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.r137-smll-155284909700301.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 RefineWMG-PT-005006, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-155284909700301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.7K Feb 12 14:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 16:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 01:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.9K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005-006-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-005-006-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553042599180

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-005006 @ 3570 seconds

FORMULA RefineWMG-PT-005-006-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-005-006-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2772
rslt: Output for CTLCardinality @ RefineWMG-PT-005006

{
"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": "Wed Mar 20 00:43:19 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E((((1 <= p12) AND (3 <= p15)) OR (p25 <= p12)) U AX((pprime <= p22)))",
"processed_size": 71,
"rewrites": 20
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 137200,
"markings": 40817,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AG(EX((2 <= p3)))",
"processed_size": 17,
"rewrites": 20
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 9847813,
"markings": 5349065,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"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": "(p7 <= 0)",
"processed_size": 9,
"rewrites": 21
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "E ((((3 <= p16) OR (p19 <= p14)) U (p8 <= p7)))",
"processed_size": 48,
"rewrites": 21
},
"result":
{
"edges": 1598034,
"markings": 995883,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"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 <= p11)",
"processed_size": 10,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 364
},
"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 ((3 <= p3)))",
"processed_size": 17,
"rewrites": 20
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"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": 2,
"visible_transitions": 0
},
"processed": "A (G (((p6 + 1 <= p14) OR (p14 <= 1))))",
"processed_size": 40,
"rewrites": 20
},
"result":
{
"edges": 25,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p25) AND (p25 <= p1))))",
"processed_size": 36,
"rewrites": 19
},
"result":
{
"edges": 56,
"markings": 43,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(E((p17 <= p4) U (3 <= p1)))",
"processed_size": 30,
"rewrites": 20
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 246958,
"markings": 127477,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 468
},
"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 (((p20 <= p23) OR (2 <= p6))))",
"processed_size": 36,
"rewrites": 20
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 546
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p3 <= 1) OR (p13 + 1 <= p2) OR ((p13 + 1 <= psecond) AND (p15 <= 2)))))",
"processed_size": 81,
"rewrites": 19
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 656
},
"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": "(2 <= p12)",
"processed_size": 10,
"rewrites": 22
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((pprime <= 1) OR (p9 + 1 <= p1)) R ((p7 <= 1))))",
"processed_size": 54,
"rewrites": 23
},
"result":
{
"edges": 4404023,
"markings": 454010,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1092
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p10) AND (pprime <= p17))",
"processed_size": 32,
"rewrites": 21
},
"result":
{
"edges": 422199,
"markings": 219107,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1638
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (((p7 <= 1) U ((p19 <= p1) AND (p5 <= p23) AND (1 <= pterce))))",
"processed_size": 65,
"rewrites": 21
},
"result":
{
"edges": 534,
"markings": 343,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3277
},
"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": "(p3 <= 2)",
"processed_size": 9,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((p19 + 1 <= p24))",
"processed_size": 20,
"rewrites": 19
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15))))",
"processed_size": 63,
"rewrites": 20
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22496,
"runtime": 798.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E((** U **)))) : E((** U A(X(**)))) : (A(F(**)) AND A(G(**))) : (** AND A(G(E(X(**))))) : E(G(E(F(**)))) : A(G(**)) : (E(F(A(G(**)))) OR A(X(*))) : ((** AND (A(F(**)) AND E(X(**)))) OR E((** U **))) : A((* R *)) : (A(G(**)) AND (E(X(**)) OR (** OR E(G(**))))) : E(F(*)) : A(G(A(F(**)))) : (E(X(*)) AND A(G(**))) : (E(F(**)) OR ((** AND E(X(**))) OR E(X(*)))) : E((** U **)) : **"
},
"net":
{
"arcs": 68,
"conflict_clusters": 18,
"places": 29,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 23
},
"result":
{
"preliminary_value": "yes no no no yes no unknown yes no no yes no no yes yes no ",
"value": "yes no no no yes no unknown yes no no yes no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 928
lola: finding significant places
lola: 29 places, 23 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (X (E (((p17 <= p4) U (3 <= p1))))) : E (((((1 <= p12) AND (3 <= p15)) OR (p25 <= p12)) U A (X ((pprime <= p22))))) : (A (F ((3 <= p3))) AND A (G (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15))))) : ((2 <= pprime) AND A (G (E (X ((2 <= p3)))))) : E (G (E (F (((1 <= p10) AND (pprime <= p17)))))) : A (G (E (G (((p20 <= p23) OR (2 <= p6)))))) : (E (F (A (G ((p5 <= p6))))) OR NOT(E (X ((p24 <= p19))))) : ((((1 <= p23) AND (1 <= p17) AND (3 <= p) AND ((p6 + 1 <= p19) OR (3 <= p16))) AND (A (F ((1 <= p7))) AND E (X ((3 <= p1))))) OR E ((((3 <= p16) OR (p19 <= p14)) U (p8 <= p7)))) : NOT(E ((((2 <= pprime) AND (p1 <= p9)) U ((2 <= p7))))) : (A (G ((3 <= p3))) AND (E (X (((2 <= psecond) AND (p21 <= p17)))) OR ((3 <= p11) OR E (G ((3 <= p12)))))) : NOT(A (G (((2 <= p3) AND (p2 <= p13) AND ((psecond <= p13) OR (3 <= p15)))))) : A (G (A (F ((p12 <= 1))))) : (NOT(A (X ((p <= 1)))) AND A (G (((p6 + 1 <= p14) OR (p14 <= 1))))) : ((E (F (((3 <= p25) AND (p25 <= p1)))) OR (((p11 <= 2) AND (p18 + 1 <= p20)) AND E (X ((p16 <= p9))))) OR NOT(A (X ((p5 <= p13))))) : E (((p7 <= 1) U ((p19 <= p1) AND (p5 <= p23) AND (1 <= pterce)))) : (p9 <= p25)
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 <= p25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p25)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p12) AND (3 <= p15)) OR (p25 <= p12)) U A (X ((pprime <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p12) AND (3 <= p15)) OR (p25 <= p12)) U AX((pprime <= p22)))
lola: processed formula length: 71
lola: 20 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: 40817 markings, 137200 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= pprime) AND A (G (E (X ((2 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= pprime)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pprime)
lola: processed formula length: 13
lola: 18 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= p3)))))
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((2 <= p3)))
lola: processed formula length: 17
lola: 20 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: 3299339 markings, 5835395 edges, 659868 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5349065 markings, 9847813 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p5 <= p6))))) OR A (X ((p19 + 1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p5 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p6 + 1 <= p5)
lola: processed formula length: 14
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p6 + 1 <= p5)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= p6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-1.sara.
sara: try reading problem file CTLCardinality-3-0.sara.


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3603839 markings, 6649650 edges, 720768 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6087778 markings, 12762022 edges, 496788 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8935026 markings, 18960648 edges, 569450 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10786994 markings, 24567480 edges, 370394 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13012899 markings, 30262665 edges, 445181 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15622622 markings, 35918601 edges, 521945 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17743962 markings, 41375056 edges, 424268 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19913686 markings, 47028170 edges, 433945 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22016915 markings, 52900486 edges, 420646 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24784245 markings, 59695318 edges, 553466 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27186446 markings, 66750192 edges, 480440 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 29507468 markings, 73656972 edges, 464204 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 31880069 markings, 80604582 edges, 474520 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34014422 markings, 87594640 edges, 426871 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 36415708 markings, 94508864 edges, 480257 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39126031 markings, 101280485 edges, 542065 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41744874 markings, 108061506 edges, 523769 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44123625 markings, 114907919 edges, 475750 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46652787 markings, 121726900 edges, 505832 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48471249 markings, 128799191 edges, 363692 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50506847 markings, 135681004 edges, 407120 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 52460774 markings, 142724344 edges, 390785 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 54306907 markings, 149704737 edges, 369227 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 56466949 markings, 156659691 edges, 432008 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 59232372 markings, 163319919 edges, 553085 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 61267684 markings, 170177230 edges, 407062 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 63736642 markings, 177039852 edges, 493792 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 65348380 markings, 184033428 edges, 322348 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 67061406 markings, 190971645 edges, 342605 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 68249638 markings, 198053944 edges, 237646 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 68983655 markings, 205260287 edges, 146803 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 69851112 markings, 212564985 edges, 173491 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 70552500 markings, 219865368 edges, 140278 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 72262260 markings, 226931339 edges, 341952 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 74541919 markings, 233846909 edges, 455932 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 76547338 markings, 240632852 edges, 401084 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 77976798 markings, 247593198 edges, 285892 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 79771269 markings, 254593259 edges, 358894 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 81651443 markings, 261350849 edges, 376035 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 82657364 markings, 268498992 edges, 201184 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 84211884 markings, 275478807 edges, 310904 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 85152388 markings, 282635420 edges, 188101 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 85968385 markings, 289968071 edges, 163199 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 87041358 markings, 297161598 edges, 214595 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 87832635 markings, 304314536 edges, 158255 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 88630514 markings, 311438963 edges, 159576 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 89438419 markings, 318661017 edges, 161581 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 90144424 markings, 325890146 edges, 141201 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 92159491 markings, 332423567 edges, 403013 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 94362333 markings, 338733581 edges, 440568 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 96681535 markings, 345313823 edges, 463840 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 98548710 markings, 351356006 edges, 373435 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 100835660 markings, 357993095 edges, 457390 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 102813005 markings, 364782511 edges, 395469 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no
lola: memory consumption: 10690068 KB
lola: time consumption: 287 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no
lola: memory consumption: 10692036 KB
lola: time consumption: 287 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p23) AND (1 <= p17) AND (3 <= p) AND ((p6 + 1 <= p19) OR (3 <= p16))) AND (A (F ((1 <= p7))) AND E (X ((3 <= p1))))) OR E ((((3 <= p16) OR (p19 <= p14)) U (p8 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p7 <= 0)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p16) OR (p19 <= p14)) U (p8 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((3 <= p16) OR (p19 <= p14)) U (p8 <= p7)))
lola: processed formula length: 48
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 995883 markings, 1598034 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= p3))) AND (E (X (((2 <= psecond) AND (p21 <= p17)))) OR ((3 <= p11) OR E (G ((3 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p11)
lola: processed formula length: 10
lola: 18 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 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((3 <= p12)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
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: (p12 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p3)))
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 ((3 <= p3)))
lola: processed formula length: 17
lola: 20 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: (p3 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((2 <= p))) AND A (G (((p6 + 1 <= p14) OR (p14 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 + 1 <= p14) OR (p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p6 + 1 <= p14) OR (p14 <= 1))))
lola: processed formula length: 40
lola: 20 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: ((p14 <= p6) AND (2 <= p14))
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: 21 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= p25) AND (p25 <= p1)))) OR ((((p11 <= 2) AND (p18 + 1 <= p20)) AND E (X ((p16 <= p9)))) OR E (X ((p13 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11 <= 2) AND (p18 + 1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11 <= 2) AND (p18 + 1 <= p20))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p25) AND (p25 <= p1))))
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 <= p25) AND (p25 <= p1))))
lola: processed formula length: 36
lola: 19 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 56 edges
lola: formula 0: ((3 <= p25) AND (p25 <= p1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p17 <= p4) U (3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E((p17 <= p4) U (3 <= p1)))
lola: processed formula length: 30
lola: 20 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 127477 markings, 246958 edges
lola: ========================================
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p20 <= p23) OR (2 <= p6))))
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 (((p20 <= p23) OR (2 <= p6))))
lola: processed formula length: 36
lola: 20 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: ((p23 + 1 <= p20) AND (p6 <= 1))
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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 <= 1) OR (p13 + 1 <= p2) OR ((p13 + 1 <= psecond) AND (p15 <= 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 (((p3 <= 1) OR (p13 + 1 <= p2) OR ((p13 + 1 <= psecond) AND (p15 <= 2)))))
lola: processed formula length: 81
lola: 19 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: ((p3 <= 1) OR (p13 + 1 <= p2) OR ((p13 + 1 <= psecond) AND (p15 <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p12 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p12)
lola: processed formula length: 10
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 23 markings, 23 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p12 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p12)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((pprime <= 1) OR (p9 + 1 <= p1)) R ((p7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((pprime <= 1) OR (p9 + 1 <= p1)) R ((p7 <= 1))))
lola: processed formula length: 54
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
sara: try reading problem file CTLCardinality-11-0.sara.

lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 454010 markings, 4404023 edges
lola: ========================================
lola: subprocess 13 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p10) AND (pprime <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p10) AND (pprime <= p17))
lola: processed formula length: 32
lola: 21 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p10) AND (pprime <= p17))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: formula 0: ((p10 <= 0) OR (p17 + 1 <= pprime))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: write sara problem file to CTLCardinality-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
lola: state equation: calling and running sara

