About the Execution of LoLA for MAPK-PT-02560
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12428.730 | 265451.00 | 534280.00 | 579.50 | TFFTTFFTFTTTTTFT | 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-155246584300323.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-02560, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584300323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.5K Feb 11 22:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 22:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 7 23:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 23:39 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 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K 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.8K 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.5K 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.9K 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.6K 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-02560-ReachabilityCardinality-00
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-01
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-02
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-03
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-04
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-05
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-06
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-07
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-08
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-09
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-10
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-11
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-12
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-13
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-14
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552887944712
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ MAPK-PT-02560 @ 3570 seconds
FORMULA MAPK-PT-02560-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3304
rslt: Output for ReachabilityCardinality @ MAPK-PT-02560
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 05:45:44 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": 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": 3
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= ERKPP)))",
"processed_size": 20,
"rewrites": 4
},
"result":
{
"edges": 32,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= ERKP_MEKPP)))",
"processed_size": 25,
"rewrites": 4
},
"result":
{
"edges": 11664,
"markings": 7773,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((Phase1 + 1 <= ERK_MEKPP)))",
"processed_size": 33,
"rewrites": 4
},
"result":
{
"edges": 16650,
"markings": 10888,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((Phase1 <= RafP)))",
"processed_size": 24,
"rewrites": 4
},
"result":
{
"edges": 3840,
"markings": 3841,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((Phase1 + 1 <= Raf)))",
"processed_size": 27,
"rewrites": 5
},
"result":
{
"edges": 640,
"markings": 641,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((Phase2 <= Raf) OR (3 <= ERKP_Phase3))))",
"processed_size": 48,
"rewrites": 5
},
"result":
{
"edges": 2563,
"markings": 1923,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "E (F (((3 <= ERKP_Phase3) AND (ERKPP + 1 <= Raf))))",
"processed_size": 51,
"rewrites": 4
},
"result":
{
"edges": 18,
"markings": 16,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"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": "E (F (((MEKP_Phase2 <= RasGTP) AND (Phase3 <= MEKP_RafP))))",
"processed_size": 59,
"rewrites": 4
},
"result":
{
"edges": 243342630,
"markings": 125898032,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((ERKP_Phase3 <= 0) AND (Phase2 <= 0) AND (Raf + 1 <= Phase2) AND (MEK + 1 <= Raf))))",
"processed_size": 91,
"rewrites": 4
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((RafP_Phase1 <= MEKP) OR (ERKP_Phase3 <= RafP_Phase1) OR (MEK_RafP <= 1))))",
"processed_size": 84,
"rewrites": 5
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 660
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((ERKP_Phase3 <= Phase2) AND (Phase1 <= MEKP) AND (ERKP <= 0))))",
"processed_size": 70,
"rewrites": 4
},
"result":
{
"edges": 7679,
"markings": 5761,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((RasGTP <= MEK_RafP) AND (ERK_MEKPP + 1 <= Phase1)) OR (ERKPP <= Phase1))))",
"processed_size": 84,
"rewrites": 5
},
"result":
{
"edges": 25680,
"markings": 16051,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1101
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((ERKP + 1 <= Phase2) AND (MEKPP_Phase2 <= 0) AND (ERK_MEKPP <= 0) AND (ERK + 1 <= MEK))))",
"processed_size": 96,
"rewrites": 4
},
"result":
{
"edges": 8330,
"markings": 6407,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((Phase2 <= MEKPP_Phase2) OR (2 <= RasGTP) OR (1 <= Phase3) OR (Phase3 + 1 <= MEKPP) OR (ERKP_Phase3 + 1 <= Raf))))",
"processed_size": 125,
"rewrites": 5
},
"result":
{
"edges": 8326,
"markings": 6407,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((2 <= ERKP) AND (MEKP_RafP <= ERK) AND ((3 <= MEKP_Phase2) OR (Phase1 <= Phase2)) AND ((1 <= ERKP_MEKPP) OR (Raf + 1 <= RafP_Phase1)))))",
"processed_size": 145,
"rewrites": 4
},
"result":
{
"edges": 5170,
"markings": 4195,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22928,
"runtime": 266.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : TRUE"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "yes no no yes yes no no yes no yes yes yes yes yes no yes ",
"value": "yes no no yes yes no no yes no yes yes yes yes yes no 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 ReachabilityCardinality.xml
lola: E (F (((MEKP_Phase2 <= RasGTP) AND (Phase3 <= MEKP_RafP)))) : A (G ((Phase1 + 1 <= Raf))) : A (G (((RafP_Phase1 <= MEKP) OR (ERKP_Phase3 <= RafP_Phase1) OR (MEK_RafP <= 1)))) : E (F (((ERKP_Phase3 <= Phase2) AND (Phase1 <= MEKP) AND (ERKP <= 0)))) : E (F (((3 <= ERKP_Phase3) AND (ERKPP + 1 <= Raf)))) : A (G (((Phase2 <= Raf) OR (3 <= ERKP_Phase3)))) : A (G ((((RasGTP <= MEK_RafP) AND (ERK_MEKPP + 1 <= Phase1)) OR (ERKPP <= Phase1)))) : E (F ((Phase1 + 1 <= ERK_MEKPP))) : E (F (((ERKP_Phase3 <= 0) AND (Phase2 <= 0) AND (Raf + 1 <= Phase2) AND (MEK + 1 <= Raf)))) : E (F (((ERKP + 1 <= Phase2) AND (MEKPP_Phase2 <= 0) AND (ERK_MEKPP <= 0) AND (ERK + 1 <= MEK)))) : E (F ((3 <= ERKP_MEKPP))) : E (F (((2 <= ERKP) AND (MEKP_RafP <= ERK) AND ((3 <= MEKP_Phase2) OR (Phase1 <= Phase2)) AND ((1 <= ERKP_MEKPP) OR (Raf + 1 <= RafP_Phase1))))) : E (F ((3 <= ERKPP))) : E (F ((Phase1 <= RafP))) : A (G (((Phase2 <= MEKPP_Phase2) OR (2 <= RasGTP) OR (1 <= Phase3) OR (Phase3 + 1 <= MEKPP) OR (ERKP_Phase3 + 1 <= Raf)))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file ReachabilityCardinality.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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= ERKPP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= ERKPP)))
lola: processed formula length: 20
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= ERKPP)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= ERKP_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= ERKP_MEKPP)))
lola: processed formula length: 25
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= ERKP_MEKPP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7773 markings, 11664 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Phase1 + 1 <= ERK_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Phase1 + 1 <= ERK_MEKPP)))
lola: processed formula length: 33
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Phase1 + 1 <= ERK_MEKPP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10888 markings, 16650 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Phase1 <= RafP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Phase1 <= RafP)))
lola: processed formula length: 24
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Phase1 <= RafP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3841 markings, 3840 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Phase1 + 1 <= Raf)))
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 ((Phase1 + 1 <= Raf)))
lola: processed formula length: 27
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: (Raf <= Phase1)
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: 641 markings, 640 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Phase2 <= Raf) OR (3 <= ERKP_Phase3))))
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 (((Phase2 <= Raf) OR (3 <= ERKP_Phase3))))
lola: processed formula length: 48
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: ((Raf + 1 <= Phase2) AND (ERKP_Phase3 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1923 markings, 2563 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ERKP_Phase3) AND (ERKPP + 1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= ERKP_Phase3) AND (ERKPP + 1 <= Raf))))
lola: processed formula length: 51
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= ERKP_Phase3) AND (ERKPP + 1 <= Raf))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 18 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((MEKP_Phase2 <= RasGTP) AND (Phase3 <= MEKP_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((MEKP_Phase2 <= RasGTP) AND (Phase3 <= MEKP_RafP))))
lola: processed formula length: 59
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((MEKP_Phase2 <= RasGTP) AND (Phase3 <= MEKP_RafP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 2514983 markings, 4914499 edges, 502997 markings/sec, 0 secs
lola: sara is running 5 secs || 4934503 markings, 9612631 edges, 483904 markings/sec, 5 secs
lola: sara is running 10 secs || 7391196 markings, 14373733 edges, 491339 markings/sec, 10 secs
lola: sara is running 15 secs || 9903789 markings, 19242337 edges, 502519 markings/sec, 15 secs
lola: sara is running 20 secs || 12373160 markings, 24020809 edges, 493874 markings/sec, 20 secs
lola: sara is running 25 secs || 14791055 markings, 28703654 edges, 483579 markings/sec, 25 secs
lola: sara is running 30 secs || 17260741 markings, 33480427 edges, 493937 markings/sec, 30 secs
lola: sara is running 35 secs || 19676204 markings, 38151616 edges, 483093 markings/sec, 35 secs
lola: sara is running 40 secs || 22098830 markings, 42839232 edges, 484525 markings/sec, 40 secs
lola: sara is running 45 secs || 24517823 markings, 47517305 edges, 483799 markings/sec, 45 secs
lola: sara is running 50 secs || 26921653 markings, 52161846 edges, 480766 markings/sec, 50 secs
lola: sara is running 55 secs || 29355275 markings, 56867290 edges, 486724 markings/sec, 55 secs
lola: sara is running 60 secs || 31886541 markings, 61762860 edges, 506253 markings/sec, 60 secs
lola: sara is running 65 secs || 34381387 markings, 66584289 edges, 498969 markings/sec, 65 secs
lola: sara is running 70 secs || 36829617 markings, 71316690 edges, 489646 markings/sec, 70 secs
lola: sara is running 75 secs || 39299243 markings, 76086879 edges, 493925 markings/sec, 75 secs
lola: sara is running 80 secs || 41728225 markings, 80783502 edges, 485796 markings/sec, 80 secs
lola: sara is running 85 secs || 44150752 markings, 85464213 edges, 484505 markings/sec, 85 secs
lola: sara is running 90 secs || 46549237 markings, 90093247 edges, 479697 markings/sec, 90 secs
lola: sara is running 95 secs || 49026170 markings, 94886482 edges, 495387 markings/sec, 95 secs
lola: sara is running 100 secs || 51466451 markings, 99599222 edges, 488056 markings/sec, 100 secs
lola: sara is running 105 secs || 53882255 markings, 104269651 edges, 483161 markings/sec, 105 secs
lola: sara is running 110 secs || 56273031 markings, 108888376 edges, 478155 markings/sec, 110 secs
lola: sara is running 115 secs || 58689848 markings, 113549915 edges, 483363 markings/sec, 115 secs
lola: sara is running 120 secs || 61085693 markings, 118174841 edges, 479169 markings/sec, 120 secs
lola: sara is running 125 secs || 63445513 markings, 122741810 edges, 471964 markings/sec, 125 secs
lola: sara is running 130 secs || 65804476 markings, 127291174 edges, 471793 markings/sec, 130 secs
lola: sara is running 135 secs || 68142872 markings, 131813318 edges, 467679 markings/sec, 135 secs
lola: sara is running 140 secs || 70552709 markings, 136472379 edges, 481967 markings/sec, 140 secs
lola: sara is running 145 secs || 72978024 markings, 141152578 edges, 485063 markings/sec, 145 secs
lola: sara is running 150 secs || 75364817 markings, 145762945 edges, 477359 markings/sec, 150 secs
lola: sara is running 155 secs || 77761228 markings, 150391529 edges, 479282 markings/sec, 155 secs
lola: sara is running 160 secs || 80117987 markings, 154938628 edges, 471352 markings/sec, 160 secs
lola: sara is running 165 secs || 82478392 markings, 159493154 edges, 472081 markings/sec, 165 secs
lola: sara is running 170 secs || 84867165 markings, 164115330 edges, 477755 markings/sec, 170 secs
lola: sara is running 175 secs || 87245609 markings, 168707273 edges, 475689 markings/sec, 175 secs
lola: sara is running 180 secs || 89601429 markings, 173258175 edges, 471164 markings/sec, 180 secs
lola: sara is running 185 secs || 91937418 markings, 177759765 edges, 467198 markings/sec, 185 secs
lola: sara is running 190 secs || 94256188 markings, 182247080 edges, 463754 markings/sec, 190 secs
lola: sara is running 195 secs || 96611241 markings, 186800428 edges, 471011 markings/sec, 195 secs
lola: sara is running 200 secs || 99031945 markings, 191468973 edges, 484141 markings/sec, 200 secs
lola: sara is running 205 secs || 101455959 markings, 196140700 edges, 484803 markings/sec, 205 secs
lola: sara is running 210 secs || 103846949 markings, 200768363 edges, 478198 markings/sec, 210 secs
lola: sara is running 215 secs || 106241812 markings, 205392338 edges, 478973 markings/sec, 215 secs
lola: sara is running 220 secs || 108618636 markings, 209981723 edges, 475365 markings/sec, 220 secs
lola: sara is running 225 secs || 110958276 markings, 214489276 edges, 467928 markings/sec, 225 secs
lola: sara is running 230 secs || 113389590 markings, 219183139 edges, 486263 markings/sec, 230 secs
lola: sara is running 235 secs || 115792599 markings, 223827525 edges, 480602 markings/sec, 235 secs
lola: sara is running 240 secs || 118180281 markings, 228444330 edges, 477536 markings/sec, 240 secs
lola: sara is running 245 secs || 120627472 markings, 233171490 edges, 489438 markings/sec, 245 secs
lola: sara is running 250 secs || 123052224 markings, 237846691 edges, 484950 markings/sec, 250 secs
lola: sara is running 255 secs || 125469968 markings, 242507375 edges, 483549 markings/sec, 255 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 125898032 markings, 243342630 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKP_Phase3 <= 0) AND (Phase2 <= 0) AND (Raf + 1 <= Phase2) AND (MEK + 1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((ERKP_Phase3 <= 0) AND (Phase2 <= 0) AND (Raf + 1 <= Phase2) AND (MEK + 1 <= Raf))))
lola: processed formula length: 91
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((ERKP_Phase3 <= 0) AND (Phase2 <= 0) AND (Raf + 1 <= Phase2) AND (MEK + 1 <= Raf))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((RafP_Phase1 <= MEKP) OR (ERKP_Phase3 <= RafP_Phase1) OR (MEK_RafP <= 1))))
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 (((RafP_Phase1 <= MEKP) OR (ERKP_Phase3 <= RafP_Phase1) OR (MEK_RafP <= 1))))
lola: processed formula length: 84
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: ((MEKP + 1 <= RafP_Phase1) AND (RafP_Phase1 + 1 <= ERKP_Phase3) AND (2 <= MEK_RafP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKP_Phase3 <= Phase2) AND (Phase1 <= MEKP) AND (ERKP <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((ERKP_Phase3 <= Phase2) AND (Phase1 <= MEKP) AND (ERKP <= 0))))
lola: processed formula length: 70
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((ERKP_Phase3 <= Phase2) AND (Phase1 <= MEKP) AND (ERKP <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5761 markings, 7679 edges
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((RasGTP <= MEK_RafP) AND (ERK_MEKPP + 1 <= Phase1)) OR (ERKPP <= Phase1))))
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 ((((RasGTP <= MEK_RafP) AND (ERK_MEKPP + 1 <= Phase1)) OR (ERKPP <= Phase1))))
lola: processed formula length: 84
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: (((MEK_RafP + 1 <= RasGTP) OR (Phase1 <= ERK_MEKPP)) AND (Phase1 + 1 <= ERKPP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16051 markings, 25680 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKP + 1 <= Phase2) AND (MEKPP_Phase2 <= 0) AND (ERK_MEKPP <= 0) AND (ERK + 1 <= MEK))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((ERKP + 1 <= Phase2) AND (MEKPP_Phase2 <= 0) AND (ERK_MEKPP <= 0) AND (ERK + 1 <= MEK))))
lola: processed formula length: 96
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
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 <= Phase2) AND (MEKPP_Phase2 <= 0) AND (ERK_MEKPP <= 0) AND (ERK + 1 <= MEK))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6407 markings, 8330 edges
lola: ========================================
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Phase2 <= MEKPP_Phase2) OR (2 <= RasGTP) OR (1 <= Phase3) OR (Phase3 + 1 <= MEKPP) OR (ERKP_Phase3 + 1 <= Raf))))
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 (((Phase2 <= MEKPP_Phase2) OR (2 <= RasGTP) OR (1 <= Phase3) OR (Phase3 + 1 <= MEKPP) OR (ERKP_Phase3 + 1 <= Raf))))
lola: processed formula length: 125
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: ((MEKPP_Phase2 + 1 <= Phase2) AND (RasGTP <= 1) AND (Phase3 <= 0) AND (MEKPP <= Phase3) AND (Raf <= ERKP_Phase3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6407 markings, 8326 edges
lola: ========================================
lola: subprocess 15 will run for 3304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ERKP) AND (MEKP_RafP <= ERK) AND ((3 <= MEKP_Phase2) OR (Phase1 <= Phase2)) AND ((1 <= ERKP_MEKPP) OR (Raf + 1 <= RafP_Phase1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= ERKP) AND (MEKP_RafP <= ERK) AND ((3 <= MEKP_Phase2) OR (Phase1 <= Phase2)) AND ((1 <= ERKP_MEKPP) OR (Raf + 1 <= RafP_Phase1)))))
lola: processed formula length: 145
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= ERKP) AND (MEKP_RafP <= ERK) AND ((3 <= MEKP_Phase2) OR (Phase1 <= Phase2)) AND ((1 <= ERKP_MEKPP) OR (Raf + 1 <= RafP_Phase1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4195 markings, 5170 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no no yes no yes yes yes yes yes no yes
lola:
preliminary result: yes no no yes yes no no yes no yes yes yes yes yes no yes
lola: memory consumption: 22928 KB
lola: time consumption: 266 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552888210163
--------------------
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-02560"
export BK_EXAMINATION="ReachabilityCardinality"
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-02560, examination is ReachabilityCardinality"
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-155246584300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-02560.tgz
mv MAPK-PT-02560 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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
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 ;