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-155246584400355.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 MAPKbis-PT-5320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584400355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 4.5K Feb 11 22:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 22:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 7 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 7 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K Feb 5 00:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 4 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 1 00:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 1 00:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 5 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 166K 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 MAPKbis-PT-5320-CTLCardinality-00
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-01
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-02
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-03
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-04
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-05
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-06
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-07
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-08
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-09
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-10
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-11
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-12
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-13
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-14
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552909011739

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ MAPKbis-PT-5320 @ 3570 seconds

FORMULA MAPKbis-PT-5320-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3061
rslt: Output for CTLCardinality @ MAPKbis-PT-5320

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 11:36:51 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": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 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": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= AKT_equals_1)))",
"processed_size": 27,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= TAK1_equals_1)))",
"processed_size": 28,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"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": 1,
"problems": 1
},
"type": "reachability",
"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": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((GADD45_equals_1 <= PLCG_equals_0))))",
"processed_size": 44,
"rewrites": 72
},
"result":
{
"edges": 53367389,
"markings": 8083745,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((GAB1_equals_0 + 1 <= GADD45_equals_1)))",
"processed_size": 46,
"rewrites": 71
},
"result":
{
"edges": 53367389,
"markings": 8083745,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 847
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(FOXO3_equals_1 <= PTEN_equals_0)",
"processed_size": 33,
"rewrites": 74
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1130
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF((AG((GRB2_equals_1 <= JNK_equals_1)) OR ((GAB1_equals_0 <= MSK_equals_1) OR ((PTEN_equals_0 <= ATF2_equals_1) AND (SMAD_equals_1 <= GADD45_equals_1)))))",
"processed_size": 156,
"rewrites": 72
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 101580802,
"markings": 8126465,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1619
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1619
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((Proliferation_equals_0 <= 0) AND (AKT_0 <= 0))",
"processed_size": 48,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3239
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))",
"processed_size": 107,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((GAB1_equals_0 <= 0) R (PI3K_equals_1 <= 0)))",
"processed_size": 49,
"rewrites": 75
},
"result":
{
"edges": 101580801,
"markings": 8126465,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))",
"processed_size": 107,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25388,
"runtime": 509.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : TRUE : A(F((A(G(**)) OR **))) : E(F(A(G(**)))) : FALSE : (A((* R *)) AND (** OR A(G(**)))) : FALSE : E(F(**)) : TRUE : E(F(*)) : FALSE : TRUE : FALSE : A(G(**)) : (** AND (** AND E(F(**)))) : E(F(**))"
},
"net":
{
"arcs": 986,
"conflict_clusters": 1,
"places": 106,
"places_significant": 49,
"singleton_clusters": 0,
"transitions": 173
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no no yes no no yes no yes no no ",
"value": "yes yes yes yes no yes no no yes no no yes no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 279/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 173 transitions, 49 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 CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= Growth_Arrest_equals_1)
lola: LP says that atomic proposition is always false: (2 <= BCL2_equals_0)
lola: LP says that atomic proposition is always false: (2 <= Proliferation_equals_1)
lola: LP says that atomic proposition is always false: (3 <= RAS_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (FGFR3_stimulus_equals_0 <= PI3K_equals_1)
lola: after: (1 <= PI3K_equals_1)
lola: LP says that atomic proposition is always false: (2 <= MSK_equals_1)
lola: LP says that atomic proposition is always false: (3 <= ATF2_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (Apoptosis_equals_1 <= EGFR_stimulus_equals_1)
lola: after: (Apoptosis_equals_1 <= 0)
lola: LP says that atomic proposition is always false: (3 <= TGFBR_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (TGFBR_equals_0 <= EGFR_stimulus_equals_0)
lola: after: (TGFBR_equals_0 <= 1)
lola: LP says that atomic proposition is always true: (TGFBR_equals_0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= FGFR3_stimulus_equals_1)
lola: after: (2 <= 0)
lola: LP says that atomic proposition is always false: (3 <= p21_equals_1)
lola: LP says that atomic proposition is always false: (2 <= ATM_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (EGFR_equals_1 <= TGFBR_stimulus_equals_0)
lola: after: (EGFR_equals_1 <= 1)
lola: LP says that atomic proposition is always true: (EGFR_equals_1 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p14_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= FGFR3_stimulus_equals_0)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= GAB1_equals_0)
lola: LP says that atomic proposition is always false: (3 <= DUSP1_equals_0)
lola: LP says that atomic proposition is always false: (3 <= PI3K_equals_1)
lola: LP says that atomic proposition is always false: (3 <= p70_equals_1)
lola: LP says that atomic proposition is always false: (3 <= AP1_equals_0)
lola: LP says that atomic proposition is always false: (3 <= MTK1_equals_1)
lola: LP says that atomic proposition is always false: (2 <= SOS_equals_1)
lola: LP says that atomic proposition is always false: (2 <= MEK1_2_equals_0)
lola: A (X (A (G ((Growth_Arrest_equals_1 <= 1))))) : NOT(((DUSP1_equals_1 <= Apoptosis_equals_0) AND (A (F ((TGFBR_equals_1 <= PI3K_equals_1))) AND E (F ((2 <= BCL2_equals_0)))))) : A (F ((A (G ((GRB2_equals_1 <= JNK_equals_1))) OR ((GAB1_equals_0 <= MSK_equals_1) OR ((PTEN_equals_0 <= ATF2_equals_1) AND (SMAD_equals_1 <= GADD45_equals_1)))))) : E (F (A (G ((PTEN_equals_0 + 1 <= FOXO3_equals_1))))) : NOT(NOT((E (F ((3 <= RAS_equals_1))) AND A (G ((1 <= GRB2_equals_0)))))) : (NOT(E (((1 <= GAB1_equals_0) U (1 <= PI3K_equals_1)))) AND ((2 <= MSK_equals_1) OR ((((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0))) OR A (G ((FOS_equals_0 <= MDM2_equals_0)))))) : (E (F (())) OR (((FOXO3_equals_1 <= MDM2_equals_1) AND (SMAD_equals_0 + 1 <= BCL2_equals_0) AND (((1 <= MSK_equals_0) AND (JUN_equals_0 <= p14_equals_0)))) AND E (((p70_equals_0 <= RSK_equals_1) U (2 <= ATM_equals_1))))) : E (F ((1 <= AKT_equals_1))) : A (G (E (G (())))) : NOT(A (G ((GADD45_equals_1 <= GAB1_equals_0)))) : E (G (E (((PI3K_equals_1 <= AKT_0) U (3 <= p14_equals_0))))) : A (G (E (F (())))) : A (F (((3 <= GAB1_equals_0) OR E (F ((3 <= DUSP1_equals_0)))))) : (E (G (E (G ((3 <= PI3K_equals_1))))) OR A (G (((GADD45_equals_1 <= PLCG_equals_0))))) : (E (((3 <= AP1_equals_0) U ((ELK1_equals_1 <= p70_equals_0)))) AND ((((Proliferation_equals_0 <= 0) AND (AKT_0 <= 0)) AND E (F ((MEK1_2_equals_1 <= TAOK_equals_0)))) OR (E (F ((2 <= SOS_equals_1))) AND (p70_equals_1 <= MSK_equals_0)))) : E ((() U (1 <= TAK1_equals_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: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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: 70 rewrites
lola: closed formula file CTLCardinality.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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 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: 70 rewrites
lola: closed formula file CTLCardinality.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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 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: 70 rewrites
lola: closed formula file CTLCardinality.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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= AKT_equals_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 ((1 <= AKT_equals_1)))
lola: processed formula length: 27
lola: 71 rewrites
lola: closed formula file CTLCardinality.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: (1 <= AKT_equals_1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= TAK1_equals_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 ((1 <= TAK1_equals_1)))
lola: processed formula length: 28
lola: 71 rewrites
lola: closed formula file CTLCardinality.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: (1 <= TAK1_equals_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((GADD45_equals_1 <= PLCG_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 (((GADD45_equals_1 <= PLCG_equals_0))))
lola: processed formula length: 44
lola: 72 rewrites
lola: closed formula file CTLCardinality.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: ((PLCG_equals_0 + 1 <= GADD45_equals_1))
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 CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1802)
lola: sara is running 0 secs || 905284 markings, 2478224 edges, 181057 markings/sec, 0 secs
lola: sara is running 5 secs || 1629646 markings, 5252498 edges, 144872 markings/sec, 5 secs
lola: sara is running 10 secs || 2201553 markings, 8218439 edges, 114381 markings/sec, 10 secs
lola: sara is running 15 secs || 2777915 markings, 11183677 edges, 115272 markings/sec, 15 secs
lola: sara is running 20 secs || 3339025 markings, 14121916 edges, 112222 markings/sec, 20 secs
lola: sara is running 25 secs || 3825275 markings, 17533763 edges, 97250 markings/sec, 25 secs
lola: sara is running 30 secs || 4165646 markings, 21037078 edges, 68074 markings/sec, 30 secs
lola: sara is running 35 secs || 4178915 markings, 24740933 edges, 2654 markings/sec, 35 secs
lola: sara is running 40 secs || 4924840 markings, 27711973 edges, 149185 markings/sec, 40 secs
lola: sara is running 45 secs || 5548582 markings, 30675834 edges, 124748 markings/sec, 45 secs
lola: sara is running 50 secs || 6100726 markings, 33596940 edges, 110429 markings/sec, 50 secs
lola: sara is running 55 secs || 6608091 markings, 36331157 edges, 101473 markings/sec, 55 secs
lola: sara is running 60 secs || 7088499 markings, 38936848 edges, 96082 markings/sec, 60 secs
lola: sara is running 65 secs || 7531617 markings, 41609157 edges, 88624 markings/sec, 65 secs
lola: sara is running 70 secs || 7899268 markings, 44428933 edges, 73530 markings/sec, 70 secs
lola: sara is running 75 secs || 8060777 markings, 47665137 edges, 32302 markings/sec, 75 secs
lola: sara is running 80 secs || 8083408 markings, 50905286 edges, 4526 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8083745 markings, 53367389 edges
lola: ========================================
lola: subprocess 11 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((GAB1_equals_0 + 1 <= GADD45_equals_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 ((GAB1_equals_0 + 1 <= GADD45_equals_1)))
lola: processed formula length: 46
lola: 71 rewrites
lola: closed formula file CTLCardinality.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: (GAB1_equals_0 + 1 <= GADD45_equals_1)
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 CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 933386 markings, 2562145 edges, 186677 markings/sec, 0 secs
lola: sara is running 5 secs || 1692210 markings, 5483054 edges, 151765 markings/sec, 5 secs
lola: sara is running 10 secs || 2283755 markings, 8599302 edges, 118309 markings/sec, 10 secs
lola: sara is running 15 secs || 2891751 markings, 11710557 edges, 121599 markings/sec, 15 secs
lola: sara is running 20 secs || 3442342 markings, 14726116 edges, 110118 markings/sec, 20 secs
lola: sara is running 25 secs || 3883324 markings, 17954398 edges, 88196 markings/sec, 25 secs
lola: sara is running 30 secs || 4172029 markings, 21530737 edges, 57741 markings/sec, 30 secs
lola: sara is running 35 secs || 4178951 markings, 25231619 edges, 1384 markings/sec, 35 secs
lola: sara is running 40 secs || 4996676 markings, 28017244 edges, 163545 markings/sec, 40 secs
lola: sara is running 45 secs || 5604832 markings, 30947582 edges, 121631 markings/sec, 45 secs
lola: sara is running 50 secs || 6144257 markings, 33850980 edges, 107885 markings/sec, 50 secs
lola: sara is running 55 secs || 6674450 markings, 36679974 edges, 106039 markings/sec, 55 secs
lola: sara is running 60 secs || 7176389 markings, 39479364 edges, 100388 markings/sec, 60 secs
lola: sara is running 65 secs || 7642324 markings, 42341945 edges, 93187 markings/sec, 65 secs
lola: sara is running 70 secs || 7996239 markings, 45503344 edges, 70783 markings/sec, 70 secs
lola: sara is running 75 secs || 8074793 markings, 48882259 edges, 15711 markings/sec, 75 secs
lola: sara is running 80 secs || 8083722 markings, 52359017 edges, 1786 markings/sec, 80 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 8083745 markings, 53367389 edges
lola: subprocess 12 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((PTEN_equals_0 + 1 <= FOXO3_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (FOXO3_equals_1 <= PTEN_equals_0)
lola: processed formula length: 33
lola: 74 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (PTEN_equals_0 + 1 <= FOXO3_equals_1)
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 CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: ========================================
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (FOXO3_equals_1 <= PTEN_equals_0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: subprocess 13 will run for 1130 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((GRB2_equals_1 <= JNK_equals_1))) OR ((GAB1_equals_0 <= MSK_equals_1) OR ((PTEN_equals_0 <= ATF2_equals_1) AND (SMAD_equals_1 <= GADD45_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG((GRB2_equals_1 <= JNK_equals_1)) OR ((GAB1_equals_0 <= MSK_equals_1) OR ((PTEN_equals_0 <= ATF2_equals_1) AND (SMAD_equals_1 <= GADD45_equals_1)))))
lola: processed formula length: 156
lola: 72 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 725393 markings, 4174362 edges, 145079 markings/sec, 0 secs
lola: 1238822 markings, 8105928 edges, 102686 markings/sec, 5 secs
lola: 1709728 markings, 11912422 edges, 94181 markings/sec, 10 secs
lola: 2137062 markings, 15617975 edges, 85467 markings/sec, 15 secs
lola: 2522928 markings, 19325688 edges, 77173 markings/sec, 20 secs
lola: 2882617 markings, 22960396 edges, 71938 markings/sec, 25 secs
lola: 3234653 markings, 26551893 edges, 70407 markings/sec, 30 secs
lola: 3573241 markings, 30037866 edges, 67718 markings/sec, 35 secs
lola: 3877414 markings, 33671174 edges, 60835 markings/sec, 40 secs
lola: 4137698 markings, 37623604 edges, 52057 markings/sec, 45 secs
lola: 4185933 markings, 40904401 edges, 9647 markings/sec, 50 secs
lola: 4186140 markings, 43933162 edges, 41 markings/sec, 55 secs
lola: 4186150 markings, 47020575 edges, 2 markings/sec, 60 secs
lola: 4186152 markings, 50264113 edges, 0 markings/sec, 65 secs
lola: 4826065 markings, 54035321 edges, 127983 markings/sec, 70 secs
lola: 5366514 markings, 57496778 edges, 108090 markings/sec, 75 secs
lola: 5823899 markings, 60814121 edges, 91477 markings/sec, 80 secs
lola: 6244812 markings, 64028087 edges, 84183 markings/sec, 85 secs
lola: 6616268 markings, 67207650 edges, 74291 markings/sec, 90 secs
lola: 6956977 markings, 70419432 edges, 68142 markings/sec, 95 secs
lola: 7269346 markings, 73662671 edges, 62474 markings/sec, 100 secs
lola: 7554059 markings, 76942412 edges, 56943 markings/sec, 105 secs
lola: 7810816 markings, 80251293 edges, 51351 markings/sec, 110 secs
lola: 8033804 markings, 83651346 edges, 44598 markings/sec, 115 secs
lola: 8126217 markings, 86698109 edges, 18483 markings/sec, 120 secs
lola: 8126413 markings, 89416145 edges, 39 markings/sec, 125 secs
lola: 8126456 markings, 92145930 edges, 9 markings/sec, 130 secs
lola: 8126461 markings, 94927296 edges, 1 markings/sec, 135 secs
lola: 8126465 markings, 97744995 edges, 1 markings/sec, 140 secs
lola: 8126465 markings, 100726944 edges, 0 markings/sec, 145 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8126465 markings, 101580802 edges
lola: ========================================
lola: subprocess 14 will run for 1619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((ELK1_equals_1 <= p70_equals_0)) AND (((Proliferation_equals_0 <= 0) AND (AKT_0 <= 0)) AND E (F ((MEK1_2_equals_1 <= TAOK_equals_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Proliferation_equals_0 <= 0) AND (AKT_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Proliferation_equals_0 <= 0) AND (AKT_0 <= 0))
lola: processed formula length: 48
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((GAB1_equals_0 <= 0) R (PI3K_equals_1 <= 0))) AND ((((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0))) OR A (G ((FOS_equals_0 <= MDM2_equals_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))
lola: processed formula length: 107
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (((GAB1_equals_0 <= 0) R (PI3K_equals_1 <= 0))) AND ((((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0))) OR A (G ((FOS_equals_0 <= MDM2_equals_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((GAB1_equals_0 <= 0) R (PI3K_equals_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((GAB1_equals_0 <= 0) R (PI3K_equals_1 <= 0)))
lola: processed formula length: 49
lola: 75 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: (1 <= PI3K_equals_1)
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 CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 599333 markings, 3388962 edges, 119867 markings/sec, 0 secs
lola: sara is running 5 secs || 1065564 markings, 6695777 edges, 93246 markings/sec, 5 secs
lola: sara is running 10 secs || 1459966 markings, 9931884 edges, 78880 markings/sec, 10 secs
lola: sara is running 15 secs || 1845917 markings, 13046627 edges, 77190 markings/sec, 15 secs
lola: sara is running 20 secs || 2191669 markings, 16160970 edges, 69150 markings/sec, 20 secs
lola: sara is running 25 secs || 2513608 markings, 19226289 edges, 64388 markings/sec, 25 secs
lola: sara is running 30 secs || 2795534 markings, 22044058 edges, 56385 markings/sec, 30 secs
lola: sara is running 35 secs || 3060119 markings, 24853524 edges, 52917 markings/sec, 35 secs
lola: sara is running 40 secs || 3341071 markings, 27577392 edges, 56190 markings/sec, 40 secs
lola: sara is running 45 secs || 3597074 markings, 30310169 edges, 51201 markings/sec, 45 secs
lola: sara is running 50 secs || 3831412 markings, 33106218 edges, 46868 markings/sec, 50 secs
lola: sara is running 55 secs || 4034299 markings, 35889637 edges, 40577 markings/sec, 55 secs
lola: sara is running 60 secs || 4181760 markings, 39131545 edges, 29492 markings/sec, 60 secs
lola: sara is running 65 secs || 4186047 markings, 41976917 edges, 857 markings/sec, 65 secs
lola: sara is running 70 secs || 4186148 markings, 44825059 edges, 20 markings/sec, 70 secs
lola: sara is running 75 secs || 4186150 markings, 47771930 edges, 0 markings/sec, 75 secs
lola: sara is running 80 secs || 4186152 markings, 50666283 edges, 0 markings/sec, 80 secs
lola: sara is running 85 secs || 4732000 markings, 53482121 edges, 109170 markings/sec, 85 secs
lola: sara is running 90 secs || 5210462 markings, 56451154 edges, 95692 markings/sec, 90 secs
lola: sara is running 95 secs || 5621543 markings, 59293835 edges, 82216 markings/sec, 95 secs
lola: sara is running 100 secs || 5994387 markings, 62085901 edges, 74569 markings/sec, 100 secs
lola: sara is running 105 secs || 6340993 markings, 64806703 edges, 69321 markings/sec, 105 secs
lola: sara is running 110 secs || 6650852 markings, 67527436 edges, 61972 markings/sec, 110 secs
lola: sara is running 115 secs || 6939156 markings, 70245541 edges, 57661 markings/sec, 115 secs
lola: sara is running 120 secs || 7204582 markings, 72971613 edges, 53085 markings/sec, 120 secs
lola: sara is running 125 secs || 7451133 markings, 75706680 edges, 49310 markings/sec, 125 secs
lola: sara is running 130 secs || 7675813 markings, 78468195 edges, 44936 markings/sec, 130 secs
lola: sara is running 135 secs || 7874323 markings, 81155916 edges, 39702 markings/sec, 135 secs
lola: sara is running 140 secs || 8056019 markings, 84017874 edges, 36339 markings/sec, 140 secs
lola: sara is running 145 secs || 8126231 markings, 86773513 edges, 14042 markings/sec, 145 secs
lola: sara is running 150 secs || 8126406 markings, 89239601 edges, 35 markings/sec, 150 secs
lola: sara is running 155 secs || 8126454 markings, 91820144 edges, 10 markings/sec, 155 secs
lola: sara is running 160 secs || 8126461 markings, 94455017 edges, 1 markings/sec, 160 secs
lola: sara is running 165 secs || 8126465 markings, 97146712 edges, 1 markings/sec, 165 secs
lola: sara is running 170 secs || 8126465 markings, 99962347 edges, 0 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 8126465 markings, 101580801 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((GADD45_equals_1 <= RAS_equals_0)) AND ((Apoptosis_equals_1 <= 0) OR (p70_equals_1 <= GADD45_equals_0)))
lola: processed formula length: 107
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no no yes no no yes no yes no no
lola:
preliminary result: yes yes yes yes no yes no no yes no no yes no yes no no
lola: memory consumption: 25388 KB
lola: time consumption: 509 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552909520551

--------------------
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="MAPKbis-PT-5320"
export BK_EXAMINATION="CTLCardinality"
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 MAPKbis-PT-5320, examination is CTLCardinality"
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-155246584400355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPKbis-PT-5320.tgz
mv MAPKbis-PT-5320 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;