About the Execution of 2019-Gold for EGFr-PT-02010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4264.190 | 5972.00 | 9157.00 | 12.50 | FTTFTTFFFFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411900186.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411900186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.0K May 13 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 13 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 13 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 59K May 12 20:53 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 EGFr-PT-02010-00
FORMULA_NAME EGFr-PT-02010-01
FORMULA_NAME EGFr-PT-02010-02
FORMULA_NAME EGFr-PT-02010-03
FORMULA_NAME EGFr-PT-02010-04
FORMULA_NAME EGFr-PT-02010-05
FORMULA_NAME EGFr-PT-02010-06
FORMULA_NAME EGFr-PT-02010-07
FORMULA_NAME EGFr-PT-02010-08
FORMULA_NAME EGFr-PT-02010-09
FORMULA_NAME EGFr-PT-02010-10
FORMULA_NAME EGFr-PT-02010-11
FORMULA_NAME EGFr-PT-02010-12
FORMULA_NAME EGFr-PT-02010-13
FORMULA_NAME EGFr-PT-02010-14
FORMULA_NAME EGFr-PT-02010-15
=== Now, execution of the tool begins
BK_START 1590651108270
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ EGFr-PT-02010 @ 3570 seconds
FORMULA EGFr-PT-02010-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA EGFr-PT-02010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ EGFr-PT-02010
{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 28 07:31:48 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((X (F ((NOT FIREABLE(EGF_equals_0_to_EGF_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))) OR (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)) OR (G (FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0)) AND F (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))))))",
"processed_size": 334,
"rewrites": 110
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G (F (((FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1)) AND X (FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1))))))",
"processed_size": 210,
"rewrites": 110
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G (F (((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1)) OR X (X (G ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1)))))))))",
"processed_size": 299,
"rewrites": 110
},
"result":
{
"edges": 48639,
"markings": 7124,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (X (F ((X (X (X (F ((FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1) OR X (FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0))))))) R NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)))))",
"processed_size": 233,
"rewrites": 110
},
"result":
{
"edges": 33110,
"markings": 4262,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((F ((FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) R (NOT FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) OR NOT FIREABLE(p21_equals_0_to_p21_equals_1_when_AKT1_equals_0_and_CDK4_equals_0_and_MYC_equals_0)))) U X (F (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0)))))",
"processed_size": 412,
"rewrites": 110
},
"result":
{
"edges": 19619,
"markings": 3299,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (F ((G (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1)) AND X ((NOT FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_CyclinD1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))))))",
"processed_size": 229,
"rewrites": 110
},
"result":
{
"edges": 49154,
"markings": 6437,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (X (NOT FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1)))",
"processed_size": 75,
"rewrites": 110
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (X (X ((NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR (G (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_MYC_equals_0)) AND F (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1)))))))",
"processed_size": 237,
"rewrites": 110
},
"result":
{
"edges": 21,
"markings": 16,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((X (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1)) U FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))",
"processed_size": 175,
"rewrites": 110
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))",
"processed_size": 109,
"rewrites": 112
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"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": 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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1)))",
"processed_size": 72,
"rewrites": 112
},
"result":
{
"edges": 111,
"markings": 72,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G (F ((NOT FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1) R NOT FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)))))",
"processed_size": 151,
"rewrites": 110
},
"result":
{
"edges": 44827,
"markings": 7715,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR F (G ((FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0) AND FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1))))))",
"processed_size": 205,
"rewrites": 110
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A ((F ((FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) OR FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1))) OR ((FIREABLE(ERBB2_equals_1_to_ERBB2_equals_0_when_EGF_equals_0) OR FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)) AND (F (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) AND G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1))))))",
"processed_size": 471,
"rewrites": 110
},
"result":
{
"edges": 36263,
"markings": 7105,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)))",
"processed_size": 72,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0)))",
"processed_size": 74,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)))",
"processed_size": 97,
"rewrites": 112
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15212,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) AND A(G(**))) : A((X(F(**)) OR (G(**) OR (G(**) AND F(G(**)))))) : A(G(F((* R *)))) : A(G(F((** AND X(**))))) : A(G(F((** OR X(X(G(**))))))) : A(X(F((X(X(X(F((** OR X(**)))))) R *)))) : A((** OR F(G(*)))) : A(G(**)) : (A(G(*)) AND (A(G(*)) AND A(G((G((* AND G(*))) OR G(F(*))))))) : A((F((* R *)) U X(F(**)))) : A((F((** OR **)) OR (** AND (F(**) AND G(**))))) : A(G(*)) : A(F((G(*) AND X(*)))) : (A(G(**)) AND A(G((G(**) OR F(**))))) : (A(X(**)) AND A(X(X((** OR (G(**) AND F(**))))))) : A((X(**) U **))"
},
"net":
{
"arcs": 338,
"conflict_clusters": 1,
"places": 40,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 68
},
"result":
{
"preliminary_value": "no yes yes no yes yes no no no no yes no yes no yes no ",
"value": "no yes yes no yes yes no no no no yes no yes no 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: 108/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40
lola: finding significant places
lola: 40 places, 68 transitions, 20 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: A (((NOT((G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) U G (FIREABLE(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0)))) U F (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1))) AND G ((FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) AND G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)))))) : A ((F (X ((NOT FIREABLE(EGF_equals_0_to_EGF_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))) OR (G (FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0)) U G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1))))) : A (X (G (F (NOT(X ((FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1) U FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)))))))) : A (G (F (((FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1)) AND X (FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1)))))) : A (X (G (F (((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1)) OR X (G (X ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1)))))))))) : A (F (NOT(X ((X (G (X (G (X (NOT((FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1) OR X (FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0))))))))) U FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)))))) : A ((FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR NOT(X (((FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1) OR FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)) U F (G (F ((NOT FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)))))))))) : A (G (NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1))) : A (NOT(F ((G (F (NOT(F (NOT(X (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1))))))) U (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR F (FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1))))))) : A ((F (NOT((NOT FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) U (FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) AND FIREABLE(p21_equals_0_to_p21_equals_1_when_AKT1_equals_0_and_CDK4_equals_0_and_MYC_equals_0))))) U X (F (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0))))) : A (((F (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) OR F (FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1))) OR (((FIREABLE(ERBB2_equals_1_to_ERBB2_equals_0_when_EGF_equals_0) OR FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)) AND F (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1))) AND G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1))))) : A (NOT(F (FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))) : A (NOT(G ((F (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1)) OR X ((FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_CyclinD1_equals_0) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))))))) : A (G ((FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0) AND NOT(F (NOT((G (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_3_equals_1)) OR (FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB3_equals_0) U F (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1)))))))))) : A (X ((NOT FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1) AND X ((G (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_MYC_equals_0)) U NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1)))))) : A ((X (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1)) U FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:491
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((NOT FIREABLE(EGF_equals_0_to_EGF_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))) OR (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)) OR (G (FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0)) AND F (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((NOT FIREABLE(EGF_equals_0_to_EGF_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))) OR (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)) OR (G (FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0)) AND F (G (FIREABLE(p27_equals_1_to_p27_equals_0_when_MYC_equals_1)))))))
lola: processed formula length: 334
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1)) AND X (FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1)) AND X (FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1))))))
lola: processed formula length: 210
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1)) OR X (X (G ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1)) OR X (X (G ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1)))))))))
lola: processed formula length: 299
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7124 markings, 48639 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((X (X (X (F ((FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1) OR X (FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0))))))) R NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((X (X (X (F ((FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1) OR X (FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0))))))) R NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1)))))
lola: processed formula length: 233
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4262 markings, 33110 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) R (NOT FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) OR NOT FIREABLE(p21_equals_0_to_p21_equals_1_when_AKT1_equals_0_and_CDK4_equals_0_and_MYC_equals_0)))) U X (F (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_e... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) R (NOT FIREABLE(CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0) OR NOT FIREABLE(p21_equals_0_to_p21_equals_1_when_AKT1_equals_0_and_CDK4_equals_0_and_MYC_equals_0)))) U X (F (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_e... (shortened)
lola: processed formula length: 412
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3299 markings, 19619 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1)) AND X ((NOT FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_CyclinD1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1)) AND X ((NOT FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_CyclinD1_equals_0) OR NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))))))
lola: processed formula length: 229
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6437 markings, 49154 edges
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (NOT FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1))) AND A (X (X ((NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR (G (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_MYC_equals_0)) AND F (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1)))
lola: processed formula length: 75
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR (G (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_MYC_equals_0)) AND F (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR (G (FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_MYC_equals_0)) AND F (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1)))))))
lola: processed formula length: 237
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1)) U FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1)) U FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))
lola: processed formula length: 175
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))
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:788
lola: processed formula: A (G (NOT FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)))
lola: processed formula length: 109
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0)
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 LTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_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 (NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1)))
lola: processed formula length: 72
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 72 markings, 111 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((NOT FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1) R NOT FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NOT FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1) R NOT FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)))))
lola: processed formula length: 151
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7715 markings, 44827 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR F (G ((FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0) AND FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR F (G ((FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0) AND FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1))))))
lola: processed formula length: 205
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) OR FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1))) OR ((FIREABLE(ERBB2_equals_1_to_ERBB2_equals_0_when_EGF_equals_0) OR FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)) AND (F (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) AND G... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) OR FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1))) OR ((FIREABLE(ERBB2_equals_1_to_ERBB2_equals_0_when_EGF_equals_0) OR FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)) AND (F (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) AND G... (shortened)
lola: processed formula length: 471
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7105 markings, 36263 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1))) AND A (G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_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 (FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)))
lola: processed formula length: 72
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: NOT FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0))) AND A (G ((G (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_3_equals_1)) OR F (FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0)))
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 (FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0)))
lola: processed formula length: 74
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: NOT FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB3_equals_0)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: try reading problem file LTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1))) AND (A (G (NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1))) AND A (G ((G ((NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) AND G (NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)))) OR G (F (NOT FIREABLE(MEK1_equals... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_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:788
lola: processed formula: A (G (NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)))
lola: processed formula length: 97
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to LTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no no no no yes no yes no yes no
lola:
preliminary result: no yes yes no yes yes no no no no yes no yes no yes no
lola: memory consumption: 15212 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
BK_STOP 1590651114242
--------------------
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="EGFr-PT-02010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is EGFr-PT-02010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-csrt-159033411900186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;