fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r166-smll-158987787300178
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for AirplaneLD-COL-0020

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.300 3600000.00 79061.00 468.60 TTTFTFTFTTFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787300178.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is AirplaneLD-COL-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.1K Mar 24 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 24 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 24 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 24 06:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 41K Mar 24 05:37 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 AirplaneLD-COL-0020-00
FORMULA_NAME AirplaneLD-COL-0020-01
FORMULA_NAME AirplaneLD-COL-0020-02
FORMULA_NAME AirplaneLD-COL-0020-03
FORMULA_NAME AirplaneLD-COL-0020-04
FORMULA_NAME AirplaneLD-COL-0020-05
FORMULA_NAME AirplaneLD-COL-0020-06
FORMULA_NAME AirplaneLD-COL-0020-07
FORMULA_NAME AirplaneLD-COL-0020-08
FORMULA_NAME AirplaneLD-COL-0020-09
FORMULA_NAME AirplaneLD-COL-0020-10
FORMULA_NAME AirplaneLD-COL-0020-11
FORMULA_NAME AirplaneLD-COL-0020-12
FORMULA_NAME AirplaneLD-COL-0020-13
FORMULA_NAME AirplaneLD-COL-0020-14
FORMULA_NAME AirplaneLD-COL-0020-15

=== Now, execution of the tool begins

BK_START 1591326010108

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:00:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 03:00:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:00:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-05 03:00:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1094 ms
[2020-06-05 03:00:14] [INFO ] sort/places :
Speed->SpeedPossibleVal,Speed_Left_Wheel,Speed_Right_Wheel,
Signal->Plane_On_Ground_Signal_no,
Dot->stp5,stp4,stp3,stp2,stp1,P5,P4,P3,P2,P6,P1,
Weight->WeightPossibleVal,Weight_Right_Wheel,Weight_Left_Wheel,
Altitude->AltitudePossibleVal,TheAltitude,

