Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-001000-00
FORMULA_NAME CircadianClock-PT-001000-01
FORMULA_NAME CircadianClock-PT-001000-02
FORMULA_NAME CircadianClock-PT-001000-03
FORMULA_NAME CircadianClock-PT-001000-04
FORMULA_NAME CircadianClock-PT-001000-05
FORMULA_NAME CircadianClock-PT-001000-06
FORMULA_NAME CircadianClock-PT-001000-07
FORMULA_NAME CircadianClock-PT-001000-08
FORMULA_NAME CircadianClock-PT-001000-09
FORMULA_NAME CircadianClock-PT-001000-10
FORMULA_NAME CircadianClock-PT-001000-11
FORMULA_NAME CircadianClock-PT-001000-12
FORMULA_NAME CircadianClock-PT-001000-13
FORMULA_NAME CircadianClock-PT-001000-14
FORMULA_NAME CircadianClock-PT-001000-15

=== Now, execution of the tool begins

BK_START 1620896328657

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 08:58:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 08:58:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:58:52] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 08:58:52] [INFO ] Transformed 14 places.
[2021-05-13 08:58:52] [INFO ] Transformed 16 transitions.
[2021-05-13 08:58:52] [INFO ] Parsed PT model containing 14 places and 16 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 87118 steps, including 0 resets, run visited all 25 properties in 95 ms. (steps per millisecond=917 )
[2021-05-13 08:58:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 08:58:52] [INFO ] Flatten gal took : 23 ms
FORMULA CircadianClock-PT-001000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:58:52] [INFO ] Flatten gal took : 4 ms
[2021-05-13 08:58:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 08:58:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CircadianClock-PT-001000 @ 3570 seconds

FORMULA CircadianClock-PT-001000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircadianClock-PT-001000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-001000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2257
rslt: Output for LTLFireability @ CircadianClock-PT-001000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (G (((p6 <= 0) OR (p13 <= 0)))) OR F (((p7 <= 0) OR (p9 <= 0))))))",
"processed_size": 77,
"rewrites": 107
},
"result":
{
"edges": 7002,
"markings": 7002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 274
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((G (F (((p6 <= 0) OR (p13 <= 0)))) OR X ((G (((p2 <= 0) OR (p11 <= 0))) AND ((1 <= p0) AND ((1 <= p8) AND ((1 <= p12) AND ((p6 <= 0) OR (p13 <= 0)))))))))",
"processed_size": 160,
"rewrites": 107
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 332
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"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 <= p2) AND (1 <= p11))",
"processed_size": 26,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((X ((((1 <= p2) AND (1 <= p11)) OR (F (((1 <= p4) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p13))))) OR ((1 <= p3) AND (1 <= p13))))",
"processed_size": 134,
"rewrites": 107
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "((p6 <= 0) AND ((p0 <= 0) OR (p2 <= 0)))",
"processed_size": 41,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((G ((((p5 <= 0) OR (p10 <= 0)) AND (1 <= p3) AND (1 <= p13))) OR G ((p6 <= 0))) U X (((1 <= p3) AND (1 <= p13))))",
"processed_size": 115,
"rewrites": 107
},
"result":
{
"edges": 4002,
"markings": 4002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((1 <= p3) AND (1 <= p13)))) OR G (((p7 <= 0) OR (p9 <= 0))))))",
"processed_size": 77,
"rewrites": 107
},
"result":
{
"edges": 4010,
"markings": 4008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 665
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 <= p0) AND (1 <= p8) AND (1 <= p12))))",
"processed_size": 48,
"rewrites": 107
},
"result":
{
"edges": 6002,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1456
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((1 <= p8)) U (G ((F ((1 <= p8)) AND (((1 <= p4) AND (1 <= p10)) OR (1 <= p8)))) AND F ((1 <= p8))))",
"processed_size": 103,
"rewrites": 107
},
"result":
{
"edges": 6001,
"markings": 6001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2912
},
"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": "(p0 <= 0)",
"processed_size": 9,
"rewrites": 109
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(p0 <= 0)",
"processed_size": 9,
"rewrites": 109
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))",
"processed_size": 41,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3540,
"runtime": 1313.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((X(G(*)) OR F(*)))) : F(G((F(G(**)) AND G((** OR G(**)))))) : (X(F(**)) AND (F(**) AND (X(G(**)) AND **))) : G((G(F(*)) OR X((G(*) AND (** AND (** AND (** AND **))))))) : G((((* R X(G(**))) AND *) OR X(*))) : F(G(**)) : (F(**) OR (** OR **)) : (** OR (X((X((** OR (F(**) OR **))) OR **)) AND (** AND **))) : (F(((X(**) OR **) AND (** AND **))) AND (** AND **)) : (F(**) U (X(G(**)) OR **)) : ((G(**) OR G(*)) U X(**)) : G(F((F(G(**)) AND G(*)))) : (F(**) U (G((F(**) AND (** OR **))) AND F(**))) : F(G((X(F(**)) OR G(*))))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no unknown no no unknown no no yes no no no unknown no no ",
"value": "no unknown no no unknown no no yes no no no unknown 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: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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: X (G ((NOT(F (X (F (((1 <= p6) AND (1 <= p13)))))) OR NOT(G (((1 <= p7) AND (1 <= p9))))))) : G (X (F (G (NOT(F (NOT(((1 <= p8) U G ((1 <= p6)))))))))) : (((X (F (((1 <= p3) AND (1 <= p13)))) AND F (((1 <= p7) AND (1 <= p9)))) AND X (G (((1 <= p5) AND (1 <= p10))))) AND ((p7 <= 0) OR (p9 <= 0))) : G ((NOT(F (G (((1 <= p6) AND (1 <= p13))))) OR X (((((NOT(F (((1 <= p2) AND (1 <= p11)))) AND (1 <= p0)) AND (1 <= p8)) AND (1 <= p12)) AND ((p6 <= 0) OR (p13 <= 0)))))) : NOT(F (((((1 <= p8) U NOT(G (X ((1 <= p8))))) OR (1 <= p8)) AND X (((1 <= p3) AND (1 <= p13)))))) : ((1 <= p8) U F (G (((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) : ((F ((1 <= p0)) OR (1 <= p0)) OR ((1 <= p3) AND (1 <= p13))) : ((1 <= p8) OR ((X (((X (((1 <= p2) AND (1 <= p11))) OR X ((F (((1 <= p4) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p13))))) OR ((1 <= p3) AND (1 <= p13)))) AND (1 <= p2)) AND (1 <= p11))) : ((F ((((X (((1 <= p0) AND (1 <= p2))) OR ((1 <= p0) AND (1 <= p2))) AND (1 <= p0)) AND (1 <= p2))) AND (p6 <= 0)) AND ((p0 <= 0) OR (p2 <= 0))) : ((((1 <= p5) AND (1 <= p10)) U (X (X (X ((1 <= p6)))) U F ((1 <= p6)))) U (X (G (((1 <= p5) AND (1 <= p13)))) OR ((1 <= p5) AND (1 <= p13)))) : ((G ((((p5 <= 0) OR (p10 <= 0)) AND (1 <= p3) AND (1 <= p13))) OR NOT(F ((1 <= p6)))) U X (((1 <= p3) AND (1 <= p13)))) : NOT(F (G ((F (G (NOT(G (((1 <= p3) AND (1 <= p11)))))) OR F (((1 <= p3) AND (1 <= p11))))))) : (F ((1 <= p8)) U (G ((((1 <= p4) AND (1 <= p10)) U (1 <= p8))) AND F ((1 <= p8)))) : F (NOT(X (NOT(G (X (X ((NOT(G (NOT(X (((1 <= p3) AND (1 <= p13)))))) OR NOT(F (((1 <= p7) AND (1 <= p9))))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G (((p6 <= 0) OR (p13 <= 0)))) OR F (((p7 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G (((p6 <= 0) OR (p13 <= 0)))) OR F (((p7 <= 0) OR (p9 <= 0))))))
lola: processed formula length: 77
lola: 107 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: 7002 markings, 7002 edges
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p3) AND (1 <= p13)))) AND (F (((1 <= p7) AND (1 <= p9))) AND (X (G (((1 <= p5) AND (1 <= p10)))) AND ((p7 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 <= 0) OR (p9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p7 <= 0) OR (p9 <= 0))
lola: processed formula length: 25
lola: 107 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p7) AND (1 <= p9)))
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: ((p7 <= 0) OR (p9 <= 0))
lola: processed formula length: 25
lola: 109 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: 2001 markings, 2001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F (((p6 <= 0) OR (p13 <= 0)))) OR X ((G (((p2 <= 0) OR (p11 <= 0))) AND ((1 <= p0) AND ((1 <= p8) AND ((1 <= p12) AND ((p6 <= 0) OR (p13 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F (((p6 <= 0) OR (p13 <= 0)))) OR X ((G (((p2 <= 0) OR (p11 <= 0))) AND ((1 <= p0) AND ((1 <= p8) AND ((1 <= p12) AND ((p6 <= 0) OR (p13 <= 0)))))))))
lola: processed formula length: 160
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 5001 markings, 5001 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p8 <= 0) R X (G ((1 <= p8)))) AND (p8 <= 0)) OR X (((p3 <= 0) OR (p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p8 <= 0) R X (G ((1 <= p8)))) AND (p8 <= 0)) OR X (((p3 <= 0) OR (p13 <= 0)))))
lola: processed formula length: 87
lola: 107 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: 4243062 markings, 8566542 edges, 848612 markings/sec, 0 secs
lola: 7220665 markings, 16016676 edges, 595521 markings/sec, 5 secs
lola: 10371559 markings, 23892199 edges, 630179 markings/sec, 10 secs
lola: 13264253 markings, 31110625 edges, 578539 markings/sec, 15 secs
lola: 16283823 markings, 38653601 edges, 603914 markings/sec, 20 secs
lola: 19404626 markings, 46465340 edges, 624161 markings/sec, 25 secs
lola: 22564138 markings, 54351830 edges, 631902 markings/sec, 30 secs
lola: 25637745 markings, 62036205 edges, 614721 markings/sec, 35 secs
lola: 28702780 markings, 69687832 edges, 613007 markings/sec, 40 secs
lola: 31701671 markings, 77191661 edges, 599778 markings/sec, 45 secs
lola: 34630919 markings, 84512705 edges, 585850 markings/sec, 50 secs
lola: 37640823 markings, 92023951 edges, 601981 markings/sec, 55 secs
lola: 40536399 markings, 99261879 edges, 579115 markings/sec, 60 secs
lola: 43494440 markings, 106663106 edges, 591608 markings/sec, 65 secs
lola: 46574607 markings, 114350566 edges, 616033 markings/sec, 70 secs
lola: 49763519 markings, 122321945 edges, 637782 markings/sec, 75 secs
lola: 52910398 markings, 130182017 edges, 629376 markings/sec, 80 secs
lola: 55954887 markings, 137798775 edges, 608898 markings/sec, 85 secs
lola: 58990393 markings, 145385619 edges, 607101 markings/sec, 90 secs
lola: 62045143 markings, 153012888 edges, 610950 markings/sec, 95 secs
lola: 65008459 markings, 160413859 edges, 592663 markings/sec, 100 secs
lola: 68077577 markings, 168100080 edges, 613824 markings/sec, 105 secs
lola: 71107387 markings, 175661671 edges, 605962 markings/sec, 110 secs
lola: 74160032 markings, 183288098 edges, 610529 markings/sec, 115 secs
lola: 77221711 markings, 190931183 edges, 612336 markings/sec, 120 secs
lola: 80291417 markings, 198601863 edges, 613941 markings/sec, 125 secs
lola: 83385230 markings, 206348264 edges, 618763 markings/sec, 130 secs
lola: 86437619 markings, 213966968 edges, 610478 markings/sec, 135 secs
lola: 89474886 markings, 221555856 edges, 607453 markings/sec, 140 secs
lola: 92467056 markings, 229028956 edges, 598434 markings/sec, 145 secs
lola: 95474491 markings, 236550464 edges, 601487 markings/sec, 150 secs
lola: 98496853 markings, 244103707 edges, 604472 markings/sec, 155 secs
lola: 101510585 markings, 251627148 edges, 602746 markings/sec, 160 secs
lola: 103691692 markings, 257088696 edges, 436221 markings/sec, 165 secs
lola: 105228345 markings, 260919075 edges, 307331 markings/sec, 170 secs
lola: 107366183 markings, 266270977 edges, 427568 markings/sec, 175 secs
lola: 109594621 markings, 271829087 edges, 445688 markings/sec, 180 secs
lola: 111417390 markings, 276392994 edges, 364554 markings/sec, 185 secs
lola: 112152025 markings, 278231025 edges, 146927 markings/sec, 190 secs
lola: 112776901 markings, 279781235 edges, 124975 markings/sec, 195 secs
lola: 113764023 markings, 282253055 edges, 197424 markings/sec, 200 secs
lola: 116729720 markings, 289656426 edges, 593139 markings/sec, 205 secs
lola: 117864744 markings, 292494435 edges, 227005 markings/sec, 210 secs
lola: 119444045 markings, 296449115 edges, 315860 markings/sec, 215 secs
lola: 121385705 markings, 301298191 edges, 388332 markings/sec, 220 secs
lola: 124150062 markings, 308217748 edges, 552871 markings/sec, 225 secs
lola: 126950139 markings, 315203127 edges, 560015 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) OR (X ((X ((((1 <= p2) AND (1 <= p11)) OR (F (((1 <= p4) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p13))))) OR ((1 <= p3) AND (1 <= p13)))) AND ((1 <= p2) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: ========================================
lola: processed formula: ((1 <= p2) AND (1 <= p11))
lola: processed formula length: 26
lola: 108 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 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((1 <= p2) AND (1 <= p11)) OR (F (((1 <= p4) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p13))))) OR ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((1 <= p2) AND (1 <= p11)) OR (F (((1 <= p4) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p13))))) OR ((1 <= p3) AND (1 <= p13))))
lola: processed formula length: 134
lola: 107 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((X (((1 <= p0) AND (1 <= p2))) OR ((1 <= p0) AND (1 <= p2))) AND ((1 <= p0) AND (1 <= p2)))) AND ((p6 <= 0) AND ((p0 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) AND ((p0 <= 0) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p6 <= 0) AND ((p0 <= 0) OR (p2 <= 0)))
lola: processed formula length: 41
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X (((1 <= p0) AND (1 <= p2))) OR ((1 <= p0) AND (1 <= p2))) AND ((1 <= p0) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X (((1 <= p0) AND (1 <= p2))) OR ((1 <= p0) AND (1 <= p2))) AND ((1 <= p0) AND (1 <= p2))))
lola: processed formula length: 96
lola: 107 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: 5002 markings, 5002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p6)) U (X (G (((1 <= p5) AND (1 <= p13)))) OR ((1 <= p5) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p6)) U (X (G (((1 <= p5) AND (1 <= p13)))) OR ((1 <= p5) AND (1 <= p13))))
lola: processed formula length: 84
lola: 107 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: 2003 markings, 2003 edges
lola: ========================================
lola: subprocess 7 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((p5 <= 0) OR (p10 <= 0)) AND (1 <= p3) AND (1 <= p13))) OR G ((p6 <= 0))) U X (((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((((p5 <= 0) OR (p10 <= 0)) AND (1 <= p3) AND (1 <= p13))) OR G ((p6 <= 0))) U X (((1 <= p3) AND (1 <= p13))))
lola: processed formula length: 115
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4002 markings, 4002 edges
lola: ========================================
lola: subprocess 8 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p3) AND (1 <= p13)))) OR G (((p7 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p3) AND (1 <= p13)))) OR G (((p7 <= 0) OR (p9 <= 0))))))
lola: processed formula length: 77
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4008 markings, 4010 edges
lola: ========================================
lola: subprocess 9 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p8) AND (1 <= p12))))
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 <= p0) AND (1 <= p8) AND (1 <= p12))))
lola: processed formula length: 48
lola: 107 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 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
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: 5002 markings, 6002 edges
lola: ========================================
lola: subprocess 10 will run for 831 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((1 <= p3) AND (1 <= p11)))) AND G (((p3 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((1 <= p3) AND (1 <= p11)))) AND G (((p3 <= 0) OR (p11 <= 0))))))
lola: processed formula length: 79
lola: 107 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: 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: 3242995 markings, 7594116 edges, 648599 markings/sec, 0 secs
lola: 6244147 markings, 15092428 edges, 600230 markings/sec, 5 secs
lola: 9207260 markings, 22495844 edges, 592623 markings/sec, 10 secs
lola: 12122150 markings, 29778425 edges, 582978 markings/sec, 15 secs
lola: 15108765 markings, 37240594 edges, 597323 markings/sec, 20 secs
lola: 18050028 markings, 44589252 edges, 588253 markings/sec, 25 secs
lola: 20984666 markings, 51924426 edges, 586928 markings/sec, 30 secs
lola: 23871230 markings, 59136459 edges, 577313 markings/sec, 35 secs
lola: 26743750 markings, 66313111 edges, 574504 markings/sec, 40 secs
lola: 29660525 markings, 73600175 edges, 583355 markings/sec, 45 secs
lola: 32562416 markings, 80851440 edges, 580378 markings/sec, 50 secs
lola: 35390000 markings, 87914722 edges, 565517 markings/sec, 55 secs
lola: 38279060 markings, 95132705 edges, 577812 markings/sec, 60 secs
lola: 41091317 markings, 102158769 edges, 562451 markings/sec, 65 secs
lola: 43939367 markings, 109276737 edges, 569610 markings/sec, 70 secs
lola: 46906112 markings, 116690577 edges, 593349 markings/sec, 75 secs
lola: 49836459 markings, 124010172 edges, 586069 markings/sec, 80 secs
lola: 52760544 markings, 131317386 edges, 584817 markings/sec, 85 secs
lola: 55663236 markings, 138568322 edges, 580538 markings/sec, 90 secs
lola: 58519562 markings, 145705646 edges, 571265 markings/sec, 95 secs
lola: 61416680 markings, 152942518 edges, 579424 markings/sec, 100 secs
lola: 64298844 markings, 160145118 edges, 576433 markings/sec, 105 secs
lola: 67150038 markings, 167267363 edges, 570239 markings/sec, 110 secs
lola: 69962621 markings, 174297654 edges, 562517 markings/sec, 115 secs
lola: 72797708 markings, 181380990 edges, 567017 markings/sec, 120 secs
lola: 75587160 markings, 188349438 edges, 557890 markings/sec, 125 secs
lola: 78513973 markings, 195663059 edges, 585363 markings/sec, 130 secs
lola: 81325975 markings, 202687381 edges, 562400 markings/sec, 135 secs
lola: 84088743 markings, 209594727 edges, 552554 markings/sec, 140 secs
lola: 85674193 markings, 213558109 edges, 317090 markings/sec, 145 secs
lola: 88097879 markings, 219610414 edges, 484737 markings/sec, 150 secs
lola: 90622876 markings, 225918384 edges, 504999 markings/sec, 155 secs
lola: 93305632 markings, 232619206 edges, 536551 markings/sec, 160 secs
lola: 95950570 markings, 239231039 edges, 528988 markings/sec, 165 secs
lola: 98567243 markings, 245767817 edges, 523335 markings/sec, 170 secs
lola: 101104327 markings, 252109549 edges, 507417 markings/sec, 175 secs
lola: 103573906 markings, 258276387 edges, 493916 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1046 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((1 <= p6))) AND G (((1 <= p8) OR G ((1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((1 <= p6))) AND G (((1 <= p8) OR G ((1 <= p6)))))))
lola: processed formula length: 64
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 2930616 markings, 7946609 edges, 586123 markings/sec, 0 secs
lola: 5364612 markings, 15844095 edges, 486799 markings/sec, 5 secs
lola: 7946069 markings, 23589221 edges, 516291 markings/sec, 10 secs
lola: 10525282 markings, 31323355 edges, 515843 markings/sec, 15 secs
lola: 12878144 markings, 38984355 edges, 470572 markings/sec, 20 secs
lola: 14751179 markings, 46371047 edges, 374607 markings/sec, 25 secs
lola: 16862751 markings, 53484279 edges, 422314 markings/sec, 30 secs
lola: 19185794 markings, 61085247 edges, 464609 markings/sec, 35 secs
lola: 21550782 markings, 68619419 edges, 472998 markings/sec, 40 secs
lola: 23956720 markings, 76157694 edges, 481188 markings/sec, 45 secs
lola: 26199306 markings, 83725168 edges, 448517 markings/sec, 50 secs
lola: 28028160 markings, 91129935 edges, 365771 markings/sec, 55 secs
lola: 29726115 markings, 97795148 edges, 339591 markings/sec, 60 secs
lola: 32246210 markings, 105911090 edges, 504019 markings/sec, 65 secs
lola: 34362922 markings, 113323774 edges, 423342 markings/sec, 70 secs
lola: 36362823 markings, 120355229 edges, 399980 markings/sec, 75 secs
lola: 38108223 markings, 127436344 edges, 349080 markings/sec, 80 secs
lola: 39804147 markings, 134143213 edges, 339185 markings/sec, 85 secs
lola: 41739838 markings, 141150467 edges, 387138 markings/sec, 90 secs
lola: 43628210 markings, 147766906 edges, 377674 markings/sec, 95 secs
lola: 45536071 markings, 155026483 edges, 381572 markings/sec, 100 secs
lola: 47971440 markings, 163039367 edges, 487074 markings/sec, 105 secs
lola: 50098909 markings, 170461334 edges, 425494 markings/sec, 110 secs
lola: 52063663 markings, 177339275 edges, 392951 markings/sec, 115 secs
lola: 54046139 markings, 184282184 edges, 396495 markings/sec, 120 secs
lola: 56079381 markings, 191404744 edges, 406648 markings/sec, 125 secs
lola: 58002648 markings, 198143118 edges, 384653 markings/sec, 130 secs
lola: 60465029 markings, 205565167 edges, 492476 markings/sec, 135 secs
lola: 62749092 markings, 212773965 edges, 456813 markings/sec, 140 secs
lola: 64856227 markings, 219760833 edges, 421427 markings/sec, 145 secs
lola: 67359810 markings, 227278472 edges, 500717 markings/sec, 150 secs
lola: 69520971 markings, 234499851 edges, 432232 markings/sec, 155 secs
lola: 71415786 markings, 241584357 edges, 378963 markings/sec, 160 secs
lola: 73157271 markings, 248257496 edges, 348297 markings/sec, 165 secs
lola: 75274024 markings, 255102011 edges, 423351 markings/sec, 170 secs
lola: 77033193 markings, 260381152 edges, 351834 markings/sec, 175 secs
lola: 78838827 markings, 266164235 edges, 361127 markings/sec, 180 secs
lola: 80582267 markings, 272282345 edges, 348688 markings/sec, 185 secs
lola: 82290697 markings, 278261194 edges, 341686 markings/sec, 190 secs
lola: 83895831 markings, 283884887 edges, 321027 markings/sec, 195 secs
lola: 85451484 markings, 289769896 edges, 311131 markings/sec, 200 secs
lola: 87463860 markings, 296691396 edges, 402475 markings/sec, 205 secs
lola: 89387686 markings, 303497202 edges, 384765 markings/sec, 210 secs
lola: 91129818 markings, 310205207 edges, 348426 markings/sec, 215 secs
lola: 92870486 markings, 316314625 edges, 348134 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p8)) U (G ((F ((1 <= p8)) AND (((1 <= p4) AND (1 <= p10)) OR (1 <= p8)))) AND F ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p8)) U (G ((F ((1 <= p8)) AND (((1 <= p4) AND (1 <= p10)) OR (1 <= p8)))) AND F ((1 <= p8))))
lola: processed formula length: 103
lola: 107 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: 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: 6001 markings, 6001 edges
lola: ========================================
lola: subprocess 13 will run for 2912 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p0)) OR ((1 <= p0) OR ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2912 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0))
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: (p0 <= 0)
lola: processed formula length: 9
lola: 109 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: 3002 markings, 3002 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: G (((((p8 <= 0) R X (G ((1 <= p8)))) AND (p8 <= 0)) OR X (((p3 <= 0) OR (p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p8 <= 0) R X (G ((1 <= p8)))) AND (p8 <= 0)) OR X (((p3 <= 0) OR (p13 <= 0)))))
lola: processed formula length: 87
lola: 107 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: 4083090 markings, 8166265 edges, 816618 markings/sec, 0 secs
lola: 7274114 markings, 16146541 edges, 638205 markings/sec, 5 secs
lola: 10426629 markings, 24028546 edges, 630503 markings/sec, 10 secs
lola: 13568717 markings, 31872868 edges, 628418 markings/sec, 15 secs
lola: 16774085 markings, 39882364 edges, 641074 markings/sec, 20 secs
lola: 19945761 markings, 47821042 edges, 634335 markings/sec, 25 secs
lola: 23054801 markings, 55581197 edges, 621808 markings/sec, 30 secs
lola: 26173683 markings, 63376624 edges, 623776 markings/sec, 35 secs
lola: 29275761 markings, 71120991 edges, 620416 markings/sec, 40 secs
lola: 32363975 markings, 78841718 edges, 617643 markings/sec, 45 secs
lola: 35364381 markings, 86347106 edges, 600081 markings/sec, 50 secs
lola: 38385503 markings, 93887604 edges, 604224 markings/sec, 55 secs
lola: 41359191 markings, 101318089 edges, 594738 markings/sec, 60 secs
lola: 44372091 markings, 108839643 edges, 602580 markings/sec, 65 secs
lola: 47438415 markings, 116512707 edges, 613265 markings/sec, 70 secs
lola: 50590985 markings, 124393114 edges, 630514 markings/sec, 75 secs
lola: 53703825 markings, 132167829 edges, 622568 markings/sec, 80 secs
lola: 56812725 markings, 139936220 edges, 621780 markings/sec, 85 secs
lola: 59822613 markings, 147467540 edges, 601978 markings/sec, 90 secs
lola: 62849461 markings, 155021229 edges, 605370 markings/sec, 95 secs
lola: 65924151 markings, 162709759 edges, 614938 markings/sec, 100 secs
lola: 69011101 markings, 170416152 edges, 617390 markings/sec, 105 secs
lola: 71995355 markings, 177882665 edges, 596851 markings/sec, 110 secs
lola: 74969884 markings, 185316502 edges, 594906 markings/sec, 115 secs
lola: 77984260 markings, 192842328 edges, 602875 markings/sec, 120 secs
lola: 81054767 markings, 200516217 edges, 614101 markings/sec, 125 secs
lola: 84122503 markings, 208192129 edges, 613547 markings/sec, 130 secs
lola: 87125470 markings, 215687238 edges, 600593 markings/sec, 135 secs
lola: 90132817 markings, 223204396 edges, 601469 markings/sec, 140 secs
lola: 93168634 markings, 230780150 edges, 607163 markings/sec, 145 secs
lola: 96201233 markings, 238362346 edges, 606520 markings/sec, 150 secs
lola: 99162619 markings, 245771599 edges, 592277 markings/sec, 155 secs
lola: 102145691 markings, 253220359 edges, 596614 markings/sec, 160 secs
lola: 104703132 markings, 259611938 edges, 511488 markings/sec, 165 secs
lola: 106047237 markings, 262972832 edges, 268821 markings/sec, 170 secs
lola: 108118011 markings, 268150484 edges, 414155 markings/sec, 175 secs
lola: 110709129 markings, 274617653 edges, 518224 markings/sec, 180 secs
lola: 113483073 markings, 281548913 edges, 554789 markings/sec, 185 secs
lola: 116304509 markings, 288591050 edges, 564287 markings/sec, 190 secs
lola: 119036619 markings, 295430900 edges, 546422 markings/sec, 195 secs
lola: 121640129 markings, 301932216 edges, 520702 markings/sec, 200 secs
lola: 124359483 markings, 308721971 edges, 543871 markings/sec, 205 secs
lola: 126945861 markings, 315194717 edges, 517276 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((1 <= p3) AND (1 <= p11)))) AND G (((p3 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((1 <= p3) AND (1 <= p11)))) AND G (((p3 <= 0) OR (p11 <= 0))))))
lola: processed formula length: 79
lola: 107 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: 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: 3192705 markings, 7467934 edges, 638541 markings/sec, 0 secs
lola: 6128837 markings, 14804972 edges, 587226 markings/sec, 5 secs
lola: 9030694 markings, 22053968 edges, 580371 markings/sec, 10 secs
lola: 11902224 markings, 29231193 edges, 574306 markings/sec, 15 secs
lola: 14831321 markings, 36550570 edges, 585819 markings/sec, 20 secs
lola: 17687354 markings, 43685371 edges, 571207 markings/sec, 25 secs
lola: 20548961 markings, 50835386 edges, 572321 markings/sec, 30 secs
lola: 23328422 markings, 57777956 edges, 555892 markings/sec, 35 secs
lola: 26060149 markings, 64603436 edges, 546345 markings/sec, 40 secs
lola: 28830587 markings, 71527788 edges, 554088 markings/sec, 45 secs
lola: 31619309 markings, 78493382 edges, 557744 markings/sec, 50 secs
lola: 34362437 markings, 85347971 edges, 548626 markings/sec, 55 secs
lola: 37121075 markings, 92238181 edges, 551728 markings/sec, 60 secs
lola: 39799302 markings, 98931738 edges, 535645 markings/sec, 65 secs
lola: 42470515 markings, 105605811 edges, 534243 markings/sec, 70 secs
lola: 45247063 markings, 112542531 edges, 555310 markings/sec, 75 secs
lola: 48067588 markings, 119592416 edges, 564105 markings/sec, 80 secs
lola: 50839364 markings, 126518204 edges, 554355 markings/sec, 85 secs
lola: 53631221 markings, 133491418 edges, 558371 markings/sec, 90 secs
lola: 56312073 markings, 140190133 edges, 536170 markings/sec, 95 secs
lola: 59003832 markings, 146916968 edges, 538352 markings/sec, 100 secs
lola: 61727748 markings, 153721940 edges, 544783 markings/sec, 105 secs
lola: 64467259 markings, 160566865 edges, 547902 markings/sec, 110 secs
lola: 67156379 markings, 167283731 edges, 537824 markings/sec, 115 secs
lola: 69880631 markings, 174092655 edges, 544850 markings/sec, 120 secs
lola: 72544068 markings, 180747302 edges, 532687 markings/sec, 125 secs
lola: 75169960 markings, 187305656 edges, 525178 markings/sec, 130 secs
lola: 77931197 markings, 194207298 edges, 552247 markings/sec, 135 secs
lola: 80646040 markings, 200990273 edges, 542969 markings/sec, 140 secs
lola: 83274297 markings, 207556072 edges, 525651 markings/sec, 145 secs
lola: 85204824 markings, 212379002 edges, 386105 markings/sec, 150 secs
lola: 87662320 markings, 218521461 edges, 491499 markings/sec, 155 secs
lola: 90071856 markings, 224543021 edges, 481907 markings/sec, 160 secs
lola: 92645397 markings, 230972552 edges, 514708 markings/sec, 165 secs
lola: 95236994 markings, 237444471 edges, 518319 markings/sec, 170 secs
lola: 97779776 markings, 243800547 edges, 508556 markings/sec, 175 secs
lola: 99767499 markings, 248767225 edges, 397545 markings/sec, 180 secs
lola: 101919345 markings, 254144488 edges, 430369 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((1 <= p6))) AND G (((1 <= p8) OR G ((1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((1 <= p6))) AND G (((1 <= p8) OR G ((1 <= p6)))))))
lola: processed formula length: 64
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 2839738 markings, 7644065 edges, 567948 markings/sec, 0 secs
lola: 5195262 markings, 15335275 edges, 471105 markings/sec, 5 secs
lola: 7604446 markings, 22564558 edges, 481837 markings/sec, 10 secs
lola: 10033765 markings, 29851054 edges, 485864 markings/sec, 15 secs
lola: 12520897 markings, 37615244 edges, 497426 markings/sec, 20 secs
lola: 14334906 markings, 44913269 edges, 362802 markings/sec, 25 secs
lola: 16343739 markings, 51820654 edges, 401767 markings/sec, 30 secs
lola: 18619065 markings, 59381783 edges, 455065 markings/sec, 35 secs
lola: 20987598 markings, 66666493 edges, 473707 markings/sec, 40 secs
lola: 23306709 markings, 74207196 edges, 463822 markings/sec, 45 secs
lola: 25648112 markings, 81721610 edges, 468281 markings/sec, 50 secs
lola: 27573284 markings, 89127202 edges, 385034 markings/sec, 55 secs
lola: 29336074 markings, 96137595 edges, 352558 markings/sec, 60 secs
lola: 31657575 markings, 104031198 edges, 464300 markings/sec, 65 secs
lola: 33856706 markings, 111550787 edges, 439826 markings/sec, 70 secs
lola: 35875184 markings, 118618598 edges, 403696 markings/sec, 75 secs
lola: 37664848 markings, 125528910 edges, 357933 markings/sec, 80 secs
lola: 39384188 markings, 132351153 edges, 343868 markings/sec, 85 secs
lola: 41223486 markings, 139340903 edges, 367860 markings/sec, 90 secs
lola: 43154559 markings, 146107995 edges, 386215 markings/sec, 95 secs
lola: 45102884 markings, 153233678 edges, 389665 markings/sec, 100 secs
lola: 47334542 markings, 161127183 edges, 446332 markings/sec, 105 secs
lola: 49555276 markings, 168557620 edges, 444147 markings/sec, 110 secs
lola: 51533223 markings, 175483499 edges, 395589 markings/sec, 115 secs
lola: 53479402 markings, 182297180 edges, 389236 markings/sec, 120 secs
lola: 55471742 markings, 189275383 edges, 398468 markings/sec, 125 secs
lola: 57419113 markings, 196098098 edges, 389474 markings/sec, 130 secs
lola: 59714027 markings, 203305214 edges, 458983 markings/sec, 135 secs
lola: 62198682 markings, 210846360 edges, 496931 markings/sec, 140 secs
lola: 64116410 markings, 217539718 edges, 383546 markings/sec, 145 secs
lola: 66634865 markings, 225101394 edges, 503691 markings/sec, 150 secs
lola: 68938799 markings, 232458866 edges, 460787 markings/sec, 155 secs
lola: 70929959 markings, 239622431 edges, 398232 markings/sec, 160 secs
lola: 72675231 markings, 246568611 edges, 349054 markings/sec, 165 secs
lola: 74621496 markings, 253143324 edges, 389253 markings/sec, 170 secs
lola: 76689955 markings, 259351556 edges, 413692 markings/sec, 175 secs
lola: 78500983 markings, 265049974 edges, 362206 markings/sec, 180 secs
lola: 80419951 markings, 271713602 edges, 383794 markings/sec, 185 secs
lola: 82172818 markings, 277848023 edges, 350573 markings/sec, 190 secs
lola: 83707085 markings, 283222926 edges, 306853 markings/sec, 195 secs
lola: 85330594 markings, 289269958 edges, 324702 markings/sec, 200 secs
lola: 86798964 markings, 294695481 edges, 293674 markings/sec, 205 secs
lola: 87653704 markings, 297260867 edges, 170948 markings/sec, 210 secs
lola: 88450941 markings, 299843100 edges, 159447 markings/sec, 215 secs
lola: 89014273 markings, 301988429 edges, 112666 markings/sec, 220 secs
lola: 90511781 markings, 308039855 edges, 299502 markings/sec, 225 secs
lola: 92241966 markings, 314112584 edges, 346037 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p0)) OR ((1 <= p0) OR ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0))
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: (p0 <= 0)
lola: processed formula length: 9
lola: 109 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: 3002 markings, 3002 edges
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))
lola: processed formula length: 41
lola: 108 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no yes no no no unknown no no
lola:
preliminary result: no unknown no no unknown no no yes no no no unknown no no
lola: memory consumption: 3540 KB
lola: time consumption: 1313 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="CircadianClock-PT-001000"
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 CircadianClock-PT-001000, 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 r056-oct2-162038334400014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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