fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r204-csrt-159033411700071
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for SwimmingPool-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.040 1711940.00 1708203.00 3505.20 FFFFF?F?TFTTFFFT normal

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-159033411700071.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-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.0K Apr 12 18:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 18:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.3K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 05:50 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-06-00
FORMULA_NAME SwimmingPool-PT-06-01
FORMULA_NAME SwimmingPool-PT-06-02
FORMULA_NAME SwimmingPool-PT-06-03
FORMULA_NAME SwimmingPool-PT-06-04
FORMULA_NAME SwimmingPool-PT-06-05
FORMULA_NAME SwimmingPool-PT-06-06
FORMULA_NAME SwimmingPool-PT-06-07
FORMULA_NAME SwimmingPool-PT-06-08
FORMULA_NAME SwimmingPool-PT-06-09
FORMULA_NAME SwimmingPool-PT-06-10
FORMULA_NAME SwimmingPool-PT-06-11
FORMULA_NAME SwimmingPool-PT-06-12
FORMULA_NAME SwimmingPool-PT-06-13
FORMULA_NAME SwimmingPool-PT-06-14
FORMULA_NAME SwimmingPool-PT-06-15

=== Now, execution of the tool begins

BK_START 1590644853455

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA SwimmingPool-PT-06-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1858
rslt: Output for LTLCardinality @ SwimmingPool-PT-06

