About the Execution of 2020-gold for CSRepetitions-COL-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4281.684 | 3600000.00 | 8629.00 | 35.50 | FFFFFFTFTFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177100242.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177100242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K 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.6K 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 4.8K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K 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 CSRepetitions-COL-02-00
FORMULA_NAME CSRepetitions-COL-02-01
FORMULA_NAME CSRepetitions-COL-02-02
FORMULA_NAME CSRepetitions-COL-02-03
FORMULA_NAME CSRepetitions-COL-02-04
FORMULA_NAME CSRepetitions-COL-02-05
FORMULA_NAME CSRepetitions-COL-02-06
FORMULA_NAME CSRepetitions-COL-02-07
FORMULA_NAME CSRepetitions-COL-02-08
FORMULA_NAME CSRepetitions-COL-02-09
FORMULA_NAME CSRepetitions-COL-02-10
FORMULA_NAME CSRepetitions-COL-02-11
FORMULA_NAME CSRepetitions-COL-02-12
FORMULA_NAME CSRepetitions-COL-02-13
FORMULA_NAME CSRepetitions-COL-02-14
FORMULA_NAME CSRepetitions-COL-02-15
=== Now, execution of the tool begins
BK_START 1620940520662
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:15:22] [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 21:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:15:22] [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-13 21:15:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 422 ms
[2021-05-13 21:15:22] [INFO ] sort/places :
Server->Server_Waiting,
Computation->Server_Anwering,
Dot->RequestBufferSlots,
Client->Client_Sending,RequestBuffer,Client_Waiting,
[2021-05-13 21:15:22] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 10 ms.
[2021-05-13 21:15:22] [INFO ] Computed order based on color domains.
[2021-05-13 21:15:22] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 4 ms.
[2021-05-13 21:15:22] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 176 steps, including 9 resets, run visited all 29 properties in 12 ms. (steps per millisecond=14 )
[2021-05-13 21:15:22] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 21:15:22] [INFO ] Flatten gal took : 25 ms
FORMULA CSRepetitions-COL-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 21:15:22] [INFO ] Applying decomposition
[2021-05-13 21:15:22] [INFO ] Flatten gal took : 6 ms
[2021-05-13 21:15:22] [INFO ] Decomposing Gal with order
[2021-05-13 21:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 21:15:22] [INFO ] Removed a total of 30 redundant transitions.
[2021-05-13 21:15:22] [INFO ] Flatten gal took : 24 ms
[2021-05-13 21:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 21:15:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 21:15:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CSRepetitions-COL-02 @ 3570 seconds
FORMULA CSRepetitions-COL-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLFireability @ CSRepetitions-COL-02
{
"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 21:15:23 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 24,
"adisj": 2,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (X (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))) OR (((1 <= p2) AND (1 <= p17)) OR (((1 <= p1) AND (1 <= p16)) OR (((1 <= p1) AND (1 <= p15)) OR (((1 <= p4) AND (1 <= p21)) OR (((1 <= p4) AND (1 <= p22)) OR (((1 <= p2) AND (1 <= p18)) OR (((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))))))))",
"processed_size": 772,
"rewrites": 106
},
"result":
{
"edges": 15,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 12,
"adisj": 3,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 2,
"tdisj": 8,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X ((X (G ((F (((p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0))) OR (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p1)) OR (((1 <= p0) AND (1 <= p3)) OR (((1 <= p0) AND (1 <= p2)) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))))))))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))))",
"processed_size": 569,
"rewrites": 106
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14)))))))",
"processed_size": 133,
"rewrites": 106
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 9,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) U (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))",
"processed_size": 367,
"rewrites": 106
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))",
"processed_size": 125,
"rewrites": 106
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))",
"processed_size": 114,
"rewrites": 111
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))",
"processed_size": 121,
"rewrites": 106
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 4,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))) U X (G ((F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) OR ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))))",
"processed_size": 322,
"rewrites": 106
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 9,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))))))",
"processed_size": 379,
"rewrites": 106
},
"result":
{
"edges": 177,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)))",
"processed_size": 117,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 0,
"aconj": 13,
"adisj": 7,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND F (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)))) OR F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) U ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))",
"processed_size": 619,
"rewrites": 106
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"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": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 17,
"adisj": 2,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR (F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) AND F (G (((p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0)))))))",
"processed_size": 580,
"rewrites": 106
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 58152,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(G(**)) OR (X(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : F((G(**) OR (F(G(**)) AND F(G(**))))) : X((X(G((F(*) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))) AND (** AND **))) : (G(F((X(**) OR (** OR (** OR (** OR **)))))) AND (X(X(X(**))) OR **)) : (X(G(**)) OR ((** U **) AND (X(**) OR (** OR (** OR (** OR **)))))) : X(((X(**) OR (** OR (** OR (** OR **)))) U X(G((F(**) AND (** OR **)))))) : X(X(G(**))) : (((** U **) OR ((G(**) AND F(**)) OR F(**))) U **) : F(**)"
},
"net":
{
"arcs": 92,
"conflict_clusters": 6,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 28
},
"result":
{
"preliminary_value": "no no no no yes no no yes yes ",
"value": "no no no no yes no no yes yes "
},
"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: 51/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 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: G (X (F (G ((((((((((F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR X (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))))) OR ((1 <= p2) AND (1 <= p17))) OR ((1 <= p1) AND (1 <= p16))) OR ((1 <= p1) AND (1 <= p15))) OR ((1 <= p4) AND (1 <= p21))) OR ((1 <= p4) AND (1 <= p22))) OR ((1 <= p2) AND (1 <= p18))) OR ((1 <= p3) AND (1 <= p20))) OR ((1 <= p3) AND (1 <= p19))))))) : F ((F (G (((p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0)))) U G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))) : X (((G (X (((((((((F (NOT(G (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))))) OR ((1 <= p0) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p1))) OR ((1 <= p0) AND (1 <= p3))) OR ((1 <= p0) AND (1 <= p2))) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)))) AND ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) : (G (F (((((X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)))) AND (X (X (X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) : (NOT(X (NOT(G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))) OR (((((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) U (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND ((((X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) OR ((1 <= p0) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p1))) OR ((1 <= p0) AND (1 <= p3))) OR ((1 <= p0) AND (1 <= p2))))) : X ((((((X (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) U G (X ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))) : G (X (G (X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))))))) : (((G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) U ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)))) OR F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) U ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) : F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: 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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:329
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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (X (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (X (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <=... (shortened)
lola: processed formula length: 772
lola: 106 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: 12 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F (((p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0))) OR (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p1)) OR (((1 <= p0) AND (1 <= p3)) OR (((1 <= p0) AND (1 <= p2)) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))))))))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) 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 (G ((F (((p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0))) OR (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p1)) OR (((1 <= p0) AND (1 <= p3)) OR (((1 <= p0) AND (1 <= p2)) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))))))))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (... (shortened)
lola: processed formula length: 569
lola: 106 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))))) AND (X (X (X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14)))))))
lola: processed formula length: 133
lola: 106 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) OR (((((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) U (((1 <= p0) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) U (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) U (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
lola: processed formula length: 367
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))
lola: processed formula length: 125
lola: 106 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p1)) OR (((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))
lola: processed formula length: 114
lola: 111 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
lola: processed formula length: 121
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))) U X (G ((F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) OR ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14))))) U X (G ((F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) OR ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))))
lola: processed formula length: 322
lola: 106 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))))))
lola: processed formula length: 379
lola: 106 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: 85 markings, 177 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))
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) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)))
lola: processed formula length: 117
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND F (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)))) OR F (((1 <= p11) OR (1 <= p12)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))) OR ((G ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND F (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)))) OR F (((1 <= p11) OR (1 <= p12)... (shortened)
lola: processed formula length: 619
lola: 106 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR (F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR (F (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) ... (shortened)
lola: processed formula length: 580
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes
lola:
preliminary result: no no no no yes no no yes yes
lola: memory consumption: 58152 KB
lola: time consumption: 2 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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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 r037-tajo-162038177100242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;