About the Execution of 2019-Gold for MAPK-PT-05120
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.170 | 1193769.00 | 1170248.00 | 3098.00 | FF?FTFF??TTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r120-csrt-158961292400019.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 win2019
Input is MAPK-PT-05120, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400019
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.9K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K Mar 24 05:37 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 MAPK-PT-05120-00
FORMULA_NAME MAPK-PT-05120-01
FORMULA_NAME MAPK-PT-05120-02
FORMULA_NAME MAPK-PT-05120-03
FORMULA_NAME MAPK-PT-05120-04
FORMULA_NAME MAPK-PT-05120-05
FORMULA_NAME MAPK-PT-05120-06
FORMULA_NAME MAPK-PT-05120-07
FORMULA_NAME MAPK-PT-05120-08
FORMULA_NAME MAPK-PT-05120-09
FORMULA_NAME MAPK-PT-05120-10
FORMULA_NAME MAPK-PT-05120-11
FORMULA_NAME MAPK-PT-05120-12
FORMULA_NAME MAPK-PT-05120-13
FORMULA_NAME MAPK-PT-05120-14
FORMULA_NAME MAPK-PT-05120-15
=== Now, execution of the tool begins
BK_START 1590336261061
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-05120 @ 3570 seconds
FORMULA MAPK-PT-05120-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2377
rslt: Output for LTLCardinality @ MAPK-PT-05120
{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 24 16:04:21 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((X (TRUE) OR F ((1 <= RafP)))))",
"processed_size": 37,
"rewrites": 105
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (F (((MEKP_Phase2 <= MEKPP_Phase2) AND (ERKP_MEKPP <= Raf_RasGTP)))))",
"processed_size": 74,
"rewrites": 105
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 308
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 308
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "A (G (F ((ERKPP_Phase3 + 1 <= MEKP_RafP))))",
"processed_size": 43,
"rewrites": 105
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 339
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(ERKPP_Phase3 <= Raf_RasGTP)",
"processed_size": 28,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((G ((ERK_MEKPP + 1 <= ERKPP_Phase3)) OR X (F ((ERKPP_Phase3 <= Raf_RasGTP)))))",
"processed_size": 81,
"rewrites": 105
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"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": "(3 <= RafP)",
"processed_size": 11,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"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": "(Phase1 <= 0)",
"processed_size": 13,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 565
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((ERKP <= 2) OR (Phase1 + 1 <= MEK_RafP))",
"processed_size": 42,
"rewrites": 107
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 796
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "A (((3 <= Raf_RasGTP) OR G ((ERK_MEKPP + 1 <= MEKPP_Phase2))))",
"processed_size": 62,
"rewrites": 105
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1062
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1062
},
"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": "(3 <= Raf)",
"processed_size": 10,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1484
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1484
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G (((MEKP <= 0) AND (ERKP_MEKPP <= 1)))))",
"processed_size": 47,
"rewrites": 105
},
"result":
{
"edges": 16653,
"markings": 11527,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2968
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2968
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(MEK <= Raf)",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= Raf)",
"processed_size": 10,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(MEK <= Raf)",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "A ((((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G ((F ((1 <= MEKPP_Phase2)) AND ((3 <= Phase2) OR (1 <= MEKPP_Phase2))))))) U (1 <= MEKPP_Phase2)))",
"processed_size": 141,
"rewrites": 105
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22928,
"runtime": 1193.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(X(X(F(**))))) AND (A(G(F(*))) AND A(G((** OR X(*)))))) : (A(G((** OR F(**)))) AND A(F(G((* AND *))))) : A(G(F(*))) : FALSE : A(X((X(TRUE) OR F(**)))) : A((** OR G(*))) : A(F(**)) : (** AND A(F(G(*)))) : A((X(**) R (* OR (* R *)))) : A(X(F(**))) : A(F(**)) : TRUE : A(X(TRUE)) : (** AND A(((** U (G(**) OR F(G((F(**) AND (** OR **)))))) U **))) : A(F(*)) : (** AND A((G(*) OR X(F(**)))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no unknown no yes no no unknown unknown yes yes yes yes no yes yes ",
"value": "no no unknown no yes no no unknown unknown yes yes yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 LTLCardinality.xml
lola: A ((X (F (X (((MEKP_RafP <= ERKPP_Phase3) U X ((MEKP_RafP <= ERKPP_Phase3)))))) AND G (((ERKP + 1 <= MEKPP) U NOT(X ((MEKP_RafP <= ERKPP_Phase3))))))) : A ((G (((ERKP_MEKPP <= ERK) OR F ((RafP <= MEK)))) AND NOT(G ((F ((1 <= MEKP)) OR F ((2 <= ERKP_MEKPP))))))) : A (NOT(F (G ((Raf <= Phase2))))) : A (F (G (X (((Phase2 + 1 <= 0) AND NOT((F (((MEKP_Phase2 <= Phase3))) U (MEKP_Phase2 <= Phase3)))))))) : A (X ((X ((F ((0 <= Raf)) OR G (((3 <= Phase1) AND (MEK_RafP <= RafP_Phase1))))) OR (F ((0 <= Raf)) AND F ((1 <= RafP)))))) : A (((3 <= Raf_RasGTP) OR NOT(F ((MEKPP_Phase2 <= ERK_MEKPP))))) : A (F (((3 <= ERKP) AND (MEK_RafP <= Phase1)))) : A (((3 <= Raf) AND G (NOT(G (NOT(X ((((0 <= ERK_MEKPP) U G ((0 <= ERK_MEKPP))) U NOT(F ((2 <= MEKPP))))))))))) : A (NOT((NOT(X (((ERK_MEKPP + 1 <= 0) U (2 <= ERKPP_Phase3)))) U ((2 <= ERKPP_Phase3) AND ((1 <= MEK_RafP) U (MEKP_RafP <= ERK)))))) : A (X ((F (((MEKP_Phase2 <= MEKPP_Phase2) AND (ERKP_MEKPP <= Raf_RasGTP))) OR X (X (X (G (X ((MEKP_RafP + 1 <= 0))))))))) : A (F (((F ((1 <= Phase2)) U ((RafP_Phase1 <= 0) AND (Phase1 <= 0) AND (Raf_RasGTP + 1 <= RafP_Phase1))) U ((3 <= Phase2) U (1 <= Phase1))))) : A (G ((F (G ((MEKPP <= ERKPP_Phase3))) OR G ((0 <= ERKP_MEKPP))))) : A (X (G (X ((0 <= Raf))))) : A (((MEK <= Raf) AND (((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G (((3 <= Phase2) U (1 <= MEKPP_Phase2)))))) U (1 <= MEKPP_Phase2)))) : A (NOT(G ((3 <= RafP)))) : A (((ERKPP_Phase3 <= Raf_RasGTP) AND (NOT(F ((ERKPP_Phase3 <= ERK_MEKPP))) OR F (((0 <= MEKP_RafP) U X (((ERKPP <= MEK) U (ERKPP_Phase3 <= Raf_RasGTP))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:519
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (TRUE) OR F ((1 <= RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (TRUE) OR F ((1 <= RafP)))))
lola: processed formula length: 37
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= ERKPP_Phase3)) R ((ERKPP_Phase3 <= 1) OR ((MEK_RafP <= 0) R (ERK + 1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= ERKPP_Phase3)) R ((ERKPP_Phase3 <= 1) OR ((MEK_RafP <= 0) R (ERK + 1 <= MEKP_RafP)))))
lola: processed formula length: 99
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 2207842 markings, 5517193 edges, 441568 markings/sec, 0 secs
lola: 4343872 markings, 10856142 edges, 427206 markings/sec, 5 secs
lola: 6241949 markings, 15600149 edges, 379615 markings/sec, 10 secs
lola: 8278222 markings, 20685492 edges, 407255 markings/sec, 15 secs
lola: 10285407 markings, 25702545 edges, 401437 markings/sec, 20 secs
lola: 12114000 markings, 30272788 edges, 365719 markings/sec, 25 secs
lola: 14055314 markings, 35121254 edges, 388263 markings/sec, 30 secs
lola: 15950100 markings, 39856556 edges, 378957 markings/sec, 35 secs
lola: 17756157 markings, 44370878 edges, 361211 markings/sec, 40 secs
lola: 19533107 markings, 48813352 edges, 355390 markings/sec, 45 secs
lola: 21561593 markings, 53878456 edges, 405697 markings/sec, 50 secs
lola: 23523908 markings, 58783001 edges, 392463 markings/sec, 55 secs
lola: 25448743 markings, 63595160 edges, 384967 markings/sec, 60 secs
lola: 27989874 markings, 69941810 edges, 508226 markings/sec, 65 secs
lola: 30835214 markings, 77053127 edges, 569068 markings/sec, 70 secs
lola: 33517490 markings, 83758208 edges, 536455 markings/sec, 75 secs
lola: 36428359 markings, 91035002 edges, 582174 markings/sec, 80 secs
lola: 39038598 markings, 97559652 edges, 522048 markings/sec, 85 secs
lola: 41753080 markings, 104338707 edges, 542896 markings/sec, 90 secs
lola: 44231267 markings, 110533098 edges, 495637 markings/sec, 95 secs
lola: 46668863 markings, 116625225 edges, 487519 markings/sec, 100 secs
lola: 49065702 markings, 122616643 edges, 479368 markings/sec, 105 secs
lola: 51758068 markings, 129346682 edges, 538473 markings/sec, 110 secs
lola: 54558694 markings, 136348595 edges, 560125 markings/sec, 115 secs
lola: 57299664 markings, 143192578 edges, 548194 markings/sec, 120 secs
lola: 59852675 markings, 149573504 edges, 510602 markings/sec, 125 secs
lola: 62339988 markings, 155790740 edges, 497463 markings/sec, 130 secs
lola: 64788919 markings, 161911859 edges, 489786 markings/sec, 135 secs
lola: 67269947 markings, 168113508 edges, 496206 markings/sec, 140 secs
lola: 69613557 markings, 173972361 edges, 468722 markings/sec, 145 secs
lola: 71776261 markings, 179378439 edges, 432541 markings/sec, 150 secs
lola: 73981767 markings, 184891314 edges, 441101 markings/sec, 155 secs
lola: 76131483 markings, 190264984 edges, 429943 markings/sec, 160 secs
lola: 77736088 markings, 194276236 edges, 320921 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((MEKP_Phase2 <= MEKPP_Phase2) AND (ERKP_MEKPP <= Raf_RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((MEKP_Phase2 <= MEKPP_Phase2) AND (ERKP_MEKPP <= Raf_RasGTP)))))
lola: processed formula length: 74
lola: 105 rewrites
lola: closed formula file LTLCardinality.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 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (X (F ((MEKP_RafP <= ERKPP_Phase3)))))) AND (A (G (F ((ERKPP_Phase3 + 1 <= MEKP_RafP)))) AND A (G (((ERKP + 1 <= MEKPP) OR X ((ERKPP_Phase3 + 1 <= MEKP_RafP)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((ERKPP_Phase3 + 1 <= MEKP_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ERKPP_Phase3 + 1 <= MEKP_RafP))))
lola: processed formula length: 43
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 1281 markings, 1281 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKPP_Phase3 <= Raf_RasGTP) AND A ((G ((ERK_MEKPP + 1 <= ERKPP_Phase3)) OR X (F ((ERKPP_Phase3 <= Raf_RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ERKPP_Phase3 <= Raf_RasGTP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP_Phase3 <= Raf_RasGTP)
lola: processed formula length: 28
lola: 105 rewrites
lola: closed formula file LTLCardinality.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 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((ERK_MEKPP + 1 <= ERKPP_Phase3)) OR X (F ((ERKPP_Phase3 <= Raf_RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((ERK_MEKPP + 1 <= ERKPP_Phase3)) OR X (F ((ERKPP_Phase3 <= Raf_RasGTP)))))
lola: processed formula length: 81
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((RafP <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= RafP)
lola: processed formula length: 11
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Phase1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Phase1 <= 0)
lola: processed formula length: 13
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= ERKP) AND (MEK_RafP <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((ERKP <= 2) OR (Phase1 + 1 <= MEK_RafP))
lola: processed formula length: 42
lola: 107 rewrites
lola: closed formula file LTLCardinality.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: 1281 markings, 1281 edges
lola: ========================================
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Phase2 + 1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Phase2 + 1 <= Raf))))
lola: processed formula length: 31
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 2808385 markings, 5562295 edges, 561677 markings/sec, 0 secs
lola: 5413758 markings, 10750648 edges, 521075 markings/sec, 5 secs
lola: 7919492 markings, 15765560 edges, 501147 markings/sec, 10 secs
lola: 10414787 markings, 20773456 edges, 499059 markings/sec, 15 secs
lola: 12809755 markings, 25575676 edges, 478994 markings/sec, 20 secs
lola: 15053622 markings, 30105385 edges, 448773 markings/sec, 25 secs
lola: 17266597 markings, 34576507 edges, 442595 markings/sec, 30 secs
lola: 19525842 markings, 39114840 edges, 451849 markings/sec, 35 secs
lola: 21761460 markings, 43595988 edges, 447124 markings/sec, 40 secs
lola: 23920643 markings, 47961616 edges, 431837 markings/sec, 45 secs
lola: 26075519 markings, 52333383 edges, 430975 markings/sec, 50 secs
lola: 28218140 markings, 56685076 edges, 428524 markings/sec, 55 secs
lola: 30366507 markings, 61022861 edges, 429673 markings/sec, 60 secs
lola: 32502963 markings, 65358729 edges, 427291 markings/sec, 65 secs
lola: 34637322 markings, 69671414 edges, 426872 markings/sec, 70 secs
lola: 36756269 markings, 73965494 edges, 423789 markings/sec, 75 secs
lola: 38881859 markings, 78260279 edges, 425118 markings/sec, 80 secs
lola: 41111891 markings, 82767339 edges, 446006 markings/sec, 85 secs
lola: 43233758 markings, 87066601 edges, 424373 markings/sec, 90 secs
lola: 45343028 markings, 91355295 edges, 421854 markings/sec, 95 secs
lola: 47420337 markings, 95615925 edges, 415462 markings/sec, 100 secs
lola: 49661455 markings, 100173902 edges, 448224 markings/sec, 105 secs
lola: 51861173 markings, 104665836 edges, 439944 markings/sec, 110 secs
lola: 54135680 markings, 109267960 edges, 454901 markings/sec, 115 secs
lola: 56401358 markings, 113876614 edges, 453136 markings/sec, 120 secs
lola: 58660691 markings, 118450162 edges, 451867 markings/sec, 125 secs
lola: 60845739 markings, 122905880 edges, 437010 markings/sec, 130 secs
lola: 63064458 markings, 127415219 edges, 443744 markings/sec, 135 secs
lola: 65244093 markings, 131857297 edges, 435927 markings/sec, 140 secs
lola: 67389432 markings, 136250580 edges, 429068 markings/sec, 145 secs
lola: 69530202 markings, 140629464 edges, 428154 markings/sec, 150 secs
lola: 71575104 markings, 144797262 edges, 408980 markings/sec, 155 secs
lola: 73605469 markings, 148925080 edges, 406073 markings/sec, 160 secs
lola: 75613766 markings, 153022135 edges, 401659 markings/sec, 165 secs
lola: 77627409 markings, 157171031 edges, 402729 markings/sec, 170 secs
lola: 79634016 markings, 161273140 edges, 401321 markings/sec, 175 secs
lola: 81635430 markings, 165372833 edges, 400283 markings/sec, 180 secs
lola: 83718757 markings, 169593382 edges, 416665 markings/sec, 185 secs
lola: 85785693 markings, 173812349 edges, 413387 markings/sec, 190 secs
lola: 87806387 markings, 177914308 edges, 404139 markings/sec, 195 secs
lola: 89798791 markings, 181993512 edges, 398481 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Raf_RasGTP) OR G ((ERK_MEKPP + 1 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= Raf_RasGTP) OR G ((ERK_MEKPP + 1 <= MEKPP_Phase2))))
lola: processed formula length: 62
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1281 markings, 1281 edges
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Raf) AND A (F (G ((MEKPP <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Raf)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Raf)
lola: processed formula length: 10
lola: 105 rewrites
lola: closed formula file LTLCardinality.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 14 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((MEKPP <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((MEKPP <= 1))))
lola: processed formula length: 24
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 3024081 markings, 6693953 edges, 604816 markings/sec, 0 secs
lola: 6020745 markings, 13352055 edges, 599333 markings/sec, 5 secs
lola: 8730102 markings, 19371494 edges, 541871 markings/sec, 10 secs
lola: 11348737 markings, 25190684 edges, 523727 markings/sec, 15 secs
lola: 13918098 markings, 30899435 edges, 513872 markings/sec, 20 secs
lola: 16709607 markings, 37102422 edges, 558302 markings/sec, 25 secs
lola: 19571849 markings, 43462373 edges, 572448 markings/sec, 30 secs
lola: 22409781 markings, 49768781 edges, 567586 markings/sec, 35 secs
lola: 25222523 markings, 56018843 edges, 562548 markings/sec, 40 secs
lola: 28016916 markings, 62227605 edges, 558879 markings/sec, 45 secs
lola: 30774043 markings, 68354003 edges, 551425 markings/sec, 50 secs
lola: 33527168 markings, 74471495 edges, 550625 markings/sec, 55 secs
lola: 36276658 markings, 80582027 edges, 549898 markings/sec, 60 secs
lola: 39150568 markings, 86966355 edges, 574782 markings/sec, 65 secs
lola: 41937417 markings, 93159488 edges, 557370 markings/sec, 70 secs
lola: 44754565 markings, 99419126 edges, 563430 markings/sec, 75 secs
lola: 47536878 markings, 105603370 edges, 556463 markings/sec, 80 secs
lola: 50282463 markings, 111703116 edges, 549117 markings/sec, 85 secs
lola: 53137083 markings, 118046445 edges, 570924 markings/sec, 90 secs
lola: 55928490 markings, 124248344 edges, 558281 markings/sec, 95 secs
lola: 58738131 markings, 130493270 edges, 561928 markings/sec, 100 secs
lola: 61586799 markings, 136821833 edges, 569734 markings/sec, 105 secs
lola: 64404927 markings, 143085392 edges, 563626 markings/sec, 110 secs
lola: 67337747 markings, 149590807 edges, 586564 markings/sec, 115 secs
lola: 70216915 markings, 155987228 edges, 575834 markings/sec, 120 secs
lola: 72832510 markings, 161798831 edges, 523119 markings/sec, 125 secs
lola: 75413982 markings, 167534396 edges, 516294 markings/sec, 130 secs
lola: 78007033 markings, 173295674 edges, 518610 markings/sec, 135 secs
lola: 80768478 markings, 179431344 edges, 552289 markings/sec, 140 secs
lola: 83634608 markings, 185800146 edges, 573226 markings/sec, 145 secs
lola: 86447763 markings, 192051053 edges, 562631 markings/sec, 150 secs
lola: 89223639 markings, 198219359 edges, 555175 markings/sec, 155 secs
lola: 92004138 markings, 204398362 edges, 556100 markings/sec, 160 secs
lola: 94775686 markings, 210556420 edges, 554310 markings/sec, 165 secs
lola: 97532182 markings, 216681938 edges, 551299 markings/sec, 170 secs
lola: 100246020 markings, 222712136 edges, 542768 markings/sec, 175 secs
lola: 101562257 markings, 225637307 edges, 263247 markings/sec, 180 secs
lola: 101917552 markings, 226426914 edges, 71059 markings/sec, 185 secs
lola: 101919636 markings, 226431082 edges, 417 markings/sec, 190 secs
lola: 101920880 markings, 226433570 edges, 249 markings/sec, 195 secs
lola: 101920953 markings, 226433718 edges, 15 markings/sec, 200 secs
lola: 101921937 markings, 226435686 edges, 197 markings/sec, 205 secs
lola: 101922092 markings, 226435994 edges, 31 markings/sec, 210 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: subprocess 14 will run for 1484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((ERKP_MEKPP <= ERK) OR F ((RafP <= MEK))))) AND A (F (G (((MEKP <= 0) AND (ERKP_MEKPP <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((MEKP <= 0) AND (ERKP_MEKPP <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((MEKP <= 0) AND (ERKP_MEKPP <= 1)))))
lola: processed formula length: 47
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 11527 markings, 16653 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MEK <= Raf) AND A ((((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G ((F ((1 <= MEKPP_Phase2)) AND ((3 <= Phase2) OR (1 <= MEKPP_Phase2))))))) U (1 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MEK <= Raf)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEK <= Raf)
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 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: ========================================
lola: ...considering subproblem: A ((X ((2 <= ERKPP_Phase3)) R ((ERKPP_Phase3 <= 1) OR ((MEK_RafP <= 0) R (ERK + 1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= ERKPP_Phase3)) R ((ERKPP_Phase3 <= 1) OR ((MEK_RafP <= 0) R (ERK + 1 <= MEKP_RafP)))))
lola: processed formula length: 99
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 2201998 markings, 5502650 edges, 440400 markings/sec, 0 secs
lola: 4265665 markings, 10660341 edges, 412733 markings/sec, 5 secs
lola: 6288408 markings, 15716423 edges, 404549 markings/sec, 10 secs
lola: 8418479 markings, 21036176 edges, 426014 markings/sec, 15 secs
lola: 10379725 markings, 25938532 edges, 392249 markings/sec, 20 secs
lola: 12311943 markings, 30768446 edges, 386444 markings/sec, 25 secs
lola: 14369584 markings, 35906572 edges, 411528 markings/sec, 30 secs
lola: 16318866 markings, 40778783 edges, 389856 markings/sec, 35 secs
lola: 18229834 markings, 45555653 edges, 382194 markings/sec, 40 secs
lola: 20200550 markings, 50477108 edges, 394143 markings/sec, 45 secs
lola: 22196643 markings, 55465895 edges, 399219 markings/sec, 50 secs
lola: 24148428 markings, 60344748 edges, 390357 markings/sec, 55 secs
lola: 26077065 markings, 65164604 edges, 385727 markings/sec, 60 secs
lola: 28977312 markings, 72409939 edges, 580049 markings/sec, 65 secs
lola: 31845972 markings, 79579709 edges, 573732 markings/sec, 70 secs
lola: 34705871 markings, 86728799 edges, 571980 markings/sec, 75 secs
lola: 37587943 markings, 93933753 edges, 576414 markings/sec, 80 secs
lola: 40479684 markings, 101162316 edges, 578348 markings/sec, 85 secs
lola: 43127085 markings, 107772784 edges, 529480 markings/sec, 90 secs
lola: 45691097 markings, 114181428 edges, 512802 markings/sec, 95 secs
lola: 48187677 markings, 120421727 edges, 499316 markings/sec, 100 secs
lola: 50699106 markings, 126700746 edges, 502286 markings/sec, 105 secs
lola: 53130230 markings, 132776419 edges, 486225 markings/sec, 110 secs
lola: 55652591 markings, 139081837 edges, 504472 markings/sec, 115 secs
lola: 58019784 markings, 144992573 edges, 473439 markings/sec, 120 secs
lola: 60336331 markings, 150782109 edges, 463309 markings/sec, 125 secs
lola: 62797337 markings, 156934158 edges, 492201 markings/sec, 130 secs
lola: 65132726 markings, 162771537 edges, 467078 markings/sec, 135 secs
lola: 67370879 markings, 168366378 edges, 447631 markings/sec, 140 secs
lola: 69551942 markings, 173817583 edges, 436213 markings/sec, 145 secs
lola: 71704753 markings, 179199186 edges, 430562 markings/sec, 150 secs
lola: 73933620 markings, 184771514 edges, 445773 markings/sec, 155 secs
lola: 76107199 markings, 190205018 edges, 434716 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((Phase2 + 1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Phase2 + 1 <= Raf))))
lola: processed formula length: 31
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 2661436 markings, 5272554 edges, 532287 markings/sec, 0 secs
lola: 5348652 markings, 10622403 edges, 537443 markings/sec, 5 secs
lola: 7923740 markings, 15775041 edges, 515018 markings/sec, 10 secs
lola: 10468427 markings, 20881202 edges, 508937 markings/sec, 15 secs
lola: 12989469 markings, 25941183 edges, 504208 markings/sec, 20 secs
lola: 15214190 markings, 30432535 edges, 444944 markings/sec, 25 secs
lola: 17423815 markings, 34889838 edges, 441925 markings/sec, 30 secs
lola: 19705473 markings, 39476161 edges, 456332 markings/sec, 35 secs
lola: 22109428 markings, 44303688 edges, 480791 markings/sec, 40 secs
lola: 24419715 markings, 48976646 edges, 462057 markings/sec, 45 secs
lola: 26701833 markings, 53608337 edges, 456424 markings/sec, 50 secs
lola: 28985925 markings, 58245221 edges, 456818 markings/sec, 55 secs
lola: 31297842 markings, 62911109 edges, 462383 markings/sec, 60 secs
lola: 33445254 markings, 67261626 edges, 429482 markings/sec, 65 secs
lola: 35571620 markings, 71554587 edges, 425273 markings/sec, 70 secs
lola: 37662111 markings, 75804722 edges, 418098 markings/sec, 75 secs
lola: 39830154 markings, 80188927 edges, 433609 markings/sec, 80 secs
lola: 42087676 markings, 84733783 edges, 451504 markings/sec, 85 secs
lola: 44188426 markings, 89004396 edges, 420150 markings/sec, 90 secs
lola: 46266326 markings, 93245823 edges, 415580 markings/sec, 95 secs
lola: 48368696 markings, 97549956 edges, 420474 markings/sec, 100 secs
lola: 50598383 markings, 102074012 edges, 445937 markings/sec, 105 secs
lola: 52810718 markings, 106578240 edges, 442467 markings/sec, 110 secs
lola: 55047459 markings, 111122042 edges, 447348 markings/sec, 115 secs
lola: 57283837 markings, 115663141 edges, 447276 markings/sec, 120 secs
lola: 59483664 markings, 120128050 edges, 439965 markings/sec, 125 secs
lola: 61648435 markings, 124536697 edges, 432954 markings/sec, 130 secs
lola: 63827758 markings, 128965019 edges, 435865 markings/sec, 135 secs
lola: 65986819 markings, 133374519 edges, 431812 markings/sec, 140 secs
lola: 68148550 markings, 137798275 edges, 432346 markings/sec, 145 secs
lola: 70314743 markings, 142219093 edges, 433239 markings/sec, 150 secs
lola: 72411572 markings, 146492383 edges, 419366 markings/sec, 155 secs
lola: 74434287 markings, 150619127 edges, 404543 markings/sec, 160 secs
lola: 76433140 markings, 154697092 edges, 399771 markings/sec, 165 secs
lola: 78493685 markings, 158942670 edges, 412109 markings/sec, 170 secs
lola: 80627877 markings, 163319009 edges, 426838 markings/sec, 175 secs
lola: 82840440 markings, 167826376 edges, 442513 markings/sec, 180 secs
lola: 85037816 markings, 172292351 edges, 439475 markings/sec, 185 secs
lola: 87261832 markings, 176813584 edges, 444803 markings/sec, 190 secs
lola: 89438900 markings, 181259656 edges, 435414 markings/sec, 195 secs
lola: 91060537 markings, 184575140 edges, 324327 markings/sec, 200 secs
lola: 91060735 markings, 184575527 edges, 40 markings/sec, 205 secs
lola: 91073823 markings, 184600804 edges, 2618 markings/sec, 210 secs
lola: 91083341 markings, 184619462 edges, 1904 markings/sec, 215 secs
lola: 91118382 markings, 184692234 edges, 7008 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((3 <= Raf) AND A (F (G ((MEKPP <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= Raf)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Raf)
lola: processed formula length: 10
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: ========================================
lola: ...considering subproblem: A (F (G ((MEKPP <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((MEKPP <= 1))))
lola: processed formula length: 24
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: 3054835 markings, 6762426 edges, 610967 markings/sec, 0 secs
lola: 6039675 markings, 13393907 edges, 596968 markings/sec, 5 secs
lola: 9008337 markings, 19989771 edges, 593732 markings/sec, 10 secs
lola: 11930928 markings, 26484213 edges, 584518 markings/sec, 15 secs
lola: 14811126 markings, 32883521 edges, 576040 markings/sec, 20 secs
lola: 17720806 markings, 39349011 edges, 581936 markings/sec, 25 secs
lola: 20607197 markings, 45762384 edges, 577278 markings/sec, 30 secs
lola: 23467863 markings, 52119763 edges, 572133 markings/sec, 35 secs
lola: 26356271 markings, 58537266 edges, 577682 markings/sec, 40 secs
lola: 29148096 markings, 64740900 edges, 558365 markings/sec, 45 secs
lola: 31970733 markings, 71013730 edges, 564527 markings/sec, 50 secs
lola: 34758969 markings, 77209443 edges, 557647 markings/sec, 55 secs
lola: 37604910 markings, 83532173 edges, 569188 markings/sec, 60 secs
lola: 40446805 markings, 89847932 edges, 568379 markings/sec, 65 secs
lola: 43273180 markings, 96128452 edges, 565275 markings/sec, 70 secs
lola: 46077115 markings, 102358819 edges, 560787 markings/sec, 75 secs
lola: 48868130 markings, 108560173 edges, 558203 markings/sec, 80 secs
lola: 51626674 markings, 114691437 edges, 551709 markings/sec, 85 secs
lola: 54183844 markings, 120373397 edges, 511434 markings/sec, 90 secs
lola: 56712208 markings, 125991912 edges, 505673 markings/sec, 95 secs
lola: 59389002 markings, 131939460 edges, 535359 markings/sec, 100 secs
lola: 62243509 markings, 138282747 edges, 570901 markings/sec, 105 secs
lola: 65071270 markings, 144565614 edges, 565552 markings/sec, 110 secs
lola: 68039533 markings, 151149497 edges, 593653 markings/sec, 115 secs
lola: 70952192 markings, 157621087 edges, 582532 markings/sec, 120 secs
lola: 73786299 markings, 163917568 edges, 566821 markings/sec, 125 secs
lola: 76604420 markings, 170179106 edges, 563624 markings/sec, 130 secs
lola: 79370474 markings, 176325422 edges, 553211 markings/sec, 135 secs
lola: 82166632 markings, 182538049 edges, 559232 markings/sec, 140 secs
lola: 84992791 markings, 188818267 edges, 565232 markings/sec, 145 secs
lola: 87780549 markings, 195012359 edges, 557552 markings/sec, 150 secs
lola: 90515954 markings, 201090680 edges, 547081 markings/sec, 155 secs
lola: 93294943 markings, 207265447 edges, 555798 markings/sec, 160 secs
lola: 96005759 markings, 213289350 edges, 542163 markings/sec, 165 secs
lola: 98737688 markings, 219359495 edges, 546386 markings/sec, 170 secs
lola: 101338404 markings, 225140004 edges, 520143 markings/sec, 175 secs
lola: 101735118 markings, 226021036 edges, 79343 markings/sec, 180 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: ========================================
lola: ...considering subproblem: ((MEK <= Raf) AND A ((((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G ((F ((1 <= MEKPP_Phase2)) AND ((3 <= Phase2) OR (1 <= MEKPP_Phase2))))))) U (1 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (MEK <= Raf)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEK <= Raf)
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.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: ========================================
lola: ...considering subproblem: A ((((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G ((F ((1 <= MEKPP_Phase2)) AND ((3 <= Phase2) OR (1 <= MEKPP_Phase2))))))) U (1 <= MEKPP_Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((ERKP <= 1) U (G ((2 <= ERKP)) OR F (G ((F ((1 <= MEKPP_Phase2)) AND ((3 <= Phase2) OR (1 <= MEKPP_Phase2))))))) U (1 <= MEKPP_Phase2)))
lola: processed formula length: 141
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 1281 markings, 1281 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no yes no no unknown unknown yes yes yes yes no yes yes
lola:
preliminary result: no no unknown no yes no no unknown unknown yes yes yes yes no yes yes
lola: memory consumption: 22928 KB
lola: time consumption: 1193 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590337454830
--------------------
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="MAPK-PT-05120"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 win2019"
echo " Input is MAPK-PT-05120, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-csrt-158961292400019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-05120.tgz
mv MAPK-PT-05120 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;