[2020-06-05 03:00:14] [INFO ] Detected 3 constant HL places corresponding to 62 PT places.
[2020-06-05 03:00:14] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 159 PT places and 252.0 transition bindings in 38 ms.
[2020-06-05 03:00:14] [INFO ] Computed order based on color domains.
[2020-06-05 03:00:14] [INFO ] Unfolded HLPN to a Petri net with 159 places and 168 transitions in 22 ms.
[2020-06-05 03:00:14] [INFO ] Unfolded HLPN properties in 1 ms.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:00:14] [INFO ] Reduced 19 identical enabling conditions.
Reduce places removed 62 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 95 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 12567 resets, run finished after 635 ms. (steps per millisecond=157 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 168 rows 97 cols
[2020-06-05 03:00:14] [INFO ] Computed 3 place invariants in 14 ms
[2020-06-05 03:00:15] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 03:00:15] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 03:00:15] [INFO ] Flatten gal took : 70 ms
FORMULA AirplaneLD-COL-0020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 03:00:15] [INFO ] Applying decomposition
[2020-06-05 03:00:15] [INFO ] Flatten gal took : 26 ms
[2020-06-05 03:00:15] [INFO ] Decomposing Gal with order
[2020-06-05 03:00:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 03:00:15] [INFO ] Removed a total of 285 redundant transitions.
[2020-06-05 03:00:15] [INFO ] Flatten gal took : 90 ms
[2020-06-05 03:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-06-05 03:00:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-05 03:00:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ AirplaneLD-COL-0020 @ 3570 seconds

FORMULA AirplaneLD-COL-0020-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3506
rslt: Output for LTLFireability @ AirplaneLD-COL-0020

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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 (F ((G (F ((p3 <= 0))) AND F (((p10 <= 0) OR (p13 <= 0))))))",
"processed_size": 63,
"rewrites": 54
},
"result":
{
"edges": 3295307,
"markings": 866320,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (((p8 <= 0) OR (p12 <= 0))) U X (((p8 <= 0) OR (p12 <= 0)))))",
"processed_size": 69,
"rewrites": 54
},
"result":
{
"edges": 4734,
"markings": 2411,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "X ((F ((p0 <= 0)) U (X (((1 <= p8) AND (1 <= p11))) AND (1 <= p1))))",
"processed_size": 68,
"rewrites": 54
},
"result":
{
"edges": 99883,
"markings": 91345,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR ((p2 <= 0) R ((p8 <= 0) OR (p11 <= 0))))))",
"processed_size": 90,
"rewrites": 54
},
"result":
{
"edges": 2853011,
"markings": 978980,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 3,
"adisj": 10,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(X (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p14 <= 0))))) U (((1 <= p8) AND (1 <= p11)) U X (((p8 <= 0) OR (p11 <= 0)))))",
"processed_size": 382,
"rewrites": 54
},
"result":
{
"edges": 252,
"markings": 253,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 508
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X (X (F (((1 <= p10) AND (1 <= p14))))) OR ((1 <= p10) AND (1 <= p14)))))",
"processed_size": 80,
"rewrites": 54
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (G ((G (((1 <= p10) AND (1 <= p13))) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))",
"processed_size": 322,
"rewrites": 54
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 21,
"adisj": 1,
"aneg": 1,
"comp": 43,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 43,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "G ((G ((1 <= p3)) AND X (G ((((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND ((p7 <= 0) OR (p47 <= 0)) AND ((p7 <= 0) OR (p46 <= 0)) AND ((p7 <= 0) OR (p45 <= 0)) AND ((p7 <= 0) OR (p52 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p54 <= 0)) AND ((p7 <= 0) OR (p53 <= 0)))))))",
"processed_size": 680,
"rewrites": 54
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 11,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56)))))",
"processed_size": 346,
"rewrites": 54
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p4 <= 0)",
"processed_size": 9,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 19,
"adisj": 1,
"aneg": 0,
"comp": 39,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 39,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p26)))) AND (1 <= p0)))",
"processed_size": 610,
"rewrites": 54
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 51248,
"runtime": 64.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((G(F(*)) AND F(*)))) : X((F(*) U X(*))) : X((F(*) U (X(**) AND **))) : F(G((X(F((F(**) OR **))) OR (* R *)))) : (F((G(**) AND **)) AND F(**)) : (X(G(**)) U (** U X(*))) : (X(X(X(X(X(G(*)))))) AND (** AND **)) : X(G((X(X(F(**))) OR **))) : X(G((G(**) AND **))) : G((G(**) AND X(G(*)))) : X(F((G(*) OR (G(**) AND F(G(*)))))) : X(F(**))"
},
"net":
{
"arcs": 470,
"conflict_clusters": 13,
"places": 97,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 168
},
"result":
{
"preliminary_value": "yes yes no yes no yes no no no no yes no ",
"value": "yes yes no yes no yes no no no no yes 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: 265/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3104
lola: finding significant places
lola: 97 places, 168 transitions, 94 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: NOT(G (X ((X (F (X (G ((1 <= p3))))) OR G (((1 <= p10) AND (1 <= p13))))))) : X ((NOT(G (((1 <= p8) AND (1 <= p12)))) U NOT(X (((1 <= p8) AND (1 <= p12)))))) : X ((NOT(G ((1 <= p0))) U (X (((1 <= p8) AND (1 <= p11))) AND (1 <= p1)))) : F (G ((X (X (F ((F ((1 <= p0)) OR (1 <= p0))))) OR X (NOT(((1 <= p2) U ((1 <= p8) AND (1 <= p11)))))))) : (F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p26)))) AND (1 <= p0))) AND F ((1 <= p4))) : (G (X ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p14 <= 0))))) U (((1 <= p8) AND (1 <= p11)) U NOT(X (((1 <= p8) AND (1 <= p11)))))) : ((X (X (G (NOT(X (X (X ((1 <= p0)))))))) AND (1 <= p0)) AND (1 <= p2)) : G (X ((F (X (X (((1 <= p10) AND (1 <= p14))))) OR ((1 <= p10) AND (1 <= p14))))) : G (X (G ((G (((1 <= p10) AND (1 <= p13))) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))) : G ((G ((1 <= p3)) AND NOT(F (((((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))) U X ((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))))))))) : F ((G (X (G ((1 <= p0)))) U NOT(X (F ((1 <= p1)))))) : X (F ((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (F ((p3 <= 0))) AND F (((p10 <= 0) OR (p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (F ((p3 <= 0))) AND F (((p10 <= 0) OR (p13 <= 0))))))
lola: processed formula length: 63
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 866320 markings, 3295307 edges
lola: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p8 <= 0) OR (p12 <= 0))) U X (((p8 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p8 <= 0) OR (p12 <= 0))) U X (((p8 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 69
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2411 markings, 4734 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p0 <= 0)) U (X (((1 <= p8) AND (1 <= p11))) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p0 <= 0)) U (X (((1 <= p8) AND (1 <= p11))) AND (1 <= p1))))
lola: processed formula length: 68
lola: 54 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: 91345 markings, 99883 edges
lola: ========================================
lola: subprocess 3 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR ((p2 <= 0) R ((p8 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR ((p2 <= 0) R ((p8 <= 0) OR (p11 <= 0))))))
lola: processed formula length: 90
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 978980 markings, 2853011 edges
lola: ========================================
lola: subprocess 4 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p14 <= 0))))) U (((1 <= p8) AND (1 <= p11)) U X (((p8 <= 0) OR (p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p14 <= 0))))) U (((1 <= p8) AND (1 <= p11)) U X (((p8 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 382
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 253 markings, 252 edges
lola: ========================================
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (X (G ((p0 <= 0))))))) AND ((1 <= p0) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p0) AND (1 <= p2))
lola: processed formula length: 25
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (G ((p0 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (G ((p0 <= 0)))))))
lola: processed formula length: 33
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (F (((1 <= p10) AND (1 <= p14))))) OR ((1 <= p10) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (F (((1 <= p10) AND (1 <= p14))))) OR ((1 <= p10) AND (1 <= p14)))))
lola: processed formula length: 80
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p10) AND (1 <= p13))) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p10) AND (1 <= p13))) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))
lola: processed formula length: 322
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((1 <= p3)) AND X (G ((((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p3)) AND X (G ((((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND... (shortened)
lola: processed formula length: 680
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p1 <= 0)) OR (G ((1 <= p0)) AND F (G ((p1 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p1 <= 0)) OR (G ((1 <= p0)) AND F (G ((p1 <= 0)))))))
lola: processed formula length: 64
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 552283 markings, 3665626 edges, 110457 markings/sec, 0 secs
lola: 888133 markings, 7476357 edges, 67170 markings/sec, 5 secs
lola: 1065971 markings, 11415989 edges, 35568 markings/sec, 10 secs
lola: 1389039 markings, 15221372 edges, 64614 markings/sec, 15 secs
lola: 1761941 markings, 19062209 edges, 74580 markings/sec, 20 secs
lola: 2125135 markings, 22761549 edges, 72639 markings/sec, 25 secs
lola: 2365973 markings, 26623732 edges, 48168 markings/sec, 30 secs
lola: 2679915 markings, 30303779 edges, 62788 markings/sec, 35 secs
lola: 2959919 markings, 34185311 edges, 56001 markings/sec, 40 secs
lola: 3270012 markings, 38043743 edges, 62019 markings/sec, 45 secs
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: 3298239 markings, 38896446 edges
lola: ========================================
lola: subprocess 10 will run for 1753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56)))))
lola: processed formula length: 346
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p4))
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: (p4 <= 0)
lola: processed formula length: 9
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: 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: (F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p4))
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: (p4 <= 0)
lola: processed formula length: 9
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <=... (shortened)
lola: processed formula length: 610
lola: 54 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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes no no no no yes no
lola:
preliminary result: yes yes no yes no yes no no no no yes no
lola: memory consumption: 51248 KB
lola: time consumption: 64 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="AirplaneLD-COL-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is AirplaneLD-COL-0020, 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 r166-smll-158987787300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0020.tgz
mv AirplaneLD-COL-0020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;