fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r027-smll-155225120900130
Last Updated
Apr 15, 2019

About the Execution of LoLA for CircadianClock-PT-000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.130 1631314.00 1601316.00 11665.30 F???TTTFTFTFFTFF 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-155225120900130.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 CircadianClock-PT-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225120900130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.5K Feb 9 08:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 9 08:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 5 07:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 5 07:16 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 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 2 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Jan 29 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Jan 29 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-000100-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552524838366

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CircadianClock-PT-000100 @ 3570 seconds

FORMULA CircadianClock-PT-000100-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1939
rslt: Output for CTLCardinality @ CircadianClock-PT-000100

{
"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 00:53:58 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": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX((mr_cap <= 2))",
"processed_size": 17,
"rewrites": 39
},
"net":
{
"conflict_clusters": 2,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AG((dr_a <= mr_cap)))",
"processed_size": 24,
"rewrites": 40
},
"net":
{
"conflict_clusters": 2,
"singleton_clusters": 0
},
"result":
{
"edges": 207,
"markings": 106,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 313
},
"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": "(ma_cap <= 2)",
"processed_size": 13,
"rewrites": 40
},
"result":
{
"edges": 98,
"markings": 99,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 366
},
"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": "(ma_cap <= dr)",
"processed_size": 14,
"rewrites": 40
},
"result":
{
"edges": 99,
"markings": 100,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 471
},
"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 ((r + 1 <= mr_cap)))",
"processed_size": 25,
"rewrites": 40
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 659
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((da_a <= mr_cap) OR (dr_a <= r) OR (c_cap <= 2)) AND ((mr_cap + 1 <= r_cap) OR (da_a + 1 <= ma_cap)))))",
"processed_size": 114,
"rewrites": 40
},
"result":
{
"edges": 100,
"markings": 101,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"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 <= c)",
"processed_size": 8,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1649
},
"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 ((3 <= a)))",
"processed_size": 16,
"rewrites": 39
},
"result":
{
"edges": 4,
"markings": 5,
"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": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1099
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= r_cap))",
"processed_size": 14,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1367
},
"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 ((2 <= mr_cap)))",
"processed_size": 21,
"rewrites": 40
},
"result":
{
"edges": 99,
"markings": 100,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2734
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(NOT DEADLOCK AND (1 <= c_cap))",
"processed_size": 31,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))",
"processed_size": 53,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= r_cap))",
"processed_size": 14,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"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 ((2 <= mr_cap)))",
"processed_size": 21,
"rewrites": 40
},
"result":
{
"edges": 99,
"markings": 100,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"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"
}
},

