fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r093-smll-155246584300303
Last Updated
Apr 15, 2019

About the Execution of LoLA for MAPK-PT-00640

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.700 758276.00 754358.00 3046.90 FTFFTT?TF?FFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r093-smll-155246584300303.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is MAPK-PT-00640, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584300303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.9K Feb 11 22:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 22:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 23:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 95 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 333 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 25K Mar 10 17:31 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--LTLCardinality-00
FORMULA_NAME MAPK-PT--LTLCardinality-01
FORMULA_NAME MAPK-PT--LTLCardinality-02
FORMULA_NAME MAPK-PT--LTLCardinality-03
FORMULA_NAME MAPK-PT--LTLCardinality-04
FORMULA_NAME MAPK-PT--LTLCardinality-05
FORMULA_NAME MAPK-PT--LTLCardinality-06
FORMULA_NAME MAPK-PT--LTLCardinality-07
FORMULA_NAME MAPK-PT--LTLCardinality-08
FORMULA_NAME MAPK-PT--LTLCardinality-09
FORMULA_NAME MAPK-PT--LTLCardinality-10
FORMULA_NAME MAPK-PT--LTLCardinality-11
FORMULA_NAME MAPK-PT--LTLCardinality-12
FORMULA_NAME MAPK-PT--LTLCardinality-13
FORMULA_NAME MAPK-PT--LTLCardinality-14
FORMULA_NAME MAPK-PT--LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552877218554

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-00640 @ 3570 seconds

FORMULA MAPK-PT--LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT--LTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2812
rslt: Output for LTLCardinality @ MAPK-PT-00640

