About the Execution of 2020-gold for ClientsAndServers-PT-N0020P4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16252.752 | 3600000.00 | 1072783.00 | 3450.90 | FFFFFTFFFTFFF?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ClientsAndServers-PT-N0020P4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600102
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P4-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-15
=== Now, execution of the tool begins
BK_START 1620897839648
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:24:02] [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 09:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:24:02] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-13 09:24:02] [INFO ] Transformed 25 places.
[2021-05-13 09:24:02] [INFO ] Transformed 18 transitions.
[2021-05-13 09:24:02] [INFO ] Parsed PT model containing 25 places and 18 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100035 steps, including 21 resets, run finished after 54 ms. (steps per millisecond=1852 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:24:02] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 09:24:02] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 09:24:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 09:24:02] [INFO ] Flatten gal took : 20 ms
FORMULA ClientsAndServers-PT-N0020P4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:24:02] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:24:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 09:24:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0020P4 @ 3570 seconds
FORMULA ClientsAndServers-PT-N0020P4-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P4-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2585
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0020P4
{
"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 09:24:03 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((F ((1 <= p18)) U (1 <= p18)) AND G (((1 <= p4) AND (1 <= p21)))))",
"processed_size": 70,
"rewrites": 88
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p3))) AND F ((1 <= p9))))",
"processed_size": 39,
"rewrites": 88
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (((1 <= p9) U ((1 <= p11) AND (1 <= p17)))))",
"processed_size": 49,
"rewrites": 88
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p7) AND (1 <= p23))",
"processed_size": 26,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p12 <= 0))",
"processed_size": 14,
"rewrites": 88
},
"result":
{
"edges": 893,
"markings": 893,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F (G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15)))))) AND G ((((1 <= p5) AND (1 <= p15)) OR G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15))))))))))",
"processed_size": 157,
"rewrites": 88
},
"result":
{
"edges": 1326649,
"markings": 656160,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 4,
"adisj": 0,
"aneg": 6,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (((X (X (X (((p2 <= 0))))) AND ((1 <= p8) AND (1 <= p15))) R (((p2 <= 0)) AND (F (((p2 <= 0))) OR G (((p2 <= 0))))))))",
"processed_size": 123,
"rewrites": 88
},
"result":
{
"edges": 1855,
"markings": 1702,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p10))",
"processed_size": 14,
"rewrites": 88
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X ((p6 <= 0)) AND (p10 <= 0)))",
"processed_size": 34,
"rewrites": 88
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((F ((1 <= p20)) U ((1 <= p0) AND (1 <= p13))) U G ((X (F ((p20 <= 0))) AND G (((1 <= p0) AND (1 <= p13))))))",
"processed_size": 109,
"rewrites": 88
},
"result":
{
"edges": 1291,
"markings": 1291,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 768
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p12) AND (1 <= p18))))",
"processed_size": 35,
"rewrites": 88
},
"result":
{
"edges": 921,
"markings": 921,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1024
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((G ((p12 <= 0)) OR G ((p12 <= 0))))",
"processed_size": 38,
"rewrites": 88
},
"result":
{
"edges": 882,
"markings": 882,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 1536
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p1 <= 0) OR (p19 <= 0)))",
"processed_size": 30,
"rewrites": 88
},
"result":
{
"edges": 893,
"markings": 893,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3072
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3072
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p16)",
"processed_size": 10,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p8) AND (1 <= p15))))",
"processed_size": 34,
"rewrites": 88
},
"result":
{
"edges": 1291,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p16)",
"processed_size": 10,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p3 <= 0))",
"processed_size": 11,
"rewrites": 90
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3080,
"runtime": 985.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X(((F(**) U **) AND G(**))) : X((G(**) AND F(**))) : X(X((** U **))) : ((G(*) AND X(**)) OR (F(**) AND (** AND **))) : X(G((F(G((** AND F(**)))) AND G((** OR G((** AND F(**)))))))) : X(X(((X(X(X(*))) AND (* AND *)) R (* AND (F(*) OR G(*)))))) : (F((X(*) AND **)) OR (G(**) AND F((X(*) AND **)))) : (F(G(*)) AND G(*)) : F((G(*) OR G(*))) : G(F(**)) : (F(**) OR (** OR (F((F(**) OR **)) AND F(G(**))))) : ((F(**) U **) U G((X(F(*)) AND G(**))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no no no no no yes no no unknown yes no ",
"value": "no no no no no no no yes no no unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 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: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: NOT(F (NOT(F (((1 <= p12) AND (1 <= p18)))))) : NOT(X ((NOT((F ((1 <= p18)) U (1 <= p18))) OR NOT(G (((1 <= p4) AND (1 <= p21))))))) : (X (G (((1 <= p3)))) AND X (F ((1 <= p9)))) : X (X (((1 <= p9) U ((1 <= p11) AND (1 <= p17))))) : ((NOT(F ((1 <= p12))) AND X (((1 <= p2)))) OR ((F (((1 <= p2))) AND (1 <= p7)) AND (1 <= p23))) : G (X (G ((((1 <= p5) AND (1 <= p15)) U (G ((p22 <= 0)) AND G (X (F (X (((1 <= p8) AND (1 <= p15))))))))))) : X (NOT(X ((((X (X (X (((1 <= p2))))) OR (p8 <= 0)) OR (p15 <= 0)) U (G (((1 <= p2))) U ((1 <= p2))))))) : (G ((1 <= p10)) U F ((NOT(X ((1 <= p6))) AND (p10 <= 0)))) : (NOT(G (F (((1 <= p1) AND (1 <= p19))))) AND NOT(((0 <= 0) U ((1 <= p1) AND (1 <= p19))))) : (F (NOT(G (F (X ((1 <= p12)))))) OR F (NOT(F ((1 <= p12))))) : F (G (F ((1 <= p22)))) : (F (X (F (G (X (((1 <= p8) AND (1 <= p15))))))) U (F (((1 <= p3))) OR (1 <= p16))) : ((F ((1 <= p20)) U ((1 <= p0) AND (1 <= p13))) U G ((NOT(X (G ((1 <= p20)))) AND NOT(F (NOT(G (((1 <= p0) AND (1 <= p13)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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 (((F ((1 <= p18)) U (1 <= p18)) AND G (((1 <= p4) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((1 <= p18)) U (1 <= p18)) AND G (((1 <= p4) AND (1 <= p21)))))
lola: processed formula length: 70
lola: 88 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p3))) AND F ((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p3))) AND F ((1 <= p9))))
lola: processed formula length: 39
lola: 88 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p9) U ((1 <= p11) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p9) U ((1 <= p11) AND (1 <= p17)))))
lola: processed formula length: 49
lola: 88 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p12 <= 0)) AND X (((1 <= p2)))) OR (F (((1 <= p2))) AND ((1 <= p7) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p7) AND (1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p7) AND (1 <= p23))
lola: processed formula length: 26
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p12 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p12 <= 0))
lola: processed formula length: 14
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 893 markings, 893 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15)))))) AND G ((((1 <= p5) AND (1 <= p15)) OR G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15)))))) AND G ((((1 <= p5) AND (1 <= p15)) OR G (((p22 <= 0) AND F (((1 <= p8) AND (1 <= p15))))))))))
lola: processed formula length: 157
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 656160 markings, 1326649 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((X (X (X (((p2 <= 0))))) AND ((1 <= p8) AND (1 <= p15))) R (((p2 <= 0)) AND (F (((p2 <= 0))) OR G (((p2 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((X (X (X (((p2 <= 0))))) AND ((1 <= p8) AND (1 <= p15))) R (((p2 <= 0)) AND (F (((p2 <= 0))) OR G (((p2 <= 0))))))))
lola: processed formula length: 123
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 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: 1702 markings, 1855 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p6 <= 0)) AND (p10 <= 0))) OR (G ((1 <= p10)) AND F ((X ((p6 <= 0)) AND (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p10))
lola: processed formula length: 14
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 180 markings, 180 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p6 <= 0)) AND (p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p6 <= 0)) AND (p10 <= 0)))
lola: processed formula length: 34
lola: 88 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p20)) U ((1 <= p0) AND (1 <= p13))) U G ((X (F ((p20 <= 0))) AND G (((1 <= p0) AND (1 <= p13))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((1 <= p20)) U ((1 <= p0) AND (1 <= p13))) U G ((X (F ((p20 <= 0))) AND G (((1 <= p0) AND (1 <= p13))))))
lola: processed formula length: 109
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1291 markings, 1291 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p22)))
lola: processed formula length: 18
lola: 88 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: 3178509 markings, 8537615 edges, 635702 markings/sec, 0 secs
lola: 6602701 markings, 16494048 edges, 684838 markings/sec, 5 secs
lola: 10207772 markings, 24324624 edges, 721014 markings/sec, 10 secs
lola: 13635466 markings, 31764716 edges, 685539 markings/sec, 15 secs
lola: 17092510 markings, 39269373 edges, 691409 markings/sec, 20 secs
lola: 20746687 markings, 47193542 edges, 730835 markings/sec, 25 secs
lola: 24169327 markings, 54631423 edges, 684528 markings/sec, 30 secs
lola: 27754341 markings, 62407995 edges, 717003 markings/sec, 35 secs
lola: 31244666 markings, 69985632 edges, 698065 markings/sec, 40 secs
lola: 34845084 markings, 77805986 edges, 720084 markings/sec, 45 secs
lola: 38374245 markings, 85469461 edges, 705832 markings/sec, 50 secs
lola: 41962473 markings, 93256467 edges, 717646 markings/sec, 55 secs
lola: 45528311 markings, 101036903 edges, 713168 markings/sec, 60 secs
lola: 49251406 markings, 109237557 edges, 744619 markings/sec, 65 secs
lola: 51470286 markings, 116606184 edges, 443776 markings/sec, 70 secs
lola: 53005258 markings, 122311388 edges, 306994 markings/sec, 75 secs
lola: 54607613 markings, 128256659 edges, 320471 markings/sec, 80 secs
lola: 55983287 markings, 133473827 edges, 275135 markings/sec, 85 secs
lola: 57571691 markings, 139533993 edges, 317681 markings/sec, 90 secs
lola: 59220695 markings, 145713289 edges, 329801 markings/sec, 95 secs
lola: 60646084 markings, 151228692 edges, 285078 markings/sec, 100 secs
lola: 61890156 markings, 155971783 edges, 248814 markings/sec, 105 secs
lola: 63522263 markings, 162086740 edges, 326421 markings/sec, 110 secs
lola: 64765507 markings, 167049551 edges, 248649 markings/sec, 115 secs
lola: 66097727 markings, 172117303 edges, 266444 markings/sec, 120 secs
lola: 67372422 markings, 176810857 edges, 254939 markings/sec, 125 secs
lola: 68245081 markings, 180265612 edges, 174532 markings/sec, 130 secs
lola: 69080455 markings, 183620828 edges, 167075 markings/sec, 135 secs
lola: 69918651 markings, 186961053 edges, 167639 markings/sec, 140 secs
lola: 71080739 markings, 191328411 edges, 232418 markings/sec, 145 secs
lola: 72649999 markings, 197150578 edges, 313852 markings/sec, 150 secs
lola: 73776447 markings, 201662490 edges, 225290 markings/sec, 155 secs
lola: 74839038 markings, 205935982 edges, 212518 markings/sec, 160 secs
lola: 75961665 markings, 210377969 edges, 224525 markings/sec, 165 secs
lola: 77405981 markings, 215670674 edges, 288863 markings/sec, 170 secs
lola: 78910096 markings, 221411184 edges, 300823 markings/sec, 175 secs
lola: 80127839 markings, 226322043 edges, 243549 markings/sec, 180 secs
lola: 81354759 markings, 231263339 edges, 245384 markings/sec, 185 secs
lola: 82625515 markings, 236266025 edges, 254151 markings/sec, 190 secs
lola: 84251593 markings, 242222282 edges, 325216 markings/sec, 195 secs
lola: 85463220 markings, 246833058 edges, 242325 markings/sec, 200 secs
lola: 86657386 markings, 251655846 edges, 238833 markings/sec, 205 secs
lola: 87834795 markings, 256422337 edges, 235482 markings/sec, 210 secs
lola: 89062658 markings, 261340740 edges, 245573 markings/sec, 215 secs
lola: 90453353 markings, 266609929 edges, 278139 markings/sec, 220 secs
lola: 91855776 markings, 271821654 edges, 280485 markings/sec, 225 secs
lola: 93235344 markings, 277131132 edges, 275914 markings/sec, 230 secs
lola: 94077827 markings, 280540427 edges, 168497 markings/sec, 235 secs
lola: 95086071 markings, 284633103 edges, 201649 markings/sec, 240 secs
lola: 96095207 markings, 288718724 edges, 201827 markings/sec, 245 secs
lola: 97269433 markings, 293419986 edges, 234845 markings/sec, 250 secs
lola: 98542280 markings, 298271425 edges, 254569 markings/sec, 255 secs
lola: 100116953 markings, 304083501 edges, 314935 markings/sec, 260 secs
lola: 101445748 markings, 309169010 edges, 265759 markings/sec, 265 secs
lola: 102471810 markings, 313333328 edges, 205212 markings/sec, 270 secs
lola: 103548794 markings, 317710866 edges, 215397 markings/sec, 275 secs
lola: 104690619 markings, 322343259 edges, 228365 markings/sec, 280 secs
lola: 105850703 markings, 326993929 edges, 232017 markings/sec, 285 secs
lola: 107094801 markings, 331882519 edges, 248820 markings/sec, 290 secs
lola: 108597976 markings, 337387415 edges, 300635 markings/sec, 295 secs
lola: 110177165 markings, 343297163 edges, 315838 markings/sec, 300 secs
lola: 111315603 markings, 347894231 edges, 227688 markings/sec, 305 secs
lola: 112453785 markings, 352518928 edges, 227636 markings/sec, 310 secs
lola: 113568006 markings, 357061347 edges, 222844 markings/sec, 315 secs
lola: 114728212 markings, 361756937 edges, 232041 markings/sec, 320 secs
lola: 115902953 markings, 366450679 edges, 234948 markings/sec, 325 secs
lola: 117145586 markings, 371301232 edges, 248527 markings/sec, 330 secs
lola: 117900730 markings, 374020761 edges, 151029 markings/sec, 335 secs
lola: 118858410 markings, 377568544 edges, 191536 markings/sec, 340 secs
lola: 119923266 markings, 381529566 edges, 212971 markings/sec, 345 secs
lola: 120941329 markings, 385596062 edges, 203613 markings/sec, 350 secs
lola: 121712453 markings, 388729173 edges, 154225 markings/sec, 355 secs
lola: 122458860 markings, 391761357 edges, 149281 markings/sec, 360 secs
lola: 123158601 markings, 394630135 edges, 139948 markings/sec, 365 secs
lola: 123910129 markings, 397677466 edges, 150306 markings/sec, 370 secs
lola: 124935230 markings, 401846662 edges, 205020 markings/sec, 375 secs
lola: 125977849 markings, 406024088 edges, 208524 markings/sec, 380 secs
lola: 126942029 markings, 409852256 edges, 192836 markings/sec, 385 secs
lola: 127828112 markings, 413283634 edges, 177217 markings/sec, 390 secs
lola: 128864174 markings, 417035873 edges, 207212 markings/sec, 395 secs
lola: 129980749 markings, 421200353 edges, 223315 markings/sec, 400 secs
lola: 130969815 markings, 424919785 edges, 197813 markings/sec, 405 secs
lola: 131715252 markings, 427905204 edges, 149087 markings/sec, 410 secs
lola: 132526102 markings, 431200408 edges, 162170 markings/sec, 415 secs
lola: 133307012 markings, 434405971 edges, 156182 markings/sec, 420 secs
lola: 134134094 markings, 437766889 edges, 165416 markings/sec, 425 secs
lola: 134973156 markings, 441179915 edges, 167812 markings/sec, 430 secs
lola: 135774923 markings, 444455762 edges, 160353 markings/sec, 435 secs
lola: 136617062 markings, 447853173 edges, 168428 markings/sec, 440 secs
lola: 137436001 markings, 451136599 edges, 163788 markings/sec, 445 secs
lola: 138300170 markings, 454560052 edges, 172834 markings/sec, 450 secs
lola: 139323754 markings, 458523423 edges, 204717 markings/sec, 455 secs
lola: 140167470 markings, 461557250 edges, 168743 markings/sec, 460 secs
lola: 141057287 markings, 464845696 edges, 177963 markings/sec, 465 secs
lola: 142097427 markings, 468686242 edges, 208028 markings/sec, 470 secs
lola: 142824642 markings, 471589057 edges, 145443 markings/sec, 475 secs
lola: 143511691 markings, 474351371 edges, 137410 markings/sec, 480 secs
lola: 144186406 markings, 477111139 edges, 134943 markings/sec, 485 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p12) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p12) AND (1 <= p18))))
lola: processed formula length: 35
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 921 markings, 921 edges
lola: ========================================
lola: subprocess 10 will run for 1024 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p12 <= 0)) OR G ((p12 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p12 <= 0)) OR G ((p12 <= 0))))
lola: processed formula length: 38
lola: 88 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: 882 markings, 882 edges
lola: ========================================
lola: subprocess 11 will run for 1536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p1 <= 0) OR (p19 <= 0)))) AND G (((p1 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1 <= 0) OR (p19 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1 <= 0) OR (p19 <= 0)))
lola: processed formula length: 30
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 893 markings, 893 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 3072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p3))) OR ((1 <= p16) OR (F ((F (((1 <= p3))) OR (1 <= p16))) AND F (G (((1 <= p8) AND (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p16)
lola: processed formula length: 10
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p8) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p8) AND (1 <= p15))))
lola: processed formula length: 34
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1290 markings, 1291 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p22)))
lola: processed formula length: 18
lola: 88 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: 2927080 markings, 7907509 edges, 585416 markings/sec, 0 secs
lola: 5876493 markings, 14910975 edges, 589883 markings/sec, 5 secs
lola: 9100414 markings, 21916625 edges, 644784 markings/sec, 10 secs
lola: 12249845 markings, 28759331 edges, 629886 markings/sec, 15 secs
lola: 15495486 markings, 35798799 edges, 649128 markings/sec, 20 secs
lola: 18677543 markings, 42713058 edges, 636411 markings/sec, 25 secs
lola: 22089671 markings, 50118555 edges, 682426 markings/sec, 30 secs
lola: 25670185 markings, 57885542 edges, 716103 markings/sec, 35 secs
lola: 29278415 markings, 65717779 edges, 721646 markings/sec, 40 secs
lola: 32840653 markings, 73453951 edges, 712448 markings/sec, 45 secs
lola: 36318599 markings, 81004272 edges, 695589 markings/sec, 50 secs
lola: 39877707 markings, 88733418 edges, 711822 markings/sec, 55 secs
lola: 43448259 markings, 96489865 edges, 714110 markings/sec, 60 secs
lola: 47039799 markings, 104347717 edges, 718308 markings/sec, 65 secs
lola: 50349578 markings, 112552521 edges, 661956 markings/sec, 70 secs
lola: 52209855 markings, 119343672 edges, 372055 markings/sec, 75 secs
lola: 53878909 markings, 125551797 edges, 333811 markings/sec, 80 secs
lola: 55355076 markings, 131188069 edges, 295233 markings/sec, 85 secs
lola: 57039120 markings, 137426706 edges, 336809 markings/sec, 90 secs
lola: 58409290 markings, 142717741 edges, 274034 markings/sec, 95 secs
lola: 60064853 markings, 148914232 edges, 331113 markings/sec, 100 secs
lola: 61325619 markings, 153914220 edges, 252153 markings/sec, 105 secs
lola: 63012835 markings, 160122427 edges, 337443 markings/sec, 110 secs
lola: 64299668 markings, 165189746 edges, 257367 markings/sec, 115 secs
lola: 65535453 markings, 170078966 edges, 247157 markings/sec, 120 secs
lola: 67175840 markings, 176114763 edges, 328077 markings/sec, 125 secs
lola: 68463272 markings, 181146851 edges, 257486 markings/sec, 130 secs
lola: 69683892 markings, 186032798 edges, 244124 markings/sec, 135 secs
lola: 71074801 markings, 191305199 edges, 278182 markings/sec, 140 secs
lola: 72744651 markings, 197525194 edges, 333970 markings/sec, 145 secs
lola: 73925548 markings, 202266939 edges, 236179 markings/sec, 150 secs
lola: 75115550 markings, 207044288 edges, 238000 markings/sec, 155 secs
lola: 76376016 markings, 211945860 edges, 252093 markings/sec, 160 secs
lola: 77924049 markings, 217642428 edges, 309607 markings/sec, 165 secs
lola: 79141088 markings, 222343163 edges, 243408 markings/sec, 170 secs
lola: 80223773 markings, 226710284 edges, 216537 markings/sec, 175 secs
lola: 81318055 markings, 231115241 edges, 218856 markings/sec, 180 secs
lola: 82465892 markings, 235649304 edges, 229567 markings/sec, 185 secs
lola: 83901721 markings, 240916446 edges, 287166 markings/sec, 190 secs
lola: 85320135 markings, 246264134 edges, 283683 markings/sec, 195 secs
lola: 86374721 markings, 250509937 edges, 210917 markings/sec, 200 secs
lola: 87438914 markings, 254818297 edges, 212839 markings/sec, 205 secs
lola: 88432392 markings, 258832097 edges, 198696 markings/sec, 210 secs
lola: 89445181 markings, 262849427 edges, 202558 markings/sec, 215 secs
lola: 90659628 markings, 267392016 edges, 242889 markings/sec, 220 secs
lola: 92198836 markings, 273073790 edges, 307842 markings/sec, 225 secs
lola: 93332362 markings, 277526065 edges, 226705 markings/sec, 230 secs
lola: 94411043 markings, 281893358 edges, 215736 markings/sec, 235 secs
lola: 95487287 markings, 286262633 edges, 215249 markings/sec, 240 secs
lola: 96350556 markings, 289742088 edges, 172654 markings/sec, 245 secs
lola: 97122514 markings, 292827815 edges, 154392 markings/sec, 250 secs
lola: 98299712 markings, 297410954 edges, 235440 markings/sec, 255 secs
lola: 99829668 markings, 302992864 edges, 305991 markings/sec, 260 secs
lola: 101267972 markings, 308460541 edges, 287661 markings/sec, 265 secs
lola: 102397993 markings, 313028027 edges, 226004 markings/sec, 270 secs
lola: 103508990 markings, 317544257 edges, 222199 markings/sec, 275 secs
lola: 104570695 markings, 321848791 edges, 212341 markings/sec, 280 secs
lola: 105691437 markings, 326370019 edges, 224148 markings/sec, 285 secs
lola: 106918626 markings, 331209411 edges, 245438 markings/sec, 290 secs
lola: 108402010 markings, 336662211 edges, 296677 markings/sec, 295 secs
lola: 109985687 markings, 342538351 edges, 316735 markings/sec, 300 secs
lola: 111151762 markings, 347232906 edges, 233215 markings/sec, 305 secs
lola: 112279287 markings, 351817373 edges, 225505 markings/sec, 310 secs
lola: 113385690 markings, 356310675 edges, 221281 markings/sec, 315 secs
lola: 114522549 markings, 360918120 edges, 227372 markings/sec, 320 secs
lola: 115699985 markings, 365645296 edges, 235487 markings/sec, 325 secs
lola: 116959019 markings, 370587997 edges, 251807 markings/sec, 330 secs
lola: 118150604 markings, 374938144 edges, 238317 markings/sec, 335 secs
lola: 119222687 markings, 378936626 edges, 214417 markings/sec, 340 secs
lola: 120109024 markings, 382259707 edges, 177267 markings/sec, 345 secs
lola: 121083794 markings, 386178961 edges, 194954 markings/sec, 350 secs
lola: 122035766 markings, 390038734 edges, 190394 markings/sec, 355 secs
lola: 122815883 markings, 393214364 edges, 156023 markings/sec, 360 secs
lola: 123557545 markings, 396248564 edges, 148332 markings/sec, 365 secs
lola: 124297369 markings, 399248258 edges, 147965 markings/sec, 370 secs
lola: 125073979 markings, 402387960 edges, 155322 markings/sec, 375 secs
lola: 125827340 markings, 405420226 edges, 150672 markings/sec, 380 secs
lola: 126593655 markings, 408473324 edges, 153263 markings/sec, 385 secs
lola: 127389165 markings, 411603560 edges, 159102 markings/sec, 390 secs
lola: 128314928 markings, 415007146 edges, 185153 markings/sec, 395 secs
lola: 129330807 markings, 418759987 edges, 203176 markings/sec, 400 secs
lola: 130563336 markings, 423309877 edges, 246506 markings/sec, 405 secs
lola: 131437245 markings, 426787604 edges, 174782 markings/sec, 410 secs
lola: 132263120 markings, 430142421 edges, 165175 markings/sec, 415 secs
lola: 133132739 markings, 433680550 edges, 173924 markings/sec, 420 secs
lola: 133987173 markings, 437162567 edges, 170887 markings/sec, 425 secs
lola: 134803597 markings, 440511159 edges, 163285 markings/sec, 430 secs
lola: 135621717 markings, 443821131 edges, 163624 markings/sec, 435 secs
lola: 136513932 markings, 447430485 edges, 178443 markings/sec, 440 secs
lola: 137438743 markings, 451147629 edges, 184962 markings/sec, 445 secs
lola: 138453641 markings, 455173355 edges, 202980 markings/sec, 450 secs
lola: 139656559 markings, 459668620 edges, 240584 markings/sec, 455 secs
lola: 140922165 markings, 464340260 edges, 253121 markings/sec, 460 secs
lola: 142017795 markings, 468388612 edges, 219126 markings/sec, 465 secs
lola: 142764716 markings, 471338008 edges, 149384 markings/sec, 470 secs
lola: 143441452 markings, 474060371 edges, 135347 markings/sec, 475 secs
lola: 144226775 markings, 477262607 edges, 157065 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p3))) OR ((1 <= p16) OR (F ((F (((1 <= p3))) OR (1 <= p16))) AND F (G (((1 <= p8) AND (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p16)
lola: processed formula length: 10
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3)))
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: ((p3 <= 0))
lola: processed formula length: 11
lola: 90 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: 201 markings, 200 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no unknown yes no
lola:
preliminary result: no no no no no no no yes no no unknown yes no
lola: ========================================
lola: memory consumption: 3080 KB
lola: time consumption: 985 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="ClientsAndServers-PT-N0020P4"
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 ClientsAndServers-PT-N0020P4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-oct2-162038334600102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 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 ;