Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411700075.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is SwimmingPool-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.7K Apr 12 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 10 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 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-08-00
FORMULA_NAME SwimmingPool-PT-08-01
FORMULA_NAME SwimmingPool-PT-08-02
FORMULA_NAME SwimmingPool-PT-08-03
FORMULA_NAME SwimmingPool-PT-08-04
FORMULA_NAME SwimmingPool-PT-08-05
FORMULA_NAME SwimmingPool-PT-08-06
FORMULA_NAME SwimmingPool-PT-08-07
FORMULA_NAME SwimmingPool-PT-08-08
FORMULA_NAME SwimmingPool-PT-08-09
FORMULA_NAME SwimmingPool-PT-08-10
FORMULA_NAME SwimmingPool-PT-08-11
FORMULA_NAME SwimmingPool-PT-08-12
FORMULA_NAME SwimmingPool-PT-08-13
FORMULA_NAME SwimmingPool-PT-08-14
FORMULA_NAME SwimmingPool-PT-08-15

=== Now, execution of the tool begins

BK_START 1590645148299

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-08 @ 3570 seconds

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

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

FORMULA SwimmingPool-PT-08-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-08-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-08-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SwimmingPool-PT-08-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-08-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-08-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-08-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SwimmingPool-PT-08-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-08-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2300
rslt: Output for LTLCardinality @ SwimmingPool-PT-08

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 28 05:52:28 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (((3 <= Dress) U ((Dress <= 2) AND G (((3 <= Dress)))))))",
"processed_size": 62,
"rewrites": 99
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((Out <= Entered) U ((Dressed <= Cabins) OR (G ((2 <= WaitBag)) AND F ((Dressed <= Cabins))))) U G ((((Dressed <= Cabins) AND X ((Out <= Entered))) OR (G ((2 <= WaitBag)) AND F (((Dressed <= Cabins) AND X ((Out <= Entered)))))))))",
"processed_size": 234,
"rewrites": 99
},
"result":
{
"edges": 24,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 189
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "A ((X ((3 <= Dress)) U G ((3 <= Dress))))",
"processed_size": 41,
"rewrites": 99
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((3 <= Cabins) OR ((Undress <= Bags) AND X (X (X (X (G (((Bags + 1 <= Undress) OR (Cabins <= 2))))))))))",
"processed_size": 108,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((1 <= Bags) OR ((1 <= Dressed) OR (X (F ((Entered <= Dress))) OR G ((Dress + 1 <= Entered)))))))",
"processed_size": 103,
"rewrites": 99
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "A (X ((((3 <= Undress) OR (Dressed <= Bags)) OR (X (G ((Out <= Undress))) U ((3 <= Undress) U (Undress <= Cabins))))))",
"processed_size": 119,
"rewrites": 99
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((X (X (X (F ((((1 <= InBath)) AND ((1 <= InBath) U (Bags <= InBath))))))) U G ((InBath <= 0))))",
"processed_size": 98,
"rewrites": 99
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (((Cabins <= WaitBag) OR (X (G ((Out <= Cabins))) U (Out <= Cabins)))))",
"processed_size": 76,
"rewrites": 99
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((3 <= Bags) OR X (X (F ((G ((Bags <= Dress)) OR X ((F ((Dress + 1 <= Bags)) AND (3 <= Bags)))))))))",
"processed_size": 103,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (F (((Dress + 1 <= Cabins) OR F (G ((Out <= Entered))))))))",
"processed_size": 67,
"rewrites": 99
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 101
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (G ((WaitBag <= 2))))",
"processed_size": 26,
"rewrites": 99
},
"result":
{
"edges": 248,
"markings": 247,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 978
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((3 <= WaitBag) OR G ((3 <= WaitBag)))))",
"processed_size": 46,
"rewrites": 99
},
"result":
{
"edges": 566,
"markings": 566,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1468
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((2 <= Undress))))",
"processed_size": 26,
"rewrites": 99
},
"result":
{
"edges": 567,
"markings": 567,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2936
},
"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": "(Dressed <= Entered)",
"processed_size": 20,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((Dressed <= InBath)) AND ((Bags <= Out) OR (Dressed <= InBath))))))",
"processed_size": 80,
"rewrites": 99
},
"result":
{
"edges": 44671,
"markings": 24527,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23572,
"runtime": 1270.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((** U (* AND G(*))))) : A(((** U (** OR (G(**) AND F(**)))) U G(((** AND X(**)) OR (G(**) AND F((** AND X(**)))))))) : (A((F(**) OR X(**))) AND A((X(**) U G(**)))) : A((** OR (** AND X(X(X(X(G(*)))))))) : A(X((** OR (** OR (X(F(**)) OR G(*)))))) : A(X((** OR (X(G(**)) U (** U **))))) : A((X(X(X(F((** AND (** U **)))))) U G(*))) : (A(G(F(**))) AND A(G((** OR **)))) : (A(F(G(**))) AND A(G((** OR G(**))))) : A(F((** OR (X(G(**)) U **)))) : A(F(**)) : A(F(G(*))) : (** AND A(F(G((F(**) AND (** OR **)))))) : A(G(F((** OR (G(**) AND F(**)))))) : A((** OR X(X(F((G(**) OR X((F(**) AND **)))))))) : A(X(X(F((* OR F(G(**)))))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no yes yes yes no no no no no no no unknown yes yes ",
"value": "no no no yes yes yes no no no no no no no unknown yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 LTLCardinality.xml
lola: A (X (((3 <= Dress) U NOT(((3 <= Dress) OR F (((Dress <= 2)))))))) : A ((((Out <= Entered) U (G ((2 <= WaitBag)) U (Dressed <= Cabins))) U G ((G ((2 <= WaitBag)) U ((Dressed <= Cabins) AND X ((Out <= Entered))))))) : A (((F ((InBath <= Dressed)) OR X ((1 <= InBath))) AND (X ((3 <= Dress)) U ((0 <= Dress) AND G ((3 <= Dress)))))) : A (((3 <= Cabins) OR ((Undress <= Bags) AND X (NOT(X (X (X (F (((Undress <= Bags) AND (3 <= Cabins))))))))))) : A ((X ((1 <= Bags)) OR X ((((1 <= Dressed) OR F (X ((Entered <= Dress)))) OR NOT(F ((Entered <= Dress))))))) : A (X ((((3 <= Undress) OR (Dressed <= Bags)) OR (G (X ((Out <= Undress))) U ((3 <= Undress) U (Undress <= Cabins)))))) : A ((X (X (F (X ((((1 <= InBath)) AND ((1 <= InBath) U (Bags <= InBath))))))) U NOT(F ((1 <= InBath))))) : A (G (((Undress <= Entered) U (2 <= Undress)))) : A (NOT((((0 <= InBath) OR NOT(X ((0 <= InBath)))) U NOT(((InBath + 1 <= 0) OR ((3 <= WaitBag) U G ((3 <= WaitBag)))))))) : A (F (((Cabins <= WaitBag) OR (G (X ((Out <= Cabins))) U (Out <= Cabins))))) : A (F ((F (X ((Entered <= WaitBag))) U (2 <= InBath)))) : A (((0 <= Out) AND F (G (X (NOT(X ((3 <= WaitBag)))))))) : A (((Dressed <= Entered) AND F (G (X (G (X (G (((Bags <= Out) U (Dressed <= InBath)))))))))) : A (G (X (X (G (F (X ((G ((1 <= Dress)) U (Undress <= Out))))))))) : A (((3 <= Bags) OR F (X (X ((G ((Bags <= Dress)) OR (F (X ((Dress + 1 <= Bags))) AND X ((3 <= Bags))))))))) : A (F (X (X (NOT(G ((((Cabins <= Dress) AND F ((0 <= Dressed))) AND X (G (NOT(G ((Out <= Entered))))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= Dress) U ((Dress <= 2) AND G (((3 <= Dress)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= Dress) U ((Dress <= 2) AND G (((3 <= Dress)))))))
lola: processed formula length: 62
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Out <= Entered) U ((Dressed <= Cabins) OR (G ((2 <= WaitBag)) AND F ((Dressed <= Cabins))))) U G ((((Dressed <= Cabins) AND X ((Out <= Entered))) OR (G ((2 <= WaitBag)) AND F (((Dressed <= Cabins) AND X ((Out <= Entered)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Out <= Entered) U ((Dressed <= Cabins) OR (G ((2 <= WaitBag)) AND F ((Dressed <= Cabins))))) U G ((((Dressed <= Cabins) AND X ((Out <= Entered))) OR (G ((2 <= WaitBag)) AND F (((Dressed <= Cabins) AND X ((Out <= Entered)))))))))
lola: processed formula length: 234
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 189 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((F ((InBath <= Dressed)) OR X ((1 <= InBath)))) AND A ((X ((3 <= Dress)) U G ((3 <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= Dress)) U G ((3 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= Dress)) U G ((3 <= Dress))))
lola: processed formula length: 41
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Cabins) OR ((Undress <= Bags) AND X (X (X (X (G (((Bags + 1 <= Undress) OR (Cabins <= 2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= Cabins) OR ((Undress <= Bags) AND X (X (X (X (G (((Bags + 1 <= Undress) OR (Cabins <= 2))))))))))
lola: processed formula length: 108
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= Bags) OR ((1 <= Dressed) OR (X (F ((Entered <= Dress))) OR G ((Dress + 1 <= Entered)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((1 <= Bags) OR ((1 <= Dressed) OR (X (F ((Entered <= Dress))) OR G ((Dress + 1 <= Entered)))))))
lola: processed formula length: 103
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((3 <= Undress) OR (Dressed <= Bags)) OR (X (G ((Out <= Undress))) U ((3 <= Undress) U (Undress <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((3 <= Undress) OR (Dressed <= Bags)) OR (X (G ((Out <= Undress))) U ((3 <= Undress) U (Undress <= Cabins))))))
lola: processed formula length: 119
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (X (F ((((1 <= InBath)) AND ((1 <= InBath) U (Bags <= InBath))))))) U G ((InBath <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (X (F ((((1 <= InBath)) AND ((1 <= InBath) U (Bags <= InBath))))))) U G ((InBath <= 0))))
lola: processed formula length: 98
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Cabins <= WaitBag) OR (X (G ((Out <= Cabins))) U (Out <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((Cabins <= WaitBag) OR (X (G ((Out <= Cabins))) U (Out <= Cabins)))))
lola: processed formula length: 76
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Bags) OR X (X (F ((G ((Bags <= Dress)) OR X ((F ((Dress + 1 <= Bags)) AND (3 <= Bags)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= Bags) OR X (X (F ((G ((Bags <= Dress)) OR X ((F ((Dress + 1 <= Bags)) AND (3 <= Bags)))))))))
lola: processed formula length: 103
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((Dress + 1 <= Cabins) OR F (G ((Out <= Entered))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((Dress + 1 <= Cabins) OR F (G ((Out <= Entered))))))))
lola: processed formula length: 67
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= InBath)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (InBath <= 1)
lola: processed formula length: 13
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 325 markings, 325 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((WaitBag <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((WaitBag <= 2))))
lola: processed formula length: 26
lola: 99 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 247 markings, 248 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((Undress <= Out) OR (G ((1 <= Dress)) AND F ((Undress <= Out)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((Undress <= Out) OR (G ((1 <= Dress)) AND F ((Undress <= Out)))))))
lola: processed formula length: 77
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1393032 markings, 4497420 edges, 278606 markings/sec, 0 secs
lola: 2501386 markings, 8242866 edges, 221671 markings/sec, 5 secs
lola: 3502200 markings, 11668593 edges, 200163 markings/sec, 10 secs
lola: 4450018 markings, 14931359 edges, 189564 markings/sec, 15 secs
lola: 5420750 markings, 18296183 edges, 194146 markings/sec, 20 secs
lola: 6455483 markings, 21894399 edges, 206947 markings/sec, 25 secs
lola: 7466501 markings, 25424051 edges, 202204 markings/sec, 30 secs
lola: 8434331 markings, 28817518 edges, 193566 markings/sec, 35 secs
lola: 9396050 markings, 32198671 edges, 192344 markings/sec, 40 secs
lola: 10335814 markings, 35506255 edges, 187953 markings/sec, 45 secs
lola: 11263169 markings, 38777719 edges, 185471 markings/sec, 50 secs
lola: 12179278 markings, 42013401 edges, 183222 markings/sec, 55 secs
lola: 13083329 markings, 45217620 edges, 180810 markings/sec, 60 secs
lola: 13968191 markings, 48350630 edges, 176972 markings/sec, 65 secs
lola: 14860033 markings, 51508294 edges, 178368 markings/sec, 70 secs
lola: 15660920 markings, 54353681 edges, 160177 markings/sec, 75 secs
lola: 16350309 markings, 56804623 edges, 137878 markings/sec, 80 secs
lola: 17073783 markings, 59370336 edges, 144695 markings/sec, 85 secs
lola: 17789886 markings, 61918110 edges, 143221 markings/sec, 90 secs
lola: 18497400 markings, 64435639 edges, 141503 markings/sec, 95 secs
lola: 19214149 markings, 66990670 edges, 143350 markings/sec, 100 secs
lola: 19947416 markings, 69605091 edges, 146653 markings/sec, 105 secs
lola: 20687974 markings, 72243541 edges, 148112 markings/sec, 110 secs
lola: 21455274 markings, 74982965 edges, 153460 markings/sec, 115 secs
lola: 22216600 markings, 77706457 edges, 152265 markings/sec, 120 secs
lola: 22982137 markings, 80439667 edges, 153107 markings/sec, 125 secs
lola: 23716713 markings, 83069779 edges, 146915 markings/sec, 130 secs
lola: 24476580 markings, 85787727 edges, 151973 markings/sec, 135 secs
lola: 25235525 markings, 88508928 edges, 151789 markings/sec, 140 secs
lola: 25987498 markings, 91204903 edges, 150395 markings/sec, 145 secs
lola: 26731660 markings, 93878528 edges, 148832 markings/sec, 150 secs
lola: 27475216 markings, 96547437 edges, 148711 markings/sec, 155 secs
lola: 28214341 markings, 99203492 edges, 147825 markings/sec, 160 secs
lola: 28952639 markings, 101850476 edges, 147660 markings/sec, 165 secs
lola: 29658827 markings, 104393057 edges, 141238 markings/sec, 170 secs
lola: 30351599 markings, 106882590 edges, 138554 markings/sec, 175 secs
lola: 31021163 markings, 109290881 edges, 133913 markings/sec, 180 secs
lola: 31733551 markings, 111857403 edges, 142478 markings/sec, 185 secs
lola: 32425866 markings, 114355899 edges, 138463 markings/sec, 190 secs
lola: 33143251 markings, 116935005 edges, 143477 markings/sec, 195 secs
lola: 33852810 markings, 119493394 edges, 141912 markings/sec, 200 secs
lola: 34575797 markings, 122096260 edges, 144597 markings/sec, 205 secs
lola: 35275943 markings, 124622172 edges, 140029 markings/sec, 210 secs
lola: 35977984 markings, 127153788 edges, 140408 markings/sec, 215 secs
lola: 36690306 markings, 129725851 edges, 142464 markings/sec, 220 secs
lola: 37404934 markings, 132304701 edges, 142926 markings/sec, 225 secs
lola: 38105624 markings, 134835926 edges, 140138 markings/sec, 230 secs
lola: 38815526 markings, 137395671 edges, 141980 markings/sec, 235 secs
lola: 39512549 markings, 139912075 edges, 139405 markings/sec, 240 secs
lola: 40187860 markings, 142350001 edges, 135062 markings/sec, 245 secs
lola: 40876060 markings, 144837228 edges, 137640 markings/sec, 250 secs
lola: 41569210 markings, 147338836 edges, 138630 markings/sec, 255 secs
lola: 42269910 markings, 149875219 edges, 140140 markings/sec, 260 secs
lola: 42956450 markings, 152354996 edges, 137308 markings/sec, 265 secs
lola: 43646760 markings, 154852140 edges, 138062 markings/sec, 270 secs
lola: 44350416 markings, 157395261 edges, 140731 markings/sec, 275 secs
lola: 45045410 markings, 159913497 edges, 138999 markings/sec, 280 secs
lola: 45742190 markings, 162434970 edges, 139356 markings/sec, 285 secs
lola: 46467434 markings, 165065728 edges, 145049 markings/sec, 290 secs
lola: 47195432 markings, 167700933 edges, 145600 markings/sec, 295 secs
lola: 47925898 markings, 170345912 edges, 146093 markings/sec, 300 secs
lola: 48648404 markings, 172966872 edges, 144501 markings/sec, 305 secs
lola: 49373066 markings, 175597881 edges, 144932 markings/sec, 310 secs
lola: 50093210 markings, 178207984 edges, 144029 markings/sec, 315 secs
lola: 50805884 markings, 180796937 edges, 142535 markings/sec, 320 secs
lola: 51516599 markings, 183377650 edges, 142143 markings/sec, 325 secs
lola: 52233861 markings, 185977670 edges, 143452 markings/sec, 330 secs
lola: 52945436 markings, 188563129 edges, 142315 markings/sec, 335 secs
lola: 53657239 markings, 191142430 edges, 142361 markings/sec, 340 secs
lola: 54363872 markings, 193706825 edges, 141327 markings/sec, 345 secs
lola: 55075948 markings, 196296197 edges, 142415 markings/sec, 350 secs
lola: 55784654 markings, 198871023 edges, 141741 markings/sec, 355 secs
lola: 56492070 markings, 201443607 edges, 141483 markings/sec, 360 secs
lola: 57197774 markings, 204008385 edges, 141141 markings/sec, 365 secs
lola: 57898061 markings, 206553377 edges, 140057 markings/sec, 370 secs
lola: 58594263 markings, 209089322 edges, 139240 markings/sec, 375 secs
lola: 59292345 markings, 211630191 edges, 139616 markings/sec, 380 secs
lola: 59988721 markings, 214167017 edges, 139275 markings/sec, 385 secs
lola: 60670722 markings, 216645905 edges, 136400 markings/sec, 390 secs
lola: 61345075 markings, 219100026 edges, 134871 markings/sec, 395 secs
lola: 62017045 markings, 221542643 edges, 134394 markings/sec, 400 secs
lola: 62687420 markings, 223982887 edges, 134075 markings/sec, 405 secs
lola: 63348114 markings, 226397238 edges, 132139 markings/sec, 410 secs
lola: 64016637 markings, 228833118 edges, 133705 markings/sec, 415 secs
lola: 64701491 markings, 231335487 edges, 136971 markings/sec, 420 secs
lola: 65382379 markings, 233818911 edges, 136178 markings/sec, 425 secs
lola: 66068670 markings, 236323427 edges, 137258 markings/sec, 430 secs
lola: 66748190 markings, 238799361 edges, 135904 markings/sec, 435 secs
lola: 67426777 markings, 241275751 edges, 135717 markings/sec, 440 secs
lola: 68084808 markings, 243674860 edges, 131606 markings/sec, 445 secs
lola: 68737397 markings, 246056151 edges, 130518 markings/sec, 450 secs
lola: 69387917 markings, 248425738 edges, 130104 markings/sec, 455 secs
lola: 70043636 markings, 250822513 edges, 131144 markings/sec, 460 secs
lola: 70695811 markings, 253200334 edges, 130435 markings/sec, 465 secs
lola: 71345513 markings, 255570256 edges, 129940 markings/sec, 470 secs
lola: 71993509 markings, 257940771 edges, 129599 markings/sec, 475 secs
lola: 72643848 markings, 260317874 edges, 130068 markings/sec, 480 secs
lola: 73270328 markings, 262601638 edges, 125296 markings/sec, 485 secs
lola: 73921618 markings, 264978824 edges, 130258 markings/sec, 490 secs
lola: 74573605 markings, 267363904 edges, 130397 markings/sec, 495 secs
lola: 75219675 markings, 269728730 edges, 129214 markings/sec, 500 secs
lola: 75876076 markings, 272124081 edges, 131280 markings/sec, 505 secs
lola: 76543531 markings, 274563893 edges, 133491 markings/sec, 510 secs
lola: 77209161 markings, 276998672 edges, 133126 markings/sec, 515 secs
lola: 77879533 markings, 279448498 edges, 134074 markings/sec, 520 secs
lola: 78546821 markings, 281894076 edges, 133458 markings/sec, 525 secs
lola: 79217000 markings, 284341451 edges, 134036 markings/sec, 530 secs
lola: 79882007 markings, 286775248 edges, 133001 markings/sec, 535 secs
lola: 80543289 markings, 289197599 edges, 132256 markings/sec, 540 secs
lola: 81174545 markings, 291505397 edges, 126251 markings/sec, 545 secs
lola: 81799480 markings, 293792694 edges, 124987 markings/sec, 550 secs
lola: 82405024 markings, 296006415 edges, 121109 markings/sec, 555 secs
lola: 83042641 markings, 298343177 edges, 127523 markings/sec, 560 secs
lola: 83696964 markings, 300739085 edges, 130865 markings/sec, 565 secs
lola: 84345712 markings, 303117441 edges, 129750 markings/sec, 570 secs
lola: 84992987 markings, 305485156 edges, 129455 markings/sec, 575 secs
lola: 85637431 markings, 307849369 edges, 128889 markings/sec, 580 secs
lola: 86282551 markings, 310214783 edges, 129024 markings/sec, 585 secs
lola: 86927559 markings, 312579987 edges, 129002 markings/sec, 590 secs
lola: 87548696 markings, 314854860 edges, 124227 markings/sec, 595 secs
lola: 87874718 markings, 316049823 edges, 65204 markings/sec, 600 secs
lola: 87876975 markings, 316058246 edges, 451 markings/sec, 605 secs
lola: 87878825 markings, 316065037 edges, 370 markings/sec, 610 secs
lola: 87895368 markings, 316126421 edges, 3309 markings/sec, 615 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 978 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((3 <= WaitBag)))) AND A (G (((3 <= WaitBag) OR G ((3 <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 978 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= WaitBag) OR G ((3 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((3 <= WaitBag) OR G ((3 <= WaitBag)))))
lola: processed formula length: 46
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 566 markings, 566 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((2 <= Undress)))) AND A (G (((Undress <= Entered) OR (2 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= Undress))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= Undress))))
lola: processed formula length: 26
lola: 99 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 567 markings, 567 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Dressed <= Entered) AND A (F (G ((F ((Dressed <= InBath)) AND ((Bags <= Out) OR (Dressed <= InBath)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Dressed <= Entered)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= Entered)
lola: processed formula length: 20
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F (((Undress <= Out) OR (G ((1 <= Dress)) AND F ((Undress <= Out)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((Undress <= Out) OR (G ((1 <= Dress)) AND F ((Undress <= Out)))))))
lola: processed formula length: 77
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1452371 markings, 4696248 edges, 290474 markings/sec, 0 secs
lola: 2652713 markings, 8757188 edges, 240068 markings/sec, 5 secs
lola: 3755657 markings, 12539351 edges, 220589 markings/sec, 10 secs
lola: 4832502 markings, 16257550 edges, 215369 markings/sec, 15 secs
lola: 5866882 markings, 19846372 edges, 206876 markings/sec, 20 secs
lola: 6833078 markings, 23211037 edges, 193239 markings/sec, 25 secs
lola: 7839348 markings, 26731082 edges, 201254 markings/sec, 30 secs
lola: 8847018 markings, 30265115 edges, 201534 markings/sec, 35 secs
lola: 9835044 markings, 33744075 edges, 197605 markings/sec, 40 secs
lola: 10810518 markings, 37178681 edges, 195095 markings/sec, 45 secs
lola: 11768548 markings, 40561136 edges, 191606 markings/sec, 50 secs
lola: 12703670 markings, 43868372 edges, 187024 markings/sec, 55 secs
lola: 13616199 markings, 47105477 edges, 182506 markings/sec, 60 secs
lola: 14518492 markings, 50300224 edges, 180459 markings/sec, 65 secs
lola: 15400185 markings, 53430246 edges, 176339 markings/sec, 70 secs
lola: 16268576 markings, 56514416 edges, 173678 markings/sec, 75 secs
lola: 17142191 markings, 59611678 edges, 174723 markings/sec, 80 secs
lola: 17997341 markings, 62656471 edges, 171030 markings/sec, 85 secs
lola: 18840588 markings, 65658960 edges, 168649 markings/sec, 90 secs
lola: 19676458 markings, 68641587 edges, 167174 markings/sec, 95 secs
lola: 20509935 markings, 71609251 edges, 166695 markings/sec, 100 secs
lola: 21334139 markings, 74551822 edges, 164841 markings/sec, 105 secs
lola: 22151726 markings, 77474640 edges, 163517 markings/sec, 110 secs
lola: 22968500 markings, 80390955 edges, 163355 markings/sec, 115 secs
lola: 23771891 markings, 83267360 edges, 160678 markings/sec, 120 secs
lola: 24567535 markings, 86113884 edges, 159129 markings/sec, 125 secs
lola: 25357077 markings, 88946045 edges, 157908 markings/sec, 130 secs
lola: 26145693 markings, 91772018 edges, 157723 markings/sec, 135 secs
lola: 26927933 markings, 94582215 edges, 156448 markings/sec, 140 secs
lola: 27703874 markings, 97367615 edges, 155188 markings/sec, 145 secs
lola: 28481602 markings, 100160537 edges, 155546 markings/sec, 150 secs
lola: 29253014 markings, 102932865 edges, 154282 markings/sec, 155 secs
lola: 30017719 markings, 105683304 edges, 152941 markings/sec, 160 secs
lola: 30773474 markings, 108401479 edges, 151151 markings/sec, 165 secs
lola: 31531399 markings, 111130934 edges, 151585 markings/sec, 170 secs
lola: 32281921 markings, 113837702 edges, 150104 markings/sec, 175 secs
lola: 33031299 markings, 116532561 edges, 149876 markings/sec, 180 secs
lola: 33777303 markings, 119221185 edges, 149201 markings/sec, 185 secs
lola: 34506784 markings, 121847590 edges, 145896 markings/sec, 190 secs
lola: 35236415 markings, 124478384 edges, 145926 markings/sec, 195 secs
lola: 35956710 markings, 127077256 edges, 144059 markings/sec, 200 secs
lola: 36672420 markings, 129661187 edges, 143142 markings/sec, 205 secs
lola: 37358000 markings, 132137123 edges, 137116 markings/sec, 210 secs
lola: 38050652 markings, 134636075 edges, 138530 markings/sec, 215 secs
lola: 38778797 markings, 137263136 edges, 145629 markings/sec, 220 secs
lola: 39493729 markings, 139844670 edges, 142986 markings/sec, 225 secs
lola: 40212610 markings, 142439539 edges, 143776 markings/sec, 230 secs
lola: 40900031 markings, 144923621 edges, 137484 markings/sec, 235 secs
lola: 41593271 markings, 147424956 edges, 138648 markings/sec, 240 secs
lola: 42281697 markings, 149916899 edges, 137685 markings/sec, 245 secs
lola: 42983532 markings, 152452589 edges, 140367 markings/sec, 250 secs
lola: 43680111 markings, 154972888 edges, 139316 markings/sec, 255 secs
lola: 44374462 markings, 157482482 edges, 138870 markings/sec, 260 secs
lola: 45071970 markings, 160009283 edges, 139502 markings/sec, 265 secs
lola: 45764538 markings, 162516824 edges, 138514 markings/sec, 270 secs
lola: 46453976 markings, 165016750 edges, 137888 markings/sec, 275 secs
lola: 47149990 markings, 167535857 edges, 139203 markings/sec, 280 secs
lola: 47848382 markings, 170066341 edges, 139678 markings/sec, 285 secs
lola: 48541393 markings, 172577449 edges, 138602 markings/sec, 290 secs
lola: 49240232 markings, 175115274 edges, 139768 markings/sec, 295 secs
lola: 49935693 markings, 177634271 edges, 139092 markings/sec, 300 secs
lola: 50609687 markings, 180085547 edges, 134799 markings/sec, 305 secs
lola: 51249945 markings, 182407612 edges, 128052 markings/sec, 310 secs
lola: 51895706 markings, 184750093 edges, 129152 markings/sec, 315 secs
lola: 52511721 markings, 186986103 edges, 123203 markings/sec, 320 secs
lola: 53093495 markings, 189098820 edges, 116355 markings/sec, 325 secs
lola: 53668150 markings, 191182327 edges, 114931 markings/sec, 330 secs
lola: 54236838 markings, 193246604 edges, 113738 markings/sec, 335 secs
lola: 54810638 markings, 195333500 edges, 114760 markings/sec, 340 secs
lola: 55386530 markings, 197422899 edges, 115178 markings/sec, 345 secs
lola: 55957664 markings, 199501920 edges, 114227 markings/sec, 350 secs
lola: 56529382 markings, 201580046 edges, 114344 markings/sec, 355 secs
lola: 57102793 markings, 203661642 edges, 114682 markings/sec, 360 secs
lola: 57676161 markings, 205747520 edges, 114674 markings/sec, 365 secs
lola: 58246770 markings, 207823900 edges, 114122 markings/sec, 370 secs
lola: 58820309 markings, 209912463 edges, 114708 markings/sec, 375 secs
lola: 59392514 markings, 211993844 edges, 114441 markings/sec, 380 secs
lola: 59962494 markings, 214071996 edges, 113996 markings/sec, 385 secs
lola: 60536180 markings, 216158769 edges, 114737 markings/sec, 390 secs
lola: 61113569 markings, 218259077 edges, 115478 markings/sec, 395 secs
lola: 61688490 markings, 220346371 edges, 114984 markings/sec, 400 secs
lola: 62265583 markings, 222446652 edges, 115419 markings/sec, 405 secs
lola: 62845717 markings, 224560275 edges, 116027 markings/sec, 410 secs
lola: 63420713 markings, 226663469 edges, 114999 markings/sec, 415 secs
lola: 64000262 markings, 228773605 edges, 115910 markings/sec, 420 secs
lola: 64574245 markings, 230868670 edges, 114797 markings/sec, 425 secs
lola: 65150007 markings, 232971470 edges, 115152 markings/sec, 430 secs
lola: 65727717 markings, 235077995 edges, 115542 markings/sec, 435 secs
lola: 66295834 markings, 237152785 edges, 113623 markings/sec, 440 secs
lola: 66875679 markings, 239262926 edges, 115969 markings/sec, 445 secs
lola: 67447914 markings, 241352626 edges, 114447 markings/sec, 450 secs
lola: 68022108 markings, 243445581 edges, 114839 markings/sec, 455 secs
lola: 68594875 markings, 245534485 edges, 114553 markings/sec, 460 secs
lola: 69168032 markings, 247623210 edges, 114631 markings/sec, 465 secs
lola: 69743139 markings, 249726585 edges, 115021 markings/sec, 470 secs
lola: 70318175 markings, 251823623 edges, 115007 markings/sec, 475 secs
lola: 70886291 markings, 253894920 edges, 113623 markings/sec, 480 secs
lola: 71455869 markings, 255975422 edges, 113916 markings/sec, 485 secs
lola: 72026187 markings, 258059417 edges, 114064 markings/sec, 490 secs
lola: 72598411 markings, 260151282 edges, 114445 markings/sec, 495 secs
lola: 73175851 markings, 262257925 edges, 115488 markings/sec, 500 secs
lola: 73751182 markings, 264358240 edges, 115066 markings/sec, 505 secs
lola: 74320437 markings, 266441157 edges, 113851 markings/sec, 510 secs
lola: 74889068 markings, 268517096 edges, 113726 markings/sec, 515 secs
lola: 75456716 markings, 270593050 edges, 113530 markings/sec, 520 secs
lola: 76020092 markings, 272650033 edges, 112675 markings/sec, 525 secs
lola: 76586589 markings, 274720756 edges, 113299 markings/sec, 530 secs
lola: 77148572 markings, 276777473 edges, 112397 markings/sec, 535 secs
lola: 77718658 markings, 278859299 edges, 114017 markings/sec, 540 secs
lola: 78295408 markings, 280973009 edges, 115350 markings/sec, 545 secs
lola: 78873698 markings, 283089690 edges, 115658 markings/sec, 550 secs
lola: 79450375 markings, 285197110 edges, 115335 markings/sec, 555 secs
lola: 80034782 markings, 287334644 edges, 116881 markings/sec, 560 secs
lola: 80609813 markings, 289440993 edges, 115006 markings/sec, 565 secs
lola: 81179946 markings, 291525333 edges, 114027 markings/sec, 570 secs
lola: 81745433 markings, 293593461 edges, 113097 markings/sec, 575 secs
lola: 82318167 markings, 295689509 edges, 114547 markings/sec, 580 secs
lola: 82891339 markings, 297788898 edges, 114634 markings/sec, 585 secs
lola: 83456251 markings, 299858098 edges, 112982 markings/sec, 590 secs
lola: 84025875 markings, 301947306 edges, 113925 markings/sec, 595 secs
lola: 84596936 markings, 304037046 edges, 114212 markings/sec, 600 secs
lola: 85167423 markings, 306126370 edges, 114097 markings/sec, 605 secs
lola: 85737895 markings, 308216610 edges, 114094 markings/sec, 610 secs
lola: 86308827 markings, 310311570 edges, 114186 markings/sec, 615 secs
lola: 86866417 markings, 312354145 edges, 111518 markings/sec, 620 secs
lola: 87404126 markings, 314325301 edges, 107542 markings/sec, 625 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((Dressed <= Entered) AND A (F (G ((F ((Dressed <= InBath)) AND ((Bags <= Out) OR (Dressed <= InBath)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (Dressed <= Entered)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= Entered)
lola: processed formula length: 20
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((Dressed <= InBath)) AND ((Bags <= Out) OR (Dressed <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((Dressed <= InBath)) AND ((Bags <= Out) OR (Dressed <= InBath))))))
lola: processed formula length: 80
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24527 markings, 44671 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no no no no no no unknown yes yes
lola:
preliminary result: no no no yes yes yes no no no no no no no unknown yes yes
lola: memory consumption: 23572 KB
lola: time consumption: 1270 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590646418623

--------------------
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-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is SwimmingPool-PT-08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-csrt-159033411700075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-08.tgz
mv SwimmingPool-PT-08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;