About the Execution of 2020-gold for ClientsAndServers-PT-N0010P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16250.960 | 3600000.00 | 928931.00 | 3558.50 | ?TFFTFTFFFFFTFFF | 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-162038334500078.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-N0010P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334500078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K 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.6K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:32 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-N0010P1-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-15
=== Now, execution of the tool begins
BK_START 1620897009349
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:10:10] [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:10:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:10:10] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-13 09:10:10] [INFO ] Transformed 25 places.
[2021-05-13 09:10:10] [INFO ] Transformed 18 transitions.
[2021-05-13 09:10:10] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 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 100000 steps, including 54 resets, run finished after 54 ms. (steps per millisecond=1851 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:10:11] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-13 09:10:11] [INFO ] [Real]Absence check using 5 positive place invariants in 45 ms returned sat
[2021-05-13 09:10:11] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 09:10:11] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 09:10:11] [INFO ] Flatten gal took : 22 ms
FORMULA ClientsAndServers-PT-N0010P1-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:10:11] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:10:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 09:10:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0010P1 @ 3570 seconds
FORMULA ClientsAndServers-PT-N0010P1-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P1-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2679
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0010P1
{
"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:10:11 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p9) OR ((1 <= p4) AND (1 <= p21)))))",
"processed_size": 50,
"rewrites": 114
},
"result":
{
"edges": 709,
"markings": 671,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((p2 <= 0))))",
"processed_size": 19,
"rewrites": 114
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (((p8 <= 0) OR (p15 <= 0))) AND (F (((p0 <= 0) OR (p13 <= 0))) OR G (((p8 <= 0) OR (p15 <= 0))))))",
"processed_size": 107,
"rewrites": 114
},
"result":
{
"edges": 100,
"markings": 100,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X (F ((p16 <= 0)))))",
"processed_size": 26,
"rewrites": 114
},
"result":
{
"edges": 828,
"markings": 828,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X (G ((p18 <= 0))) OR F ((1 <= p12))) AND (((p7 <= 0) OR (p23 <= 0)) U ((1 <= p7) AND (1 <= p23)))))",
"processed_size": 106,
"rewrites": 114
},
"result":
{
"edges": 93978335,
"markings": 26203770,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((p12 <= 0)) AND ((p4 <= 0) OR (p21 <= 0))))",
"processed_size": 51,
"rewrites": 114
},
"result":
{
"edges": 574,
"markings": 574,
"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": 406
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p11 <= 0) OR (p17 <= 0))",
"processed_size": 27,
"rewrites": 116
},
"result":
{
"edges": 5480,
"markings": 3011,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"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": "(p10 <= 0)",
"processed_size": 10,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 542
},
"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 <= p20)",
"processed_size": 10,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 651
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((1 <= p20))",
"processed_size": 14,
"rewrites": 114
},
"result":
{
"edges": 573,
"markings": 573,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((F (G (((p0 <= 0) OR (p13 <= 0)))) OR ((p0 <= 0) OR (p13 <= 0))) AND X (((1 <= p0) AND (1 <= p13)))))",
"processed_size": 106,
"rewrites": 114
},
"result":
{
"edges": 573,
"markings": 573,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 542
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((p12 <= 0))) OR (F ((p10 <= 0)) AND (p16 <= 0)))))",
"processed_size": 63,
"rewrites": 114
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((G ((1 <= p16)) OR (X (X ((1 <= p22))) AND G (F ((1 <= p9))))) U (F ((1 <= p16)) AND (1 <= p16)))",
"processed_size": 98,
"rewrites": 114
},
"result":
{
"edges": 4537,
"markings": 2325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 813
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p3))) U ((F (((p3 <= 0))) AND G (((p5 <= 0) OR (p15 <= 0)))) R (p16 <= 0))))",
"processed_size": 91,
"rewrites": 114
},
"result":
{
"edges": 573,
"markings": 573,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 31
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1085
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F ((p24 <= 0))) AND (F (G (((1 <= p0) AND (1 <= p13)))) OR G (F ((p24 <= 0))))))",
"processed_size": 87,
"rewrites": 114
},
"result":
{
"edges": 2148,
"markings": 2127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"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": 1627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((p6 <= 0))) OR ((p7 <= 0) OR (p23 <= 0)))))",
"processed_size": 56,
"rewrites": 114
},
"result":
{
"edges": 1645,
"markings": 1415,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((p8 <= 0) OR (p15 <= 0))) AND (F (((p5 <= 0) OR (p15 <= 0))) AND (((p16 <= 0) OR (p22 <= 0)) AND ((p8 <= 0) OR (p15 <= 0)))))))",
"processed_size": 142,
"rewrites": 114
},
"result":
{
"edges": 783,
"markings": 696,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"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 <= p12)",
"processed_size": 10,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3148,
"runtime": 891.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F(**)) OR (** AND (X(**) OR **))) : (F(G(**)) AND G((X(X(**)) OR G(**)))) : X(F(*)) : (X(X(X(F(*)))) OR (G((G(*) AND (F(*) OR G(*)))) AND X(X(X(F(*)))))) : X(((X(G(*)) OR F(**)) AND (** U **))) : F(G((F(*) AND (F(*) AND (* AND *))))) : X((G(*) AND **)) : (F(**) AND (** OR (X(**) AND **))) : G(((F(G(*)) OR (* OR *)) AND X(*))) : F(G((F(G(*)) OR (* OR *)))) : X(F((F(G(*)) OR (F(*) AND *)))) : ((G(**) OR (X(X(**)) AND G(F(**)))) U (F(**) AND **)) : X((X(**) U ((F(*) AND G(*)) R *))) : F((X(F(*)) AND (F(G(*)) OR G(F(*)))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "unknown no yes no yes no no no no no yes no no no ",
"value": "unknown no yes no yes no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: (G (X (F ((1 <= p12)))) OR ((1 <= p12) AND (X ((1 <= p10)) OR ((1 <= p5) AND (1 <= p15))))) : G ((X (X (((1 <= p4) AND (1 <= p21)))) U G (((1 <= p9) OR ((1 <= p4) AND (1 <= p21)))))) : X (F (((1 <= p9) U F (NOT(G (((1 <= p2)))))))) : (G (NOT((G (((1 <= p0) AND (1 <= p13))) U F (((1 <= p8) AND (1 <= p15)))))) U X (F (NOT(X (G (X ((1 <= p16)))))))) : (X ((NOT(X (F ((1 <= p18)))) OR F ((1 <= p12)))) AND X ((((p7 <= 0) OR (p23 <= 0)) U ((1 <= p7) AND (1 <= p23))))) : NOT(F (G (F ((((G (((1 <= p8) AND (1 <= p15))) OR G (((1 <= p5) AND (1 <= p15)))) OR ((1 <= p16) AND (1 <= p22))) OR ((1 <= p8) AND (1 <= p15))))))) : X ((NOT(F ((1 <= p12))) AND ((p4 <= 0) OR (p21 <= 0)))) : (F (((1 <= p11) AND (1 <= p17))) AND ((1 <= p20) OR (X ((1 <= p20)) AND (p10 <= 0)))) : G (NOT(F ((((G (F (X (((1 <= p0) AND (1 <= p13))))) AND (1 <= p0)) AND (1 <= p13)) OR X (((p0 <= 0) OR (p13 <= 0))))))) : F (NOT(F (((F (G (F ((1 <= p6)))) AND (1 <= p7)) AND (1 <= p23))))) : NOT(G (X ((F (G (F ((1 <= p12)))) AND (G ((1 <= p10)) OR (1 <= p16)))))) : ((G ((1 <= p16)) OR (X (X ((1 <= p22))) AND G (F ((1 <= p9))))) U (F ((1 <= p16)) AND (1 <= p16))) : (X (X (((1 <= p3)))) U NOT(X (((G (((1 <= p3))) OR F (((1 <= p5) AND (1 <= p15)))) U (1 <= p16))))) : F (NOT((G (F (((p0 <= 0) OR (p13 <= 0)))) U X (G ((1 <= p24))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p12))) OR ((1 <= p12) AND (X ((1 <= p10)) OR ((1 <= p5) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p15))
lola: processed formula length: 26
lola: 114 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 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 114 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: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p12)))
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)))
lola: processed formula length: 18
lola: 114 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: 2141911 markings, 7840085 edges, 428382 markings/sec, 0 secs
lola: 3939703 markings, 14857803 edges, 359558 markings/sec, 5 secs
lola: 5721945 markings, 21872284 edges, 356448 markings/sec, 10 secs
lola: 7343368 markings, 28676365 edges, 324285 markings/sec, 15 secs
lola: 8898046 markings, 34658148 edges, 310936 markings/sec, 20 secs
lola: 10072542 markings, 39796536 edges, 234899 markings/sec, 25 secs
lola: 11094043 markings, 44291657 edges, 204300 markings/sec, 30 secs
lola: 12322887 markings, 49170582 edges, 245769 markings/sec, 35 secs
lola: 13647083 markings, 54300043 edges, 264839 markings/sec, 40 secs
lola: 14934685 markings, 59980913 edges, 257520 markings/sec, 45 secs
lola: 16163178 markings, 65445450 edges, 245699 markings/sec, 50 secs
lola: 17248883 markings, 70300557 edges, 217141 markings/sec, 55 secs
lola: 18439262 markings, 75449012 edges, 238076 markings/sec, 60 secs
lola: 19689937 markings, 80130454 edges, 250135 markings/sec, 65 secs
lola: 21102335 markings, 85985242 edges, 282480 markings/sec, 70 secs
lola: 22429981 markings, 91883644 edges, 265529 markings/sec, 75 secs
lola: 23686151 markings, 97641662 edges, 251234 markings/sec, 80 secs
lola: 24710219 markings, 102260112 edges, 204814 markings/sec, 85 secs
lola: 25812506 markings, 107175624 edges, 220457 markings/sec, 90 secs
lola: 27014040 markings, 112349024 edges, 240307 markings/sec, 95 secs
lola: 28351665 markings, 118086861 edges, 267525 markings/sec, 100 secs
lola: 29675381 markings, 123110256 edges, 264743 markings/sec, 105 secs
lola: 31182100 markings, 129555173 edges, 301344 markings/sec, 110 secs
lola: 32535391 markings, 135659395 edges, 270658 markings/sec, 115 secs
lola: 33846308 markings, 141669260 edges, 262183 markings/sec, 120 secs
lola: 34929259 markings, 146560607 edges, 216590 markings/sec, 125 secs
lola: 35845065 markings, 150900625 edges, 183161 markings/sec, 130 secs
lola: 36927957 markings, 155705897 edges, 216578 markings/sec, 135 secs
lola: 37802822 markings, 159882447 edges, 174973 markings/sec, 140 secs
lola: 38969320 markings, 164780740 edges, 233300 markings/sec, 145 secs
lola: 40109434 markings, 170188953 edges, 228023 markings/sec, 150 secs
lola: 41382431 markings, 174832080 edges, 254599 markings/sec, 155 secs
lola: 42724882 markings, 180249251 edges, 268490 markings/sec, 160 secs
lola: 43938106 markings, 185565253 edges, 242645 markings/sec, 165 secs
lola: 44999972 markings, 190403837 edges, 212373 markings/sec, 170 secs
lola: 46112845 markings, 195481247 edges, 222575 markings/sec, 175 secs
lola: 47249147 markings, 200690511 edges, 227260 markings/sec, 180 secs
lola: 48340823 markings, 205768375 edges, 218335 markings/sec, 185 secs
lola: 49449297 markings, 210859934 edges, 221695 markings/sec, 190 secs
lola: 50344656 markings, 215037060 edges, 179072 markings/sec, 195 secs
lola: 51412667 markings, 219855176 edges, 213602 markings/sec, 200 secs
lola: 52294704 markings, 224080284 edges, 176407 markings/sec, 205 secs
lola: 53311804 markings, 228460665 edges, 203420 markings/sec, 210 secs
lola: 54470215 markings, 233713922 edges, 231682 markings/sec, 215 secs
lola: 55460101 markings, 238511563 edges, 197977 markings/sec, 220 secs
lola: 56557842 markings, 242819402 edges, 219548 markings/sec, 225 secs
lola: 57822884 markings, 247712607 edges, 253008 markings/sec, 230 secs
lola: 59109086 markings, 253077780 edges, 257240 markings/sec, 235 secs
lola: 60336981 markings, 258638042 edges, 245579 markings/sec, 240 secs
lola: 61582988 markings, 264276510 edges, 249201 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8981376 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8981700 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p9) OR ((1 <= p4) AND (1 <= p21))))) AND G ((X (X (((1 <= p4) AND (1 <= p21)))) OR G (((1 <= p9) OR ((1 <= p4) AND (1 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p9) OR ((1 <= p4) AND (1 <= p21)))))
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 <= p9) OR ((1 <= p4) AND (1 <= p21)))))
lola: processed formula length: 50
lola: 114 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: 671 markings, 709 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p2 <= 0))))
lola: processed formula length: 19
lola: 114 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: ========================================
lola: subprocess 3 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (F ((p16 <= 0))))) OR (G ((G (((p8 <= 0) OR (p15 <= 0))) AND (F (((p0 <= 0) OR (p13 <= 0))) OR G (((p8 <= 0) OR (p15 <= 0)))))) AND X (X (X (F ((p16 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p8 <= 0) OR (p15 <= 0))) AND (F (((p0 <= 0) OR (p13 <= 0))) OR G (((p8 <= 0) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p8 <= 0) OR (p15 <= 0))) AND (F (((p0 <= 0) OR (p13 <= 0))) OR G (((p8 <= 0) OR (p15 <= 0))))))
lola: processed formula length: 107
lola: 114 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: 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: 100 markings, 100 edges
lola: ========================================
lola: subprocess 4 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p16 <= 0)))))
lola: processed formula length: 26
lola: 114 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: 828 markings, 828 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (G ((p18 <= 0))) OR F ((1 <= p12))) AND (((p7 <= 0) OR (p23 <= 0)) U ((1 <= p7) AND (1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (G ((p18 <= 0))) OR F ((1 <= p12))) AND (((p7 <= 0) OR (p23 <= 0)) U ((1 <= p7) AND (1 <= p23)))))
lola: processed formula length: 106
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2690581 markings, 9193620 edges, 538116 markings/sec, 0 secs
lola: 4927647 markings, 17263798 edges, 447413 markings/sec, 5 secs
lola: 6879910 markings, 24301207 edges, 390453 markings/sec, 10 secs
lola: 8878322 markings, 31512429 edges, 399682 markings/sec, 15 secs
lola: 11011124 markings, 39216763 edges, 426560 markings/sec, 20 secs
lola: 13300316 markings, 47476484 edges, 457838 markings/sec, 25 secs
lola: 15586887 markings, 55738258 edges, 457314 markings/sec, 30 secs
lola: 17959955 markings, 64292804 edges, 474614 markings/sec, 35 secs
lola: 20318018 markings, 72796097 edges, 471613 markings/sec, 40 secs
lola: 22709901 markings, 81429727 edges, 478377 markings/sec, 45 secs
lola: 25061343 markings, 89941656 edges, 470288 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 26203770 markings, 93978335 edges
lola: ========================================
lola: subprocess 5 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p12 <= 0)) AND ((p4 <= 0) OR (p21 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p12 <= 0)) AND ((p4 <= 0) OR (p21 <= 0))))
lola: processed formula length: 51
lola: 114 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: 574 markings, 574 edges
lola: subprocess 6 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ========================================
...considering subproblem: (F (((1 <= p11) AND (1 <= p17))) AND ((1 <= p20) OR (X ((1 <= p20)) AND (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p17)))
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: ((p11 <= 0) OR (p17 <= 0))
lola: processed formula length: 27
lola: 116 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: 3011 markings, 5480 edges
lola: ========================================
lola: subprocess 7 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= 0)
lola: processed formula length: 10
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p20)
lola: processed formula length: 10
lola: 114 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: subprocess 9 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p20))
lola: processed formula length: 14
lola: 114 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: 573 markings, 573 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((F (G (((p0 <= 0) OR (p13 <= 0)))) OR ((p0 <= 0) OR (p13 <= 0))) AND X (((1 <= p0) AND (1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((F (G (((p0 <= 0) OR (p13 <= 0)))) OR ((p0 <= 0) OR (p13 <= 0))) AND X (((1 <= p0) AND (1 <= p13)))))
lola: processed formula length: 106
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 573 markings, 573 edges
lola: ========================================
lola: subprocess 8 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((p12 <= 0))) OR (F ((p10 <= 0)) AND (p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((p12 <= 0))) OR (F ((p10 <= 0)) AND (p16 <= 0)))))
lola: processed formula length: 63
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((1 <= p16)) OR (X (X ((1 <= p22))) AND G (F ((1 <= p9))))) U (F ((1 <= p16)) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((1 <= p16)) OR (X (X ((1 <= p22))) AND G (F ((1 <= p9))))) U (F ((1 <= p16)) AND (1 <= p16)))
lola: processed formula length: 98
lola: 114 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: 2325 markings, 4537 edges
lola: ========================================
lola: subprocess 10 will run for 813 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p3))) U ((F (((p3 <= 0))) AND G (((p5 <= 0) OR (p15 <= 0)))) R (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p3))) U ((F (((p3 <= 0))) AND G (((p5 <= 0) OR (p15 <= 0)))) R (p16 <= 0))))
lola: processed formula length: 91
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 31 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: 573 markings, 573 edges
lola: ========================================
lola: subprocess 11 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p24 <= 0))) AND (F (G (((1 <= p0) AND (1 <= p13)))) OR G (F ((p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p24 <= 0))) AND (F (G (((1 <= p0) AND (1 <= p13)))) OR G (F ((p24 <= 0))))))
lola: processed formula length: 87
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2127 markings, 2148 edges
lola: ========================================
lola: subprocess 12 will run for 1627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((p6 <= 0))) OR ((p7 <= 0) OR (p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((p6 <= 0))) OR ((p7 <= 0) OR (p23 <= 0)))))
lola: processed formula length: 56
lola: 114 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: 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: 1415 markings, 1645 edges
lola: ========================================
lola: subprocess 13 will run for 3255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p8 <= 0) OR (p15 <= 0))) AND (F (((p5 <= 0) OR (p15 <= 0))) AND (((p16 <= 0) OR (p22 <= 0)) AND ((p8 <= 0) OR (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p8 <= 0) OR (p15 <= 0))) AND (F (((p5 <= 0) OR (p15 <= 0))) AND (((p16 <= 0) OR (p22 <= 0)) AND ((p8 <= 0) OR (p15 <= 0)))))))
lola: processed formula length: 142
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 696 markings, 783 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p12))) OR ((1 <= p12) AND (X ((1 <= p10)) OR ((1 <= p5) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 114 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: G (F ((1 <= p12)))
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)))
lola: processed formula length: 18
lola: 114 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: 2113705 markings, 7715066 edges, 422741 markings/sec, 0 secs
lola: 3782158 markings, 14277451 edges, 333691 markings/sec, 5 secs
lola: 5438681 markings, 20643995 edges, 331305 markings/sec, 10 secs
lola: 6805325 markings, 26499970 edges, 273329 markings/sec, 15 secs
lola: 8378802 markings, 32413283 edges, 314695 markings/sec, 20 secs
lola: 9793365 markings, 38580245 edges, 282913 markings/sec, 25 secs
lola: 11028465 markings, 44002041 edges, 247020 markings/sec, 30 secs
lola: 12457139 markings, 49690676 edges, 285735 markings/sec, 35 secs
lola: 14025201 markings, 55935148 edges, 313612 markings/sec, 40 secs
lola: 15476670 markings, 62407017 edges, 290294 markings/sec, 45 secs
lola: 16771479 markings, 68123940 edges, 258962 markings/sec, 50 secs
lola: 18091742 markings, 73848346 edges, 264053 markings/sec, 55 secs
lola: 19554495 markings, 79666776 edges, 292551 markings/sec, 60 secs
lola: 21106946 markings, 86003007 edges, 310490 markings/sec, 65 secs
lola: 22543965 markings, 92400522 edges, 287404 markings/sec, 70 secs
lola: 23912021 markings, 98611516 edges, 273611 markings/sec, 75 secs
lola: 25183941 markings, 104283050 edges, 254384 markings/sec, 80 secs
lola: 26446475 markings, 110063984 edges, 252507 markings/sec, 85 secs
lola: 27884076 markings, 116427855 edges, 287520 markings/sec, 90 secs
lola: 29441172 markings, 122166774 edges, 311419 markings/sec, 95 secs
lola: 30907197 markings, 128376683 edges, 293205 markings/sec, 100 secs
lola: 32272567 markings, 134524461 edges, 273074 markings/sec, 105 secs
lola: 33617375 markings, 140605183 edges, 268962 markings/sec, 110 secs
lola: 34916394 markings, 146501002 edges, 259804 markings/sec, 115 secs
lola: 36071999 markings, 151887831 edges, 231121 markings/sec, 120 secs
lola: 37366289 markings, 157800007 edges, 258858 markings/sec, 125 secs
lola: 38695240 markings, 163504338 edges, 265790 markings/sec, 130 secs
lola: 40015238 markings, 169764766 edges, 264000 markings/sec, 135 secs
lola: 41370742 markings, 174792271 edges, 271101 markings/sec, 140 secs
lola: 42720783 markings, 180232079 edges, 270008 markings/sec, 145 secs
lola: 44041726 markings, 186031581 edges, 264189 markings/sec, 150 secs
lola: 45207294 markings, 191368092 edges, 233114 markings/sec, 155 secs
lola: 46403407 markings, 196859572 edges, 239223 markings/sec, 160 secs
lola: 47675337 markings, 202699765 edges, 254386 markings/sec, 165 secs
lola: 48924175 markings, 208358115 edges, 249768 markings/sec, 170 secs
lola: 50048701 markings, 213748275 edges, 224905 markings/sec, 175 secs
lola: 51299655 markings, 219306209 edges, 250191 markings/sec, 180 secs
lola: 52420124 markings, 224668404 edges, 224094 markings/sec, 185 secs
lola: 53726774 markings, 230193751 edges, 261330 markings/sec, 190 secs
lola: 55123230 markings, 236844256 edges, 279291 markings/sec, 195 secs
lola: 56435549 markings, 242342666 edges, 262464 markings/sec, 200 secs
lola: 57797144 markings, 247611874 edges, 272319 markings/sec, 205 secs
lola: 59047246 markings, 252813914 edges, 250020 markings/sec, 210 secs
lola: 60249740 markings, 258220123 edges, 240499 markings/sec, 215 secs
lola: 61499579 markings, 263869576 edges, 249968 markings/sec, 220 secs
lola: 62677354 markings, 269252421 edges, 235555 markings/sec, 225 secs
lola: 63909643 markings, 274899498 edges, 246458 markings/sec, 230 secs
lola: 65054120 markings, 280350980 edges, 228895 markings/sec, 235 secs
lola: 66274767 markings, 285842968 edges, 244129 markings/sec, 240 secs
lola: 67376456 markings, 291133029 edges, 220338 markings/sec, 245 secs
lola: 68484896 markings, 296159726 edges, 221688 markings/sec, 250 secs
lola: 69635334 markings, 301488480 edges, 230088 markings/sec, 255 secs
lola: 70486728 markings, 305639710 edges, 170279 markings/sec, 260 secs
lola: 71353121 markings, 309651081 edges, 173279 markings/sec, 265 secs
lola: 72358396 markings, 313773115 edges, 201055 markings/sec, 270 secs
lola: 73499116 markings, 319200034 edges, 228144 markings/sec, 275 secs
lola: 74485946 markings, 324011036 edges, 197366 markings/sec, 280 secs
lola: 75341968 markings, 328145311 edges, 171204 markings/sec, 285 secs
lola: 76453616 markings, 331818599 edges, 222330 markings/sec, 290 secs
lola: 77520347 markings, 336303799 edges, 213346 markings/sec, 295 secs
lola: 78627592 markings, 340842750 edges, 221449 markings/sec, 300 secs
lola: 79757352 markings, 345790661 edges, 225952 markings/sec, 305 secs
lola: 80701180 markings, 350265055 edges, 188766 markings/sec, 310 secs
lola: 81794408 markings, 355278205 edges, 218646 markings/sec, 315 secs
lola: 82972973 markings, 360525106 edges, 235713 markings/sec, 320 secs
lola: 83914660 markings, 365058656 edges, 188337 markings/sec, 325 secs
lola: 84971322 markings, 369790337 edges, 211332 markings/sec, 330 secs
lola: 85913680 markings, 374361920 edges, 188472 markings/sec, 335 secs
lola: 87103415 markings, 379694061 edges, 237947 markings/sec, 340 secs
lola: 88220390 markings, 385000399 edges, 223395 markings/sec, 345 secs
lola: 89226162 markings, 389911604 edges, 201154 markings/sec, 350 secs
lola: 90307928 markings, 394704277 edges, 216353 markings/sec, 355 secs
lola: 91483007 markings, 400228648 edges, 235016 markings/sec, 360 secs
lola: 92589275 markings, 405608806 edges, 221254 markings/sec, 365 secs
lola: 93643844 markings, 410595898 edges, 210914 markings/sec, 370 secs
lola: 94911297 markings, 415889332 edges, 253491 markings/sec, 375 secs
lola: 96261096 markings, 422281660 edges, 269960 markings/sec, 380 secs
lola: 97549788 markings, 428580274 edges, 257738 markings/sec, 385 secs
lola: 98682107 markings, 434159915 edges, 226464 markings/sec, 390 secs
lola: 100186009 markings, 439463993 edges, 300780 markings/sec, 395 secs
lola: 101451507 markings, 444872713 edges, 253100 markings/sec, 400 secs
lola: 102864383 markings, 450738914 edges, 282575 markings/sec, 405 secs
lola: 104061467 markings, 456114076 edges, 239417 markings/sec, 410 secs
lola: 105314717 markings, 461767952 edges, 250650 markings/sec, 415 secs
lola: 106466440 markings, 467287221 edges, 230345 markings/sec, 420 secs
lola: 107677672 markings, 472958467 edges, 242246 markings/sec, 425 secs
lola: 109090656 markings, 479330888 edges, 282597 markings/sec, 430 secs
lola: 110246132 markings, 484782595 edges, 231095 markings/sec, 435 secs
lola: 111452832 markings, 490504778 edges, 241340 markings/sec, 440 secs
lola: 112483460 markings, 495110415 edges, 206126 markings/sec, 445 secs
lola: 113357764 markings, 499346520 edges, 174861 markings/sec, 450 secs
lola: 114344324 markings, 504115864 edges, 197312 markings/sec, 455 secs
lola: 115358985 markings, 508862468 edges, 202932 markings/sec, 460 secs
lola: 116484382 markings, 513833464 edges, 225079 markings/sec, 465 secs
lola: 117654669 markings, 519439954 edges, 234057 markings/sec, 470 secs
lola: 118773417 markings, 524920875 edges, 223750 markings/sec, 475 secs
lola: 119805381 markings, 529989620 edges, 206393 markings/sec, 480 secs
lola: 120967273 markings, 535239974 edges, 232378 markings/sec, 485 secs
lola: 122190079 markings, 540314906 edges, 244561 markings/sec, 490 secs
lola: 123423133 markings, 546305337 edges, 246611 markings/sec, 495 secs
lola: 124652383 markings, 552363753 edges, 245850 markings/sec, 500 secs
lola: 125736070 markings, 557607382 edges, 216737 markings/sec, 505 secs
lola: 126827530 markings, 562201985 edges, 218292 markings/sec, 510 secs
lola: 128263760 markings, 568185799 edges, 287246 markings/sec, 515 secs
lola: 129236097 markings, 571968413 edges, 194467 markings/sec, 520 secs
lola: 130537216 markings, 577342376 edges, 260224 markings/sec, 525 secs
lola: 131649671 markings, 582381515 edges, 222491 markings/sec, 530 secs
lola: 132769837 markings, 587442349 edges, 224033 markings/sec, 535 secs
lola: 133948726 markings, 592606352 edges, 235778 markings/sec, 540 secs
lola: 134950241 markings, 597361008 edges, 200303 markings/sec, 545 secs
lola: 135936950 markings, 602292538 edges, 197342 markings/sec, 550 secs
lola: 137066916 markings, 607551336 edges, 225993 markings/sec, 555 secs
lola: 138034225 markings, 612288451 edges, 193462 markings/sec, 560 secs
lola: 139146064 markings, 617484786 edges, 222368 markings/sec, 565 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no yes no no no no no yes no no no
lola:
preliminary result: unknown no yes no yes no no no no no yes no no no
lola: memory consumption: 3148 KB
lola: time consumption: 891 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-N0010P1"
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-N0010P1, 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-162038334500078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P1.tgz
mv ClientsAndServers-PT-N0010P1 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 ;