About the Execution of 2020-gold for ClientsAndServers-PT-N0020P3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16255.191 | 3600000.00 | 581548.00 | 4303.60 | FFFFTTFFFFFTFTF? | 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-162038334600098.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-N0020P3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-N0020P3-00
FORMULA_NAME ClientsAndServers-PT-N0020P3-01
FORMULA_NAME ClientsAndServers-PT-N0020P3-02
FORMULA_NAME ClientsAndServers-PT-N0020P3-03
FORMULA_NAME ClientsAndServers-PT-N0020P3-04
FORMULA_NAME ClientsAndServers-PT-N0020P3-05
FORMULA_NAME ClientsAndServers-PT-N0020P3-06
FORMULA_NAME ClientsAndServers-PT-N0020P3-07
FORMULA_NAME ClientsAndServers-PT-N0020P3-08
FORMULA_NAME ClientsAndServers-PT-N0020P3-09
FORMULA_NAME ClientsAndServers-PT-N0020P3-10
FORMULA_NAME ClientsAndServers-PT-N0020P3-11
FORMULA_NAME ClientsAndServers-PT-N0020P3-12
FORMULA_NAME ClientsAndServers-PT-N0020P3-13
FORMULA_NAME ClientsAndServers-PT-N0020P3-14
FORMULA_NAME ClientsAndServers-PT-N0020P3-15
=== Now, execution of the tool begins
BK_START 1620897608152
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:20:09] [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:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:20:09] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-13 09:20:09] [INFO ] Transformed 25 places.
[2021-05-13 09:20:09] [INFO ] Transformed 18 transitions.
[2021-05-13 09:20:09] [INFO ] Parsed PT model containing 25 places and 18 transitions in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100021 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=2439 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:20:09] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-13 09:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-13 09:20:09] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 09:20:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 09:20:09] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N0020P3-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:20:09] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:20:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 09:20:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0020P3 @ 3570 seconds
FORMULA ClientsAndServers-PT-N0020P3-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0020P3-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3007
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0020P3
{
"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:20:10 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 4,
"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": "((p24 <= 0) R (((p4 <= 0) OR (p21 <= 0)) AND (F ((p10 <= 0)) OR G (((p4 <= 0) OR (p21 <= 0))))))",
"processed_size": 98,
"rewrites": 61
},
"result":
{
"edges": 783,
"markings": 783,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"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 ((X (G (((p3 <= 0)))) AND F ((1 <= p9))))",
"processed_size": 43,
"rewrites": 61
},
"result":
{
"edges": 1217,
"markings": 1217,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 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": 61
},
"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": 356
},
"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 ((F ((p22 <= 0)) AND G (((1 <= p2)))))",
"processed_size": 40,
"rewrites": 61
},
"result":
{
"edges": 1217,
"markings": 1217,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((X (G (((1 <= p5) AND (1 <= p15)))) AND (1 <= p22))) AND X ((1 <= p16))))",
"processed_size": 80,
"rewrites": 61
},
"result":
{
"edges": 1217,
"markings": 1217,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((G (((1 <= p8) AND (1 <= p15))) AND (1 <= p12)) OR (X (((1 <= p2))) OR ((1 <= p2)))))",
"processed_size": 89,
"rewrites": 61
},
"result":
{
"edges": 1217,
"markings": 1217,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((1 <= p16))) OR G (((1 <= p5) AND (1 <= p15))))))",
"processed_size": 62,
"rewrites": 61
},
"result":
{
"edges": 1267,
"markings": 638,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (X (X (G ((p10 <= 0))))) AND ((p12 <= 0) AND (p10 <= 0)))))",
"processed_size": 68,
"rewrites": 61
},
"result":
{
"edges": 1235,
"markings": 1234,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p20 <= 0)",
"processed_size": 10,
"rewrites": 63
},
"result":
{
"edges": 1335289,
"markings": 1149273,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p5) AND (1 <= p15) AND (1 <= p16))))",
"processed_size": 49,
"rewrites": 61
},
"result":
{
"edges": 1219,
"markings": 1218,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p9 <= 0))",
"processed_size": 13,
"rewrites": 61
},
"result":
{
"edges": 900,
"markings": 900,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p0 <= 0) OR (p13 <= 0)))",
"processed_size": 30,
"rewrites": 61
},
"result":
{
"edges": 875,
"markings": 875,
"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":
{
"error": null,
"memory": 3224,
"runtime": 563.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(**)) AND (* R (* AND (F(*) OR G(*))))) : X((X(G(**)) AND F(**))) : G(**) : X(F(*)) : X((F(**) AND G(**))) : G((F((X(G(**)) AND **)) AND X(**))) : G(((G(**) AND *) OR (X(**) OR *))) : F(**) : G(**) : X(F((X(F(*)) OR G(**)))) : X(F((X(X(X(G(*)))) AND (* AND *)))) : F(G(**)) : G(F(((G((* AND (F(*) OR G(*)))) R *) AND **)))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no yes no no no no no yes no no unknown ",
"value": "no no no yes no no no no no yes no no unknown "
},
"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: LP says that atomic proposition is always true: (1 <= p14)
lola: (X (X (((1 <= p24) AND (1 <= p10)))) AND NOT(((1 <= p24) U (G ((1 <= p10)) U ((1 <= p4) AND (1 <= p21)))))) : (X (X (G (((p3 <= 0))))) AND X (F ((1 <= p9)))) : G ((p9 <= 0)) : NOT(G (X (G (((1 <= p2)))))) : X (((((1 <= p2)) U F ((p22 <= 0))) AND G (((1 <= p2))))) : G ((F ((G (X (((1 <= p5) AND (1 <= p15)))) AND (1 <= p22))) AND X ((1 <= p16)))) : NOT(F ((((NOT(G (((1 <= p8) AND (1 <= p15)))) OR (p12 <= 0)) AND NOT(X (((1 <= p2))))) AND ((p2 <= 0))))) : F ((1 <= p20)) : G (((p0 <= 0) OR (p13 <= 0))) : F (X (F ((NOT(G (X ((p16 <= 0)))) OR G (((1 <= p5) AND (1 <= p15))))))) : X (NOT(G (((X (X (X (F ((1 <= p10))))) OR (1 <= p12)) OR (1 <= p10))))) : F (G (((1 <= p5) AND (1 <= p15) AND (1 <= p16)))) : G (F ((NOT((F ((G (((1 <= p3))) U ((1 <= p0) AND (1 <= p13)))) U ((p3 <= 0)))) AND (1 <= p3))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p24) AND (1 <= p10)))) AND ((p24 <= 0) R (((p4 <= 0) OR (p21 <= 0)) AND (F ((p10 <= 0)) OR G (((p4 <= 0) OR (p21 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p24 <= 0) R (((p4 <= 0) OR (p21 <= 0)) AND (F ((p10 <= 0)) OR G (((p4 <= 0) OR (p21 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p24 <= 0) R (((p4 <= 0) OR (p21 <= 0)) AND (F ((p10 <= 0)) OR G (((p4 <= 0) OR (p21 <= 0))))))
lola: processed formula length: 98
lola: 61 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: 783 markings, 783 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p3 <= 0)))) AND F ((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p3 <= 0)))) AND F ((1 <= p9))))
lola: processed formula length: 43
lola: 61 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: 1217 markings, 1217 edges
lola: ========================================
lola: subprocess 2 will run for 324 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: 61 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 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p22 <= 0)) AND G (((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p22 <= 0)) AND G (((1 <= p2)))))
lola: processed formula length: 40
lola: 61 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: 1217 markings, 1217 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X (G (((1 <= p5) AND (1 <= p15)))) AND (1 <= p22))) AND X ((1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X (G (((1 <= p5) AND (1 <= p15)))) AND (1 <= p22))) AND X ((1 <= p16))))
lola: processed formula length: 80
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1217 markings, 1217 edges
lola: ========================================
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (((1 <= p8) AND (1 <= p15))) AND (1 <= p12)) OR (X (((1 <= p2))) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((1 <= p8) AND (1 <= p15))) AND (1 <= p12)) OR (X (((1 <= p2))) OR ((1 <= p2)))))
lola: processed formula length: 89
lola: 61 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: 1217 markings, 1217 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((1 <= p16))) OR G (((1 <= p5) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((1 <= p16))) OR G (((1 <= p5) AND (1 <= p15))))))
lola: processed formula length: 62
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 638 markings, 1267 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (X (G ((p10 <= 0))))) AND ((p12 <= 0) AND (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (X (G ((p10 <= 0))))) AND ((p12 <= 0) AND (p10 <= 0)))))
lola: processed formula length: 68
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1234 markings, 1235 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p20))
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: (p20 <= 0)
lola: processed formula length: 10
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1149273 markings, 1335289 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p5) AND (1 <= p15) AND (1 <= p16))))
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 <= p5) AND (1 <= p15) AND (1 <= p16))))
lola: processed formula length: 49
lola: 61 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: 1218 markings, 1219 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p9 <= 0))
lola: processed formula length: 13
lola: 61 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: 900 markings, 900 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p0 <= 0) OR (p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p0 <= 0) OR (p13 <= 0)))
lola: processed formula length: 30
lola: 61 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: 875 markings, 875 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G ((((p0 <= 0) OR (p13 <= 0)) AND (F (((p3 <= 0))) OR G (((p0 <= 0) OR (p13 <= 0)))))) R ((1 <= p3))) AND (1 <= p3))))
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)) AND (F (((p3 <= 0))) OR G (((p0 <= 0) OR (p13 <= 0)))))) R ((1 <= p3))) AND (1 <= p3))))
lola: processed formula length: 128
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 23 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: 3039493 markings, 7110574 edges, 607899 markings/sec, 0 secs
lola: 5714810 markings, 13901881 edges, 535063 markings/sec, 5 secs
lola: 8305516 markings, 20612343 edges, 518141 markings/sec, 10 secs
lola: 10855793 markings, 27284883 edges, 510055 markings/sec, 15 secs
lola: 13347970 markings, 33881827 edges, 498435 markings/sec, 20 secs
lola: 15805333 markings, 40435779 edges, 491473 markings/sec, 25 secs
lola: 18224016 markings, 46917654 edges, 483737 markings/sec, 30 secs
lola: 20640839 markings, 53406459 edges, 483365 markings/sec, 35 secs
lola: 23047088 markings, 59888379 edges, 481250 markings/sec, 40 secs
lola: 25410668 markings, 66304456 edges, 472716 markings/sec, 45 secs
lola: 27782784 markings, 72751667 edges, 474423 markings/sec, 50 secs
lola: 30130319 markings, 79117789 edges, 469507 markings/sec, 55 secs
lola: 32481792 markings, 85494332 edges, 470295 markings/sec, 60 secs
lola: 34819509 markings, 91861712 edges, 467543 markings/sec, 65 secs
lola: 37146972 markings, 98215374 edges, 465493 markings/sec, 70 secs
lola: 39487587 markings, 104603922 edges, 468123 markings/sec, 75 secs
lola: 41839219 markings, 110979810 edges, 470326 markings/sec, 80 secs
lola: 44186774 markings, 117380830 edges, 469511 markings/sec, 85 secs
lola: 46535244 markings, 123756581 edges, 469694 markings/sec, 90 secs
lola: 48891909 markings, 130149790 edges, 471333 markings/sec, 95 secs
lola: 51197266 markings, 136485932 edges, 461071 markings/sec, 100 secs
lola: 53533446 markings, 142827005 edges, 467236 markings/sec, 105 secs
lola: 55875568 markings, 149148835 edges, 468424 markings/sec, 110 secs
lola: 58188625 markings, 155477297 edges, 462611 markings/sec, 115 secs
lola: 60482944 markings, 161749883 edges, 458864 markings/sec, 120 secs
lola: 62813720 markings, 168110184 edges, 466155 markings/sec, 125 secs
lola: 65138088 markings, 174408258 edges, 464874 markings/sec, 130 secs
lola: 67459134 markings, 180771375 edges, 464209 markings/sec, 135 secs
lola: 69776298 markings, 187081784 edges, 463433 markings/sec, 140 secs
lola: 72127039 markings, 193437752 edges, 470148 markings/sec, 145 secs
lola: 74431608 markings, 199756390 edges, 460914 markings/sec, 150 secs
lola: 76751937 markings, 206065604 edges, 464066 markings/sec, 155 secs
lola: 79069746 markings, 212379768 edges, 463562 markings/sec, 160 secs
lola: 81388398 markings, 218712072 edges, 463730 markings/sec, 165 secs
lola: 83696798 markings, 224989069 edges, 461680 markings/sec, 170 secs
lola: 86024908 markings, 231310758 edges, 465622 markings/sec, 175 secs
lola: 88361324 markings, 237657842 edges, 467283 markings/sec, 180 secs
lola: 90685039 markings, 244011908 edges, 464743 markings/sec, 185 secs
lola: 93032861 markings, 250394459 edges, 469564 markings/sec, 190 secs
lola: 95355255 markings, 256756743 edges, 464479 markings/sec, 195 secs
lola: 97648968 markings, 263028867 edges, 458743 markings/sec, 200 secs
lola: 99996958 markings, 269364890 edges, 469598 markings/sec, 205 secs
lola: 102304832 markings, 275652791 edges, 461575 markings/sec, 210 secs
lola: 103738791 markings, 279613321 edges, 286792 markings/sec, 215 secs
lola: 103865412 markings, 279959297 edges, 25324 markings/sec, 220 secs
lola: 106045540 markings, 285867018 edges, 436026 markings/sec, 225 secs
lola: 108251965 markings, 291843788 edges, 441285 markings/sec, 230 secs
lola: 110433772 markings, 297810617 edges, 436361 markings/sec, 235 secs
lola: 112613671 markings, 303748005 edges, 435980 markings/sec, 240 secs
lola: 114797020 markings, 309708253 edges, 436670 markings/sec, 245 secs
lola: 116992663 markings, 315690066 edges, 439129 markings/sec, 250 secs
lola: 119182734 markings, 321627013 edges, 438014 markings/sec, 255 secs
lola: 121347187 markings, 327503811 edges, 432891 markings/sec, 260 secs
lola: 123513300 markings, 333413023 edges, 433223 markings/sec, 265 secs
lola: 125668715 markings, 339299100 edges, 431083 markings/sec, 270 secs
lola: 127841803 markings, 345210455 edges, 434618 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F (((G ((((p0 <= 0) OR (p13 <= 0)) AND (F (((p3 <= 0))) OR G (((p0 <= 0) OR (p13 <= 0)))))) R ((1 <= p3))) AND (1 <= p3))))
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)) AND (F (((p3 <= 0))) OR G (((p0 <= 0) OR (p13 <= 0)))))) R ((1 <= p3))) AND (1 <= p3))))
lola: processed formula length: 128
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 23 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: 2987904 markings, 6979493 edges, 597581 markings/sec, 0 secs
lola: 5626838 markings, 13674296 edges, 527787 markings/sec, 5 secs
lola: 8207808 markings, 20354799 edges, 516194 markings/sec, 10 secs
lola: 10740968 markings, 26994850 edges, 506632 markings/sec, 15 secs
lola: 13236733 markings, 33585986 edges, 499153 markings/sec, 20 secs
lola: 15682466 markings, 40103974 edges, 489147 markings/sec, 25 secs
lola: 18111191 markings, 46612148 edges, 485745 markings/sec, 30 secs
lola: 20525522 markings, 53112224 edges, 482866 markings/sec, 35 secs
lola: 22944227 markings, 59613259 edges, 483741 markings/sec, 40 secs
lola: 25310615 markings, 66033039 edges, 473278 markings/sec, 45 secs
lola: 27664542 markings, 72433373 edges, 470785 markings/sec, 50 secs
lola: 30010974 markings, 78790460 edges, 469286 markings/sec, 55 secs
lola: 32358536 markings, 85157214 edges, 469512 markings/sec, 60 secs
lola: 34692116 markings, 91526798 edges, 466716 markings/sec, 65 secs
lola: 37044196 markings, 97944401 edges, 470416 markings/sec, 70 secs
lola: 39392088 markings, 104348165 edges, 469578 markings/sec, 75 secs
lola: 41751872 markings, 110740868 edges, 471957 markings/sec, 80 secs
lola: 44086630 markings, 117094645 edges, 466952 markings/sec, 85 secs
lola: 46411958 markings, 123426466 edges, 465066 markings/sec, 90 secs
lola: 48755438 markings, 129776427 edges, 468696 markings/sec, 95 secs
lola: 51069800 markings, 136144996 edges, 462872 markings/sec, 100 secs
lola: 53396878 markings, 142458267 edges, 465416 markings/sec, 105 secs
lola: 55750407 markings, 148807422 edges, 470706 markings/sec, 110 secs
lola: 58123773 markings, 155303877 edges, 474673 markings/sec, 115 secs
lola: 60457794 markings, 161681494 edges, 466804 markings/sec, 120 secs
lola: 62793187 markings, 168055096 edges, 467079 markings/sec, 125 secs
lola: 65134518 markings, 174398687 edges, 468266 markings/sec, 130 secs
lola: 67452759 markings, 180754278 edges, 463648 markings/sec, 135 secs
lola: 69794302 markings, 187130158 edges, 468309 markings/sec, 140 secs
lola: 72179236 markings, 193576975 edges, 476987 markings/sec, 145 secs
lola: 74518644 markings, 199985795 edges, 467882 markings/sec, 150 secs
lola: 76869644 markings, 206383140 edges, 470200 markings/sec, 155 secs
lola: 79213225 markings, 212775752 edges, 468716 markings/sec, 160 secs
lola: 81547825 markings, 219145511 edges, 466920 markings/sec, 165 secs
lola: 83888839 markings, 225510133 edges, 468203 markings/sec, 170 secs
lola: 86230930 markings, 231859106 edges, 468418 markings/sec, 175 secs
lola: 88568149 markings, 238218899 edges, 467444 markings/sec, 180 secs
lola: 90889556 markings, 244549782 edges, 464281 markings/sec, 185 secs
lola: 93214619 markings, 250894473 edges, 465013 markings/sec, 190 secs
lola: 95531361 markings, 257244638 edges, 463348 markings/sec, 195 secs
lola: 97837636 markings, 263547972 edges, 461255 markings/sec, 200 secs
lola: 100194155 markings, 269895253 edges, 471304 markings/sec, 205 secs
lola: 102513355 markings, 276225072 edges, 463840 markings/sec, 210 secs
lola: 104756652 markings, 282353605 edges, 448659 markings/sec, 215 secs
lola: 106953374 markings, 288337024 edges, 439344 markings/sec, 220 secs
lola: 109132503 markings, 294239991 edges, 435826 markings/sec, 225 secs
lola: 111301215 markings, 300172535 edges, 433742 markings/sec, 230 secs
lola: 113490872 markings, 306126418 edges, 437931 markings/sec, 235 secs
lola: 115660211 markings, 312075462 edges, 433868 markings/sec, 240 secs
lola: 117838561 markings, 317992083 edges, 435670 markings/sec, 245 secs
lola: 119994069 markings, 323866415 edges, 431102 markings/sec, 250 secs
lola: 122147354 markings, 329722063 edges, 430657 markings/sec, 255 secs
lola: 124291331 markings, 335524068 edges, 428795 markings/sec, 260 secs
lola: 126431536 markings, 341357990 edges, 428041 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no yes no no unknown
lola:
preliminary result: no no no yes no no no no no yes no no unknown
lola: memory consumption: 3224 KB
lola: time consumption: 563 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-N0020P3"
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-N0020P3, 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-162038334600098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P3.tgz
mv ClientsAndServers-PT-N0020P3 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 ;