{
"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": "Mon Mar 18 02:46:58 2019
",
"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": 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 <= ERKPP)",
"processed_size": 12,
"rewrites": 16
},
"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": 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": "(2 <= RafP_Phase1)",
"processed_size": 18,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "(Raf_RasGTP <= MEKPP)",
"processed_size": 21,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 280
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((F ((1 <= MEKPP_Phase2)) U X (F ((2 <= Phase3)))))",
"processed_size": 53,
"rewrites": 16
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (G ((2 <= MEKPP))))",
"processed_size": 24,
"rewrites": 16
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((2 <= RasGTP)))",
"processed_size": 21,
"rewrites": 18
},
"result":
{
"edges": 159,
"markings": 160,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 398
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((MEK <= ERKP)))",
"processed_size": 21,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 455
},
"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": "(RasGTP <= 1)",
"processed_size": 13,
"rewrites": 18
},
"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": 530
},
"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": "(ERKPP <= 0)",
"processed_size": 12,
"rewrites": 18
},
"result":
{
"edges": 161,
"markings": 161,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 637
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(MEKPP + 1 <= ERK)",
"processed_size": 18,
"rewrites": 18
},
"result":
{
"edges": 161,
"markings": 161,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 796
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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": "A (F (G ((3 <= MEKP))))",
"processed_size": 23,
"rewrites": 16
},
"result":
{
"edges": 163,
"markings": 162,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1061
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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": "A (G (F ((3 <= RafP_Phase1))))",
"processed_size": 30,
"rewrites": 16
},
"result":
{
"edges": 161,
"markings": 161,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (F (G ((ERK_MEKPP <= Raf_RasGTP))))",
"processed_size": 37,
"rewrites": 16
},
"result":
{
"edges": 134587,
"markings": 86979,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((RafP_Phase1 <= MEKP_RafP) OR (G (F ((2 <= MEK_RafP))) AND F ((RafP_Phase1 <= MEKP_RafP)))))",
"processed_size": 96,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"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": 16044,
"runtime": 758.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "** : A((** OR (G(F(**)) AND F(**)))) : A(F(**)) : ** : A(F(**)) : A((F(**) U X(F(**)))) : A(X(G(**))) : ** : A(F(G(**))) : A(X((X(**) U G(**)))) : A(X(G(**))) : A(F(**)) : A(G(F(**))) : A(G(**)) : A(F(G(**))) : A(G(**))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no yes no no yes yes unknown yes no unknown no no no no no no ",
"value": "no yes no no yes yes unknown yes no unknown no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: LP says that atomic proposition is always true: (MEK_RafP <= Phase2)
lola: LP says that atomic proposition is always true: (MEKP_RafP <= Phase2)
lola: A ((3 <= ERKPP)) : A ((G (F ((2 <= MEK_RafP))) U (RafP_Phase1 <= MEKP_RafP))) : A (F ((ERK <= MEKPP))) : A ((2 <= RafP_Phase1)) : A (F (F ((2 <= RasGTP)))) : A ((((MEK_RafP <= Phase2) U (1 <= MEKPP_Phase2)) U F (X ((2 <= Phase3))))) : A (G (X ((3 <= Phase1)))) : A ((Raf_RasGTP <= MEKPP)) : A (F (F (F (G ((ERK_MEKPP <= Raf_RasGTP)))))) : A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf))))) : A (X (G ((2 <= MEKPP)))) : A ((X (G ((3 <= MEKP_Phase2))) U ((MEKP_RafP <= Phase2) U (1 <= ERKPP)))) : A (G (F (((Raf <= RafP) U (3 <= RafP_Phase1))))) : A (G ((MEK <= ERKP))) : A ((((ERK <= ERKP) U (Phase1 <= MEK_RafP)) U F (G ((3 <= MEKP))))) : A (G ((2 <= RasGTP)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= ERKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ERKPP)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= RafP_Phase1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= RafP_Phase1)
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Raf_RasGTP <= MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Raf_RasGTP <= MEKPP)
lola: processed formula length: 21
lola: 16 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Phase1))))
lola: processed formula length: 25
lola: 16 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: 2388006 markings, 5960578 edges, 477601 markings/sec, 0 secs
lola: 4702684 markings, 11785014 edges, 462936 markings/sec, 5 secs
lola: 6912391 markings, 17404923 edges, 441941 markings/sec, 10 secs
lola: 9222968 markings, 23173622 edges, 462115 markings/sec, 15 secs
lola: 11402890 markings, 28615023 edges, 435984 markings/sec, 20 secs
lola: 13538111 markings, 33940932 edges, 427044 markings/sec, 25 secs
lola: 15798584 markings, 39584689 edges, 452095 markings/sec, 30 secs
lola: 17941901 markings, 44936394 edges, 428663 markings/sec, 35 secs
lola: 20079352 markings, 50269562 edges, 427490 markings/sec, 40 secs
lola: 22211488 markings, 55594262 edges, 426427 markings/sec, 45 secs
lola: 24192974 markings, 60589480 edges, 396297 markings/sec, 50 secs
lola: 26428067 markings, 66169796 edges, 447019 markings/sec, 55 secs
lola: 28517391 markings, 71384007 edges, 417865 markings/sec, 60 secs
lola: 30452643 markings, 76212440 edges, 387050 markings/sec, 65 secs
lola: 32552442 markings, 81455099 edges, 419960 markings/sec, 70 secs
lola: 34453863 markings, 86199665 edges, 380284 markings/sec, 75 secs
lola: 36473139 markings, 91343142 edges, 403855 markings/sec, 80 secs
lola: 38515845 markings, 96441764 edges, 408541 markings/sec, 85 secs
lola: 40656671 markings, 101788484 edges, 428165 markings/sec, 90 secs
lola: 42544599 markings, 106551777 edges, 377586 markings/sec, 95 secs
lola: 44532827 markings, 111618812 edges, 397646 markings/sec, 100 secs
lola: 46569711 markings, 116705440 edges, 407377 markings/sec, 105 secs
lola: 48403517 markings, 121385078 edges, 366761 markings/sec, 110 secs
lola: 50292243 markings, 126152768 edges, 377745 markings/sec, 115 secs
lola: 52526676 markings, 131731499 edges, 446887 markings/sec, 120 secs
lola: 54407221 markings, 136423861 edges, 376109 markings/sec, 125 secs
lola: 56156291 markings, 140789322 edges, 349814 markings/sec, 130 secs
lola: 58272191 markings, 146072933 edges, 423180 markings/sec, 135 secs
lola: 60055153 markings, 150573748 edges, 356592 markings/sec, 140 secs
lola: 61986291 markings, 155393133 edges, 386228 markings/sec, 145 secs
lola: 64080516 markings, 160622413 edges, 418845 markings/sec, 150 secs
lola: 65984855 markings, 165378354 edges, 380868 markings/sec, 155 secs
lola: 67810724 markings, 169935230 edges, 365174 markings/sec, 160 secs
lola: 69601736 markings, 174405662 edges, 358202 markings/sec, 165 secs
lola: 71644902 markings, 179504499 edges, 408633 markings/sec, 170 secs
lola: 73547860 markings, 184256362 edges, 380592 markings/sec, 175 secs
lola: 75412996 markings, 188911708 edges, 373027 markings/sec, 180 secs
lola: 76154072 markings, 190763246 edges, 148215 markings/sec, 185 secs
lola: 76154125 markings, 190763403 edges, 11 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= MEKPP_Phase2)) U X (F ((2 <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((1 <= MEKPP_Phase2)) U X (F ((2 <= Phase3)))))
lola: processed formula length: 53
lola: 16 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: subprocess 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: processed formula length: 47
lola: 16 rewrites
lola: closed formula file LTLCardinality.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: 2313861 markings, 5875361 edges, 462772 markings/sec, 0 secs
lola: 4486969 markings, 11300078 edges, 434622 markings/sec, 5 secs
lola: 6670785 markings, 16751500 edges, 436763 markings/sec, 10 secs
lola: 8973918 markings, 22551361 edges, 460627 markings/sec, 15 secs
lola: 11359726 markings, 28560798 edges, 477162 markings/sec, 20 secs
lola: 13686485 markings, 34416156 edges, 465352 markings/sec, 25 secs
lola: 15815712 markings, 39732812 edges, 425845 markings/sec, 30 secs
lola: 18076751 markings, 45377837 edges, 452208 markings/sec, 35 secs
lola: 20454886 markings, 51315057 edges, 475627 markings/sec, 40 secs
lola: 22473759 markings, 56354295 edges, 403775 markings/sec, 45 secs
lola: 24682379 markings, 61867013 edges, 441724 markings/sec, 50 secs
lola: 26661358 markings, 66802594 edges, 395796 markings/sec, 55 secs
lola: 28641935 markings, 71747980 edges, 396115 markings/sec, 60 secs
lola: 30840951 markings, 77239118 edges, 439803 markings/sec, 65 secs
lola: 32731130 markings, 81956704 edges, 378036 markings/sec, 70 secs
lola: 34816400 markings, 87162365 edges, 417054 markings/sec, 75 secs
lola: 36728985 markings, 91937300 edges, 382517 markings/sec, 80 secs
lola: 38905588 markings, 97368727 edges, 435321 markings/sec, 85 secs
lola: 41253073 markings, 103231310 edges, 469497 markings/sec, 90 secs
lola: 43524963 markings, 108901924 edges, 454378 markings/sec, 95 secs
lola: 45668049 markings, 114251777 edges, 428617 markings/sec, 100 secs
lola: 47945173 markings, 119936363 edges, 455425 markings/sec, 105 secs
lola: 50059981 markings, 125266246 edges, 422962 markings/sec, 110 secs
lola: 51867996 markings, 129780769 edges, 361603 markings/sec, 115 secs
lola: 53652627 markings, 134287984 edges, 356926 markings/sec, 120 secs
lola: 55769293 markings, 139572657 edges, 423333 markings/sec, 125 secs
lola: 57989148 markings, 145214504 edges, 443971 markings/sec, 130 secs
lola: 60155032 markings, 150620257 edges, 433177 markings/sec, 135 secs
lola: 62209138 markings, 155749426 edges, 410821 markings/sec, 140 secs
lola: 64152020 markings, 160597595 edges, 388576 markings/sec, 145 secs
lola: 65985530 markings, 165175663 edges, 366702 markings/sec, 150 secs
lola: 67769133 markings, 169629033 edges, 356721 markings/sec, 155 secs
lola: 69482358 markings, 173904557 edges, 342645 markings/sec, 160 secs
lola: 71284197 markings, 178404045 edges, 360368 markings/sec, 165 secs
lola: 73250595 markings, 183309213 edges, 393280 markings/sec, 170 secs
lola: 75122108 markings, 187981338 edges, 374303 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= MEKPP))))
lola: processed formula length: 24
lola: 16 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= RasGTP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= RasGTP)))
lola: processed formula length: 21
lola: 18 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (RasGTP <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 160 markings, 159 edges
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEK <= ERKP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((MEK <= ERKP)))
lola: processed formula length: 21
lola: 18 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (ERKP + 1 <= MEK)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= RasGTP)))
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: (RasGTP <= 1)
lola: processed formula length: 13
lola: 18 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 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= ERKPP)))
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: (ERKPP <= 0)
lola: processed formula length: 12
lola: 18 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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ERK <= MEKPP)))
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: (MEKPP + 1 <= ERK)
lola: processed formula length: 18
lola: 18 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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= MEKP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= MEKP))))
lola: processed formula length: 23
lola: 16 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: add low 1
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: 162 markings, 163 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= RafP_Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= RafP_Phase1))))
lola: processed formula length: 30
lola: 16 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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ERK_MEKPP <= Raf_RasGTP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ERK_MEKPP <= Raf_RasGTP))))
lola: processed formula length: 37
lola: 16 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: add low 25
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: 86979 markings, 134587 edges
lola: ========================================
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((RafP_Phase1 <= MEKP_RafP) OR (G (F ((2 <= MEK_RafP))) AND F ((RafP_Phase1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((RafP_Phase1 <= MEKP_RafP) OR (G (F ((2 <= MEK_RafP))) AND F ((RafP_Phase1 <= MEKP_RafP)))))
lola: processed formula length: 96
lola: 16 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Phase1))))
lola: processed formula length: 25
lola: 16 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: 2343396 markings, 5848874 edges, 468679 markings/sec, 0 secs
lola: 4629824 markings, 11603111 edges, 457286 markings/sec, 5 secs
lola: 6804744 markings, 17136784 edges, 434984 markings/sec, 10 secs
lola: 9071847 markings, 22796992 edges, 453421 markings/sec, 15 secs
lola: 11204225 markings, 28118857 edges, 426476 markings/sec, 20 secs
lola: 13267257 markings, 33265502 edges, 412606 markings/sec, 25 secs
lola: 15501198 markings, 38843692 edges, 446788 markings/sec, 30 secs
lola: 17635494 markings, 44171496 edges, 426859 markings/sec, 35 secs
lola: 19690090 markings, 49297263 edges, 410919 markings/sec, 40 secs
lola: 21875342 markings, 54754296 edges, 437050 markings/sec, 45 secs
lola: 23803669 markings, 59583725 edges, 385665 markings/sec, 50 secs
lola: 26046808 markings, 65217802 edges, 448628 markings/sec, 55 secs
lola: 28141168 markings, 70444152 edges, 418872 markings/sec, 60 secs
lola: 29993165 markings, 75067351 edges, 370399 markings/sec, 65 secs
lola: 32157839 markings, 80469262 edges, 432935 markings/sec, 70 secs
lola: 34048141 markings, 85186338 edges, 378060 markings/sec, 75 secs
lola: 35911540 markings, 89942524 edges, 372680 markings/sec, 80 secs
lola: 38044887 markings, 95266553 edges, 426669 markings/sec, 85 secs
lola: 40093183 markings, 100380485 edges, 409659 markings/sec, 90 secs
lola: 41997842 markings, 105185885 edges, 380932 markings/sec, 95 secs
lola: 43850185 markings, 109876066 edges, 370469 markings/sec, 100 secs
lola: 45957396 markings, 115175907 edges, 421442 markings/sec, 105 secs
lola: 47731389 markings, 119708208 edges, 354799 markings/sec, 110 secs
lola: 49570165 markings, 124300382 edges, 367755 markings/sec, 115 secs
lola: 51691886 markings, 129646141 edges, 424344 markings/sec, 120 secs
lola: 53641391 markings, 134511030 edges, 389901 markings/sec, 125 secs
lola: 55444632 markings, 139014621 edges, 360648 markings/sec, 130 secs
lola: 57436326 markings, 143983650 edges, 398339 markings/sec, 135 secs
lola: 59314638 markings, 148724008 edges, 375662 markings/sec, 140 secs
lola: 61102386 markings, 153189142 edges, 357550 markings/sec, 145 secs
lola: 63131932 markings, 158254269 edges, 405909 markings/sec, 150 secs
lola: 65112169 markings, 163198588 edges, 396047 markings/sec, 155 secs
lola: 67051216 markings, 168039123 edges, 387809 markings/sec, 160 secs
lola: 68721310 markings, 172207879 edges, 334019 markings/sec, 165 secs
lola: 70719249 markings, 177194242 edges, 399588 markings/sec, 170 secs
lola: 72689092 markings, 182110757 edges, 393969 markings/sec, 175 secs
lola: 74559192 markings, 186780099 edges, 374020 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: processed formula length: 47
lola: 16 rewrites
lola: closed formula file LTLCardinality.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: 2359758 markings, 5989932 edges, 471952 markings/sec, 0 secs
lola: 4542964 markings, 11439932 edges, 436641 markings/sec, 5 secs
lola: 6751858 markings, 16953930 edges, 441779 markings/sec, 10 secs
lola: 9047289 markings, 22750656 edges, 459086 markings/sec, 15 secs
lola: 11426950 markings, 28729033 edges, 475932 markings/sec, 20 secs
lola: 13770110 markings, 34624137 edges, 468632 markings/sec, 25 secs
lola: 15900470 markings, 39943542 edges, 426072 markings/sec, 30 secs
lola: 18171594 markings, 45613737 edges, 454225 markings/sec, 35 secs
lola: 20545379 markings, 51541133 edges, 474757 markings/sec, 40 secs
lola: 22537106 markings, 56512560 edges, 398345 markings/sec, 45 secs
lola: 24752672 markings, 62042631 edges, 443113 markings/sec, 50 secs
lola: 26736173 markings, 66989463 edges, 396700 markings/sec, 55 secs
lola: 28750044 markings, 72018086 edges, 402774 markings/sec, 60 secs
lola: 30970355 markings, 77562347 edges, 444062 markings/sec, 65 secs
lola: 32849044 markings, 82251216 edges, 375738 markings/sec, 70 secs
lola: 34957770 markings, 87514592 edges, 421745 markings/sec, 75 secs
lola: 36870060 markings, 92290161 edges, 382458 markings/sec, 80 secs
lola: 39052285 markings, 97735542 edges, 436445 markings/sec, 85 secs
lola: 41431584 markings, 103676971 edges, 475860 markings/sec, 90 secs
lola: 43676830 markings, 109281240 edges, 449049 markings/sec, 95 secs
lola: 45849366 markings, 114704725 edges, 434507 markings/sec, 100 secs
lola: 48103579 markings, 120332475 edges, 450843 markings/sec, 105 secs
lola: 50183454 markings, 125574553 edges, 415975 markings/sec, 110 secs
lola: 52041785 markings, 130215143 edges, 371666 markings/sec, 115 secs
lola: 53803196 markings, 134663830 edges, 352282 markings/sec, 120 secs
lola: 55927982 markings, 139969468 edges, 424957 markings/sec, 125 secs
lola: 58153940 markings, 145626563 edges, 445192 markings/sec, 130 secs
lola: 60324872 markings, 151044400 edges, 434186 markings/sec, 135 secs
lola: 62396828 markings, 156217374 edges, 414391 markings/sec, 140 secs
lola: 64320360 markings, 161018531 edges, 384706 markings/sec, 145 secs
lola: 66142602 markings, 165567798 edges, 364448 markings/sec, 150 secs
lola: 67938030 markings, 170050994 edges, 359086 markings/sec, 155 secs
lola: 69619890 markings, 174248119 edges, 336372 markings/sec, 160 secs
lola: 71487197 markings, 178910334 edges, 373461 markings/sec, 165 secs
lola: 73445062 markings, 183794983 edges, 391573 markings/sec, 170 secs
lola: 75294138 markings, 188410930 edges, 369815 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no yes yes unknown yes no unknown no no no no no no
lola:
preliminary result: no yes no no yes yes unknown yes no unknown no no no no no no
lola: memory consumption: 16044 KB
lola: time consumption: 758 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552877976830

--------------------
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-00640"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-3957"
echo " Executing tool lola"
echo " Input is MAPK-PT-00640, 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 r093-smll-155246584300303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00640.tgz
mv MAPK-PT-00640 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;