{
"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:47:33 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 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": "(Bags <= 0)",
"processed_size": 11,
"rewrites": 118
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((1 <= Entered) U X (X ((X (G ((Dress + 1 <= Entered))) U (Entered <= Dress))))))",
"processed_size": 84,
"rewrites": 116
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((Bags <= InBath))))",
"processed_size": 28,
"rewrites": 116
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((F ((3 <= Dress)) OR G (((2 <= Dress) AND G ((Undress <= Out)))))))",
"processed_size": 73,
"rewrites": 116
},
"result":
{
"edges": 36767028,
"markings": 13102229,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((Entered <= WaitBag) OR (((WaitBag + 1 <= Entered) AND (InBath <= 1)) AND (F ((Entered + 1 <= WaitBag)) AND X ((WaitBag + 1 <= Entered))))))",
"processed_size": 144,
"rewrites": 116
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((2 <= WaitBag)) AND ((Cabins <= 0) OR (X ((Out <= Entered)) OR (2 <= WaitBag)))))))",
"processed_size": 96,
"rewrites": 116
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 4,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((Dressed <= InBath) U G (((Entered + 1 <= Dressed) OR X (G ((F ((Dress <= 2)) AND (F (G ((Cabins <= 0))) OR G (F ((Dress <= 2)))))))))))",
"processed_size": 140,
"rewrites": 116
},
"result":
{
"edges": 107,
"markings": 78,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 35
},
"compoundnumber": 10,
"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": 579
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((Undress + 1 <= Dress) AND X ((Dress + 1 <= Bags))))))",
"processed_size": 64,
"rewrites": 116
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 724
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((3 <= Dress))))",
"processed_size": 24,
"rewrites": 116
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 965
},
"exit":
{
"localtimelimitreached": false
},
"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 ((3 <= Out))))",
"processed_size": 22,
"rewrites": 116
},
"result":
{
"edges": 13740,
"markings": 10105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((G (((Bags + 1 <= InBath) AND (Cabins <= 2))) OR (G (((Undress <= Out) AND (3 <= Cabins))) AND F (G (((Bags + 1 <= InBath) AND (Cabins <= 2)))))))",
"processed_size": 149,
"rewrites": 116
},
"result":
{
"edges": 365,
"markings": 365,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 14,
"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": 2896
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2896
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= Bags)",
"processed_size": 11,
"rewrites": 116
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= Bags)",
"processed_size": 11,
"rewrites": 116
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= Out)",
"processed_size": 10,
"rewrites": 118
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21952,
"runtime": 1712.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((F(**) OR G((** AND G(**)))))) : A(F(G((F(**) AND (** OR (X(**) OR **)))))) : A(X(F(**))) : A((G(*) OR (G(**) AND F(G(*))))) : (A((** U X(X((X(G(**)) U **))))) AND A(F(**))) : A((F(**) OR X(X(X(X(G(*))))))) : A(X(G(**))) : A(X(G((F(G((** AND G(**)))) OR X(F(**)))))) : TRUE : (** AND A(F(*))) : A((* OR (* AND (F(*) AND X(*))))) : TRUE : A((** U G((* OR X(G((F(*) AND (F(G(*)) OR G(F(*)))))))))) : A(G(F(**))) : A(F(G((* AND X(*))))) : TRUE"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no no no unknown no unknown yes no yes yes no no no yes ",
"value": "no no no no no unknown no unknown yes no yes yes no no no 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 ((F ((3 <= Dress)) OR G (((2 <= Dress) AND G ((Undress <= Out))))))) : A (NOT(G (X (NOT(G ((((Cabins <= 0) OR X ((Out <= Entered))) U (2 <= WaitBag)))))))) : A ((X (G ((0 <= Entered))) U X ((3 <= Dress)))) : A ((G (((Undress <= Out) AND (3 <= Cabins))) U NOT(F (((InBath <= Bags) OR (3 <= Cabins)))))) : A ((((1 <= Entered) U X (X ((G (X ((Dress + 1 <= Entered))) U (Entered <= Dress))))) AND F ((1 <= Bags)))) : A ((F ((3 <= Undress)) OR G (X (X (X (NOT(X (F ((Out <= Undress)))))))))) : A (G (X ((Bags <= InBath)))) : A (G (X ((F (G (((Cabins + 1 <= WaitBag) AND G ((1 <= Bags))))) OR F (X ((Cabins + 1 <= WaitBag))))))) : A (((0 <= InBath) OR NOT(X (((0 <= Bags) AND ((Out <= Undress) OR ((0 <= Bags) U (0 <= InBath)))))))) : A (((3 <= Bags) AND NOT(G ((2 <= Out))))) : A (NOT(((WaitBag + 1 <= Entered) AND ((((Entered <= WaitBag) OR (2 <= InBath)) OR G ((WaitBag <= Entered))) OR X ((Entered <= WaitBag)))))) : A (G ((((Bags <= Undress) OR X ((0 <= Out))) U G ((0 <= Out))))) : A (((Dressed <= InBath) U G (NOT(((Dressed <= Entered) AND X (F ((G (F ((1 <= Cabins))) U G ((3 <= Dress)))))))))) : A (F (G (F ((F (((Undress <= Cabins) OR G ((1 <= Dress)))) U (3 <= Out)))))) : A (F (NOT(((3 <= Bags) U F (((2 <= Undress) U F ((F ((Dress <= Undress)) U ((Dress <= Undress) OR X ((Bags <= Dress))))))))))) : A (NOT(G (NOT(F (G (X ((0 <= Dressed))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= Entered) U X (X ((X (G ((Dress + 1 <= Entered))) U (Entered <= Dress)))))) AND A (F ((1 <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Bags)))
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: (Bags <= 0)
lola: processed formula length: 11
lola: 118 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Entered) U X (X ((X (G ((Dress + 1 <= Entered))) U (Entered <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Entered) U X (X ((X (G ((Dress + 1 <= Entered))) U (Entered <= Dress))))))
lola: processed formula length: 84
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 20 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= Undress)) OR X (X (X (X (G ((Undress + 1 <= Out))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= Undress)) OR X (X (X (X (G ((Undress + 1 <= Out))))))))
lola: processed formula length: 68
lola: 116 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: 1874634 markings, 5464627 edges, 374927 markings/sec, 0 secs
lola: 3364564 markings, 9929138 edges, 297986 markings/sec, 5 secs
lola: 4799079 markings, 14249221 edges, 286903 markings/sec, 10 secs
lola: 6154363 markings, 18358934 edges, 271057 markings/sec, 15 secs
lola: 7448450 markings, 22292039 edges, 258817 markings/sec, 20 secs
lola: 8710393 markings, 26138003 edges, 252389 markings/sec, 25 secs
lola: 9946043 markings, 29912272 edges, 247130 markings/sec, 30 secs
lola: 11158214 markings, 33619013 edges, 242434 markings/sec, 35 secs
lola: 12304230 markings, 37130595 edges, 229203 markings/sec, 40 secs
lola: 13462039 markings, 40682848 edges, 231562 markings/sec, 45 secs
lola: 14613253 markings, 44213951 edges, 230243 markings/sec, 50 secs
lola: 15745909 markings, 47695929 edges, 226531 markings/sec, 55 secs
lola: 16866492 markings, 51143048 edges, 224117 markings/sec, 60 secs
lola: 17980585 markings, 54568460 edges, 222819 markings/sec, 65 secs
lola: 19085450 markings, 57975435 edges, 220973 markings/sec, 70 secs
lola: 20186420 markings, 61368282 edges, 220194 markings/sec, 75 secs
lola: 21276953 markings, 64729123 edges, 218107 markings/sec, 80 secs
lola: 22346731 markings, 68029556 edges, 213956 markings/sec, 85 secs
lola: 23412803 markings, 71316100 edges, 213214 markings/sec, 90 secs
lola: 24471749 markings, 74584230 edges, 211789 markings/sec, 95 secs
lola: 25526240 markings, 77841145 edges, 210898 markings/sec, 100 secs
lola: 26543448 markings, 80986542 edges, 203442 markings/sec, 105 secs
lola: 27581989 markings, 84191605 edges, 207708 markings/sec, 110 secs
lola: 28596084 markings, 87331270 edges, 202819 markings/sec, 115 secs
lola: 29626273 markings, 90515120 edges, 206038 markings/sec, 120 secs
lola: 30652979 markings, 93694932 edges, 205341 markings/sec, 125 secs
lola: 31667212 markings, 96831580 edges, 202847 markings/sec, 130 secs
lola: 32674524 markings, 99955364 edges, 201462 markings/sec, 135 secs
lola: 33683112 markings, 103079629 edges, 201718 markings/sec, 140 secs
lola: 34682921 markings, 106177670 edges, 199962 markings/sec, 145 secs
lola: 35674429 markings, 109255325 edges, 198302 markings/sec, 150 secs
lola: 36661104 markings, 112319887 edges, 197335 markings/sec, 155 secs
lola: 37649122 markings, 115385480 edges, 197604 markings/sec, 160 secs
lola: 38626134 markings, 118422868 edges, 195402 markings/sec, 165 secs
lola: 39612460 markings, 121487821 edges, 197265 markings/sec, 170 secs
lola: 40591873 markings, 124530470 edges, 195883 markings/sec, 175 secs
lola: 41568046 markings, 127558648 edges, 195235 markings/sec, 180 secs
lola: 42550109 markings, 130608603 edges, 196413 markings/sec, 185 secs
lola: 43538374 markings, 133676976 edges, 197653 markings/sec, 190 secs
lola: 44509608 markings, 136696919 edges, 194247 markings/sec, 195 secs
lola: 45493291 markings, 139749336 edges, 196737 markings/sec, 200 secs
lola: 46472921 markings, 142793503 edges, 195926 markings/sec, 205 secs
lola: 47444364 markings, 145809987 edges, 194289 markings/sec, 210 secs
lola: 48412067 markings, 148821490 edges, 193541 markings/sec, 215 secs
lola: 49373250 markings, 151806602 edges, 192237 markings/sec, 220 secs
lola: 50328925 markings, 154778334 edges, 191135 markings/sec, 225 secs
lola: 51284921 markings, 157751591 edges, 191199 markings/sec, 230 secs
lola: 52243350 markings, 160733494 edges, 191686 markings/sec, 235 secs
lola: 53195679 markings, 163698045 edges, 190466 markings/sec, 240 secs
lola: 54145894 markings, 166653538 edges, 190043 markings/sec, 245 secs
lola: 55091589 markings, 169593588 edges, 189139 markings/sec, 250 secs
lola: 56031016 markings, 172518858 edges, 187885 markings/sec, 255 secs
lola: 56939650 markings, 175350035 edges, 181727 markings/sec, 260 secs
lola: 57843178 markings, 178162481 edges, 180706 markings/sec, 265 secs
lola: 58753271 markings, 180996984 edges, 182019 markings/sec, 270 secs
lola: 59673885 markings, 183860735 edges, 184123 markings/sec, 275 secs
lola: 60581475 markings, 186687797 edges, 181518 markings/sec, 280 secs
lola: 61486486 markings, 189502732 edges, 181002 markings/sec, 285 secs
lola: 62386421 markings, 192303902 edges, 179987 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown yes unknown unknown yes unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Bags <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Bags <= InBath))))
lola: processed formula length: 28
lola: 116 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 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F (G (((Cabins + 1 <= WaitBag) AND G ((1 <= Bags))))) OR X (F ((Cabins + 1 <= WaitBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (G (((Cabins + 1 <= WaitBag) AND G ((1 <= Bags))))) OR X (F ((Cabins + 1 <= WaitBag)))))))
lola: processed formula length: 102
lola: 116 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: 1646351 markings, 5364471 edges, 329270 markings/sec, 0 secs
lola: 3011698 markings, 10004449 edges, 273069 markings/sec, 5 secs
lola: 4267226 markings, 14329547 edges, 251106 markings/sec, 10 secs
lola: 5466422 markings, 18484740 edges, 239839 markings/sec, 15 secs
lola: 6626513 markings, 22518938 edges, 232018 markings/sec, 20 secs
lola: 7742297 markings, 26416045 edges, 223157 markings/sec, 25 secs
lola: 8828739 markings, 30220025 edges, 217288 markings/sec, 30 secs
lola: 9883075 markings, 33913286 edges, 210867 markings/sec, 35 secs
lola: 10907528 markings, 37514042 edges, 204891 markings/sec, 40 secs
lola: 11924101 markings, 41083207 edges, 203315 markings/sec, 45 secs
lola: 12920490 markings, 44591363 edges, 199278 markings/sec, 50 secs
lola: 13905043 markings, 48047214 edges, 196911 markings/sec, 55 secs
lola: 14875037 markings, 51451012 edges, 193999 markings/sec, 60 secs
lola: 15826694 markings, 54796405 edges, 190331 markings/sec, 65 secs
lola: 16766231 markings, 58107053 edges, 187907 markings/sec, 70 secs
lola: 17671433 markings, 61281383 edges, 181040 markings/sec, 75 secs
lola: 18559048 markings, 64400191 edges, 177523 markings/sec, 80 secs
lola: 19437508 markings, 67488895 edges, 175692 markings/sec, 85 secs
lola: 20308605 markings, 70548070 edges, 174219 markings/sec, 90 secs
lola: 21196993 markings, 73667392 edges, 177678 markings/sec, 95 secs
lola: 22100631 markings, 76835253 edges, 180728 markings/sec, 100 secs
lola: 22967579 markings, 79878738 edges, 173390 markings/sec, 105 secs
lola: 23841922 markings, 82948401 edges, 174869 markings/sec, 110 secs
lola: 24759247 markings, 86165231 edges, 183465 markings/sec, 115 secs
lola: 25655013 markings, 89309314 edges, 179153 markings/sec, 120 secs
lola: 26469151 markings, 92161808 edges, 162828 markings/sec, 125 secs
lola: 27276762 markings, 94991472 edges, 161522 markings/sec, 130 secs
lola: 28070938 markings, 97779088 edges, 158835 markings/sec, 135 secs
lola: 28862603 markings, 100560713 edges, 158333 markings/sec, 140 secs
lola: 29654875 markings, 103337394 edges, 158454 markings/sec, 145 secs
lola: 30447620 markings, 106125210 edges, 158549 markings/sec, 150 secs
lola: 31235204 markings, 108888002 edges, 157517 markings/sec, 155 secs
lola: 32026013 markings, 111658768 edges, 158162 markings/sec, 160 secs
lola: 32831026 markings, 114479575 edges, 161003 markings/sec, 165 secs
lola: 33634445 markings, 117295278 edges, 160684 markings/sec, 170 secs
lola: 34408176 markings, 120011606 edges, 154746 markings/sec, 175 secs
lola: 35224823 markings, 122873140 edges, 163329 markings/sec, 180 secs
lola: 36015873 markings, 125644167 edges, 158210 markings/sec, 185 secs
lola: 36811020 markings, 128427976 edges, 159029 markings/sec, 190 secs
lola: 37625314 markings, 131285597 edges, 162859 markings/sec, 195 secs
lola: 38441094 markings, 134149079 edges, 163156 markings/sec, 200 secs
lola: 39268397 markings, 137047290 edges, 165461 markings/sec, 205 secs
lola: 40099292 markings, 139952530 edges, 166179 markings/sec, 210 secs
lola: 40917029 markings, 142819645 edges, 163547 markings/sec, 215 secs
lola: 41727298 markings, 145658335 edges, 162054 markings/sec, 220 secs
lola: 42533028 markings, 148480680 edges, 161146 markings/sec, 225 secs
lola: 43350532 markings, 151350593 edges, 163501 markings/sec, 230 secs
lola: 44165068 markings, 154201839 edges, 162907 markings/sec, 235 secs
lola: 44974110 markings, 157041064 edges, 161808 markings/sec, 240 secs
lola: 45772157 markings, 159847467 edges, 159609 markings/sec, 245 secs
lola: 46569648 markings, 162644543 edges, 159498 markings/sec, 250 secs
lola: 47363404 markings, 165429456 edges, 158751 markings/sec, 255 secs
lola: 48154329 markings, 168204433 edges, 158185 markings/sec, 260 secs
lola: 48941722 markings, 170958481 edges, 157479 markings/sec, 265 secs
lola: 49728805 markings, 173714722 edges, 157417 markings/sec, 270 secs
lola: 50517551 markings, 176480479 edges, 157749 markings/sec, 275 secs
lola: 51304449 markings, 179244254 edges, 157380 markings/sec, 280 secs
lola: 52092513 markings, 182007472 edges, 157613 markings/sec, 285 secs
lola: 52880162 markings, 184762826 edges, 157530 markings/sec, 290 secs
lola: 53665405 markings, 187518399 edges, 157049 markings/sec, 295 secs
lola: 54448769 markings, 190266526 edges, 156673 markings/sec, 300 secs
lola: 55237246 markings, 193032576 edges, 157695 markings/sec, 305 secs
lola: 56015299 markings, 195771575 edges, 155611 markings/sec, 310 secs
lola: 56799689 markings, 198517629 edges, 156878 markings/sec, 315 secs
lola: 57577106 markings, 201239696 edges, 155483 markings/sec, 320 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown no unknown yes unknown unknown yes unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= Dress)) OR G (((2 <= Dress) AND G ((Undress <= Out)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= Dress)) OR G (((2 <= Dress) AND G ((Undress <= Out)))))))
lola: processed formula length: 73
lola: 116 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: 2093940 markings, 5699053 edges, 418788 markings/sec, 0 secs
lola: 3736528 markings, 10274363 edges, 328518 markings/sec, 5 secs
lola: 5248553 markings, 14519416 edges, 302405 markings/sec, 10 secs
lola: 6694993 markings, 18600640 edges, 289288 markings/sec, 15 secs
lola: 8098053 markings, 22567569 edges, 280612 markings/sec, 20 secs
lola: 9475595 markings, 26459994 edges, 275508 markings/sec, 25 secs
lola: 10813986 markings, 30258358 edges, 267678 markings/sec, 30 secs
lola: 12112655 markings, 33950652 edges, 259734 markings/sec, 35 secs
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: 13102229 markings, 36767028 edges
lola: ========================================
lola: subprocess 8 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Entered <= WaitBag) OR (((WaitBag + 1 <= Entered) AND (InBath <= 1)) AND (F ((Entered + 1 <= WaitBag)) AND X ((WaitBag + 1 <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Entered <= WaitBag) OR (((WaitBag + 1 <= Entered) AND (InBath <= 1)) AND (F ((Entered + 1 <= WaitBag)) AND X ((WaitBag + 1 <= Entered))))))
lola: processed formula length: 144
lola: 116 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((2 <= WaitBag)) AND ((Cabins <= 0) OR (X ((Out <= Entered)) OR (2 <= WaitBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((2 <= WaitBag)) AND ((Cabins <= 0) OR (X ((Out <= Entered)) OR (2 <= WaitBag)))))))
lola: processed formula length: 96
lola: 116 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Dressed <= InBath) U G (((Entered + 1 <= Dressed) OR X (G ((F ((Dress <= 2)) AND (F (G ((Cabins <= 0))) OR G (F ((Dress <= 2)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Dressed <= InBath) U G (((Entered + 1 <= Dressed) OR X (G ((F ((Dress <= 2)) AND (F (G ((Cabins <= 0))) OR G (F ((Dress <= 2)))))))))))
lola: processed formula length: 140
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 35 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: 78 markings, 107 edges
lola: ========================================
lola: subprocess 11 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((Undress + 1 <= Dress) AND X ((Dress + 1 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((Undress + 1 <= Dress) AND X ((Dress + 1 <= Bags))))))
lola: processed formula length: 64
lola: 116 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 12 will run for 724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= Dress))))
lola: processed formula length: 24
lola: 116 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: 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 965 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Out))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Out))))
lola: processed formula length: 22
lola: 116 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: 10105 markings, 13740 edges
lola: ========================================
lola: subprocess 14 will run for 1448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (((Bags + 1 <= InBath) AND (Cabins <= 2))) OR (G (((Undress <= Out) AND (3 <= Cabins))) AND F (G (((Bags + 1 <= InBath) AND (Cabins <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (((Bags + 1 <= InBath) AND (Cabins <= 2))) OR (G (((Undress <= Out) AND (3 <= Cabins))) AND F (G (((Bags + 1 <= InBath) AND (Cabins <= 2)))))))
lola: processed formula length: 149
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 365 markings, 365 edges
lola: ========================================
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Bags) AND A (F ((Out <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Bags)
lola: processed formula length: 11
lola: 116 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 ((F ((3 <= Undress)) OR X (X (X (X (G ((Undress + 1 <= Out))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= Undress)) OR X (X (X (X (G ((Undress + 1 <= Out))))))))
lola: processed formula length: 68
lola: 116 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: 2023983 markings, 5909483 edges, 404797 markings/sec, 0 secs
lola: 3581923 markings, 10582534 edges, 311588 markings/sec, 5 secs
lola: 5017435 markings, 14910532 edges, 287102 markings/sec, 10 secs
lola: 6370621 markings, 19015445 edges, 270637 markings/sec, 15 secs
lola: 7656459 markings, 22924877 edges, 257168 markings/sec, 20 secs
lola: 8935695 markings, 26826127 edges, 255847 markings/sec, 25 secs
lola: 10173658 markings, 30607585 edges, 247593 markings/sec, 30 secs
lola: 11346689 markings, 34194872 edges, 234606 markings/sec, 35 secs
lola: 12530938 markings, 37827820 edges, 236850 markings/sec, 40 secs
lola: 13722537 markings, 41482309 edges, 238320 markings/sec, 45 secs
lola: 14907769 markings, 45120769 edges, 237046 markings/sec, 50 secs
lola: 16070148 markings, 48691363 edges, 232476 markings/sec, 55 secs
lola: 17220265 markings, 52229349 edges, 230023 markings/sec, 60 secs
lola: 18343812 markings, 55688762 edges, 224709 markings/sec, 65 secs
lola: 19437634 markings, 59061563 edges, 218764 markings/sec, 70 secs
lola: 20508615 markings, 62363249 edges, 214196 markings/sec, 75 secs
lola: 21540763 markings, 65543313 edges, 206430 markings/sec, 80 secs
lola: 22620132 markings, 68874356 edges, 215874 markings/sec, 85 secs
lola: 23699583 markings, 72202058 edges, 215890 markings/sec, 90 secs
lola: 24792103 markings, 75574151 edges, 218504 markings/sec, 95 secs
lola: 25847317 markings, 78833860 edges, 211043 markings/sec, 100 secs
lola: 26858737 markings, 81958596 edges, 202284 markings/sec, 105 secs
lola: 27869956 markings, 85084256 edges, 202244 markings/sec, 110 secs
lola: 28889584 markings, 88236881 edges, 203926 markings/sec, 115 secs
lola: 29904672 markings, 91376290 edges, 203018 markings/sec, 120 secs
lola: 30936126 markings, 94569971 edges, 206291 markings/sec, 125 secs
lola: 31969158 markings, 97768973 edges, 206606 markings/sec, 130 secs
lola: 32986611 markings, 100923590 edges, 203491 markings/sec, 135 secs
lola: 33990638 markings, 104031296 edges, 200805 markings/sec, 140 secs
lola: 34982496 markings, 107109319 edges, 198372 markings/sec, 145 secs
lola: 35981610 markings, 110209092 edges, 199823 markings/sec, 150 secs
lola: 36973765 markings, 113292113 edges, 198431 markings/sec, 155 secs
lola: 37966478 markings, 116369939 edges, 198543 markings/sec, 160 secs
lola: 38961366 markings, 119464574 edges, 198978 markings/sec, 165 secs
lola: 39930301 markings, 122473250 edges, 193787 markings/sec, 170 secs
lola: 40878468 markings, 125419976 edges, 189633 markings/sec, 175 secs
lola: 41823016 markings, 128348749 edges, 188910 markings/sec, 180 secs
lola: 42810374 markings, 131415916 edges, 197472 markings/sec, 185 secs
lola: 43805707 markings, 134510150 edges, 199067 markings/sec, 190 secs
lola: 44798796 markings, 137593123 edges, 198618 markings/sec, 195 secs
lola: 45788921 markings, 140669116 edges, 198025 markings/sec, 200 secs
lola: 46778974 markings, 143743501 edges, 198011 markings/sec, 205 secs
lola: 47765912 markings, 146810034 edges, 197388 markings/sec, 210 secs
lola: 48747673 markings, 149861338 edges, 196352 markings/sec, 215 secs
lola: 49720495 markings, 152886149 edges, 194564 markings/sec, 220 secs
lola: 50680458 markings, 155869399 edges, 191993 markings/sec, 225 secs
lola: 51637716 markings, 158849638 edges, 191452 markings/sec, 230 secs
lola: 52583686 markings, 161792215 edges, 189194 markings/sec, 235 secs
lola: 53538178 markings, 164762157 edges, 190898 markings/sec, 240 secs
lola: 54479942 markings, 167692668 edges, 188353 markings/sec, 245 secs
lola: 55421872 markings, 170622294 edges, 188386 markings/sec, 250 secs
lola: 56362665 markings, 173552682 edges, 188159 markings/sec, 255 secs
lola: 57304115 markings, 176484605 edges, 188290 markings/sec, 260 secs
lola: 58237640 markings, 179390795 edges, 186705 markings/sec, 265 secs
lola: 59163555 markings, 182273455 edges, 185183 markings/sec, 270 secs
lola: 60083500 markings, 185135949 edges, 183989 markings/sec, 275 secs
lola: 60990486 markings, 187959479 edges, 181397 markings/sec, 280 secs
lola: 61943831 markings, 190926261 edges, 190669 markings/sec, 285 secs
lola: 62890581 markings, 193871169 edges, 189350 markings/sec, 290 secs
lola: 63829788 markings, 196793829 edges, 187841 markings/sec, 295 secs
lola: 64764755 markings, 199708048 edges, 186993 markings/sec, 300 secs
lola: 65699867 markings, 202618089 edges, 187022 markings/sec, 305 secs
lola: 66632648 markings, 205520800 edges, 186556 markings/sec, 310 secs
lola: 67568625 markings, 208432983 edges, 187195 markings/sec, 315 secs
lola: 68497234 markings, 211328415 edges, 185722 markings/sec, 320 secs
lola: 69433021 markings, 214240776 edges, 187157 markings/sec, 325 secs
lola: 70367556 markings, 217149906 edges, 186907 markings/sec, 330 secs
lola: 71285944 markings, 220014524 edges, 183678 markings/sec, 335 secs
lola: 72215067 markings, 222910364 edges, 185825 markings/sec, 340 secs
lola: 73133568 markings, 225774620 edges, 183700 markings/sec, 345 secs
lola: 74055379 markings, 228650168 edges, 184362 markings/sec, 350 secs
lola: 74986238 markings, 231545261 edges, 186172 markings/sec, 355 secs
lola: 75902927 markings, 234402222 edges, 183338 markings/sec, 360 secs
lola: 76824055 markings, 237273525 edges, 184226 markings/sec, 365 secs
lola: 77762986 markings, 240195502 edges, 187786 markings/sec, 370 secs
lola: 78696176 markings, 243108963 edges, 186638 markings/sec, 375 secs
lola: 79623631 markings, 246002269 edges, 185491 markings/sec, 380 secs
lola: 80552932 markings, 248900112 edges, 185860 markings/sec, 385 secs
lola: 81485837 markings, 251804248 edges, 186581 markings/sec, 390 secs
lola: 82410533 markings, 254688166 edges, 184939 markings/sec, 395 secs
lola: 83337311 markings, 257581520 edges, 185356 markings/sec, 400 secs
lola: 84277850 markings, 260509183 edges, 188108 markings/sec, 405 secs
lola: 85210955 markings, 263423701 edges, 186621 markings/sec, 410 secs
lola: 86144169 markings, 266331603 edges, 186643 markings/sec, 415 secs
lola: 87073268 markings, 269231574 edges, 185820 markings/sec, 420 secs
lola: 88005295 markings, 272139896 edges, 186405 markings/sec, 425 secs
lola: 88943702 markings, 275063447 edges, 187681 markings/sec, 430 secs
lola: 89869526 markings, 277956583 edges, 185165 markings/sec, 435 secs
lola: 90779070 markings, 280795851 edges, 181909 markings/sec, 440 secs
lola: 91208188 markings, 282133927 edges, 85824 markings/sec, 445 secs
lola: 91463626 markings, 282930942 edges, 51088 markings/sec, 450 secs
lola: 91465004 markings, 282935319 edges, 276 markings/sec, 455 secs
lola: 91465091 markings, 282935617 edges, 17 markings/sec, 460 secs
lola: 91465494 markings, 282936840 edges, 81 markings/sec, 465 secs
lola: 91468367 markings, 282946188 edges, 575 markings/sec, 470 secs
lola: 91471022 markings, 282954143 edges, 531 markings/sec, 475 secs
lola: 91471667 markings, 282956147 edges, 129 markings/sec, 480 secs
lola: 91473177 markings, 282960891 edges, 302 markings/sec, 485 secs
lola: 91544288 markings, 283183237 edges, 14222 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (G ((F (G (((Cabins + 1 <= WaitBag) AND G ((1 <= Bags))))) OR X (F ((Cabins + 1 <= WaitBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (G (((Cabins + 1 <= WaitBag) AND G ((1 <= Bags))))) OR X (F ((Cabins + 1 <= WaitBag)))))))
lola: processed formula length: 102
lola: 116 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: 1663311 markings, 5420977 edges, 332662 markings/sec, 0 secs
lola: 3078500 markings, 10232561 edges, 283038 markings/sec, 5 secs
lola: 4351155 markings, 14619484 edges, 254531 markings/sec, 10 secs
lola: 5564568 markings, 18826017 edges, 242683 markings/sec, 15 secs
lola: 6739298 markings, 22913182 edges, 234946 markings/sec, 20 secs
lola: 7877763 markings, 26890730 edges, 227693 markings/sec, 25 secs
lola: 8989154 markings, 30782801 edges, 222278 markings/sec, 30 secs
lola: 10071194 markings, 34574922 edges, 216408 markings/sec, 35 secs
lola: 11142874 markings, 38338498 edges, 214336 markings/sec, 40 secs
lola: 12188679 markings, 42013215 edges, 209161 markings/sec, 45 secs
lola: 13216334 markings, 45625883 edges, 205531 markings/sec, 50 secs
lola: 14236221 markings, 49207530 edges, 203977 markings/sec, 55 secs
lola: 15242549 markings, 52743376 edges, 201266 markings/sec, 60 secs
lola: 16227206 markings, 56206965 edges, 196931 markings/sec, 65 secs
lola: 17207071 markings, 59652659 edges, 195973 markings/sec, 70 secs
lola: 18169620 markings, 63030665 edges, 192510 markings/sec, 75 secs
lola: 19093986 markings, 66281608 edges, 184873 markings/sec, 80 secs
lola: 20003510 markings, 69481588 edges, 181905 markings/sec, 85 secs
lola: 20904554 markings, 72643816 edges, 180209 markings/sec, 90 secs
lola: 21805483 markings, 75800200 edges, 180186 markings/sec, 95 secs
lola: 22696321 markings, 78926792 edges, 178168 markings/sec, 100 secs
lola: 23579105 markings, 82025693 edges, 176557 markings/sec, 105 secs
lola: 24453845 markings, 85094905 edges, 174948 markings/sec, 110 secs
lola: 25324090 markings, 88151786 edges, 174049 markings/sec, 115 secs
lola: 26193254 markings, 91197954 edges, 173833 markings/sec, 120 secs
lola: 27054761 markings, 94217250 edges, 172301 markings/sec, 125 secs
lola: 27915871 markings, 97234948 edges, 172222 markings/sec, 130 secs
lola: 28761224 markings, 100204031 edges, 169071 markings/sec, 135 secs
lola: 29608239 markings, 103175507 edges, 169403 markings/sec, 140 secs
lola: 30450931 markings, 106136777 edges, 168538 markings/sec, 145 secs
lola: 31290999 markings, 109082485 edges, 168014 markings/sec, 150 secs
lola: 32130370 markings, 112025689 edges, 167874 markings/sec, 155 secs
lola: 32970710 markings, 114967189 edges, 168068 markings/sec, 160 secs
lola: 33805800 markings, 117897384 edges, 167018 markings/sec, 165 secs
lola: 34635126 markings, 120809170 edges, 165865 markings/sec, 170 secs
lola: 35461337 markings, 123703533 edges, 165242 markings/sec, 175 secs
lola: 36282171 markings, 126576193 edges, 164167 markings/sec, 180 secs
lola: 37098484 markings, 129437016 edges, 163263 markings/sec, 185 secs
lola: 37906809 markings, 132279072 edges, 161665 markings/sec, 190 secs
lola: 38720057 markings, 135126541 edges, 162650 markings/sec, 195 secs
lola: 39528604 markings, 137957328 edges, 161709 markings/sec, 200 secs
lola: 40331526 markings, 140768901 edges, 160584 markings/sec, 205 secs
lola: 41132190 markings, 143576298 edges, 160133 markings/sec, 210 secs
lola: 41934740 markings, 146382688 edges, 160510 markings/sec, 215 secs
lola: 42734777 markings, 149190746 edges, 160007 markings/sec, 220 secs
lola: 43533084 markings, 151989898 edges, 159661 markings/sec, 225 secs
lola: 44333833 markings, 154795043 edges, 160150 markings/sec, 230 secs
lola: 45121709 markings, 157560604 edges, 157575 markings/sec, 235 secs
lola: 45911255 markings, 160335989 edges, 157909 markings/sec, 240 secs
lola: 46700353 markings, 163104089 edges, 157820 markings/sec, 245 secs
lola: 47484306 markings, 165850785 edges, 156791 markings/sec, 250 secs
lola: 48263884 markings, 168588423 edges, 155916 markings/sec, 255 secs
lola: 49049272 markings, 171337268 edges, 157078 markings/sec, 260 secs
lola: 49823587 markings, 174049961 edges, 154863 markings/sec, 265 secs
lola: 50592956 markings, 176747284 edges, 153874 markings/sec, 270 secs
lola: 51358311 markings, 179434253 edges, 153071 markings/sec, 275 secs
lola: 52117422 markings, 182095761 edges, 151822 markings/sec, 280 secs
lola: 52882205 markings, 184770273 edges, 152957 markings/sec, 285 secs
lola: 53642617 markings, 187439184 edges, 152082 markings/sec, 290 secs
lola: 54411596 markings, 190135811 edges, 153796 markings/sec, 295 secs
lola: 55192361 markings, 192875534 edges, 156153 markings/sec, 300 secs
lola: 55963448 markings, 195589711 edges, 154217 markings/sec, 305 secs
lola: 56735677 markings, 198293754 edges, 154446 markings/sec, 310 secs
lola: 57520378 markings, 201038563 edges, 156940 markings/sec, 315 secs
lola: 58290817 markings, 203740766 edges, 154088 markings/sec, 320 secs
lola: 59052406 markings, 206410949 edges, 152318 markings/sec, 325 secs
lola: 59813755 markings, 209073250 edges, 152270 markings/sec, 330 secs
lola: 60570528 markings, 211732536 edges, 151355 markings/sec, 335 secs
lola: 61328512 markings, 214397835 edges, 151597 markings/sec, 340 secs
lola: 62090924 markings, 217066347 edges, 152482 markings/sec, 345 secs
lola: 62847504 markings, 219716630 edges, 151316 markings/sec, 350 secs
lola: 63602671 markings, 222360063 edges, 151033 markings/sec, 355 secs
lola: 64354261 markings, 225004061 edges, 150318 markings/sec, 360 secs
lola: 65108077 markings, 227645952 edges, 150763 markings/sec, 365 secs
lola: 65864637 markings, 230291974 edges, 151312 markings/sec, 370 secs
lola: 66597170 markings, 232859077 edges, 146507 markings/sec, 375 secs
lola: 67318354 markings, 235376114 edges, 144237 markings/sec, 380 secs
lola: 68049985 markings, 237932073 edges, 146326 markings/sec, 385 secs
lola: 68776776 markings, 240471347 edges, 145358 markings/sec, 390 secs
lola: 69502862 markings, 243009476 edges, 145217 markings/sec, 395 secs
lola: 70228891 markings, 245548273 edges, 145206 markings/sec, 400 secs
lola: 70950063 markings, 248079675 edges, 144234 markings/sec, 405 secs
lola: 71716489 markings, 250762586 edges, 153285 markings/sec, 410 secs
lola: 72490962 markings, 253458469 edges, 154895 markings/sec, 415 secs
lola: 73254045 markings, 256130331 edges, 152617 markings/sec, 420 secs
lola: 74022896 markings, 258814378 edges, 153770 markings/sec, 425 secs
lola: 74772363 markings, 261447379 edges, 149893 markings/sec, 430 secs
lola: 75514243 markings, 264039300 edges, 148376 markings/sec, 435 secs
lola: 76258908 markings, 266640683 edges, 148933 markings/sec, 440 secs
lola: 77001898 markings, 269235958 edges, 148598 markings/sec, 445 secs
lola: 77758830 markings, 271874335 edges, 151386 markings/sec, 450 secs
lola: 78509434 markings, 274494781 edges, 150121 markings/sec, 455 secs
lola: 79260600 markings, 277122903 edges, 150233 markings/sec, 460 secs
lola: 80013180 markings, 279755319 edges, 150516 markings/sec, 465 secs
lola: 80769725 markings, 282392996 edges, 151309 markings/sec, 470 secs
lola: 81529814 markings, 285050392 edges, 152018 markings/sec, 475 secs
lola: 82282942 markings, 287672672 edges, 150626 markings/sec, 480 secs
lola: 83041015 markings, 290313722 edges, 151615 markings/sec, 485 secs
lola: 83787693 markings, 292924357 edges, 149336 markings/sec, 490 secs
lola: 84532673 markings, 295525171 edges, 148996 markings/sec, 495 secs
lola: 85283594 markings, 298144944 edges, 150184 markings/sec, 500 secs
lola: 86027119 markings, 300747268 edges, 148705 markings/sec, 505 secs
lola: 86773299 markings, 303346742 edges, 149236 markings/sec, 510 secs
lola: 87520037 markings, 305946820 edges, 149348 markings/sec, 515 secs
lola: 88031872 markings, 307737270 edges, 102367 markings/sec, 520 secs
lola: 88302568 markings, 308681523 edges, 54139 markings/sec, 525 secs
lola: 88473797 markings, 309279029 edges, 34246 markings/sec, 530 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((3 <= Bags) AND A (F ((Out <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Bags)
lola: processed formula length: 11
lola: 116 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: ...considering subproblem: A (F ((Out <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= Out)
lola: processed formula length: 10
lola: 118 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: 7 markings, 7 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown no unknown yes no yes yes no no no yes
lola:
preliminary result: no no no no no unknown no unknown yes no yes yes no no no yes
lola: memory consumption: 21952 KB
lola: time consumption: 1712 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590646565395

--------------------
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-06"
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-06, 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-159033411700071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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