{
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(NOT DEADLOCK AND (1 <= c_cap))",
"processed_size": 31,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((mr <= c_cap)))",
"processed_size": 21,
"rewrites": 40
},
"result":
{
"edges": 109,
"markings": 107,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))",
"processed_size": 53,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap)))))",
"processed_size": 59,
"rewrites": 39
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20064,
"runtime": 1631.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(E(X(**)))) : A(G(E(X(**)))) : ((** OR E(F(**))) AND E(F(DEADLOCK))) : E(F(*)) : TRUE : (E(F(**)) AND (** OR E(F(*)))) : (E(X(**)) OR E(X(A(G(**))))) : (** AND E(G(**))) : FALSE : E(X(E(F(*)))) : A(G(*)) : FALSE : E(X(E(F(**)))) : A(G(**)) : ((A(G(**)) OR A(G(**))) AND (NODEADLOCK AND **))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no unknown unknown unknown yes yes yes no yes no yes no no yes no no ",
"value": "no unknown unknown unknown yes yes yes no yes no yes no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= da_a)
lola: LP says that atomic proposition is always false: (2 <= dr)
lola: LP says that atomic proposition is always false: (3 <= da)
lola: LP says that atomic proposition is always false: (3 <= dr_a)
lola: LP says that atomic proposition is always false: (2 <= dr_a)
lola: A (G (((mr <= r) OR (1 <= a_cap)))) : A (G (E (X (((mr_cap <= dr) OR (1 <= ma)))))) : A (G (E (X (((c <= dr_a) OR (dr_a <= r_cap)))))) : ((((3 <= r_cap)) OR E (F ((ma <= c)))) AND E (F (A (X ((2 <= dr)))))) : A (F (NOT(A (G ((1 <= r_cap)))))) : A (G ((A (X ((1 <= dr))) OR ()))) : (E (F ((3 <= a))) AND ((3 <= c) OR NOT(A (G ((3 <= a_cap)))))) : E (X (((mr_cap <= 2) OR A (G ((dr_a <= mr_cap)))))) : ((((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap)) AND A (G ((da <= 2)))) AND E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap)))))) : E (F ((E (G ((3 <= dr_a))) AND A (X ((mr_cap <= da)))))) : E (X (NOT(A (G ((3 <= ma_cap)))))) : NOT(E (F ((mr_cap <= r)))) : E ((((ma <= dr) AND (mr <= r_cap) AND (dr_a <= r_cap)) U (1 <= 0))) : E (F (E (X ((ma_cap <= dr))))) : A (G ((((da_a <= mr_cap) OR (dr_a <= r) OR (c_cap <= 2)) AND ((mr_cap + 1 <= r_cap) OR (da_a + 1 <= ma_cap))))) : (((A (G ((mr <= c_cap))) OR A (G ((2 <= mr_cap)))) AND NOT(A (X ((2 <= dr_a))))) AND (1 <= c_cap))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:449
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
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:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: 38 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((mr_cap <= 2))) OR E (X (A (G ((dr_a <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((mr_cap <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((mr_cap <= 2))
lola: processed formula length: 17
lola: 39 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: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((dr_a <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((dr_a <= mr_cap)))
lola: processed formula length: 24
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 106 markings, 207 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((c <= dr_a) OR (dr_a <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((c <= dr_a) OR (dr_a <= r_cap))))
lola: processed formula length: 41
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3336953 markings, 6764826 edges, 667391 markings/sec, 0 secs
lola: 6736757 markings, 13632094 edges, 679961 markings/sec, 5 secs
lola: 10144780 markings, 20540677 edges, 681605 markings/sec, 10 secs
lola: 13456226 markings, 27376686 edges, 662289 markings/sec, 15 secs
lola: 16743215 markings, 34080686 edges, 657398 markings/sec, 20 secs
lola: 19938681 markings, 40657356 edges, 639093 markings/sec, 25 secs
lola: 23108218 markings, 47234998 edges, 633907 markings/sec, 30 secs
lola: 26292854 markings, 53762940 edges, 636927 markings/sec, 35 secs
lola: 29365125 markings, 60052526 edges, 614454 markings/sec, 40 secs
lola: 32419994 markings, 66398707 edges, 610974 markings/sec, 45 secs
lola: 35528799 markings, 72794933 edges, 621761 markings/sec, 50 secs
lola: 38571462 markings, 79023366 edges, 608533 markings/sec, 55 secs
lola: 41603477 markings, 85247417 edges, 606403 markings/sec, 60 secs
lola: 44661103 markings, 91552181 edges, 611525 markings/sec, 65 secs
lola: 47674822 markings, 97811759 edges, 602744 markings/sec, 70 secs
lola: 50700716 markings, 104067842 edges, 605179 markings/sec, 75 secs
lola: 53666162 markings, 110307938 edges, 593089 markings/sec, 80 secs
lola: 56611997 markings, 116477695 edges, 589167 markings/sec, 85 secs
lola: 59535465 markings, 122617910 edges, 584694 markings/sec, 90 secs
lola: 62462882 markings, 128669998 edges, 585483 markings/sec, 95 secs
lola: 65441037 markings, 134779561 edges, 595631 markings/sec, 100 secs
lola: 68433951 markings, 140962623 edges, 598583 markings/sec, 105 secs
lola: 71367824 markings, 147089633 edges, 586775 markings/sec, 110 secs
lola: 73384560 markings, 151374863 edges, 403347 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((ma_cap <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (ma_cap <= 2)
lola: processed formula length: 13
lola: 40 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 /EXEF)
lola: state space: using reachability graph (EXef 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: 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: (ma_cap <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 99 markings, 98 edges
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((mr_cap <= dr) OR (1 <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((mr_cap <= dr) OR (1 <= ma))))
lola: processed formula length: 38
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3147474 markings, 6383948 edges, 629495 markings/sec, 0 secs
lola: 6418831 markings, 13005414 edges, 654271 markings/sec, 5 secs
lola: 9761548 markings, 19768496 edges, 668543 markings/sec, 10 secs
lola: 12986226 markings, 26375393 edges, 644936 markings/sec, 15 secs
lola: 16150185 markings, 32889832 edges, 632792 markings/sec, 20 secs
lola: 19274208 markings, 39293950 edges, 624805 markings/sec, 25 secs
lola: 22378576 markings, 45707914 edges, 620874 markings/sec, 30 secs
lola: 25498510 markings, 52126376 edges, 623987 markings/sec, 35 secs
lola: 28561517 markings, 58389789 edges, 612601 markings/sec, 40 secs
lola: 31583447 markings, 64657104 edges, 604386 markings/sec, 45 secs
lola: 34637115 markings, 70930950 edges, 610734 markings/sec, 50 secs
lola: 37596956 markings, 77037462 edges, 591968 markings/sec, 55 secs
lola: 40609777 markings, 83160103 edges, 602564 markings/sec, 60 secs
lola: 43591603 markings, 89319653 edges, 596365 markings/sec, 65 secs
lola: 46563293 markings, 95528311 edges, 594338 markings/sec, 70 secs
lola: 49516806 markings, 101635641 edges, 590703 markings/sec, 75 secs
lola: 52463466 markings, 107814569 edges, 589332 markings/sec, 80 secs
lola: 55380160 markings, 113924594 edges, 583339 markings/sec, 85 secs
lola: 58282398 markings, 119923084 edges, 580448 markings/sec, 90 secs
lola: 61119965 markings, 125883155 edges, 567513 markings/sec, 95 secs
lola: 64059941 markings, 131961170 edges, 587995 markings/sec, 100 secs
lola: 66943043 markings, 137898948 edges, 576620 markings/sec, 105 secs
lola: 69898927 markings, 144033999 edges, 591177 markings/sec, 110 secs
lola: 72729772 markings, 149948172 edges, 566169 markings/sec, 115 secs
lola: 73353677 markings, 151262401 edges, 124781 markings/sec, 120 secs
lola: 73353741 markings, 151262646 edges, 13 markings/sec, 125 secs
lola: 73370486 markings, 151324443 edges, 3349 markings/sec, 130 secs
lola: 73403653 markings, 151450988 edges, 6633 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((ma_cap <= dr)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (ma_cap <= dr)
lola: processed formula length: 14
lola: 40 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 /EXEF)
lola: state space: using reachability graph (EXef 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: 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: (ma_cap <= dr)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_cap <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((r_cap <= 0)))
lola: processed formula length: 20
lola: 39 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: (r_cap <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((r + 1 <= mr_cap)))
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 ((r + 1 <= mr_cap)))
lola: processed formula length: 25
lola: 40 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: (mr_cap <= r)
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: 101 markings, 100 edges
lola: ========================================
lola: subprocess 10 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((mr <= r) OR (1 <= a_cap))))
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 (((mr <= r) OR (1 <= a_cap))))
lola: processed formula length: 36
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((r + 1 <= mr) AND (a_cap <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((da_a <= mr_cap) OR (dr_a <= r) OR (c_cap <= 2)) AND ((mr_cap + 1 <= r_cap) OR (da_a + 1 <= ma_cap)))))
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 ((((da_a <= mr_cap) OR (dr_a <= r) OR (c_cap <= 2)) AND ((mr_cap + 1 <= r_cap) OR (da_a + 1 <= ma_cap)))))
lola: processed formula length: 114
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((mr_cap + 1 <= da_a) AND (r + 1 <= dr_a) AND (3 <= c_cap)) OR ((r_cap <= mr_cap) AND (ma_cap <= da_a)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= a))) AND ((3 <= c) OR E (F ((a_cap <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= c)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c)
lola: processed formula length: 8
lola: 38 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 13 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((a_cap <= 2)))
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 ((a_cap <= 2)))
lola: processed formula length: 20
lola: 39 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: (a_cap <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 14 will run for 1649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= a)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= a)))
lola: processed formula length: 16
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= a)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((3 <= r_cap)) OR E (F ((ma <= c)))) AND E (F (DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= r_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= r_cap))
lola: processed formula length: 14
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4013891 markings, 7155271 edges, 802778 markings/sec, 0 secs
lola: 7075233 markings, 13711505 edges, 612268 markings/sec, 5 secs
lola: 9678278 markings, 19908044 edges, 520609 markings/sec, 10 secs
lola: 11948810 markings, 25894064 edges, 454106 markings/sec, 15 secs
lola: 14229542 markings, 31809712 edges, 456146 markings/sec, 20 secs
lola: 16288282 markings, 37535030 edges, 411748 markings/sec, 25 secs
lola: 18086102 markings, 43158981 edges, 359564 markings/sec, 30 secs
lola: 19745338 markings, 48669697 edges, 331847 markings/sec, 35 secs
lola: 21378331 markings, 54108760 edges, 326599 markings/sec, 40 secs
lola: 23013496 markings, 59577545 edges, 327033 markings/sec, 45 secs
lola: 24603204 markings, 64979079 edges, 317942 markings/sec, 50 secs
lola: 26184197 markings, 70383231 edges, 316199 markings/sec, 55 secs
lola: 27773056 markings, 75822726 edges, 317772 markings/sec, 60 secs
lola: 29374811 markings, 81245351 edges, 320351 markings/sec, 65 secs
lola: 30957176 markings, 86678037 edges, 316473 markings/sec, 70 secs
lola: 32522551 markings, 92053805 edges, 313075 markings/sec, 75 secs
lola: 34129200 markings, 97467246 edges, 321330 markings/sec, 80 secs
lola: 35668501 markings, 102814814 edges, 307860 markings/sec, 85 secs
lola: 37222686 markings, 108219068 edges, 310837 markings/sec, 90 secs
lola: 38847577 markings, 113662157 edges, 324978 markings/sec, 95 secs
lola: 40421586 markings, 119057744 edges, 314802 markings/sec, 100 secs
lola: 42021058 markings, 124522192 edges, 319894 markings/sec, 105 secs
lola: 43628220 markings, 129950274 edges, 321432 markings/sec, 110 secs
lola: 45408366 markings, 136032811 edges, 356029 markings/sec, 115 secs
lola: 47207168 markings, 142082571 edges, 359760 markings/sec, 120 secs
lola: 48969340 markings, 148181212 edges, 352434 markings/sec, 125 secs
lola: 50711917 markings, 154250687 edges, 348515 markings/sec, 130 secs
lola: 52445180 markings, 160294157 edges, 346653 markings/sec, 135 secs
lola: 54202304 markings, 166388322 edges, 351425 markings/sec, 140 secs
lola: 55986773 markings, 172450169 edges, 356894 markings/sec, 145 secs
lola: 57719263 markings, 178443204 edges, 346498 markings/sec, 150 secs
lola: 59478846 markings, 184516311 edges, 351917 markings/sec, 155 secs
lola: 61243486 markings, 190546234 edges, 352928 markings/sec, 160 secs
lola: 62976687 markings, 196568039 edges, 346640 markings/sec, 165 secs
lola: 64718989 markings, 202617306 edges, 348460 markings/sec, 170 secs
lola: 66439401 markings, 208642727 edges, 344082 markings/sec, 175 secs
lola: 68229496 markings, 214698676 edges, 358019 markings/sec, 180 secs
lola: 69988604 markings, 220702269 edges, 351822 markings/sec, 185 secs
lola: 71749282 markings, 226723602 edges, 352136 markings/sec, 190 secs
lola: 73508446 markings, 232806148 edges, 351833 markings/sec, 195 secs
lola: 75280944 markings, 238856564 edges, 354500 markings/sec, 200 secs
lola: 77042843 markings, 244886914 edges, 352380 markings/sec, 205 secs
lola: 78785907 markings, 250944597 edges, 348613 markings/sec, 210 secs
lola: 80570838 markings, 257020233 edges, 356986 markings/sec, 215 secs
lola: 82328138 markings, 263120371 edges, 351460 markings/sec, 220 secs
lola: 84107944 markings, 269206557 edges, 355961 markings/sec, 225 secs
lola: 85866784 markings, 275290892 edges, 351768 markings/sec, 230 secs
lola: 87626418 markings, 281349991 edges, 351927 markings/sec, 235 secs
lola: 89407092 markings, 287385660 edges, 356135 markings/sec, 240 secs
lola: 91198421 markings, 293460577 edges, 358266 markings/sec, 245 secs
lola: 92937477 markings, 299451437 edges, 347811 markings/sec, 250 secs
lola: 94737640 markings, 305490605 edges, 360033 markings/sec, 255 secs
lola: 96509250 markings, 311524548 edges, 354322 markings/sec, 260 secs
lola: 98265158 markings, 317516595 edges, 351182 markings/sec, 265 secs
lola: 100011196 markings, 323500274 edges, 349208 markings/sec, 270 secs
lola: 101763412 markings, 329483259 edges, 350443 markings/sec, 275 secs
lola: 103520542 markings, 335450097 edges, 351426 markings/sec, 280 secs
lola: 105255317 markings, 341379157 edges, 346955 markings/sec, 285 secs
lola: 107037165 markings, 347359856 edges, 356370 markings/sec, 290 secs
lola: 108787227 markings, 353346118 edges, 350012 markings/sec, 295 secs
lola: 110558028 markings, 359366346 edges, 354160 markings/sec, 300 secs
lola: 112285991 markings, 365330514 edges, 345593 markings/sec, 305 secs
lola: 114044892 markings, 371322312 edges, 351780 markings/sec, 310 secs
lola: 115830223 markings, 377310380 edges, 357066 markings/sec, 315 secs
lola: 117577448 markings, 383253271 edges, 349445 markings/sec, 320 secs
lola: 119318026 markings, 389123627 edges, 348116 markings/sec, 325 secs
lola: 121038905 markings, 394998487 edges, 344176 markings/sec, 330 secs
lola: 122769433 markings, 400885332 edges, 346106 markings/sec, 335 secs
lola: 124512029 markings, 406779669 edges, 348519 markings/sec, 340 secs
lola: 126158917 markings, 412344991 edges, 329378 markings/sec, 345 secs
lola: 127564153 markings, 417104390 edges, 281047 markings/sec, 350 secs
lola: 129223919 markings, 422741194 edges, 331953 markings/sec, 355 secs
lola: 130879548 markings, 428381511 edges, 331126 markings/sec, 360 secs
lola: 132646328 markings, 434331805 edges, 353356 markings/sec, 365 secs
lola: 134395054 markings, 440284066 edges, 349745 markings/sec, 370 secs
lola: 136097921 markings, 446100931 edges, 340573 markings/sec, 375 secs
lola: 137740122 markings, 451603226 edges, 328440 markings/sec, 380 secs
lola: 139444679 markings, 457323852 edges, 340911 markings/sec, 385 secs
lola: 140998863 markings, 462523135 edges, 310837 markings/sec, 390 secs
lola: 142665858 markings, 468112319 edges, 333399 markings/sec, 395 secs
lola: 144317255 markings, 473693261 edges, 330279 markings/sec, 400 secs
lola: 145986936 markings, 479414266 edges, 333936 markings/sec, 405 secs
lola: 147695307 markings, 485240819 edges, 341674 markings/sec, 410 secs
lola: 149407859 markings, 491051725 edges, 342510 markings/sec, 415 secs
lola: 151122911 markings, 496908715 edges, 343010 markings/sec, 420 secs
lola: 152830909 markings, 502777759 edges, 341600 markings/sec, 425 secs
lola: 154571489 markings, 508732281 edges, 348116 markings/sec, 430 secs
lola: 156292858 markings, 514644165 edges, 344274 markings/sec, 435 secs
lola: 158034902 markings, 520528455 edges, 348409 markings/sec, 440 secs
lola: 159764271 markings, 526358365 edges, 345874 markings/sec, 445 secs
lola: 161483516 markings, 532187567 edges, 343849 markings/sec, 450 secs
lola: 163202094 markings, 538007753 edges, 343716 markings/sec, 455 secs
lola: 164919650 markings, 543832929 edges, 343511 markings/sec, 460 secs
lola: 166646057 markings, 549679154 edges, 345281 markings/sec, 465 secs
lola: 168362109 markings, 555492921 edges, 343210 markings/sec, 470 secs
lola: 170091986 markings, 561343134 edges, 345975 markings/sec, 475 secs
lola: 171802044 markings, 567134538 edges, 342012 markings/sec, 480 secs
lola: 173506750 markings, 572938447 edges, 340941 markings/sec, 485 secs
lola: 175235265 markings, 578786315 edges, 345703 markings/sec, 490 secs
lola: 176962630 markings, 584589161 edges, 345473 markings/sec, 495 secs
lola: 178703152 markings, 590436454 edges, 348104 markings/sec, 500 secs
lola: 180442368 markings, 596267999 edges, 347843 markings/sec, 505 secs
lola: 182157023 markings, 602053530 edges, 342931 markings/sec, 510 secs
lola: 183873585 markings, 607825404 edges, 343312 markings/sec, 515 secs
lola: 185578712 markings, 613566768 edges, 341025 markings/sec, 520 secs
lola: 187281850 markings, 619290099 edges, 340628 markings/sec, 525 secs
lola: 188976703 markings, 625041236 edges, 338971 markings/sec, 530 secs
lola: 190096988 markings, 628858830 edges, 224057 markings/sec, 535 secs
lola: 190117913 markings, 628930963 edges, 4185 markings/sec, 540 secs
lola: 190287256 markings, 629501823 edges, 33869 markings/sec, 545 secs
lola: 190299193 markings, 629541896 edges, 2387 markings/sec, 550 secs
lola: 190299234 markings, 629542102 edges, 8 markings/sec, 555 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 1367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((mr <= c_cap))) OR A (G ((2 <= mr_cap)))) AND (NOT DEADLOCK AND (1 <= c_cap)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= mr_cap)))
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 ((2 <= mr_cap)))
lola: processed formula length: 21
lola: 40 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: 100 markings, 99 edges
lola: ========================================
lola: subprocess 15 will run for 2734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND (1 <= c_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (NOT DEADLOCK AND (1 <= c_cap))
lola: processed formula length: 31
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap)) AND E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))
lola: processed formula length: 53
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((c <= dr_a) OR (dr_a <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((c <= dr_a) OR (dr_a <= r_cap))))
lola: processed formula length: 41
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3373744 markings, 6838781 edges, 674749 markings/sec, 0 secs
lola: 6691802 markings, 13540734 edges, 663612 markings/sec, 5 secs
lola: 10018253 markings, 20285697 edges, 665290 markings/sec, 10 secs
lola: 13253335 markings, 26947278 edges, 647016 markings/sec, 15 secs
lola: 16463702 markings, 33506056 edges, 642073 markings/sec, 20 secs
lola: 19584672 markings, 39928098 edges, 624194 markings/sec, 25 secs
lola: 22702459 markings, 46404764 edges, 623557 markings/sec, 30 secs
lola: 25850425 markings, 52848697 edges, 629593 markings/sec, 35 secs
lola: 28894183 markings, 59100895 edges, 608752 markings/sec, 40 secs
lola: 31915007 markings, 65328737 edges, 604165 markings/sec, 45 secs
lola: 34988233 markings, 71643194 edges, 614645 markings/sec, 50 secs
lola: 37966531 markings, 77796914 edges, 595660 markings/sec, 55 secs
lola: 40769496 markings, 83483553 edges, 560593 markings/sec, 60 secs
lola: 43787865 markings, 89728927 edges, 603674 markings/sec, 65 secs
lola: 46804555 markings, 96016294 edges, 603338 markings/sec, 70 secs
lola: 49769394 markings, 102146654 edges, 592968 markings/sec, 75 secs
lola: 52766941 markings, 108481436 edges, 599509 markings/sec, 80 secs
lola: 55753791 markings, 114691600 edges, 597370 markings/sec, 85 secs
lola: 58666628 markings, 120713321 edges, 582567 markings/sec, 90 secs
lola: 61502268 markings, 126667372 edges, 567128 markings/sec, 95 secs
lola: 64413607 markings, 132686867 edges, 582268 markings/sec, 100 secs
lola: 67188833 markings, 138426001 edges, 555045 markings/sec, 105 secs
lola: 70139285 markings, 144531832 edges, 590090 markings/sec, 110 secs
lola: 72959981 markings, 150416473 edges, 564139 markings/sec, 115 secs
lola: 73363602 markings, 151299727 edges, 80724 markings/sec, 120 secs
lola: 73396874 markings, 151423335 edges, 6654 markings/sec, 125 secs
lola: 73406622 markings, 151456903 edges, 1950 markings/sec, 130 secs
lola: 73410259 markings, 151464258 edges, 727 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((mr_cap <= dr) OR (1 <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((mr_cap <= dr) OR (1 <= ma))))
lola: processed formula length: 38
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3112678 markings, 6313994 edges, 622536 markings/sec, 0 secs
lola: 6304271 markings, 12773799 edges, 638319 markings/sec, 5 secs
lola: 9580852 markings, 19404470 edges, 655316 markings/sec, 10 secs
lola: 12745345 markings, 25885535 edges, 632899 markings/sec, 15 secs
lola: 15735744 markings, 32066353 edges, 598080 markings/sec, 20 secs
lola: 18883999 markings, 38509904 edges, 629651 markings/sec, 25 secs
lola: 21997465 markings, 44903805 edges, 622693 markings/sec, 30 secs
lola: 25106799 markings, 51300768 edges, 621867 markings/sec, 35 secs
lola: 28188795 markings, 57612104 edges, 616399 markings/sec, 40 secs
lola: 31201921 markings, 63883880 edges, 602625 markings/sec, 45 secs
lola: 34135406 markings, 69903007 edges, 586697 markings/sec, 50 secs
lola: 37135249 markings, 76088878 edges, 599969 markings/sec, 55 secs
lola: 40142641 markings, 82220341 edges, 601478 markings/sec, 60 secs
lola: 43113369 markings, 88351053 edges, 594146 markings/sec, 65 secs
lola: 46092444 markings, 94559763 edges, 595815 markings/sec, 70 secs
lola: 49063113 markings, 100670703 edges, 594134 markings/sec, 75 secs
lola: 51987743 markings, 106846975 edges, 584926 markings/sec, 80 secs
lola: 54904610 markings, 112905984 edges, 583373 markings/sec, 85 secs
lola: 57801945 markings, 118923374 edges, 579467 markings/sec, 90 secs
lola: 60653612 markings, 124925618 edges, 570333 markings/sec, 95 secs
lola: 63580181 markings, 130982513 edges, 585314 markings/sec, 100 secs
lola: 66488722 markings, 136923095 edges, 581708 markings/sec, 105 secs
lola: 69445525 markings, 143018635 edges, 591361 markings/sec, 110 secs
lola: 72273975 markings, 149020501 edges, 565690 markings/sec, 115 secs
lola: 73409069 markings, 151461834 edges, 227019 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((3 <= r_cap)) OR E (F ((ma <= c)))) AND E (F (DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((3 <= r_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= r_cap))
lola: processed formula length: 14
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4049962 markings, 7241834 edges, 809992 markings/sec, 0 secs
lola: 7342330 markings, 14308925 edges, 658474 markings/sec, 5 secs
lola: 10128080 markings, 21094012 edges, 557150 markings/sec, 10 secs
lola: 12639093 markings, 27700303 edges, 502203 markings/sec, 15 secs
lola: 15137696 markings, 34249675 edges, 499721 markings/sec, 20 secs
lola: 17276850 markings, 40589239 edges, 427831 markings/sec, 25 secs
lola: 19222900 markings, 46860997 edges, 389210 markings/sec, 30 secs
lola: 21071140 markings, 53065478 edges, 369648 markings/sec, 35 secs
lola: 22910260 markings, 59254919 edges, 367824 markings/sec, 40 secs
lola: 24735512 markings, 65404907 edges, 365050 markings/sec, 45 secs
lola: 26509654 markings, 71565278 edges, 354828 markings/sec, 50 secs
lola: 28332328 markings, 77726539 edges, 364535 markings/sec, 55 secs
lola: 30161983 markings, 83911008 edges, 365931 markings/sec, 60 secs
lola: 31941265 markings, 90025632 edges, 355856 markings/sec, 65 secs
lola: 33737220 markings, 96135868 edges, 359191 markings/sec, 70 secs
lola: 35480103 markings, 102168401 edges, 348577 markings/sec, 75 secs
lola: 37242794 markings, 108287373 edges, 352538 markings/sec, 80 secs
lola: 39066723 markings, 114399479 edges, 364786 markings/sec, 85 secs
lola: 40840882 markings, 120490364 edges, 354832 markings/sec, 90 secs
lola: 42636954 markings, 126618158 edges, 359214 markings/sec, 95 secs
lola: 44448297 markings, 132752615 edges, 362269 markings/sec, 100 secs
lola: 46223544 markings, 138845484 edges, 355049 markings/sec, 105 secs
lola: 48033283 markings, 144960635 edges, 361948 markings/sec, 110 secs
lola: 49813368 markings, 151117075 edges, 356017 markings/sec, 115 secs
lola: 51570245 markings, 157219112 edges, 351375 markings/sec, 120 secs
lola: 53244947 markings, 163078179 edges, 334940 markings/sec, 125 secs
lola: 55001426 markings, 169125461 edges, 351296 markings/sec, 130 secs
lola: 56706051 markings, 174968351 edges, 340925 markings/sec, 135 secs
lola: 58451090 markings, 180968065 edges, 349008 markings/sec, 140 secs
lola: 60216125 markings, 186999056 edges, 353007 markings/sec, 145 secs
lola: 61959014 markings, 193017754 edges, 348578 markings/sec, 150 secs
lola: 63670626 markings, 199011455 edges, 342322 markings/sec, 155 secs
lola: 65398723 markings, 205022344 edges, 345619 markings/sec, 160 secs
lola: 67154925 markings, 211042048 edges, 351240 markings/sec, 165 secs
lola: 68889380 markings, 217039181 edges, 346891 markings/sec, 170 secs
lola: 70682212 markings, 223060707 edges, 358566 markings/sec, 175 secs
lola: 72446997 markings, 229099632 edges, 352957 markings/sec, 180 secs
lola: 74213085 markings, 235167941 edges, 353218 markings/sec, 185 secs
lola: 75974586 markings, 241174763 edges, 352300 markings/sec, 190 secs
lola: 77718495 markings, 247203631 edges, 348782 markings/sec, 195 secs
lola: 79461903 markings, 253231982 edges, 348682 markings/sec, 200 secs
lola: 81244265 markings, 259304391 edges, 356472 markings/sec, 205 secs
lola: 82972741 markings, 265368939 edges, 345695 markings/sec, 210 secs
lola: 84769937 markings, 271456609 edges, 359439 markings/sec, 215 secs
lola: 86503238 markings, 277492476 edges, 346660 markings/sec, 220 secs
lola: 88283995 markings, 283525408 edges, 356151 markings/sec, 225 secs
lola: 90059193 markings, 289566462 edges, 355040 markings/sec, 230 secs
lola: 91808385 markings, 295567215 edges, 349838 markings/sec, 235 secs
lola: 93547160 markings, 301538196 edges, 347755 markings/sec, 240 secs
lola: 95328980 markings, 307531878 edges, 356364 markings/sec, 245 secs
lola: 97106378 markings, 313533235 edges, 355480 markings/sec, 250 secs
lola: 98835476 markings, 319505109 edges, 345820 markings/sec, 255 secs
lola: 100583199 markings, 325468508 edges, 349545 markings/sec, 260 secs
lola: 102330081 markings, 331412041 edges, 349376 markings/sec, 265 secs
lola: 104005860 markings, 337105436 edges, 335156 markings/sec, 270 secs
lola: 105708310 markings, 342903350 edges, 340490 markings/sec, 275 secs
lola: 107482839 markings, 348873789 edges, 354906 markings/sec, 280 secs
lola: 109244011 markings, 354862834 edges, 352234 markings/sec, 285 secs
lola: 110983577 markings, 360850450 edges, 347913 markings/sec, 290 secs
lola: 112697338 markings, 366767635 edges, 342752 markings/sec, 295 secs
lola: 114483995 markings, 372778181 edges, 357331 markings/sec, 300 secs
lola: 116250384 markings, 378727626 edges, 353278 markings/sec, 305 secs
lola: 117989055 markings, 384659371 edges, 347734 markings/sec, 310 secs
lola: 119741994 markings, 390565866 edges, 350588 markings/sec, 315 secs
lola: 121455899 markings, 396452440 edges, 342781 markings/sec, 320 secs
lola: 123209804 markings, 402409106 edges, 350781 markings/sec, 325 secs
lola: 124991297 markings, 408404596 edges, 356299 markings/sec, 330 secs
lola: 126745926 markings, 414347168 edges, 350926 markings/sec, 335 secs
lola: 128503258 markings, 420278024 edges, 351466 markings/sec, 340 secs
lola: 130249166 markings, 426214381 edges, 349182 markings/sec, 345 secs
lola: 132001803 markings, 432141381 edges, 350527 markings/sec, 350 secs
lola: 133755628 markings, 438105562 edges, 350765 markings/sec, 355 secs
lola: 135502005 markings, 444065855 edges, 349275 markings/sec, 360 secs
lola: 137240931 markings, 449921739 edges, 347785 markings/sec, 365 secs
lola: 139009830 markings, 455842209 edges, 353780 markings/sec, 370 secs
lola: 140747521 markings, 461686493 edges, 347538 markings/sec, 375 secs
lola: 142472437 markings, 467489828 edges, 344983 markings/sec, 380 secs
lola: 144221211 markings, 473351320 edges, 349755 markings/sec, 385 secs
lola: 145917895 markings, 479169594 edges, 339337 markings/sec, 390 secs
lola: 147619396 markings, 485000677 edges, 340300 markings/sec, 395 secs
lola: 149341941 markings, 490829292 edges, 344509 markings/sec, 400 secs
lola: 151060066 markings, 496688501 edges, 343625 markings/sec, 405 secs
lola: 152769668 markings, 502561216 edges, 341920 markings/sec, 410 secs
lola: 154509690 markings, 508526107 edges, 348004 markings/sec, 415 secs
lola: 156242106 markings, 514461151 edges, 346483 markings/sec, 420 secs
lola: 157982170 markings, 520344683 edges, 348013 markings/sec, 425 secs
lola: 159723801 markings, 526216453 edges, 348326 markings/sec, 430 secs
lola: 161466903 markings, 532132421 edges, 348620 markings/sec, 435 secs
lola: 163209166 markings, 538032275 edges, 348453 markings/sec, 440 secs
lola: 164950558 markings, 543938037 edges, 348278 markings/sec, 445 secs
lola: 166696385 markings, 549859734 edges, 349165 markings/sec, 450 secs
lola: 168437992 markings, 555759851 edges, 348321 markings/sec, 455 secs
lola: 170191834 markings, 561693665 edges, 350768 markings/sec, 460 secs
lola: 171938245 markings, 567583041 edges, 349282 markings/sec, 465 secs
lola: 173661916 markings, 573467240 edges, 344734 markings/sec, 470 secs
lola: 175419479 markings, 579389583 edges, 351513 markings/sec, 475 secs
lola: 177164768 markings, 585273494 edges, 349058 markings/sec, 480 secs
lola: 178936560 markings, 591210064 edges, 354358 markings/sec, 485 secs
lola: 180697350 markings, 597131531 edges, 352158 markings/sec, 490 secs
lola: 182440287 markings, 602999346 edges, 348587 markings/sec, 495 secs
lola: 184176768 markings, 608833636 edges, 347296 markings/sec, 500 secs
lola: 185915630 markings, 614671316 edges, 347772 markings/sec, 505 secs
lola: 187636163 markings, 620476795 edges, 344107 markings/sec, 510 secs
lola: 189354224 markings, 626329558 edges, 343612 markings/sec, 515 secs
lola: 190306888 markings, 629569235 edges, 190533 markings/sec, 520 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((mr <= c_cap))) OR A (G ((2 <= mr_cap)))) AND (NOT DEADLOCK AND (1 <= c_cap)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= mr_cap)))
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 ((2 <= mr_cap)))
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (mr_cap <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND (1 <= c_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (NOT DEADLOCK AND (1 <= c_cap))
lola: processed formula length: 31
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((mr <= c_cap)))
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 ((mr <= c_cap)))
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (c_cap + 1 <= mr)
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: 107 markings, 109 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap)) AND E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c <= 2) AND (ma + 1 <= ma_cap) AND (da_a <= r_cap))
lola: processed formula length: 53
lola: 38 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: ========================================
lola: ...considering subproblem: E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((c <= a_cap) AND ((a_cap <= a) OR (2 <= ma_cap)))))
lola: processed formula length: 59
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((a_cap + 1 <= c) OR ((a + 1 <= a_cap) AND (ma_cap <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown unknown unknown yes yes yes no yes no yes no no yes no no
lola:
preliminary result: no unknown unknown unknown yes yes yes no yes no yes no no yes no no
lola: memory consumption: 20064 KB
lola: time consumption: 1631 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552526469680

--------------------
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="CircadianClock-PT-000100"
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 CircadianClock-PT-000100, 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-155225120900130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;