About the Execution of 2020-gold for UtilityControlRoom-COL-Z4T3N06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4289.304 | 3600000.00 | 10539.00 | 765.20 | FTFTFFFFTFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128100230.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is UtilityControlRoom-COL-Z4T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128100230
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.0K May 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_pt
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 5 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 29K May 12 08:13 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 UtilityControlRoom-COL-Z4T3N06-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-15
=== Now, execution of the tool begins
BK_START 1621451169989
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:06:11] [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-19 19:06:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:06:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 19:06:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2021-05-19 19:06:12] [INFO ] sort/places :
Cli->Clients,ControlRoomDispatch,Finished,ClientsWaiting,ClientsTimeout,
CxZ->OpenRequests,Assigned,StartSecuring,DoSecuring,
Dot->Idles,NumClientsReq,
Z->IdleTechs,
CxZxZ->MovetoZ,
[2021-05-19 19:06:12] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:06:12] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:06:12] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:06:12] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 135 PT places and 240.0 transition bindings in 96 ms.
[2021-05-19 19:06:12] [INFO ] Computed order based on color domains.
[2021-05-19 19:06:12] [INFO ] Unfolded HLPN to a Petri net with 135 places and 240 transitions in 17 ms.
[2021-05-19 19:06:12] [INFO ] Unfolded HLPN properties in 1 ms.
[2021-05-19 19:06:12] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-19 19:06:12] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-19 19:06:12] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 192 transitions.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 163 steps, including 0 resets, run visited all 40 properties in 4 ms. (steps per millisecond=40 )
[2021-05-19 19:06:12] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 19:06:12] [INFO ] Flatten gal took : 29 ms
FORMULA UtilityControlRoom-COL-Z4T3N06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N06-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:06:12] [INFO ] Applying decomposition
[2021-05-19 19:06:12] [INFO ] Flatten gal took : 10 ms
[2021-05-19 19:06:12] [INFO ] Decomposing Gal with order
[2021-05-19 19:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:06:12] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-19 19:06:12] [INFO ] Flatten gal took : 33 ms
[2021-05-19 19:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-19 19:06:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-19 19:06:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ UtilityControlRoom-COL-Z4T3N06 @ 3570 seconds
FORMULA UtilityControlRoom-COL-Z4T3N06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ UtilityControlRoom-COL-Z4T3N06
{
"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": "Wed May 19 19:06:15 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) AND ((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18)))))))",
"processed_size": 426,
"rewrites": 205
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 3,
"aneg": 2,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F ((X (((p22 <= 0) AND (p25 <= 0))) AND (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))) OR X (G ((((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)))))))",
"processed_size": 246,
"rewrites": 205
},
"result":
{
"edges": 273,
"markings": 131,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 6,
"aneg": 3,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((X (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))))) AND (F ((p25 <= 0)) OR G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))))))))",
"processed_size": 225,
"rewrites": 205
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((X (X ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (1 <= p22)))) OR (1 <= p22))))",
"processed_size": 319,
"rewrites": 205
},
"result":
{
"edges": 318,
"markings": 168,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 2,
"aneg": 1,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 1,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p6 <= 0))))) AND (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (((1 <= p2) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p5)) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))))))))))",
"processed_size": 836,
"rewrites": 205
},
"result":
{
"edges": 24,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((1 <= p3) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))) OR X (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))))",
"processed_size": 206,
"rewrites": 205
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))",
"processed_size": 275,
"rewrites": 205
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(F ((p3 <= 0)) U G ((1 <= p3)))",
"processed_size": 31,
"rewrites": 205
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 19,
"aneg": 10,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6))))) OR (((1 <= p2) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p5)) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p6)) OR (((1 <= p1) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p5)) OR (((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))))))))))))",
"processed_size": 843,
"rewrites": 205
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G (F ((G ((F ((((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27)))) OR (1 <= p25))) AND X (((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18))))))",
"processed_size": 268,
"rewrites": 205
},
"result":
{
"edges": 186,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 5,
"aconj": 19,
"adisj": 2,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (((X (X (X (G (((p7 <= 0) AND (p8 <= 0) AND (p9 <= 0)))))) AND ((1 <= p3) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6))))))",
"processed_size": 623,
"rewrites": 205
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p7 <= 0) AND (p8 <= 0) AND (p9 <= 0))",
"processed_size": 39,
"rewrites": 207
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)))",
"processed_size": 93,
"rewrites": 207
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 88704,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(G((X(**) AND **))))) : X((F((X(*) AND **)) OR X(G(*)))) : X(G((X(F(*)) AND (F(*) OR G(F(*)))))) : G(F((X(X((X(**) OR **))) OR *))) : X((F(G(*)) AND (F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : X(((** U **) OR X(G(*)))) : X(G(**)) : F(**) : ((F(**) U G(**)) AND X(**)) : F(**) : X(X(F((G(*) OR (G(F(**)) OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR *))))))))))))) : G(F((G((F(**) OR **)) AND X(**)))) : X(X(((X(X(X(G(**)))) AND **) U **)))"
},
"net":
{
"arcs": 117,
"conflict_clusters": 18,
"places": 31,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "no yes no yes no no no no no yes yes no no ",
"value": "no yes no yes no no no no no yes yes 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 992
lola: finding significant places
lola: 31 places, 39 transitions, 26 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: X (G (X (NOT(X (F (NOT(G ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) AND ((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18))))))))))) : (F (X ((NOT(X (((1 <= p22) OR (1 <= p25)))) AND (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27)))))) OR G (NOT(X (X ((((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27)))))))) : NOT(X (F (((p25 <= 0) U (G ((1 <= p25)) U X (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))))))) : F (X (G (NOT(G (X ((NOT(X (X ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (1 <= p22))))) AND (p22 <= 0)))))))) : X ((F (G (NOT(X (X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))))) AND (((((((((F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR ((1 <= p2) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p5))) OR ((1 <= p2) AND (1 <= p5))) OR ((1 <= p0) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p4))) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p5))) OR ((1 <= p0) AND (1 <= p4))) OR ((1 <= p1) AND (1 <= p6))))) : (X (((1 <= p3) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))))) OR NOT(F (((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))) U X (X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))))))))) : X (G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6))))) : F (((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) AND (1 <= p3)) U (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))) : ((((1 <= p3) U F ((p3 <= 0))) U G ((1 <= p3))) AND X ((1 <= p26))) : (X (NOT(X (X (F (((1 <= p25))))))) U F (((1 <= p25) U ((1 <= p7) OR (1 <= p8) OR (1 <= p9))))) : X (NOT(X (G (((((((((((F ((((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)))) AND NOT(F (G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))))) AND ((p2 <= 0) OR (p6 <= 0))) AND ((p1 <= 0) OR (p5 <= 0))) AND ((p2 <= 0) OR (p5 <= 0))) AND ((p0 <= 0) OR (p6 <= 0))) AND ((p1 <= 0) OR (p4 <= 0))) AND ((p2 <= 0) OR (p4 <= 0))) AND ((p0 <= 0) OR (p5 <= 0))) AND ((p0 <= 0) OR (p4 <= 0))) AND ((p1 <= 0) OR (p6 <= 0))))))) : G (F (X ((G ((F (((1 <= p25) U (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))) OR (1 <= p25))) AND X (((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18))))))) : X (X (((X (G (X (G (X (((p7 <= 0) AND (p8 <= 0) AND (p9 <= 0))))))) AND ((1 <= p3) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) AND ((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) AND ((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <=... (shortened)
lola: processed formula length: 426
lola: 205 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (((p22 <= 0) AND (p25 <= 0))) AND (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))) OR X (G ((((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (((p22 <= 0) AND (p25 <= 0))) AND (((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))) OR X (G ((((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)))))))
lola: processed formula length: 246
lola: 205 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 131 markings, 273 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))))) AND (F ((p25 <= 0)) OR G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5))))) AND (F ((p25 <= 0)) OR G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))))))))
lola: processed formula length: 225
lola: 205 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (1 <= p22)))) OR (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X ((X ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (1 <= p22)))) OR (1 <= p22))))
lola: processed formula length: 319
lola: 205 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: 168 markings, 318 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p6 <= 0))))) AND (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p2 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p6 <= 0))))) AND (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= ... (shortened)
lola: processed formula length: 836
lola: 205 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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p3) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))) OR X (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p3) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p5)))) OR X (G ((((p2 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))))
lola: processed formula length: 206
lola: 205 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))))
lola: processed formula length: 275
lola: 205 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p3 <= 0)) U G ((1 <= p3))) AND X ((1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p3 <= 0)) U G ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p3 <= 0)) U G ((1 <= p3)))
lola: processed formula length: 31
lola: 205 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: 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: 15 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) OR (G (F ((((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1... (shortened)
lola: processed formula length: 843
lola: 205 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F ((((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27)))) OR (1 <= p25))) AND X (((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F ((((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27)))) OR (1 <= p25))) AND X (((1 <= p11) OR (1 <= p10) OR (1 <= p13) OR (1 <= p12) OR (1 <= p15) OR (1 <= p14) OR (1 <= p17) OR (1 <= p16) OR (1 <= p18))))))
lola: processed formula length: 268
lola: 205 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: 76 markings, 186 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((X (X (X (G (((p7 <= 0) AND (p8 <= 0) AND (p9 <= 0)))))) AND ((1 <= p3) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((X (X (X (G (((p7 <= 0) AND (p8 <= 0) AND (p9 <= 0)))))) AND ((1 <= p3) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p1) AND (1 <= p6)))) U (((1 <= p2) AND (1 <= p6)) OR ((1 <= p1) AND (... (shortened)
lola: processed formula length: 623
lola: 205 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p7) OR (1 <= p8) OR (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) AND (p8 <= 0) AND (p9 <= 0))
lola: processed formula length: 39
lola: 207 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p21) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p20) AND (1 <= p27))))
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: (((p21 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)) AND ((p20 <= 0) OR (p27 <= 0)))
lola: processed formula length: 93
lola: 207 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: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no yes yes no no
lola:
preliminary result: no yes no yes no no no no no yes yes no no
lola: memory consumption: 88704 KB
lola: time consumption: 4 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="UtilityControlRoom-COL-Z4T3N06"
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 UtilityControlRoom-COL-Z4T3N06, 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 r322-tall-162132128100230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T3N06.tgz
mv UtilityControlRoom-COL-Z4T3N06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;