sara: try reading problem file CTLCardinality-13-1.sara.

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 219107 markings, 422199 edges
lola: ========================================
lola: subprocess 14 will run for 1638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p7 <= 1) U ((p19 <= p1) AND (p5 <= p23) AND (1 <= pterce))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p7 <= 1) U ((p19 <= p1) AND (p5 <= p23) AND (1 <= pterce))))
lola: processed formula length: 65
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p19 <= p1) AND (p5 <= p23) AND (1 <= pterce))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 343 markings, 534 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: subprocess 15 will run for 3277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= p3))) AND A (G (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 15 will run for 3277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 <= 2)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
sara: try reading problem file CTLCardinality-14-0.sara.
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p5 <= p6))))) OR A (X ((p19 + 1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING

lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p5 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p6 + 1 <= p5)
lola: processed formula length: 14
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p6 + 1 <= p5)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= p6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-16-1.sara
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3739158 markings, 6935746 edges, 747832 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6580571 markings, 13803323 edges, 568283 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9589506 markings, 20856340 edges, 601787 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12260939 markings, 27929034 edges, 534287 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15225461 markings, 34900748 edges, 592904 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17906740 markings, 41825628 edges, 536256 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20373969 markings, 48811875 edges, 493446 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23170579 markings, 55710155 edges, 559322 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25854059 markings, 62630455 edges, 536696 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28013355 markings, 69660147 edges, 431859 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30647719 markings, 76500876 edges, 526873 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 32846475 markings, 83482304 edges, 439751 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 34955774 markings, 90386165 edges, 421860 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 37427012 markings, 97257416 edges, 494248 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 40232212 markings, 104056281 edges, 561040 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 42401463 markings, 110961461 edges, 433850 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 45286868 markings, 117640723 edges, 577081 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 46962130 markings, 124753284 edges, 335052 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 49293177 markings, 131564785 edges, 466209 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 51322208 markings, 138486934 edges, 405806 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 52941869 markings, 145516490 edges, 323932 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 55093786 markings, 152476304 edges, 430383 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 57724901 markings, 159270824 edges, 526223 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 59826972 markings, 166019724 edges, 420414 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 62019704 markings, 172915867 edges, 438546 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 64553314 markings, 179689216 edges, 506722 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 66114532 markings, 186692405 edges, 312244 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67723502 markings, 193659297 edges, 321794 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68548051 markings, 200857072 edges, 164910 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 69272804 markings, 208075774 edges, 144951 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 70058711 markings, 215362180 edges, 157181 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 71128636 markings, 222486890 edges, 213985 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 73367015 markings, 229461183 edges, 447676 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 75210218 markings, 236386760 edges, 368641 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 77121434 markings, 243277737 edges, 382243 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 78850797 markings, 250072331 edges, 345873 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 80468485 markings, 257096152 edges, 323538 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 82040173 markings, 263984164 edges, 314338 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 82899855 markings, 271129291 edges, 171936 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 84730510 markings, 278020278 edges, 366131 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 85437079 markings, 285290601 edges, 141314 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 86210202 markings, 292600568 edges, 154625 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 87340171 markings, 299676061 edges, 225994 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 88183156 markings, 306869478 edges, 168597 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 88929521 markings, 314025955 edges, 149273 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 89629237 markings, 321228931 edges, 139943 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 90493624 markings, 328442033 edges, 172877 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 92903532 markings, 334977407 edges, 481982 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 95282704 markings, 341550714 edges, 475834 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 97661217 markings, 348161998 edges, 475703 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 99565209 markings, 354781411 edges, 380798 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 101841028 markings, 361390993 edges, 455164 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 103939410 markings, 368130039 edges, 419676 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 106200295 markings, 374794992 edges, 452177 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 107735787 markings, 381727025 edges, 307098 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 110295630 markings, 388264812 edges, 511969 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 111930618 markings, 394958934 edges, 326998 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 113717989 markings, 401645198 edges, 357474 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 115583325 markings, 408340114 edges, 373067 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 117118487 markings, 415068738 edges, 307032 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 118890851 markings, 421711507 edges, 354473 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 120369731 markings, 428627438 edges, 295776 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 122364724 markings, 435396486 edges, 398999 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 124316142 markings, 441982675 edges, 390284 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 126048455 markings, 448672946 edges, 346463 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 127366064 markings, 455631685 edges, 263522 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 129361379 markings, 462250269 edges, 399063 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 131307033 markings, 468829987 edges, 389131 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 132072578 markings, 475924718 edges, 153109 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 133309428 markings, 482656583 edges, 247370 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 134503964 markings, 489423477 edges, 238907 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 135231881 markings, 496366889 edges, 145583 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 136198891 markings, 503233898 edges, 193402 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 136972687 markings, 510167382 edges, 154759 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 138108572 markings, 517007815 edges, 227177 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 139212470 markings, 523947071 edges, 220780 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 141227720 markings, 530552879 edges, 403050 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 142628140 markings, 537351942 edges, 280084 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 145057191 markings, 543837867 edges, 485810 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 146078548 markings, 550626421 edges, 204271 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 148144848 markings, 557140755 edges, 413260 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 149891598 markings, 563759144 edges, 349350 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 151435203 markings, 570483678 edges, 308721 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 153386743 markings, 577172711 edges, 390308 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 154529169 markings, 583955155 edges, 228485 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 155663637 markings, 590441273 edges, 226894 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 157062034 markings, 597203413 edges, 279679 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 158340075 markings, 603843215 edges, 255608 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 159907728 markings, 610568791 edges, 313531 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 160143621 markings, 613133464 edges, 47179 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 160430437 markings, 614511137 edges, 57363 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 160717311 markings, 615836004 edges, 57375 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 160961731 markings, 617912806 edges, 48884 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 161142727 markings, 619312854 edges, 36199 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 161142750 markings, 619313110 edges, 5 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 161152365 markings, 619422928 edges, 1923 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 161175358 markings, 619668587 edges, 4599 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 161175428 markings, 619668698 edges, 14 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 161186499 markings, 619686230 edges, 2214 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((p19 + 1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p19 + 1 <= p24))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: lola: ========================================
========================================
lola: ...considering subproblem: (A (F ((3 <= p3))) AND A (G (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 <= 2)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15))))
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 (((1 <= p4) OR (3 <= p6) OR (p <= p20) OR (2 <= p15))))
lola: processed formula length: 63
lola: 20 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: ((p4 <= 0) AND (p6 <= 2) AND (p20 + 1 <= p) AND (p15 <= 1))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no unknown yes no no yes no no yes yes no
lola:
preliminary result: yes no no no yes no unknown yes no no yes no no yes yes no
lola: memory consumption: 22496 KB
lola: time consumption: 798 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1553043397246

--------------------
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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r137-smll-155284909700301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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