Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r170-oct2-155297750100076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is SwimmingPool-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750100076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 164K
-rw-r--r-- 1 mcc users 3.5K Feb 12 19:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 19:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 9 02:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 9 02:54 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 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 21:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 21:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 21:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 21:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-04-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553105613718

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SwimmingPool-PT-04 @ 3570 seconds

FORMULA SwimmingPool-PT-04-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-04-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-04-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2457
rslt: Output for CTLCardinality @ SwimmingPool-PT-04

{
"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 18:13:33 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"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": "EX(AG((Entered + 1 <= Cabins)))",
"processed_size": 31,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 464,
"markings": 236,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "(Out <= InBath)",
"processed_size": 15,
"rewrites": 36
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "(Out <= 1)",
"processed_size": 10,
"rewrites": 36
},
"result":
{
"edges": 78,
"markings": 79,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AG((((Undress <= Bags) OR (Undress <= Cabins) OR ((WaitBag <= Dress) AND (1 <= Entered))) OR AX((1 <= Entered))))",
"processed_size": 115,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 8106336,
"markings": 2448439,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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": "(Entered <= Bags)",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": "EX(AG((1 <= Bags)))",
"processed_size": 19,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 44807945,
"markings": 12901195,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((Cabins + 1 <= Entered) AND (Dress + 1 <= Entered))",
"processed_size": 52,
"rewrites": 36
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((2 <= Out) OR (2 <= Dress))))",
"processed_size": 37,
"rewrites": 35
},
"result":
{
"edges": 79,
"markings": 80,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((Undress <= Dressed) AND (Cabins + 1 <= Undress) AND (WaitBag <= Dressed))))",
"processed_size": 83,
"rewrites": 34
},
"result":
{
"edges": 124,
"markings": 125,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"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": "A (G (((InBath <= 0) OR (Bags + 1 <= WaitBag) OR (Dressed <= Cabins))))",
"processed_size": 73,
"rewrites": 35
},
"result":
{
"edges": 129,
"markings": 130,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 872
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((Undress + 1 <= Cabins) OR (InBath + 1 <= Entered) OR (Dressed + 1 <= Entered))))",
"processed_size": 90,
"rewrites": 35
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1484
},
"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": "(InBath <= 1)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2968
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((Out <= 2)))",
"processed_size": 18,
"rewrites": 34
},
"result":
{
"edges": 78,
"markings": 79,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))",
"processed_size": 90,
"rewrites": 36
},
"result":
{
"edges": 459,
"markings": 233,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(InBath <= 1)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((Dress <= Entered) OR (2 <= Out) OR (2 <= WaitBag))",
"processed_size": 54,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

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

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

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))",
"processed_size": 90,
"rewrites": 36
},
"result":
{
"edges": 459,
"markings": 233,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21008,
"runtime": 1089.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : FALSE : E(F(*)) : A(X(A(G(*)))) : A(G(**)) : E(F((E(G(**)) AND **))) : A(G(**)) : E(X(A(G(*)))) : (E((** U **)) AND (E(F(**)) AND (E(F(**)) AND E(F(*))))) : FALSE : (* AND (E(F(*)) AND *)) : E(F(**)) : (A(X(A(F(**)))) AND A(X(A(G(**))))) : A(G((** OR A(X(**))))) : (E(X(A(G(**)))) AND **) : A(X(A(G(**))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no yes no no unknown no no yes no yes yes no no no no ",
"value": "no no yes no no unknown no no yes no yes yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (G (A (G (((2 <= Out) OR (2 <= Dress)))))) : E (((Dressed <= Bags) U ())) : A (F (NOT(A (G ((3 <= Out)))))) : A (G (NOT(E (X ((Out <= InBath)))))) : A (G (((Undress + 1 <= Cabins) OR (InBath + 1 <= Entered) OR (Dressed + 1 <= Entered)))) : E (F ((E (G ((3 <= Bags))) AND ((3 <= Out) AND (Cabins <= Dress) AND (Bags <= 0))))) : A (G (((InBath <= 0) OR (Bags + 1 <= WaitBag) OR (Dressed <= Cabins)))) : E (X (NOT(E (F ((Cabins <= Entered)))))) : (E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress)))) AND ((E (F ((InBath <= Bags))) AND E (F ((1 <= Entered)))) AND NOT(A (G ((1 <= Cabins)))))) : NOT(E (F (A (G ((0 <= 0)))))) : NOT((((Entered + 1 <= Dress) AND (Out <= 1) AND (WaitBag <= 1)) OR (A (G ((3 <= Out))) OR (2 <= InBath)))) : E (F (((Undress <= Dressed) AND (Cabins + 1 <= Undress) AND (WaitBag <= Dressed)))) : A (X ((A (F ((1 <= WaitBag))) AND A (G ((2 <= Out)))))) : A (G ((((Undress <= Bags) OR (Undress <= Cabins) OR ((WaitBag <= Dress) AND (1 <= Entered))) OR A (X ((1 <= Entered)))))) : (E (X (A (G ((1 <= Bags))))) AND (Entered <= Bags)) : A (X (A (G (((Entered <= Cabins) OR (Entered <= Dress))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((Entered + 1 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((Entered + 1 <= Cabins)))
lola: processed formula length: 31
lola: 35 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: 236 markings, 464 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((InBath + 1 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (Out <= InBath)
lola: processed formula length: 15
lola: 36 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: (Out <= InBath)
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: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 80 markings, 79 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= WaitBag))))) AND A (X (A (G ((2 <= Out))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((2 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Out <= 1)
lola: processed formula length: 10
lola: 36 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: (Out <= 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-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 79 markings, 78 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Undress <= Bags) OR (Undress <= Cabins) OR ((WaitBag <= Dress) AND (1 <= Entered))) OR A (X ((1 <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((Undress <= Bags) OR (Undress <= Cabins) OR ((WaitBag <= Dress) AND (1 <= Entered))) OR AX((1 <= Entered))))
lola: processed formula length: 115
lola: 35 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: 2057140 markings, 6771285 edges, 411428 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: 2448439 markings, 8106336 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((1 <= Bags))))) AND (Entered <= Bags))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Entered <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Entered <= Bags)
lola: processed formula length: 17
lola: 33 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 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((1 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((1 <= Bags)))
lola: processed formula length: 19
lola: 35 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: 1632296 markings, 5330361 edges, 326459 markings/sec, 0 secs
lola: 2743413 markings, 9119123 edges, 222223 markings/sec, 5 secs
lola: 3736453 markings, 12549121 edges, 198608 markings/sec, 10 secs
lola: 4705852 markings, 15921629 edges, 193880 markings/sec, 15 secs
lola: 5623050 markings, 19126654 edges, 183440 markings/sec, 20 secs
lola: 6481728 markings, 22138806 edges, 171736 markings/sec, 25 secs
lola: 7320853 markings, 25082248 edges, 167825 markings/sec, 30 secs
lola: 8165088 markings, 28047910 edges, 168847 markings/sec, 35 secs
lola: 9025170 markings, 31073680 edges, 172016 markings/sec, 40 secs
lola: 9857290 markings, 34016316 edges, 166424 markings/sec, 45 secs
lola: 10657076 markings, 36843045 edges, 159957 markings/sec, 50 secs
lola: 11447084 markings, 39642125 edges, 158002 markings/sec, 55 secs
lola: 12221600 markings, 42393036 edges, 154903 markings/sec, 60 secs
lola: 12901195 markings, 44807945 edges, 135919 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12901195 markings, 44807945 edges
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((Entered <= Cabins) OR (Entered <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((Cabins + 1 <= Entered) AND (Dress + 1 <= Entered))
lola: processed formula length: 52
lola: 36 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((Cabins + 1 <= Entered) AND (Dress + 1 <= Entered))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Out <= 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 ((Out <= 2)))
lola: processed formula length: 18
lola: 34 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: (Out <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Out) OR (2 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= Out) OR (2 <= Dress))))
lola: processed formula length: 37
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Out <= 1) AND (Dress <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
sara: try reading problem file CTLCardinality-8-0.sara.
lola: subprocess 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F (((Undress <= Dressed) AND (Cabins + 1 <= Undress) AND (WaitBag <= Dressed))))
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 (((Undress <= Dressed) AND (Cabins + 1 <= Undress) AND (WaitBag <= Dressed))))
lola: processed formula length: 83
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task

lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 125 markings, 124 edges
lola: state equation task get result unparse finished++ id 0
lola: ========================================
lola: subprocess 11 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((InBath <= 0) OR (Bags + 1 <= WaitBag) OR (Dressed <= Cabins))))
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 (((InBath <= 0) OR (Bags + 1 <= WaitBag) OR (Dressed <= Cabins))))
lola: processed formula length: 73
lola: 35 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: ((1 <= InBath) AND (WaitBag <= Bags) AND (Cabins + 1 <= Dressed))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 130 markings, 129 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Undress + 1 <= Cabins) OR (InBath + 1 <= Entered) OR (Dressed + 1 <= Entered))))
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 (((Undress + 1 <= Cabins) OR (InBath + 1 <= Entered) OR (Dressed + 1 <= Entered))))
lola: processed formula length: 90
lola: 35 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: ((Cabins <= Undress) AND (Entered <= InBath) AND (Entered <= Dressed))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
sara: try reading problem file CTLCardinality-11-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 13 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= Bags))) AND ((3 <= Out) AND (Cabins <= Dress) AND (Bags <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((Bags <= 2)) OR ((Out <= 2) OR (Dress + 1 <= Cabins) OR (1 <= Bags))))
lola: processed formula length: 79
lola: 43 rewrites
lola: closed formula file CTLCardinality.xml

lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1770123 markings, 5797873 edges, 354025 markings/sec, 0 secs
lola: 3166318 markings, 10572982 edges, 279239 markings/sec, 5 secs
lola: 4508147 markings, 15233946 edges, 268366 markings/sec, 10 secs
lola: 5804122 markings, 19760848 edges, 259195 markings/sec, 15 secs
lola: 7108845 markings, 24337659 edges, 260945 markings/sec, 20 secs
lola: 8317869 markings, 28583368 edges, 241805 markings/sec, 25 secs
lola: 9497267 markings, 32743180 edges, 235880 markings/sec, 30 secs
lola: 10664378 markings, 36868786 edges, 233422 markings/sec, 35 secs
lola: 11790959 markings, 40863892 edges, 225316 markings/sec, 40 secs
lola: 12867740 markings, 44689170 edges, 215356 markings/sec, 45 secs
lola: 13934900 markings, 48496360 edges, 213432 markings/sec, 50 secs
lola: 14994871 markings, 52281730 edges, 211994 markings/sec, 55 secs
lola: 16012125 markings, 55920299 edges, 203451 markings/sec, 60 secs
lola: 17027008 markings, 59548400 edges, 202977 markings/sec, 65 secs
lola: 18010246 markings, 63069976 edges, 196648 markings/sec, 70 secs
lola: 18930464 markings, 66358118 edges, 184044 markings/sec, 75 secs
lola: 19635422 markings, 68880452 edges, 140992 markings/sec, 80 secs
lola: 20288096 markings, 71215329 edges, 130535 markings/sec, 85 secs
lola: 20940187 markings, 73545083 edges, 130418 markings/sec, 90 secs
lola: 21596872 markings, 75892211 edges, 131337 markings/sec, 95 secs
lola: 22250865 markings, 78231477 edges, 130799 markings/sec, 100 secs
lola: 22921092 markings, 80629560 edges, 134045 markings/sec, 105 secs
lola: 23599264 markings, 83058269 edges, 135634 markings/sec, 110 secs
lola: 24295717 markings, 85549352 edges, 139291 markings/sec, 115 secs
lola: 25007426 markings, 88099499 edges, 142342 markings/sec, 120 secs
lola: 25733454 markings, 90703030 edges, 145206 markings/sec, 125 secs
lola: 26470227 markings, 93342553 edges, 147355 markings/sec, 130 secs
lola: 27232406 markings, 96076203 edges, 152436 markings/sec, 135 secs
lola: 27985435 markings, 98778969 edges, 150606 markings/sec, 140 secs
lola: 28755306 markings, 101541268 edges, 153974 markings/sec, 145 secs
lola: 29528702 markings, 104321253 edges, 154679 markings/sec, 150 secs
lola: 30300648 markings, 107094206 edges, 154389 markings/sec, 155 secs
lola: 31053617 markings, 109804230 edges, 150594 markings/sec, 160 secs
lola: 31836157 markings, 112621224 edges, 156508 markings/sec, 165 secs
lola: 32631268 markings, 115485924 edges, 159022 markings/sec, 170 secs
lola: 33427595 markings, 118353334 edges, 159265 markings/sec, 175 secs
lola: 34233012 markings, 121263330 edges, 161083 markings/sec, 180 secs
lola: 35030321 markings, 124141457 edges, 159462 markings/sec, 185 secs
lola: 35825748 markings, 127012043 edges, 159085 markings/sec, 190 secs
lola: 36623542 markings, 129896965 edges, 159559 markings/sec, 195 secs
lola: 37424216 markings, 132790754 edges, 160135 markings/sec, 200 secs
lola: 38226823 markings, 135689337 edges, 160521 markings/sec, 205 secs
lola: 39024524 markings, 138574989 edges, 159540 markings/sec, 210 secs
lola: 39838855 markings, 141516271 edges, 162866 markings/sec, 215 secs
lola: 40649666 markings, 144449189 edges, 162162 markings/sec, 220 secs
lola: 41480775 markings, 147460596 edges, 166222 markings/sec, 225 secs
lola: 42311381 markings, 150462993 edges, 166121 markings/sec, 230 secs
lola: 43148206 markings, 153490670 edges, 167365 markings/sec, 235 secs
lola: 43989204 markings, 156532361 edges, 168200 markings/sec, 240 secs
lola: 44833404 markings, 159586756 edges, 168840 markings/sec, 245 secs
lola: 45672404 markings, 162622550 edges, 167800 markings/sec, 250 secs
lola: 46519529 markings, 165691859 edges, 169425 markings/sec, 255 secs
lola: 47370135 markings, 168771461 edges, 170121 markings/sec, 260 secs
lola: 48225955 markings, 171867446 edges, 171164 markings/sec, 265 secs
lola: 49073868 markings, 174943556 edges, 169583 markings/sec, 270 secs
lola: 49931603 markings, 178054181 edges, 171547 markings/sec, 275 secs
lola: 50833025 markings, 181314139 edges, 180284 markings/sec, 280 secs
lola: 51738784 markings, 184599140 edges, 181152 markings/sec, 285 secs
lola: 52634638 markings, 187846651 edges, 179171 markings/sec, 290 secs
lola: 53495948 markings, 190969792 edges, 172262 markings/sec, 295 secs
lola: 54365068 markings, 194123765 edges, 173824 markings/sec, 300 secs
lola: 55232719 markings, 197272281 edges, 173530 markings/sec, 305 secs
lola: 56100012 markings, 200418698 edges, 173459 markings/sec, 310 secs
lola: 56965728 markings, 203563368 edges, 173143 markings/sec, 315 secs
lola: 57825618 markings, 206681839 edges, 171978 markings/sec, 320 secs
lola: 58681262 markings, 209790409 edges, 171129 markings/sec, 325 secs
lola: 59541090 markings, 212914802 edges, 171966 markings/sec, 330 secs
lola: 60389395 markings, 215999483 edges, 169661 markings/sec, 335 secs
lola: 61239412 markings, 219089630 edges, 170003 markings/sec, 340 secs
lola: 62096562 markings, 222207151 edges, 171430 markings/sec, 345 secs
lola: 62958418 markings, 225342054 edges, 172371 markings/sec, 350 secs
lola: 63870794 markings, 228658515 edges, 182475 markings/sec, 355 secs
lola: 64775677 markings, 231954103 edges, 180977 markings/sec, 360 secs
lola: 65691972 markings, 235287654 edges, 183259 markings/sec, 365 secs
lola: 66585570 markings, 238539597 edges, 178720 markings/sec, 370 secs
lola: 67456859 markings, 241714589 edges, 174258 markings/sec, 375 secs
lola: 68327134 markings, 244884940 edges, 174055 markings/sec, 380 secs
lola: 69197456 markings, 248052892 edges, 174064 markings/sec, 385 secs
lola: 70068916 markings, 251224110 edges, 174292 markings/sec, 390 secs
lola: 70942117 markings, 254405820 edges, 174640 markings/sec, 395 secs
lola: 71808915 markings, 257565088 edges, 173360 markings/sec, 400 secs
lola: 72689443 markings, 260778146 edges, 176106 markings/sec, 405 secs
lola: 73565683 markings, 263972434 edges, 175248 markings/sec, 410 secs
lola: 74449259 markings, 267194731 edges, 176715 markings/sec, 415 secs
lola: 75325934 markings, 270386452 edges, 175335 markings/sec, 420 secs
lola: 76200406 markings, 273576688 edges, 174894 markings/sec, 425 secs
lola: 77077430 markings, 276776103 edges, 175405 markings/sec, 430 secs
lola: 77972405 markings, 280043085 edges, 178995 markings/sec, 435 secs
lola: 78874507 markings, 283339318 edges, 180420 markings/sec, 440 secs
lola: 79774716 markings, 286628099 edges, 180042 markings/sec, 445 secs
lola: 80668788 markings, 289889518 edges, 178814 markings/sec, 450 secs
lola: 81563266 markings, 293156249 edges, 178896 markings/sec, 455 secs
lola: 82454632 markings, 296414094 edges, 178273 markings/sec, 460 secs
lola: 83347201 markings, 299671193 edges, 178514 markings/sec, 465 secs
lola: 84240595 markings, 302938364 edges, 178679 markings/sec, 470 secs
lola: 85126201 markings, 306174806 edges, 177121 markings/sec, 475 secs
lola: 86025496 markings, 309464129 edges, 179859 markings/sec, 480 secs
lola: 86951174 markings, 312850864 edges, 185136 markings/sec, 485 secs
lola: 87710472 markings, 315627306 edges, 151860 markings/sec, 490 secs
lola: 87724186 markings, 315678076 edges, 2743 markings/sec, 495 secs
lola: 87726361 markings, 315685950 edges, 435 markings/sec, 500 secs
lola: 87740729 markings, 315738430 edges, 2874 markings/sec, 505 secs
lola: 87778787 markings, 315878465 edges, 7612 markings/sec, 510 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Dress <= Entered) OR (2 <= Out) OR (2 <= WaitBag)) AND (E (F ((Out <= 2))) AND (InBath <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (InBath <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (InBath <= 1)
lola: processed formula length: 13
lola: 33 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 15 will run for 2968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Out <= 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 ((Out <= 2)))
lola: processed formula length: 18
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress)))) AND (E (F ((InBath <= Bags))) AND (E (F ((1 <= Entered))) AND E (F ((Cabins <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Cabins <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Cabins <= 0)))
lola: processed formula length: 21
lola: 34 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: (Cabins <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((InBath <= Bags)))
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 ((InBath <= Bags)))
lola: processed formula length: 24
lola: 34 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: (InBath <= Bags)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: ========================================
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 ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))
lola: processed formula length: 90
lola: 36 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: ((Cabins <= Dress) OR (Bags <= Dress))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 233 markings, 459 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= Bags))) AND ((3 <= Out) AND (Cabins <= Dress) AND (Bags <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((Bags <= 2)) OR ((Out <= 2) OR (Dress + 1 <= Cabins) OR (1 <= Bags))))
lola: processed formula length: 79
lola: 43 rewrites
lola: closed formula file CTLCardinality.xml
lola: ========================================
lola: state equation: calling and running sara
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1745077 markings, 5712736 edges, 349015 markings/sec, 0 secs
lola: 3182821 markings, 10630498 edges, 287549 markings/sec, 5 secs
lola: 4505778 markings, 15225398 edges, 264591 markings/sec, 10 secs
lola: 5732709 markings, 19511347 edges, 245386 markings/sec, 15 secs
lola: 6957040 markings, 23803948 edges, 244866 markings/sec, 20 secs
lola: 8168528 markings, 28060036 edges, 242298 markings/sec, 25 secs
lola: 9321939 markings, 32123280 edges, 230682 markings/sec, 30 secs
lola: 10362875 markings, 35803026 edges, 208187 markings/sec, 35 secs
lola: 11345593 markings, 39280689 edges, 196544 markings/sec, 40 secs
lola: 12288357 markings, 42627751 edges, 188553 markings/sec, 45 secs
lola: 13196297 markings, 45861447 edges, 181588 markings/sec, 50 secs
lola: 14102142 markings, 49095466 edges, 181169 markings/sec, 55 secs
lola: 15025735 markings, 52392263 edges, 184719 markings/sec, 60 secs
lola: 15958472 markings, 55727130 edges, 186547 markings/sec, 65 secs
lola: 16905091 markings, 59113381 edges, 189324 markings/sec, 70 secs
lola: 17851521 markings, 62501048 edges, 189286 markings/sec, 75 secs
lola: 18798624 markings, 65887781 edges, 189421 markings/sec, 80 secs
lola: 19744671 markings, 69272860 edges, 189209 markings/sec, 85 secs
lola: 20692601 markings, 72660987 edges, 189586 markings/sec, 90 secs
lola: 21642227 markings, 76054424 edges, 189925 markings/sec, 95 secs
lola: 22585616 markings, 79428864 edges, 188678 markings/sec, 100 secs
lola: 23512012 markings, 82747832 edges, 185279 markings/sec, 105 secs
lola: 24435997 markings, 86050403 edges, 184797 markings/sec, 110 secs
lola: 25357500 markings, 89351868 edges, 184301 markings/sec, 115 secs
lola: 26290265 markings, 92696908 edges, 186553 markings/sec, 120 secs
lola: 27217977 markings, 96024487 edges, 185542 markings/sec, 125 secs
lola: 28147403 markings, 99358987 edges, 185885 markings/sec, 130 secs
lola: 29076826 markings, 102698406 edges, 185885 markings/sec, 135 secs
lola: 30038340 markings, 106150474 edges, 192303 markings/sec, 140 secs
lola: 30958535 markings, 109462472 edges, 184039 markings/sec, 145 secs
lola: 31938748 markings, 112991430 edges, 196043 markings/sec, 150 secs
lola: 32927034 markings, 116550428 edges, 197657 markings/sec, 155 secs
lola: 33901495 markings, 120066016 edges, 194892 markings/sec, 160 secs
lola: 34882661 markings, 123610342 edges, 196233 markings/sec, 165 secs
lola: 35839926 markings, 127063416 edges, 191453 markings/sec, 170 secs
lola: 36763383 markings, 130403052 edges, 184691 markings/sec, 175 secs
lola: 37689926 markings, 133751226 edges, 185309 markings/sec, 180 secs
lola: 38614838 markings, 137091198 edges, 184982 markings/sec, 185 secs
lola: 39528623 markings, 140392843 edges, 182757 markings/sec, 190 secs
lola: 40441507 markings, 143694938 edges, 182577 markings/sec, 195 secs
lola: 41363709 markings, 147036224 edges, 184440 markings/sec, 200 secs
lola: 42282980 markings, 150360666 edges, 183854 markings/sec, 205 secs
lola: 43204312 markings, 153694085 edges, 184266 markings/sec, 210 secs
lola: 44122847 markings, 157017308 edges, 183707 markings/sec, 215 secs
lola: 45040226 markings, 160331818 edges, 183476 markings/sec, 220 secs
lola: 45942836 markings, 163603460 edges, 180522 markings/sec, 225 secs
lola: 46838329 markings, 166845339 edges, 179099 markings/sec, 230 secs
lola: 47732357 markings, 170081921 edges, 178806 markings/sec, 235 secs
lola: 48633263 markings, 173345057 edges, 180181 markings/sec, 240 secs
lola: 49535468 markings, 176616381 edges, 180441 markings/sec, 245 secs
lola: 50438218 markings, 179887479 edges, 180550 markings/sec, 250 secs
lola: 51356327 markings, 183213427 edges, 183622 markings/sec, 255 secs
lola: 52273660 markings, 186536203 edges, 183467 markings/sec, 260 secs
lola: 53180652 markings, 189826637 edges, 181398 markings/sec, 265 secs
lola: 54081589 markings, 193095165 edges, 180187 markings/sec, 270 secs
lola: 54987507 markings, 196381538 edges, 181184 markings/sec, 275 secs
lola: 55889563 markings, 199654248 edges, 180411 markings/sec, 280 secs
lola: 56792485 markings, 202934205 edges, 180584 markings/sec, 285 secs
lola: 57661254 markings, 206086768 edges, 173754 markings/sec, 290 secs
lola: 58290841 markings, 208371339 edges, 125917 markings/sec, 295 secs
lola: 58884852 markings, 210529577 edges, 118802 markings/sec, 300 secs
lola: 59481436 markings, 212695918 edges, 119317 markings/sec, 305 secs
lola: 60066841 markings, 214825817 edges, 117081 markings/sec, 310 secs
lola: 60647703 markings, 216939028 edges, 116172 markings/sec, 315 secs
lola: 61229862 markings, 219054685 edges, 116432 markings/sec, 320 secs
lola: 61809608 markings, 221165471 edges, 115949 markings/sec, 325 secs
lola: 62394018 markings, 223287914 edges, 116882 markings/sec, 330 secs
lola: 63211296 markings, 226260046 edges, 163456 markings/sec, 335 secs
lola: 64087521 markings, 229445812 edges, 175245 markings/sec, 340 secs
lola: 64956704 markings, 232614325 edges, 173837 markings/sec, 345 secs
lola: 65846924 markings, 235848626 edges, 178044 markings/sec, 350 secs
lola: 66713718 markings, 239006614 edges, 173359 markings/sec, 355 secs
lola: 67561935 markings, 242098088 edges, 169643 markings/sec, 360 secs
lola: 68401605 markings, 245156077 edges, 167934 markings/sec, 365 secs
lola: 69262317 markings, 248289165 edges, 172142 markings/sec, 370 secs
lola: 70141395 markings, 251487425 edges, 175816 markings/sec, 375 secs
lola: 71015641 markings, 254674007 edges, 174849 markings/sec, 380 secs
lola: 71887636 markings, 257852137 edges, 174399 markings/sec, 385 secs
lola: 72752605 markings, 261008611 edges, 172994 markings/sec, 390 secs
lola: 73618904 markings, 264166074 edges, 173260 markings/sec, 395 secs
lola: 74487182 markings, 267333955 edges, 173656 markings/sec, 400 secs
lola: 75343371 markings, 270450061 edges, 171238 markings/sec, 405 secs
lola: 76203383 markings, 273587800 edges, 172002 markings/sec, 410 secs
lola: 77041973 markings, 276646309 edges, 167718 markings/sec, 415 secs
lola: 77895706 markings, 279761436 edges, 170747 markings/sec, 420 secs
lola: 78740755 markings, 282852691 edges, 169010 markings/sec, 425 secs
lola: 79594222 markings, 285967981 edges, 170693 markings/sec, 430 secs
lola: 80454127 markings, 289105680 edges, 171981 markings/sec, 435 secs
lola: 81316804 markings, 292256918 edges, 172535 markings/sec, 440 secs
lola: 82178966 markings, 295406144 edges, 172432 markings/sec, 445 secs
lola: 83047378 markings, 298577214 edges, 173682 markings/sec, 450 secs
lola: 83909145 markings, 301730853 edges, 172353 markings/sec, 455 secs
lola: 84781622 markings, 304914808 edges, 174495 markings/sec, 460 secs
lola: 85646885 markings, 308080162 edges, 173053 markings/sec, 465 secs
lola: 86520684 markings, 311273998 edges, 174760 markings/sec, 470 secs
lola: 87387369 markings, 314444785 edges, 173337 markings/sec, 475 secs
lola: 87822287 markings, 316037281 edges, 86984 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((Dress <= Entered) OR (2 <= Out) OR (2 <= WaitBag)) AND (E (F ((Out <= 2))) AND (InBath <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (InBath <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (InBath <= 1)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((Out <= 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 ((Out <= 2)))
lola: processed formula length: 18
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Out <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ...considering subproblem: ((Dress <= Entered) OR (2 <= Out) OR (2 <= WaitBag))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Dress <= Entered) OR (2 <= Out) OR (2 <= WaitBag))
lola: processed formula length: 54
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress)))) AND (E (F ((InBath <= Bags))) AND (E (F ((1 <= Entered))) AND E (F ((Cabins <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((Cabins <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Cabins <= 0)))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= Entered)))
lola: processed formula length: 22
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((InBath <= Bags)))
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 ((InBath <= Bags)))
lola: processed formula length: 24
lola: 34 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: (InBath <= Bags)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))
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 ((((Entered <= Cabins) OR (Bags <= InBath)) U ((Cabins <= Dress) OR (Bags <= Dress))))
lola: processed formula length: 90
lola: 36 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: ((Cabins <= Dress) OR (Bags <= Dress))
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-21-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 233 markings, 459 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no unknown no no yes no yes yes no no no no
lola:
preliminary result: no no yes no no unknown no no yes no yes yes no no no no
lola: ========================================
lola: memory consumption: 21008 KB
lola: time consumption: 1089 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1553106726785

--------------------
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="SwimmingPool-PT-04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is SwimmingPool-PT-04, 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 r170-oct2-155297750100076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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