Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654500013.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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-3954
Executing tool lola
Input is Diffusion2D-PT-D05N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 4.2K Feb 10 21:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 10 21:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 6 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 6 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 23:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 23:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 3 07:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 07:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jan 30 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 30 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 55K 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 Diffusion2D-PT-D05N050-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552544648207

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D05N050 @ 3570 seconds

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2848
rslt: Output for CTLCardinality @ Diffusion2D-PT-D05N050

{
"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": "Thu Mar 14 06:24:08 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(cAMP__2_3_ + 1 <= cAMP__1_4_)",
"processed_size": 30,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AG(EX((cAMP__1_4_ <= 2)))",
"processed_size": 25,
"rewrites": 57
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 1174523,
"markings": 313866,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"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": 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": "(cAMP__3_4_ <= cAMP__2_5_)",
"processed_size": 26,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((cAMP__3_2_ <= 1) AND (cAMP__1_1_ + 1 <= cAMP__4_3_))",
"processed_size": 54,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((cAMP__1_5_ <= cAMP__4_5_) AND (cAMP__3_5_ <= cAMP__4_1_))))",
"processed_size": 67,
"rewrites": 56
},
"result":
{
"edges": 551,
"markings": 551,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 34
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G ((((cAMP__2_1_ <= 0) AND (cAMP__3_1_ <= 1)) OR ((1 <= cAMP__5_5_) AND (1 <= cAMP__3_4_) AND (1 <= cAMP__2_4_) AND (1 <= cAMP__4_1_)))))",
"processed_size": 141,
"rewrites": 56
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 62
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(EF((cAMP__3_5_ <= cAMP__4_5_)) U ((cAMP__4_2_ + 1 <= cAMP__3_3_) AND (cAMP__3_3_ + 1 <= cAMP__5_3_)))",
"processed_size": 103,
"rewrites": 57
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 13682,
"markings": 3345,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= cAMP__1_5_)",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E ((((cAMP__1_2_ <= 0) AND (cAMP__4_4_ + 1 <= cAMP__1_1_)) R (2 <= cAMP__3_3_)))",
"processed_size": 80,
"rewrites": 58
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= cAMP__2_5_)",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((cAMP__2_1_ + 1 <= cAMP__5_5_) OR (cAMP__5_2_ + 1 <= cAMP__2_5_)) R ((cAMP__4_2_ + 1 <= cAMP__5_5_) AND (cAMP__2_3_ <= 1))))",
"processed_size": 130,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 34
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(cAMP__3_4_ <= 0)",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((cAMP__4_2_ + 1 <= cAMP__2_5_)))",
"processed_size": 38,
"rewrites": 57
},
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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 (G ((cAMP__3_4_ + 1 <= cAMP__5_1_)))",
"processed_size": 38,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(cAMP__5_5_ <= 1)",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((cAMP__1_4_ <= 2)))",
"processed_size": 25,
"rewrites": 57
},
"result":
{
"edges": 32,
"markings": 18,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_))))",
"processed_size": 84,
"rewrites": 56
},
"result":
{
"edges": 78,
"markings": 41,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))",
"processed_size": 54,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((cAMP__1_4_ <= 1)))",
"processed_size": 25,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_))",
"processed_size": 63,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))",
"processed_size": 54,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((cAMP__1_4_ <= 1)))",
"processed_size": 25,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(cAMP__5_3_ <= 0)",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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 ((cAMP__3_3_ <= 1)))",
"processed_size": 25,
"rewrites": 56
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23788,
"runtime": 721.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(X(**)))) : (E(F(**)) OR ((** OR A(F(**))) AND **)) : E((E(F(**)) U **)) : (E(F(**)) OR E(X(E(F(**))))) : (A(G(E(F(**)))) AND (E(F(*)) OR *)) : (E(F(**)) OR (A(G(*)) AND **)) : ** : (** AND (E(X(*)) AND **)) : E((* R *)) : E(G(**)) : ((A(F(*)) AND *) OR E(G(**))) : E(G(**)) : (** AND (A(G(*)) OR **)) : (E(G(*)) OR (* AND A(G(*)))) : E((* R *)) : E(F(*))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "no yes yes yes unknown yes no no yes yes yes yes no no no yes ",
"value": "no yes yes yes unknown yes no no yes yes yes yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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: A (G (E (X ((cAMP__1_4_ <= 2))))) : (E (F ((cAMP__3_3_ <= 1))) OR ((((3 <= cAMP__4_5_) AND (2 <= cAMP__4_2_) AND (2 <= cAMP__1_1_) AND (3 <= cAMP__2_4_)) OR A (F ((1 <= cAMP__5_3_)))) AND ((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_)))) : E ((E (F ((cAMP__3_5_ <= cAMP__4_5_))) U ((cAMP__4_2_ + 1 <= cAMP__3_3_) AND (cAMP__3_3_ + 1 <= cAMP__5_3_)))) : E (F ((((3 <= cAMP__1_1_) AND (cAMP__2_1_ <= cAMP__1_4_)) OR E (X ((cAMP__3_3_ <= cAMP__3_4_)))))) : (A (G (E (F ((cAMP__5_1_ <= cAMP__4_3_))))) AND NOT((A (G ((2 <= cAMP__1_4_))) AND ((cAMP__5_3_ <= 2) AND (cAMP__5_2_ <= cAMP__4_2_))))) : (E (F (((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_)))) OR (NOT(E (F ((3 <= cAMP__1_4_)))) AND (cAMP__5_5_ <= 1))) : (cAMP__2_3_ + 1 <= cAMP__1_4_) : (((cAMP__3_4_ <= cAMP__2_5_) AND NOT(A (X ((1 <= cAMP__4_3_))))) AND ((cAMP__3_2_ <= 1) AND (cAMP__1_1_ + 1 <= cAMP__4_3_))) : NOT(A ((((1 <= cAMP__1_2_) OR (cAMP__1_1_ <= cAMP__4_4_)) U (cAMP__3_3_ <= 1)))) : E (G ((((cAMP__2_1_ <= 0) AND (cAMP__3_1_ <= 1)) OR ((1 <= cAMP__5_5_) AND (1 <= cAMP__3_4_) AND (1 <= cAMP__2_4_) AND (1 <= cAMP__4_1_))))) : NOT(((E (G ((3 <= cAMP__2_5_))) OR (3 <= cAMP__1_2_)) AND NOT(E (G ((1 <= cAMP__4_1_)))))) : NOT(NOT(E (G (((cAMP__1_5_ <= cAMP__4_5_) AND (cAMP__3_5_ <= cAMP__4_1_)))))) : ((2 <= cAMP__3_4_) AND (NOT(E (F ((cAMP__1_1_ <= cAMP__2_4_)))) OR (1 <= cAMP__1_5_))) : NOT((A (F ((cAMP__5_1_ <= cAMP__3_4_))) AND ((1 <= cAMP__3_4_) OR E (F ((cAMP__2_5_ <= cAMP__4_2_)))))) : NOT(A ((((cAMP__5_5_ <= cAMP__2_1_) AND (cAMP__2_5_ <= cAMP__5_2_)) U ((cAMP__5_5_ <= cAMP__4_2_) OR (2 <= cAMP__2_3_))))) : NOT(A (G (((cAMP__3_5_ + 1 <= cAMP__2_1_) OR (cAMP__4_1_ <= 1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__2_3_ + 1 <= cAMP__1_4_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__2_3_ + 1 <= cAMP__1_4_)
lola: processed formula length: 30
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= cAMP__1_1_) AND (cAMP__2_1_ <= cAMP__1_4_)))) OR E (X (E (F ((cAMP__3_3_ <= cAMP__3_4_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__1_1_) AND (cAMP__2_1_ <= cAMP__1_4_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= cAMP__1_1_) AND (cAMP__2_1_ <= cAMP__1_4_))))
lola: processed formula length: 58
lola: 56 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: ((3 <= cAMP__1_1_) AND (cAMP__2_1_ <= cAMP__1_4_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((cAMP__1_4_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((cAMP__1_4_ <= 2)))
lola: processed formula length: 25
lola: 57 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 313866 markings, 1174523 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__3_4_ <= cAMP__2_5_) AND (E (X ((cAMP__4_3_ <= 0))) AND ((cAMP__3_2_ <= 1) AND (cAMP__1_1_ + 1 <= cAMP__4_3_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__3_4_ <= cAMP__2_5_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__3_4_ <= cAMP__2_5_)
lola: processed formula length: 26
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__3_2_ <= 1) AND (cAMP__1_1_ + 1 <= cAMP__4_3_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__3_2_ <= 1) AND (cAMP__1_1_ + 1 <= cAMP__4_3_))
lola: processed formula length: 54
lola: 55 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__2_1_ <= cAMP__3_5_) AND (2 <= cAMP__4_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 (((cAMP__2_1_ <= cAMP__3_5_) AND (2 <= cAMP__4_1_))))
lola: processed formula length: 58
lola: 56 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 5 edges
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: ((cAMP__2_1_ <= cAMP__3_5_) AND (2 <= cAMP__4_1_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((cAMP__1_5_ <= cAMP__4_5_) AND (cAMP__3_5_ <= cAMP__4_1_))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((cAMP__1_5_ <= cAMP__4_5_) AND (cAMP__3_5_ <= cAMP__4_1_))))
lola: processed formula length: 67
lola: 56 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((cAMP__4_5_ + 1 <= cAMP__1_5_) OR (cAMP__4_1_ + 1 <= cAMP__3_5_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 551 markings, 551 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((cAMP__2_1_ <= 0) AND (cAMP__3_1_ <= 1)) OR ((1 <= cAMP__5_5_) AND (1 <= cAMP__3_4_) AND (1 <= cAMP__2_4_) AND (1 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((cAMP__2_1_ <= 0) AND (cAMP__3_1_ <= 1)) OR ((1 <= cAMP__5_5_) AND (1 <= cAMP__3_4_) AND (1 <= cAMP__2_4_) AND (1 <= cAMP__4_1_)))))
lola: processed formula length: 141
lola: 56 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: formula 0: (((1 <= cAMP__2_1_) OR (2 <= cAMP__3_1_)) AND ((cAMP__5_5_ <= 0) OR (cAMP__3_4_ <= 0) OR (cAMP__2_4_ <= 0) OR (cAMP__4_1_ <= 0)))
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((cAMP__3_5_ <= cAMP__4_5_))) U ((cAMP__4_2_ + 1 <= cAMP__3_3_) AND (cAMP__3_3_ + 1 <= cAMP__5_3_))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((cAMP__3_5_ <= cAMP__4_5_)) U ((cAMP__4_2_ + 1 <= cAMP__3_3_) AND (cAMP__3_3_ + 1 <= cAMP__5_3_)))
lola: processed formula length: 103
lola: 57 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3345 markings, 13682 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= cAMP__3_4_) AND (A (G ((cAMP__2_4_ + 1 <= cAMP__1_1_))) OR (1 <= cAMP__1_5_)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= cAMP__1_5_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= cAMP__1_5_)
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= cAMP__3_4_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= cAMP__3_4_)
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((cAMP__1_2_ <= 0) AND (cAMP__4_4_ + 1 <= cAMP__1_1_)) R (2 <= cAMP__3_3_)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((cAMP__1_2_ <= 0) AND (cAMP__4_4_ + 1 <= cAMP__1_1_)) R (2 <= cAMP__3_3_)))
lola: processed formula length: 80
lola: 58 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
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: (cAMP__3_3_ <= 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: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((cAMP__2_5_ <= 2))) AND (cAMP__1_2_ <= 2)) OR E (G ((1 <= cAMP__4_1_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__1_2_ <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__1_2_ <= 2)
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= cAMP__4_1_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= cAMP__4_1_)))
lola: processed formula length: 25
lola: 56 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
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: (cAMP__4_1_ <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cAMP__2_5_ <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= cAMP__2_5_)
lola: processed formula length: 17
lola: 58 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((cAMP__2_1_ + 1 <= cAMP__5_5_) OR (cAMP__5_2_ + 1 <= cAMP__2_5_)) R ((cAMP__4_2_ + 1 <= cAMP__5_5_) AND (cAMP__2_3_ <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((cAMP__2_1_ + 1 <= cAMP__5_5_) OR (cAMP__5_2_ + 1 <= cAMP__2_5_)) R ((cAMP__4_2_ + 1 <= cAMP__5_5_) AND (cAMP__2_3_ <= 1))))
lola: processed formula length: 130
lola: 58 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
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: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((cAMP__5_5_ <= cAMP__4_2_) OR (2 <= cAMP__2_3_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((cAMP__3_4_ + 1 <= cAMP__5_1_))) OR ((cAMP__3_4_ <= 0) AND A (G ((cAMP__4_2_ + 1 <= cAMP__2_5_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__3_4_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__3_4_ <= 0)
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__4_2_ + 1 <= cAMP__2_5_)))
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 ((cAMP__4_2_ + 1 <= cAMP__2_5_)))
lola: processed formula length: 38
lola: 57 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (cAMP__2_5_ <= cAMP__4_2_)
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 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((cAMP__3_4_ + 1 <= cAMP__5_1_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((cAMP__3_4_ + 1 <= cAMP__5_1_)))
lola: processed formula length: 38
lola: 56 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (cAMP__5_1_ <= cAMP__3_4_)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_)))) OR (A (G ((cAMP__1_4_ <= 2))) AND (cAMP__5_5_ <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__5_5_ <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__5_5_ <= 1)
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_4_ <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((cAMP__1_4_ <= 2)))
lola: processed formula length: 25
lola: 57 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= cAMP__1_4_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 32 edges
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_))))
lola: processed formula length: 84
lola: 56 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: ((3 <= cAMP__1_2_) AND (3 <= cAMP__1_2_) AND (cAMP__5_3_ + 1 <= cAMP__2_5_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 78 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((cAMP__5_1_ <= cAMP__4_3_))))) AND (E (F ((cAMP__1_4_ <= 1))) OR ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))
lola: processed formula length: 54
lola: 55 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: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__1_4_ <= 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 ((cAMP__1_4_ <= 1)))
lola: processed formula length: 25
lola: 56 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: (cAMP__1_4_ <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
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: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((cAMP__3_3_ <= 1))) OR ((((3 <= cAMP__4_5_) AND (2 <= cAMP__4_2_) AND (2 <= cAMP__1_1_) AND (3 <= cAMP__2_4_)) OR A (F ((1 <= cAMP__5_3_)))) AND ((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= cAMP__5_3_)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (cAMP__5_3_ <= 0)
lola: processed formula length: 17
lola: 58 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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: (1 <= cAMP__5_3_)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 6 markings, 6 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_))
lola: processed formula length: 63
lola: 55 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: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((cAMP__5_1_ <= cAMP__4_3_))))) AND (E (F ((cAMP__1_4_ <= 1))) OR ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= cAMP__5_3_) OR (cAMP__4_2_ + 1 <= cAMP__5_2_))
lola: processed formula length: 54
lola: 55 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: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__1_4_ <= 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 ((cAMP__1_4_ <= 1)))
lola: processed formula length: 25
lola: 56 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: (cAMP__1_4_ <= 1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((cAMP__5_1_ <= cAMP__4_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (cAMP__5_1_ <= cAMP__4_3_)
lola: processed formula length: 26
lola: 58 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (cAMP__4_3_ + 1 <= cAMP__5_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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (cAMP__5_1_ <= cAMP__4_3_)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-1.sara.
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 915374 markings, 2900389 edges, 183075 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1562302 markings, 5496484 edges, 129386 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2240226 markings, 7991647 edges, 135585 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2898208 markings, 10405644 edges, 131596 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3565945 markings, 12772598 edges, 133547 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4189082 markings, 15082603 edges, 124627 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4725842 markings, 17410737 edges, 107352 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 5269776 markings, 19653892 edges, 108787 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 5874943 markings, 21905120 edges, 121033 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 6586265 markings, 24150591 edges, 142264 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 7221019 markings, 26332775 edges, 126951 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 7776548 markings, 28466787 edges, 111106 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 8379109 markings, 30582951 edges, 120512 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 8913282 markings, 32713447 edges, 106835 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 9517260 markings, 34823133 edges, 120796 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10074757 markings, 36921849 edges, 111499 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 10595394 markings, 38992943 edges, 104127 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 11116336 markings, 41033532 edges, 104188 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 11586238 markings, 43133938 edges, 93980 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 12031328 markings, 45269005 edges, 89018 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 12489752 markings, 47378114 edges, 91685 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 13007334 markings, 49378777 edges, 103516 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 13517686 markings, 51394056 edges, 102070 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 14007766 markings, 53386889 edges, 98016 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 14488784 markings, 55424796 edges, 96204 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 14978321 markings, 57455547 edges, 97907 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 15433945 markings, 59504650 edges, 91125 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 15839801 markings, 61541459 edges, 81171 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 16395144 markings, 63549922 edges, 111069 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 16901640 markings, 65576388 edges, 101299 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 17367395 markings, 67591346 edges, 93151 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 17848837 markings, 69612728 edges, 96288 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 18373322 markings, 71624098 edges, 104897 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 19018675 markings, 73667158 edges, 129071 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 19577453 markings, 75679347 edges, 111756 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 20043034 markings, 77695602 edges, 93116 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 20534421 markings, 79657565 edges, 98277 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 20999267 markings, 81654342 edges, 92969 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 21480882 markings, 83620391 edges, 96323 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 21921179 markings, 85646003 edges, 88059 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 22364769 markings, 87626705 edges, 88718 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 22827243 markings, 89625708 edges, 92495 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 23259291 markings, 91632109 edges, 86410 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 23681866 markings, 93646043 edges, 84515 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 24110545 markings, 95675303 edges, 85736 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 24592895 markings, 97632363 edges, 96470 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 25085446 markings, 99587082 edges, 98510 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 25621350 markings, 101548946 edges, 107181 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 26145709 markings, 103512868 edges, 104872 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 26751917 markings, 105562844 edges, 121242 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 27327604 markings, 107619482 edges, 115137 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 27840594 markings, 109623882 edges, 102598 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 28278156 markings, 111571395 edges, 87512 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 28693226 markings, 113555973 edges, 83014 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 29135575 markings, 115443663 edges, 88470 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 29593547 markings, 117408830 edges, 91594 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 30026207 markings, 119442420 edges, 86532 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 30442566 markings, 121526163 edges, 83272 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 30865655 markings, 123540468 edges, 84618 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 31277744 markings, 125607808 edges, 82418 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 31721182 markings, 127642649 edges, 88688 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 32106361 markings, 129620896 edges, 77036 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 32506742 markings, 131533231 edges, 80076 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 32935163 markings, 133408957 edges, 85684 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 33483627 markings, 135324438 edges, 109693 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 34126397 markings, 137324471 edges, 128554 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 34653546 markings, 139228637 edges, 105430 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 35141647 markings, 141135299 edges, 97620 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 35699487 markings, 143047928 edges, 111568 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 36133556 markings, 144942828 edges, 86814 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 36566445 markings, 146825910 edges, 86578 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 37008198 markings, 148706432 edges, 88351 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 37486072 markings, 150606892 edges, 95575 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 37991903 markings, 152480451 edges, 101166 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 38469783 markings, 154330321 edges, 95576 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 38927735 markings, 156204153 edges, 91590 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 39348633 markings, 158119687 edges, 84180 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 39770299 markings, 160079802 edges, 84333 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 40223398 markings, 162031918 edges, 90620 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 40702640 markings, 163996655 edges, 95848 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 41270482 markings, 165986751 edges, 113568 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 41804116 markings, 167955093 edges, 106727 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 42320574 markings, 169913038 edges, 103292 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 42790269 markings, 171902488 edges, 93939 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 43195396 markings, 173914783 edges, 81025 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 43640756 markings, 175893368 edges, 89072 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 44067551 markings, 177850278 edges, 85359 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 44534256 markings, 179807071 edges, 93341 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 44926089 markings, 181651153 edges, 78367 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 45335442 markings, 183509277 edges, 81871 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 45857358 markings, 185387058 edges, 104383 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 46309096 markings, 187231213 edges, 90348 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 46742728 markings, 189055234 edges, 86726 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 47137431 markings, 190917528 edges, 78941 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 47511569 markings, 192770818 edges, 74828 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 47886372 markings, 194627555 edges, 74961 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 48302728 markings, 196465666 edges, 83271 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 48662246 markings, 198328095 edges, 71904 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 49033692 markings, 200172912 edges, 74289 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 49427645 markings, 202008376 edges, 78791 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 49864111 markings, 203854034 edges, 87293 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 50348679 markings, 205691370 edges, 96914 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 50856966 markings, 207562820 edges, 101657 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 51408768 markings, 209478866 edges, 110360 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 51898459 markings, 211351556 edges, 97938 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 52275652 markings, 213207541 edges, 75439 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 52743380 markings, 215049275 edges, 93546 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 53263469 markings, 216908944 edges, 104018 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 53692686 markings, 218738310 edges, 85843 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 54080558 markings, 220574110 edges, 77574 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 54503579 markings, 222403637 edges, 84604 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 54952951 markings, 224229074 edges, 89874 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 55330598 markings, 226104505 edges, 75529 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 55724735 markings, 227965140 edges, 78827 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 56100501 markings, 229844641 edges, 75153 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 56530694 markings, 231681544 edges, 86039 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 56925724 markings, 233487144 edges, 79006 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 57306844 markings, 235341175 edges, 76224 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 57710649 markings, 237186497 edges, 80761 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 58145552 markings, 239013204 edges, 86981 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 58594290 markings, 240844436 edges, 89748 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 59014290 markings, 242655402 edges, 84000 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 59372696 markings, 244407251 edges, 71681 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 59836648 markings, 246302036 edges, 92790 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 60346716 markings, 248198217 edges, 102014 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 60756017 markings, 249862572 edges, 81860 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 60956913 markings, 250559785 edges, 40179 markings/sec, 630 secs
lola: sara is running 635 secs || sara is running 635 secs || 60964619 markings, 250585421 edges, 1541 markings/sec, 635 secs
lola: sara is running 640 secs || sara is running 640 secs || 60966934 markings, 250592459 edges, 463 markings/sec, 640 secs
lola: sara is running 645 secs || sara is running 645 secs || 61007837 markings, 250732234 edges, 8181 markings/sec, 645 secs
lola: sara is running 650 secs || sara is running 650 secs || 61012513 markings, 250748213 edges, 935 markings/sec, 650 secs
lola: sara is running 655 secs || sara is running 655 secs || 61014278 markings, 250753418 edges, 353 markings/sec, 655 secs
lola: sara is running 660 secs || sara is running 660 secs || 61014317 markings, 250753534 edges, 8 markings/sec, 660 secs
lola: sara is running 665 secs || sara is running 665 secs || 61015073 markings, 250755617 edges, 151 markings/sec, 665 secs
lola: sara is running 670 secs || sara is running 670 secs || 61015420 markings, 250756726 edges, 69 markings/sec, 670 secs
lola: sara is running 675 secs || sara is running 675 secs || 61015471 markings, 250756850 edges, 10 markings/sec, 675 secs
lola: sara is running 680 secs || sara is running 680 secs || 61017611 markings, 250764088 edges, 428 markings/sec, 680 secs
lola: sara is running 685 secs || sara is running 685 secs || 61017642 markings, 250764191 edges, 6 markings/sec, 685 secs
lola: sara is running 690 secs || sara is running 690 secs || 61018747 markings, 250768031 edges, 221 markings/sec, 690 secs
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: (E (F ((cAMP__3_3_ <= 1))) OR ((((3 <= cAMP__4_5_) AND (2 <= cAMP__4_2_) AND (2 <= cAMP__1_1_) AND (3 <= cAMP__2_4_)) OR A (F ((1 <= cAMP__5_3_)))) AND ((cAMP__4_1_ <= cAMP__2_2_) AND (cAMP__5_2_ + 1 <= cAMP__2_3_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= cAMP__5_3_)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (cAMP__5_3_ <= 0)
lola: processed formula length: 17
lola: 58 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
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: (1 <= cAMP__5_3_)
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 / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ <= 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 ((cAMP__3_3_ <= 1)))
lola: processed formula length: 25
lola: 56 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: (cAMP__3_3_ <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes unknown yes no no yes yes yes yes no no no yes
lola:
preliminary result: no yes yes yes unknown yes no no yes yes yes yes no no no yes
lola: memory consumption: 23788 KB
lola: time consumption: 721 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552545370177

--------------------
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="Diffusion2D-PT-D05N050"
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-3954"
echo " Executing tool lola"
echo " Input is Diffusion2D-PT-D05N050, 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 r060-ebro-155234654500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N050.tgz
mv Diffusion2D-PT-D05N050 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 ;