About the Execution of LoLA for MAPK-PT-05120
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15918.520 | 690941.00 | 696397.00 | 2009.40 | TTTTFFFFTFT?FTTF | 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-155246584400332.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-05120, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584400332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.2K Feb 11 22:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 11 22:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 7 23:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 12K 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.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 06:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 31 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 31 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-05120-ReachabilityCardinality-00
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-01
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-02
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-03
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-04
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-05
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-06
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-07
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-08
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-09
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-10
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-11
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-12
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-13
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-14
FORMULA_NAME MAPK-PT-05120-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552893665426
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ MAPK-PT-05120 @ 3570 seconds
FORMULA MAPK-PT-05120-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-05120-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2879
rslt: Output for ReachabilityCardinality @ MAPK-PT-05120
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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 07:21:05 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": 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 ((MEKP_RafP <= 2)))",
"processed_size": 24,
"rewrites": 5
},
"result":
{
"produced_by": "state equation",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((1 <= Phase1)))",
"processed_size": 21,
"rewrites": 5
},
"result":
{
"edges": 15359,
"markings": 11521,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"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 ((ERK <= MEKP)))",
"processed_size": 21,
"rewrites": 4
},
"result":
{
"edges": 19202,
"markings": 15363,
"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
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((3 <= Raf) OR (2 <= RafP_Phase1))))",
"processed_size": 43,
"rewrites": 5
},
"result":
{
"edges": 12794,
"markings": 8957,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 324
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((2 <= ERKPP_Phase3) AND (MEKPP + 1 <= Phase2) AND (2 <= MEK))))",
"processed_size": 70,
"rewrites": 4
},
"result":
{
"edges": 24,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 356
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((MEK <= 2) AND (ERKPP_Phase3 + 1 <= RasGTP) AND (2 <= MEK_RafP))))",
"processed_size": 73,
"rewrites": 4
},
"result":
{
"edges": 56936,
"markings": 33639,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 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": 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": "E (F (((ERKP <= 2) AND (RafP + 1 <= RafP_Phase1) AND (Phase3 <= ERKP))))",
"processed_size": 72,
"rewrites": 4
},
"result":
{
"edges": 23059,
"markings": 19215,
"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": 3,
"problems": 3
},
"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 (((MEK <= ERKPP) AND (ERK_MEKPP <= ERKP))))",
"processed_size": 48,
"rewrites": 4
},
"result":
{
"edges": 7680,
"markings": 5122,
"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": 509
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((ERKP <= MEK) OR ((1 <= ERKPP) AND (RasGTP <= Raf_RasGTP)))))",
"processed_size": 69,
"rewrites": 5
},
"result":
{
"edges": 7694,
"markings": 5131,
"produced_by": "state space",
"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": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "A (G ((((1 <= ERKPP_Phase3) AND (2 <= MEKP)) OR (MEK + 1 <= ERK) OR (MEKP_Phase2 <= 1))))",
"processed_size": 91,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F (((ERK <= MEKP_RafP) AND ((ERK_MEKPP + 1 <= RasGTP) OR (ERKPP_Phase3 <= Raf)))))",
"processed_size": 86,
"rewrites": 4
},
"result":
{
"edges": 11526,
"markings": 7686,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"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": 7,
"visible_transitions": 0
},
"processed": "A (G (((1 <= MEKPP_Phase2) OR (ERKPP_Phase3 <= ERK) OR (2 <= Raf) OR (3 <= Phase3) OR ((ERKPP <= ERK) AND (1 <= MEK_RafP) AND (1 <= ERKPP)))))",
"processed_size": 146,
"rewrites": 5
},
"result":
{
"edges": 28166,
"markings": 20487,
"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": 15,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((ERKPP <= MEKP_Phase2) AND (MEK <= Raf)) OR (MEKP_RafP <= 2) OR (RafP <= ERK_MEKPP))))",
"processed_size": 96,
"rewrites": 5
},
"result":
{
"edges": 5140,
"markings": 3858,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((2 <= Raf) AND (1 <= MEKP) AND ((Raf_RasGTP <= MEKP) OR (MEKP <= ERK)) AND (3 <= ERKP) AND (MEKP_RafP <= ERKP_MEKPP) AND (MEKP_RafP <= 0))))",
"processed_size": 148,
"rewrites": 4
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 21540,
"runtime": 691.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : TRUE : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "yes yes yes yes no no no no yes no yes unknown no yes yes no ",
"value": "yes yes yes yes no no no no yes no yes unknown no yes yes 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (ERKP_MEKPP <= Phase2)
lola: E (F (((2 <= ERKPP_Phase3) AND (MEKPP + 1 <= Phase2) AND (2 <= MEK)))) : E (F (((MEK <= ERKPP) AND (ERK_MEKPP <= ERKP)))) : E (F ((ERK <= MEKP))) : E (F (((MEK <= 2) AND (ERKPP_Phase3 + 1 <= RasGTP) AND (2 <= MEK_RafP)))) : A (G (((ERKP <= MEK) OR ((1 <= ERKPP) AND (RasGTP <= Raf_RasGTP))))) : A (G ((((ERKPP <= MEKP_Phase2) AND (MEK <= Raf)) OR (MEKP_RafP <= 2) OR (RafP <= ERK_MEKPP)))) : A (G ((1 <= Phase1))) : A (G (((3 <= Raf) OR (2 <= RafP_Phase1)))) : E (F (((ERK <= MEKP_RafP) AND ((ERK_MEKPP + 1 <= RasGTP) OR (ERKPP_Phase3 <= Raf))))) : A (G ((MEKP_RafP <= 2))) : E (F (((ERKP <= 2) AND (RafP + 1 <= RafP_Phase1) AND (Phase3 <= ERKP)))) : E (F (((3 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1)))) : A (G (((1 <= MEKPP_Phase2) OR (ERKPP_Phase3 <= ERK) OR (2 <= Raf) OR (3 <= Phase3) OR ((ERKPP <= ERK) AND (1 <= MEK_RafP) AND (1 <= ERKPP))))) : A (G ((ERKP_MEKPP <= Phase2))) : E (F (((2 <= Raf) AND (1 <= MEKP) AND ((Raf_RasGTP <= MEKP) OR (MEKP <= ERK)) AND (3 <= ERKP) AND (MEKP_RafP <= ERKP_MEKPP) AND (MEKP_RafP <= 0)))) : A (G ((((1 <= ERKPP_Phase3) AND (2 <= MEKP)) OR (MEK + 1 <= ERK) OR (MEKP_Phase2 <= 1))))
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: A (G ((MEKP_RafP <= 2)))
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 ((MEKP_RafP <= 2)))
lola: processed formula length: 24
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: (3 <= MEKP_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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= 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 ((1 <= Phase1)))
lola: processed formula length: 21
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: (Phase1 <= 0)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11521 markings, 15359 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((ERK <= MEKP)))
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 ((ERK <= MEKP)))
lola: processed formula length: 21
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: (ERK <= MEKP)
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: 15363 markings, 19202 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Raf) OR (2 <= RafP_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 (((3 <= Raf) OR (2 <= RafP_Phase1))))
lola: processed formula length: 43
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 <= 2) AND (RafP_Phase1 <= 1))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8957 markings, 12794 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ERKPP_Phase3) AND (MEKPP + 1 <= Phase2) AND (2 <= 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 (((2 <= ERKPP_Phase3) AND (MEKPP + 1 <= Phase2) AND (2 <= MEK))))
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: ((2 <= ERKPP_Phase3) AND (MEKPP + 1 <= Phase2) AND (2 <= MEK))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 24 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((MEK <= 2) AND (ERKPP_Phase3 + 1 <= RasGTP) AND (2 <= MEK_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 (((MEK <= 2) AND (ERKPP_Phase3 + 1 <= RasGTP) AND (2 <= MEK_RafP))))
lola: processed formula length: 73
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: ((MEK <= 2) AND (ERKPP_Phase3 + 1 <= RasGTP) 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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33639 markings, 56936 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKP <= 2) AND (RafP + 1 <= RafP_Phase1) AND (Phase3 <= ERKP))))
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 <= 2) AND (RafP + 1 <= RafP_Phase1) AND (Phase3 <= ERKP))))
lola: processed formula length: 72
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 <= 2) AND (RafP + 1 <= RafP_Phase1) AND (Phase3 <= ERKP))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19215 markings, 23059 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((MEK <= ERKPP) AND (ERK_MEKPP <= ERKP))))
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 (((MEK <= ERKPP) AND (ERK_MEKPP <= ERKP))))
lola: processed formula length: 48
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: ((MEK <= ERKPP) AND (ERK_MEKPP <= ERKP))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5122 markings, 7680 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ERKP <= MEK) OR ((1 <= ERKPP) AND (RasGTP <= Raf_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 (((ERKP <= MEK) OR ((1 <= ERKPP) AND (RasGTP <= Raf_RasGTP)))))
lola: processed formula length: 69
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 + 1 <= ERKP) AND ((ERKPP <= 0) OR (Raf_RasGTP + 1 <= RasGTP)))
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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5131 markings, 7694 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= ERKPP_Phase3) AND (2 <= MEKP)) OR (MEK + 1 <= ERK) OR (MEKP_Phase2 <= 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 ((((1 <= ERKPP_Phase3) AND (2 <= MEKP)) OR (MEK + 1 <= ERK) OR (MEKP_Phase2 <= 1))))
lola: processed formula length: 91
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: (((ERKPP_Phase3 <= 0) OR (MEKP <= 1)) AND (ERK <= MEK) AND (2 <= MEKP_Phase2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ERK <= MEKP_RafP) AND ((ERK_MEKPP + 1 <= RasGTP) OR (ERKPP_Phase3 <= 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 (((ERK <= MEKP_RafP) AND ((ERK_MEKPP + 1 <= RasGTP) OR (ERKPP_Phase3 <= Raf)))))
lola: processed formula length: 86
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: ((ERK <= MEKP_RafP) AND ((ERK_MEKPP + 1 <= RasGTP) OR (ERKPP_Phase3 <= Raf)))
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-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: 7686 markings, 11526 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= MEKPP_Phase2) OR (ERKPP_Phase3 <= ERK) OR (2 <= Raf) OR (3 <= Phase3) OR ((ERKPP <= ERK) AND (1 <= MEK_RafP) AND (1 <= ERKPP)))))
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 (((1 <= MEKPP_Phase2) OR (ERKPP_Phase3 <= ERK) OR (2 <= Raf) OR (3 <= Phase3) OR ((ERKPP <= ERK) AND (1 <= MEK_RafP) AND (1 <= ERKPP)))))
lola: processed formula length: 146
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 <= 0) AND (ERK + 1 <= ERKPP_Phase3) AND (Raf <= 1) AND (Phase3 <= 2) AND ((ERK + 1 <= ERKPP) OR (MEK_RafP <= 0) OR (ERKPP <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 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: 20487 markings, 28166 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((ERKPP <= MEKP_Phase2) AND (MEK <= Raf)) OR (MEKP_RafP <= 2) OR (RafP <= ERK_MEKPP))))
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 ((((ERKPP <= MEKP_Phase2) AND (MEK <= Raf)) OR (MEKP_RafP <= 2) OR (RafP <= ERK_MEKPP))))
lola: processed formula length: 96
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_Phase2 + 1 <= ERKPP) OR (Raf + 1 <= MEK)) AND (3 <= MEKP_RafP) AND (ERK_MEKPP + 1 <= RafP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3858 markings, 5140 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Raf) AND (1 <= MEKP) AND ((Raf_RasGTP <= MEKP) OR (MEKP <= ERK)) AND (3 <= ERKP) AND (MEKP_RafP <= ERKP_MEKPP) AND (MEKP_RafP <= 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 (((2 <= Raf) AND (1 <= MEKP) AND ((Raf_RasGTP <= MEKP) OR (MEKP <= ERK)) AND (3 <= ERKP) AND (MEKP_RafP <= ERKP_MEKPP) AND (MEKP_RafP <= 0))))
lola: processed formula length: 148
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 <= Raf) AND (1 <= MEKP) AND ((Raf_RasGTP <= MEKP) OR (MEKP <= ERK)) AND (3 <= ERKP) AND (MEKP_RafP <= ERKP_MEKPP) AND (MEKP_RafP <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))))
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 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))))
lola: processed formula length: 117
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 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 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: sara is running 0 secs || 2995643 markings, 4619995 edges, 599129 markings/sec, 0 secs
lola: sara is running 5 secs || 5975012 markings, 9107335 edges, 595874 markings/sec, 5 secs
lola: sara is running 10 secs || 8906607 markings, 13519600 edges, 586319 markings/sec, 10 secs
lola: sara is running 15 secs || 11784958 markings, 17850209 edges, 575670 markings/sec, 15 secs
lola: sara is running 20 secs || 14697400 markings, 22231055 edges, 582488 markings/sec, 20 secs
lola: sara is running 25 secs || 17557012 markings, 26531457 edges, 571922 markings/sec, 25 secs
lola: sara is running 30 secs || 20393021 markings, 30796160 edges, 567202 markings/sec, 30 secs
lola: sara is running 35 secs || 23177065 markings, 34982191 edges, 556809 markings/sec, 35 secs
lola: sara is running 40 secs || 26020475 markings, 39256712 edges, 568682 markings/sec, 40 secs
lola: sara is running 45 secs || 28804075 markings, 43440905 edges, 556720 markings/sec, 45 secs
lola: sara is running 50 secs || 31574576 markings, 47605704 edges, 554100 markings/sec, 50 secs
lola: sara is running 55 secs || 34357043 markings, 51788088 edges, 556493 markings/sec, 55 secs
lola: sara is running 60 secs || 37100053 markings, 55910733 edges, 548602 markings/sec, 60 secs
lola: sara is running 65 secs || 39792389 markings, 59956967 edges, 538467 markings/sec, 65 secs
lola: sara is running 70 secs || 42673847 markings, 64287425 edges, 576292 markings/sec, 70 secs
lola: sara is running 75 secs || 45477405 markings, 68500065 edges, 560712 markings/sec, 75 secs
lola: sara is running 80 secs || 48251574 markings, 72669445 edges, 554834 markings/sec, 80 secs
lola: sara is running 85 secs || 50999083 markings, 76797708 edges, 549502 markings/sec, 85 secs
lola: sara is running 90 secs || 53788601 markings, 80989340 edges, 557904 markings/sec, 90 secs
lola: sara is running 95 secs || 56514226 markings, 85084757 edges, 545125 markings/sec, 95 secs
lola: sara is running 100 secs || 59249346 markings, 89194263 edges, 547024 markings/sec, 100 secs
lola: sara is running 105 secs || 61945508 markings, 93245512 edges, 539232 markings/sec, 105 secs
lola: sara is running 110 secs || 64746486 markings, 97454148 edges, 560196 markings/sec, 110 secs
lola: sara is running 115 secs || 67514282 markings, 101612003 edges, 553559 markings/sec, 115 secs
lola: sara is running 120 secs || 70257597 markings, 105733243 edges, 548663 markings/sec, 120 secs
lola: sara is running 125 secs || 72982166 markings, 109827338 edges, 544914 markings/sec, 125 secs
lola: sara is running 130 secs || 75702188 markings, 113913137 edges, 544004 markings/sec, 130 secs
lola: sara is running 135 secs || 78483087 markings, 118090879 edges, 556180 markings/sec, 135 secs
lola: sara is running 140 secs || 81262963 markings, 122267310 edges, 555975 markings/sec, 140 secs
lola: sara is running 145 secs || 83995309 markings, 126372420 edges, 546469 markings/sec, 145 secs
lola: sara is running 150 secs || 86734107 markings, 130486347 edges, 547760 markings/sec, 150 secs
lola: sara is running 155 secs || 89460322 markings, 134581750 edges, 545243 markings/sec, 155 secs
lola: sara is running 160 secs || 92146700 markings, 138616977 edges, 537276 markings/sec, 160 secs
lola: sara is running 165 secs || 95021944 markings, 142936447 edges, 575049 markings/sec, 165 secs
lola: sara is running 170 secs || 97914756 markings, 147281747 edges, 578562 markings/sec, 170 secs
lola: sara is running 175 secs || 100746695 markings, 151535266 edges, 566388 markings/sec, 175 secs
lola: sara is running 180 secs || 103598073 markings, 155818609 edges, 570276 markings/sec, 180 secs
lola: sara is running 185 secs || 106395101 markings, 160019722 edges, 559406 markings/sec, 185 secs
lola: sara is running 190 secs || 109211156 markings, 164249915 edges, 563211 markings/sec, 190 secs
lola: sara is running 195 secs || 112011612 markings, 168456066 edges, 560091 markings/sec, 195 secs
lola: sara is running 200 secs || 114731993 markings, 172542356 edges, 544076 markings/sec, 200 secs
lola: sara is running 205 secs || 117464370 markings, 176646291 edges, 546475 markings/sec, 205 secs
lola: sara is running 210 secs || 120221291 markings, 180787198 edges, 551384 markings/sec, 210 secs
lola: sara is running 215 secs || 123008672 markings, 184974161 edges, 557476 markings/sec, 215 secs
lola: sara is running 220 secs || 125757852 markings, 189103073 edges, 549836 markings/sec, 220 secs
lola: sara is running 225 secs || 128500456 markings, 193222454 edges, 548521 markings/sec, 225 secs
lola: sara is running 230 secs || 131203287 markings, 197281565 edges, 540566 markings/sec, 230 secs
lola: sara is running 235 secs || 134037748 markings, 201538887 edges, 566892 markings/sec, 235 secs
lola: sara is running 240 secs || 136828723 markings, 205730529 edges, 558195 markings/sec, 240 secs
lola: sara is running 245 secs || 139614350 markings, 209914078 edges, 557125 markings/sec, 245 secs
lola: sara is running 250 secs || 142346968 markings, 214018520 edges, 546524 markings/sec, 250 secs
lola: sara is running 255 secs || 145134686 markings, 218205271 edges, 557544 markings/sec, 255 secs
lola: sara is running 260 secs || 147877637 markings, 222325004 edges, 548590 markings/sec, 260 secs
lola: sara is running 265 secs || 150598608 markings, 226411380 edges, 544194 markings/sec, 265 secs
lola: sara is running 270 secs || 153281316 markings, 230440363 edges, 536542 markings/sec, 270 secs
lola: sara is running 275 secs || 156025719 markings, 234561990 edges, 548881 markings/sec, 275 secs
lola: sara is running 280 secs || 158785912 markings, 238706740 edges, 552039 markings/sec, 280 secs
lola: sara is running 285 secs || 161527224 markings, 242824451 edges, 548262 markings/sec, 285 secs
lola: sara is running 290 secs || 164225541 markings, 246876258 edges, 539663 markings/sec, 290 secs
lola: sara is running 295 secs || 166886312 markings, 250872509 edges, 532154 markings/sec, 295 secs
lola: sara is running 300 secs || 169631397 markings, 254994550 edges, 549017 markings/sec, 300 secs
lola: sara is running 305 secs || 172318805 markings, 259030921 edges, 537482 markings/sec, 305 secs
lola: sara is running 310 secs || 174993508 markings, 263047464 edges, 534941 markings/sec, 310 secs
lola: sara is running 315 secs || 177658564 markings, 267049664 edges, 533011 markings/sec, 315 secs
lola: sara is running 320 secs || 180318578 markings, 271044129 edges, 532003 markings/sec, 320 secs
lola: sara is running 325 secs || 183177759 markings, 275338342 edges, 571836 markings/sec, 325 secs
lola: sara is running 330 secs || 185983683 markings, 279551922 edges, 561185 markings/sec, 330 secs
lola: sara is running 335 secs || 188043378 markings, 282644774 edges, 411939 markings/sec, 335 secs
lola: sara is running 340 secs || 188047036 markings, 282649851 edges, 732 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))))
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 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))))
lola: processed formula length: 117
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 <= Raf) AND (Phase3 <= MEKP_Phase2) AND ((MEKPP_Phase2 <= Phase2) OR (ERK <= Phase2)) AND (RasGTP <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
lola: sara is running 0 secs || 2866974 markings, 4426193 edges, 573395 markings/sec, 0 secs
lola: sara is running 5 secs || 5926102 markings, 9033695 edges, 611826 markings/sec, 5 secs
lola: sara is running 10 secs || 8933373 markings, 13559911 edges, 601454 markings/sec, 10 secs
lola: sara is running 15 secs || 11872879 markings, 17982627 edges, 587901 markings/sec, 15 secs
lola: sara is running 20 secs || 14865271 markings, 22483462 edges, 598478 markings/sec, 20 secs
lola: sara is running 25 secs || 17730361 markings, 26792378 edges, 573018 markings/sec, 25 secs
lola: sara is running 30 secs || 20576421 markings, 31071895 edges, 569212 markings/sec, 30 secs
lola: sara is running 35 secs || 23373999 markings, 35278027 edges, 559516 markings/sec, 35 secs
lola: sara is running 40 secs || 26272030 markings, 39635065 edges, 579606 markings/sec, 40 secs
lola: sara is running 45 secs || 29106921 markings, 43896702 edges, 566978 markings/sec, 45 secs
lola: sara is running 50 secs || 31925725 markings, 48133648 edges, 563761 markings/sec, 50 secs
lola: sara is running 55 secs || 34741647 markings, 52365979 edges, 563184 markings/sec, 55 secs
lola: sara is running 60 secs || 37536045 markings, 56565766 edges, 558880 markings/sec, 60 secs
lola: sara is running 65 secs || 40329441 markings, 60763979 edges, 558679 markings/sec, 65 secs
lola: sara is running 70 secs || 43234422 markings, 65130026 edges, 580996 markings/sec, 70 secs
lola: sara is running 75 secs || 46078341 markings, 69403403 edges, 568784 markings/sec, 75 secs
lola: sara is running 80 secs || 48886162 markings, 73622642 edges, 561564 markings/sec, 80 secs
lola: sara is running 85 secs || 51696319 markings, 77845292 edges, 562031 markings/sec, 85 secs
lola: sara is running 90 secs || 54515188 markings, 82081191 edges, 563774 markings/sec, 90 secs
lola: sara is running 95 secs || 57295498 markings, 86258723 edges, 556062 markings/sec, 95 secs
lola: sara is running 100 secs || 60062595 markings, 90416045 edges, 553419 markings/sec, 100 secs
lola: sara is running 105 secs || 62767574 markings, 94480656 edges, 540996 markings/sec, 105 secs
lola: sara is running 110 secs || 65612555 markings, 98755327 edges, 568996 markings/sec, 110 secs
lola: sara is running 115 secs || 68381609 markings, 102915023 edges, 553811 markings/sec, 115 secs
lola: sara is running 120 secs || 71128218 markings, 107041710 edges, 549322 markings/sec, 120 secs
lola: sara is running 125 secs || 73855988 markings, 111139551 edges, 545554 markings/sec, 125 secs
lola: sara is running 130 secs || 76531745 markings, 115159796 edges, 535151 markings/sec, 130 secs
lola: sara is running 135 secs || 79314814 markings, 119340625 edges, 556614 markings/sec, 135 secs
lola: sara is running 140 secs || 82042024 markings, 123438015 edges, 545442 markings/sec, 140 secs
lola: sara is running 145 secs || 84704087 markings, 127436567 edges, 532413 markings/sec, 145 secs
lola: sara is running 150 secs || 87429472 markings, 131530745 edges, 545077 markings/sec, 150 secs
lola: sara is running 155 secs || 90118049 markings, 135569746 edges, 537715 markings/sec, 155 secs
lola: sara is running 160 secs || 92749995 markings, 139522942 edges, 526389 markings/sec, 160 secs
lola: sara is running 165 secs || 95662967 markings, 143899289 edges, 582594 markings/sec, 165 secs
lola: sara is running 170 secs || 98493217 markings, 148150529 edges, 566050 markings/sec, 170 secs
lola: sara is running 175 secs || 101281366 markings, 152338775 edges, 557630 markings/sec, 175 secs
lola: sara is running 180 secs || 104081841 markings, 156545177 edges, 560095 markings/sec, 180 secs
lola: sara is running 185 secs || 106862438 markings, 160722250 edges, 556119 markings/sec, 185 secs
lola: sara is running 190 secs || 109606980 markings, 164844305 edges, 548908 markings/sec, 190 secs
lola: sara is running 195 secs || 112361757 markings, 168981918 edges, 550955 markings/sec, 195 secs
lola: sara is running 200 secs || 115123083 markings, 173129598 edges, 552265 markings/sec, 200 secs
lola: sara is running 205 secs || 117880320 markings, 177271567 edges, 551447 markings/sec, 205 secs
lola: sara is running 210 secs || 120579774 markings, 181325862 edges, 539891 markings/sec, 210 secs
lola: sara is running 215 secs || 123309376 markings, 185425525 edges, 545920 markings/sec, 215 secs
lola: sara is running 220 secs || 125991632 markings, 189453733 edges, 536451 markings/sec, 220 secs
lola: sara is running 225 secs || 128677264 markings, 193487463 edges, 537126 markings/sec, 225 secs
lola: sara is running 230 secs || 131105430 markings, 197135047 edges, 485633 markings/sec, 230 secs
lola: sara is running 235 secs || 133939568 markings, 201391304 edges, 566828 markings/sec, 235 secs
lola: sara is running 240 secs || 136739747 markings, 205596845 edges, 560036 markings/sec, 240 secs
lola: sara is running 245 secs || 139529334 markings, 209786663 edges, 557917 markings/sec, 245 secs
lola: sara is running 250 secs || 142264991 markings, 213895551 edges, 547131 markings/sec, 250 secs
lola: sara is running 255 secs || 145054759 markings, 218085364 edges, 557954 markings/sec, 255 secs
lola: sara is running 260 secs || 147790880 markings, 222194962 edges, 547224 markings/sec, 260 secs
lola: sara is running 265 secs || 150504457 markings, 226269936 edges, 542715 markings/sec, 265 secs
lola: sara is running 270 secs || 153195726 markings, 230311775 edges, 538254 markings/sec, 270 secs
lola: sara is running 275 secs || 155939926 markings, 234432844 edges, 548840 markings/sec, 275 secs
lola: sara is running 280 secs || 158706363 markings, 238587315 edges, 553287 markings/sec, 280 secs
lola: sara is running 285 secs || 161449766 markings, 242707982 edges, 548681 markings/sec, 285 secs
lola: sara is running 290 secs || 164149493 markings, 246762153 edges, 539945 markings/sec, 290 secs
lola: sara is running 295 secs || 166813265 markings, 250762591 edges, 532754 markings/sec, 295 secs
lola: sara is running 300 secs || 169566805 markings, 254897998 edges, 550708 markings/sec, 300 secs
lola: sara is running 305 secs || 172257388 markings, 258938408 edges, 538117 markings/sec, 305 secs
lola: sara is running 310 secs || 174937494 markings, 262963491 edges, 536021 markings/sec, 310 secs
lola: sara is running 315 secs || 177606534 markings, 266971790 edges, 533808 markings/sec, 315 secs
lola: sara is running 320 secs || 180261753 markings, 270958784 edges, 531044 markings/sec, 320 secs
lola: sara is running 325 secs || 183126192 markings, 275260727 edges, 572888 markings/sec, 325 secs
lola: sara is running 330 secs || 185940507 markings, 279487399 edges, 562863 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes no yes unknown no yes yes no
lola:
preliminary result: yes yes yes yes no no no no yes no yes unknown no yes yes no
lola: memory consumption: 21540 KB
lola: time consumption: 691 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552894356367
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-05120"
export BK_EXAMINATION="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-05120, 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-155246584400332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-05120.tgz
mv MAPK-PT-05120 execution
cd execution
if [ "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 ;