About the Execution of LoLA for ClientsAndServers-PT-N0010P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12399.110 | 3570120.00 | 1106654.00 | 8812.80 | FTTFTFTT?FFF??TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r027-smll-155225121100274.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is ClientsAndServers-PT-N0010P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225121100274
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 4.1K Feb 9 08:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 9 08:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 07:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 5 07:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 115 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 353 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 29 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 29 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 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 9.1K 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 ClientsAndServers-PT-N0010P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552575268646
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0010P0 @ 3570 seconds
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ ClientsAndServers-PT-N0010P0
{
"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 14:54:28 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 1,
"E": 1,
"F": 1,
"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": "AF(EG((1 <= SwG)))",
"processed_size": 18,
"rewrites": 59
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 37574,
"markings": 31875,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(Ci + 1 <= CwA)",
"processed_size": 15,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((2 <= MwU) AND (2 <= MpA))",
"processed_size": 27,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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 ((Mi + 1 <= Ci)))",
"processed_size": 22,
"rewrites": 59
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((Ci <= CA))",
"processed_size": 14,
"rewrites": 58
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"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": "(CF <= CR)",
"processed_size": 10,
"rewrites": 60
},
"result":
{
"edges": 556,
"markings": 536,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((SpA <= 0) OR (MpA + 1 <= SR) OR ((SG <= 1) AND (CR <= 2)))))",
"processed_size": 70,
"rewrites": 59
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= CwG) AND (SpA <= StR) AND (3 <= SpG)) OR (3 <= CA))))",
"processed_size": 68,
"rewrites": 58
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(SA <= 0)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 124749,
"markings": 106529,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(CA + 1 <= SG)",
"processed_size": 14,
"rewrites": 60
},
"result":
{
"edges": 5664613,
"markings": 2597347,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 451
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((SpA <= CF) AND (3 <= SF))",
"processed_size": 27,
"rewrites": 60
},
"result":
{
"edges": 534,
"markings": 533,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"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": "(3 <= SpA)",
"processed_size": 10,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((CwA <= 1)))",
"processed_size": 18,
"rewrites": 59
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 631
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((SF + 1 <= MpA) R (MpA <= 1)))",
"processed_size": 34,
"rewrites": 62
},
"result":
{
"edges": 26667251,
"markings": 7022810,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 835
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((Mi + 1 <= MpA) R (Cb <= 2)))",
"processed_size": 33,
"rewrites": 62
},
"result":
{
"edges": 504,
"markings": 503,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 835
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 835
},
"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 <= SF)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1253
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "((CG <= 1) AND (SF <= 0) AND (SA <= MpA))",
"processed_size": 41,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((MpA + 1 <= MtF) R (SF <= 0)))",
"processed_size": 34,
"rewrites": 60
},
"result":
{
"edges": 8538,
"markings": 7608,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1253
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= CwA)))",
"processed_size": 18,
"rewrites": 58
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25948,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(*)) : E(F(**)) : E(F(E(G(**)))) : (A(G(*)) OR (* OR A(X(**)))) : (A(F(E(G(**)))) AND A(X(A(F(**))))) : A(F(**)) : TRUE : (E(F(**)) OR **) : (A(G(E(F(**)))) OR **) : (A(G(**)) AND A(F(**))) : A(G(E(F(*)))) : A(X(A(F(*)))) : (E((** U **)) OR ((A(G(**)) AND **) OR **)) : A(G(E(F(*)))) : (A(F(*)) AND (* AND E((* R *)))) : (A((* R *)) OR A((* R *)))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"interim_value": "no yes yes no yes no yes yes unknown no no no unknown unknown yes no ",
"preliminary_value": "no yes yes no yes no yes yes unknown no no no unknown unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (SR <= SwG)
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: NOT(E (F (((1 <= SpA) AND (SR <= MpA) AND ((2 <= SG) OR (3 <= CR)))))) : E (F ((((1 <= CwG) AND (SpA <= StR) AND (3 <= SpG)) OR (3 <= CA)))) : E (F (E (G (((SpA <= CF) AND (3 <= SF)))))) : NOT(((E (F ((Ci <= Mi))) AND ((MwU <= 1) OR (MpA <= 1))) AND NOT(A (X ((Ci <= CA)))))) : (A (F (E (G ((1 <= SwG))))) AND A (X (A (F ((CwA <= Ci)))))) : A (F ((1 <= SA))) : A (G (())) : (E (F ((2 <= CwA))) OR ((Uf <= 0) AND (Uf <= 1) AND (3 <= StF) AND ((2 <= Uf) OR (SG <= Uf) OR (Cb <= Si) OR (SwA <= SpG) OR (((CG <= Ci) OR (2 <= SpG)) AND (StF + 1 <= CwG))))) : (A (G (E (F ((CwG <= CG))))) OR (A (((CwG <= Uf) U (SR <= SwG))) AND (2 <= SG))) : ((A (G ((CwA <= 1))) AND A (F ((SpA <= 2)))) OR NOT(E (G (())))) : A (G (NOT(A (G ((SG <= CA)))))) : A (X (NOT(E (G ((CF <= CR)))))) : (E ((((3 <= Cb) OR (3 <= StR)) U (StR + 1 <= SF))) OR ((A (G ((1 <= Ci))) AND ((StF <= CA) OR ((3 <= StF) AND (StR <= MwU)))) OR (((SwA + 1 <= SpG)) AND (CG <= MpG)))) : A (G (NOT(A (G ((2 <= Si)))))) : NOT(((E (G ((3 <= SF))) OR ((2 <= CG) OR (1 <= SF) OR (MpA + 1 <= SA))) OR A (((MtF <= MpA) U (1 <= SF))))) : NOT((E (((MpA <= Mi) U (3 <= Cb))) AND E (((MpA <= SF) U (2 <= MpA)))))
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:318
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 57 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((1 <= SwG))))) AND A (X (A (F ((CwA <= Ci))))))
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: A (F (E (G ((1 <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((1 <= SwG)))
lola: processed formula length: 18
lola: 59 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: 31875 markings, 37574 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((CwA <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Ci + 1 <= CwA)
lola: processed formula length: 15
lola: 60 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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 /EXEG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: The predicate eventually occurs from all successors.
lola: 0 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CwA <= Ci)lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Mi + 1 <= Ci))) OR (((2 <= MwU) AND (2 <= MpA)) OR A (X ((Ci <= CA)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= MwU) AND (2 <= MpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= MwU) AND (2 <= MpA))
lola: processed formula length: 27
lola: 57 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Mi + 1 <= Ci)))
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 ((Mi + 1 <= Ci)))
lola: processed formula length: 22
lola: 59 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: (Ci <= Mi)
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: 51 markings, 50 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Ci <= CA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((Ci <= CA))
lola: processed formula length: 14
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((CR + 1 <= CF)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (CF <= CR)
lola: processed formula length: 10
lola: 60 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 536 markings, 556 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CR + 1 <= CF)
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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((SpA <= 0) OR (MpA + 1 <= SR) OR ((SG <= 1) AND (CR <= 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 (((SpA <= 0) OR (MpA + 1 <= SR) OR ((SG <= 1) AND (CR <= 2)))))
lola: processed formula length: 70
lola: 59 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= SpA) AND (SR <= MpA) AND ((2 <= SG) OR (3 <= CR)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= CwG) AND (SpA <= StR) AND (3 <= SpG)) OR (3 <= CA))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= CwG) AND (SpA <= StR) AND (3 <= SpG)) OR (3 <= CA))))
lola: processed formula length: 68
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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= CwG) AND (SpA <= StR) AND (3 <= SpG)) OR (3 <= CA))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= SA)))
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: (SA <= 0)
lola: processed formula length: 9
lola: 60 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 <= SA)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 106529 markings, 124749 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((Si <= 1)))))
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: (Si <= 1)
lola: processed formula length: 9
lola: 60 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= Si)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
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: (Si <= 1)
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-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-1.sara.
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1990169 markings, 5464258 edges, 398034 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3565101 markings, 8929905 edges, 314986 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 4980478 markings, 12148639 edges, 283075 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6314666 markings, 15233951 edges, 266838 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 7596156 markings, 18224704 edges, 256298 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 8832414 markings, 21135114 edges, 247252 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 10038728 markings, 23998488 edges, 241263 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 11220282 markings, 26825756 edges, 236311 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 12373500 markings, 29603693 edges, 230644 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 13513641 markings, 32354134 edges, 228028 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 14636659 markings, 35065461 edges, 224604 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 15740457 markings, 37753231 edges, 220760 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 16828491 markings, 40411937 edges, 217607 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 17910368 markings, 43057265 edges, 216375 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 18975969 markings, 45672786 edges, 213120 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 20022301 markings, 48262123 edges, 209266 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 21056163 markings, 50826997 edges, 206772 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 22087379 markings, 53382937 edges, 206243 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 23105207 markings, 55919474 edges, 203566 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 24118176 markings, 58438753 edges, 202594 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 25116623 markings, 60940796 edges, 199689 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 26106409 markings, 63429418 edges, 197957 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 27089390 markings, 65899474 edges, 196596 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 28064992 markings, 68356165 edges, 195120 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 29033152 markings, 70795843 edges, 193632 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 29995095 markings, 73232324 edges, 192389 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 30938386 markings, 75638462 edges, 188658 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 31894609 markings, 78050241 edges, 191245 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 32830863 markings, 80438533 edges, 187251 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 33769618 markings, 82825299 edges, 187751 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 34696464 markings, 85189902 edges, 185369 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 35616281 markings, 87542700 edges, 183963 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 36538673 markings, 89897509 edges, 184478 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 37445186 markings, 92229972 edges, 181303 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 38343583 markings, 94546733 edges, 179679 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 39245913 markings, 96868681 edges, 180466 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 40141243 markings, 99175416 edges, 179066 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 41037118 markings, 101481954 edges, 179175 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 41922668 markings, 103770152 edges, 177110 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 42800069 markings, 106043831 edges, 175480 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 43669865 markings, 108304518 edges, 173959 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 44537041 markings, 110559021 edges, 173435 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 45405415 markings, 112807104 edges, 173675 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 46261193 markings, 115042004 edges, 171156 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 47121590 markings, 117277111 edges, 172079 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 47971239 markings, 119499366 edges, 169930 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 48823903 markings, 121721141 edges, 170533 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 49675562 markings, 123931666 edges, 170332 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 50517310 markings, 126131335 edges, 168350 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 51358824 markings, 128331076 edges, 168303 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 52196176 markings, 130519129 edges, 167470 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 53035044 markings, 132713050 edges, 167774 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 53870078 markings, 134897256 edges, 167007 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 54703255 markings, 137074739 edges, 166635 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 55526799 markings, 139246258 edges, 164709 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 56350937 markings, 141406766 edges, 164828 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 57168976 markings, 143562146 edges, 163608 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 57984329 markings, 145711192 edges, 163071 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 58800660 markings, 147857536 edges, 163266 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 59608120 markings, 149991167 edges, 161492 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 60423527 markings, 152129390 edges, 163081 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 61227660 markings, 154254649 edges, 160827 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 62029198 markings, 156375111 edges, 160308 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 62836569 markings, 158501278 edges, 161474 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 63633703 markings, 160614513 edges, 159427 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 64430110 markings, 162724638 edges, 159281 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 65227675 markings, 164836989 edges, 159513 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 66019626 markings, 166936666 edges, 158390 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 66814031 markings, 169037694 edges, 158881 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 67600613 markings, 171129066 edges, 157316 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 68389569 markings, 173221791 edges, 157791 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 69166350 markings, 175299287 edges, 155356 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 69950748 markings, 177381787 edges, 156880 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 70731193 markings, 179455147 edges, 156089 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 71502965 markings, 181518845 edges, 154354 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 72279487 markings, 183583214 edges, 155304 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 73056353 markings, 185653190 edges, 155373 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 73825587 markings, 187705372 edges, 153847 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 74598936 markings, 189762894 edges, 154670 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown no yes no yes unknown unknown unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 7450864 KB
lola: time consumption: 401 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((CA + 1 <= SG)))))
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: (CA + 1 <= SG)
lola: processed formula length: 14
lola: 60 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (SG <= CA)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
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: (CA + 1 <= SG)
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-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1927327 markings, 4169359 edges, 385465 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 2597347 markings, 5664613 edges
lola: ========================================
lola: subprocess 9 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((SpA <= CF) AND (3 <= SF))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((SpA <= CF) AND (3 <= SF))
lola: processed formula length: 27
lola: 60 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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 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: ((SpA <= CF) AND (3 <= SF))
lola: state equation task get result unparse finished id 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((CF + 1 <= SpA) OR (SF <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 533 markings, 534 edges
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: subprocess 10 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((CwA <= 1))) AND A (F ((SpA <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((SpA <= 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:787
lola: processed formula: (3 <= SpA)
lola: processed formula length: 10
lola: 60 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: subprocess 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CwA <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((CwA <= 1)))
lola: processed formula length: 18
lola: 59 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: subprocess 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((CwG <= CG))))) OR (2 <= SG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= SG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SG)
lola: processed formula length: 9
lola: 57 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 12 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((CwG <= CG)))))
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: (CwG <= CG)
lola: processed formula length: 11
lola: 60 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 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: (CwG <= CG)
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: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: try reading problem file CTLCardinality-12-1.sara.
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: (CG + 1 <= CwG)lola: ========================================
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: state equation 1: solution produced
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2225894 markings, 4491198 edges, 445179 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4260445 markings, 8484638 edges, 406910 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6203537 markings, 12258022 edges, 388618 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8075564 markings, 15911664 edges, 374405 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9924138 markings, 19464393 edges, 369715 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11749604 markings, 22945782 edges, 365093 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 13538490 markings, 26360424 edges, 357777 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 15303775 markings, 29723014 edges, 353057 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 17050493 markings, 33044249 edges, 349344 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 18779909 markings, 36324259 edges, 345883 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 20496141 markings, 39565849 edges, 343246 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 22201171 markings, 42778771 edges, 341006 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 23888374 markings, 45954853 edges, 337441 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 25561436 markings, 49102052 edges, 334612 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 27227675 markings, 52227712 edges, 333248 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 28880310 markings, 55328915 edges, 330527 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 30527953 markings, 58412585 edges, 329529 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 32164555 markings, 61472817 edges, 327320 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 33792693 markings, 64515586 edges, 325628 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 35411439 markings, 67540564 edges, 323749 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 37022063 markings, 70547876 edges, 322125 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 38620732 markings, 73533641 edges, 319734 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 40229907 markings, 76506114 edges, 321835 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 41825223 markings, 79461070 edges, 319063 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 43407758 markings, 82398821 edges, 316507 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 44979267 markings, 85325053 edges, 314302 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 46560995 markings, 88244569 edges, 316346 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 48134199 markings, 91140187 edges, 314641 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 49705808 markings, 94022179 edges, 314322 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 51278423 markings, 96899238 edges, 314523 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 52836255 markings, 99759828 edges, 311566 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 54385234 markings, 102606415 edges, 309796 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 55923487 markings, 105435934 edges, 307651 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 57460231 markings, 108263313 edges, 307349 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 59009497 markings, 111081083 edges, 309853 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 60544131 markings, 113892358 edges, 306927 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 62074501 markings, 116686587 edges, 306074 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 63600054 markings, 119463283 edges, 305111 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 65123632 markings, 122240895 edges, 304716 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 66634001 markings, 125002146 edges, 302074 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 68142504 markings, 127755292 edges, 301701 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 69659911 markings, 130497353 edges, 303481 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 71165070 markings, 133244055 edges, 301032 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 72674171 markings, 135981474 edges, 301820 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 74179908 markings, 138707446 edges, 301147 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 75683488 markings, 141434663 edges, 300716 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 77181971 markings, 144143250 edges, 299697 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 78685683 markings, 146845422 edges, 300742 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 80170978 markings, 149538320 edges, 297059 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 81648729 markings, 152218320 edges, 295550 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 83139360 markings, 154900735 edges, 298126 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 84617657 markings, 157572538 edges, 295659 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 86101176 markings, 160244358 edges, 296704 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 87578295 markings, 162914640 edges, 295424 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 89054419 markings, 165576560 edges, 295225 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 90526339 markings, 168237992 edges, 294384 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 92001185 markings, 170887100 edges, 294969 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 93467886 markings, 173522014 edges, 293340 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 94924960 markings, 176155395 edges, 291415 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 96380625 markings, 178779584 edges, 291133 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 97835000 markings, 181401601 edges, 290875 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 99294258 markings, 184019976 edges, 291852 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 100745541 markings, 186632753 edges, 290257 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 102204185 markings, 189240734 edges, 291729 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 103650870 markings, 191840906 edges, 289337 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 105099162 markings, 194438198 edges, 289658 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 106550816 markings, 197032938 edges, 290331 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 107993087 markings, 199619724 edges, 288454 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 109433225 markings, 202199598 edges, 288028 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 110866431 markings, 204765361 edges, 286641 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 112296455 markings, 207325723 edges, 286005 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 113729944 markings, 209883944 edges, 286698 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 115152204 markings, 212428237 edges, 284452 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 116584649 markings, 214973512 edges, 286489 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 118017165 markings, 217516158 edges, 286503 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 119436091 markings, 220047008 edges, 283785 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 120862203 markings, 222590149 edges, 285222 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 122285315 markings, 225121833 edges, 284622 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 123693097 markings, 227642259 edges, 281556 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 125098148 markings, 230156597 edges, 281010 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 126509363 markings, 232676331 edges, 282243 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 127922256 markings, 235189769 edges, 282579 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 129342647 markings, 237701804 edges, 284078 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 130750975 markings, 240214420 edges, 281666 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 132153072 markings, 242712590 edges, 280419 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 133560307 markings, 245213294 edges, 281447 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 134973576 markings, 247719243 edges, 282654 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 136379978 markings, 250208489 edges, 281280 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 137777332 markings, 252703421 edges, 279471 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 139193865 markings, 255198083 edges, 283307 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 140593015 markings, 257685693 edges, 279830 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 141991122 markings, 260165424 edges, 279621 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 143386559 markings, 262640546 edges, 279087 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 144782658 markings, 265114926 edges, 279220 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 146169032 markings, 267585892 edges, 277275 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 147557702 markings, 270050014 edges, 277734 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 148951454 markings, 272514773 edges, 278750 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 150350971 markings, 274982077 edges, 279903 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 151746012 markings, 277443141 edges, 279008 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 153138832 markings, 279901340 edges, 278564 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 154528528 markings, 282354669 edges, 277939 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 155920866 markings, 284807701 edges, 278468 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 157303997 markings, 287257961 edges, 276626 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 158680686 markings, 289703268 edges, 275338 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 160059290 markings, 292141262 edges, 275721 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 161434300 markings, 294583550 edges, 275002 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 162804574 markings, 297018378 edges, 274055 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 164183613 markings, 299451273 edges, 275808 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 165552322 markings, 301882000 edges, 273742 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 166931728 markings, 304310461 edges, 275881 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 168315304 markings, 306738987 edges, 276715 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 169687016 markings, 309165023 edges, 274342 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 171048839 markings, 311580716 edges, 272365 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 172406697 markings, 313988438 edges, 271572 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 173782956 markings, 316408262 edges, 275252 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 175145540 markings, 318818788 edges, 272517 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 176514052 markings, 321236157 edges, 273702 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 177881584 markings, 323643394 edges, 273506 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 179246728 markings, 326048176 edges, 273029 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 180606028 markings, 328457091 edges, 271860 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 181970781 markings, 330854743 edges, 272951 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 183326866 markings, 333247034 edges, 271217 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 184684614 markings, 335651788 edges, 271550 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 186043955 markings, 338050030 edges, 271868 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 187395057 markings, 340441600 edges, 270220 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 188755319 markings, 342840943 edges, 272052 markings/sec, 625 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no yes no yes unknown unknown no no no unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes yes no yes no yes unknown unknown no no no unknown unknown unknown unknown
lola: memory consumption: 12509116 KB
lola: time consumption: 1042 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes yes no yes no yes unknown unknown no no no unknown unknown unknown unknown
lola: memory consumption: 12510852 KB
lola: time consumption: 1042 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((Mi + 1 <= MpA) R (Cb <= 2))) OR A (((SF + 1 <= MpA) R (MpA <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((SF + 1 <= MpA) R (MpA <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((SF + 1 <= MpA) R (MpA <= 1)))
lola: processed formula length: 34
lola: 62 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= MpA)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 1626802 markings, 6675766 edges, 325360 markings/sec, 0 secs
lola: sara is running 5 secs || 3357229 markings, 13160217 edges, 346085 markings/sec, 5 secs
lola: sara is running 10 secs || 5055107 markings, 19515712 edges, 339576 markings/sec, 10 secs
lola: sara is running 15 secs || 6767032 markings, 25809116 edges, 342385 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 7022810 markings, 26667251 edges
lola: ========================================
lola: subprocess 13 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Mi + 1 <= MpA) R (Cb <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((Mi + 1 <= MpA) R (Cb <= 2)))
lola: processed formula length: 33
lola: 62 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= Cb)
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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 503 markings, 504 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((SF <= 2))) AND (((CG <= 1) AND (SF <= 0) AND (SA <= MpA)) AND E (((MpA + 1 <= MtF) R (SF <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((SF <= 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 <= SF)
lola: processed formula length: 9
lola: 60 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: (SF <= 2)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((CG <= 1) AND (SF <= 0) AND (SA <= MpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CG <= 1) AND (SF <= 0) AND (SA <= MpA))
lola: processed formula length: 41
lola: 57 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((MpA + 1 <= MtF) R (SF <= 0)))
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 (((MpA + 1 <= MtF) R (SF <= 0)))
lola: processed formula length: 34
lola: 60 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: 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: (1 <= SF)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
lola: state equation 0: solution produced
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 7608 markings, 8538 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= CwA))) OR ((Uf <= 0) AND (Uf <= 1) AND (3 <= StF) AND ((2 <= Uf) OR (SG <= Uf) OR (Cb <= Si) OR (SwA <= SpG) OR (((CG <= Ci) OR (2 <= SpG)) AND (StF + 1 <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= CwA)))
lola: processed formula length: 18
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= CwA)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: subprocess 15 will run for 2506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= Cb) OR (3 <= StR)) U (StR + 1 <= SF))) OR ((A (G ((1 <= Ci))) AND ((StF <= CA) OR ((3 <= StF) AND (StR <= MwU)))) OR (((SwA + 1 <= SpG)) AND (CG <= MpG))))
lola: ========================================
lola: SUBTASK
lola: lola: checking a Boolean combination of formulas
========================================
lola: RUNNING
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no yes no yes yes unknown no no no unknown unknown yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 25948 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: no yes yes no yes no yes yes unknown no no no unknown unknown yes no
lola:
preliminary result: no yes yes no yes no yes yes unknown no no no unknown unknown yes no
lola: memory consumption: 25948 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
BK_STOP 1552578838766
--------------------
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="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool lola"
echo " Input is ClientsAndServers-PT-N0010P0, 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 r027-smll-155225121100274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 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 '
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 ;