fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r015-smll-158897552800083
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for Angiogenesis-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.980 554279.00 559156.00 2279.90 FFFFTTFFFFFFFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r015-smll-158897552800083.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Angiogenesis-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-smll-158897552800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.4K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-10-00
FORMULA_NAME Angiogenesis-PT-10-01
FORMULA_NAME Angiogenesis-PT-10-02
FORMULA_NAME Angiogenesis-PT-10-03
FORMULA_NAME Angiogenesis-PT-10-04
FORMULA_NAME Angiogenesis-PT-10-05
FORMULA_NAME Angiogenesis-PT-10-06
FORMULA_NAME Angiogenesis-PT-10-07
FORMULA_NAME Angiogenesis-PT-10-08
FORMULA_NAME Angiogenesis-PT-10-09
FORMULA_NAME Angiogenesis-PT-10-10
FORMULA_NAME Angiogenesis-PT-10-11
FORMULA_NAME Angiogenesis-PT-10-12
FORMULA_NAME Angiogenesis-PT-10-13
FORMULA_NAME Angiogenesis-PT-10-14
FORMULA_NAME Angiogenesis-PT-10-15

=== Now, execution of the tool begins

BK_START 1589282092170

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Angiogenesis-PT-10 @ 3570 seconds

FORMULA Angiogenesis-PT-10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Angiogenesis-PT-10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3016
rslt: Output for LTLCardinality @ Angiogenesis-PT-10

{
"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": "Tue May 12 11:14:52 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": "FALSE",
"processed_size": 5,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (((DAGE + 1 <= GStarPgP3) AND G ((F ((3 <= GStarP3)) AND (X ((1 <= GStarP3kP3)) OR (3 <= GStarP3)))))))",
"processed_size": 108,
"rewrites": 69
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((KdStarGStar <= 1) OR X ((KdStarGStar <= 1)))))",
"processed_size": 54,
"rewrites": 69
},
"result":
{
"edges": 29983,
"markings": 14545,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F ((X ((1 <= KdStarPg)) AND G ((1 <= KdStarPg)))))",
"processed_size": 53,
"rewrites": 69
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= GP3)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"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": "(KdStarGStarP3kP3 <= 2)",
"processed_size": 23,
"rewrites": 71
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 657
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(KdStarGStarPg + 1 <= Pg)",
"processed_size": 25,
"rewrites": 71
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 822
},
"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 ((2 <= KdStarG))))",
"processed_size": 26,
"rewrites": 69
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 1096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((KdStar <= GStarP3kP3))))",
"processed_size": 34,
"rewrites": 69
},
"result":
{
"edges": 3,
"markings": 3,
"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": 1644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((G ((KdStarGStarP3 <= KdStarGStarP3k)) OR (F ((3 <= PtP3)) U (GP3 <= PtP3P2))))",
"processed_size": 82,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3289
},
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= GP3)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22232,
"runtime": 554.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(G((** AND X(**))))) : FALSE : (** AND A(X(F((F(*) AND (F(G(**)) OR G(F(*)))))))) : A(G(F(*))) : A((** OR (G(**) OR X(F(*))))) : A((G(**) OR (F(**) U **))) : A(F((** AND G((F(**) AND (X(**) OR **)))))) : A(G(**)) : A(F(**)) : A(G((* OR X(*)))) : A(F(**)) : A(F(**)) : A(G(F(**))) : A(F((X(**) AND G(**)))) : (A(F(**)) AND A(F(**))) : (A(X((* R *))) AND A(F(**)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no yes yes no no no no no no no no no unknown ",
"value": "no no no no yes yes no no no no no no no no no unknown "
},
"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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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: LP says that atomic proposition is always true: (GStarPgP3 <= Pten)
lola: A (F (G (((2 <= KdStarGStarP3kStar) AND X ((2 <= KdStarGStarP3kStar)))))) : A ((F ((KdStarGStar <= Pip2)) U NOT((((KdStarGP3 + 1 <= AktStar) U NOT(X ((GStarP3 <= Pip2)))) U (GStarPgP3 <= Pten))))) : A (((GStarP3kP3 <= PtP2) AND F (X (NOT((NOT(F (X (G ((1 <= KdStarGStarPg))))) U G ((KdStarGStarPgStarP3 <= DAGE)))))))) : A (G (NOT(X (G ((GStarP3kP3 + 1 <= KdStar)))))) : A ((((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3) OR G ((3 <= KdStarGStarPg))) OR F (NOT(X ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3)))))) : A ((G ((KdStarGStarP3 <= KdStarGStarP3k)) OR (F ((3 <= PtP3)) U (GP3 <= PtP3P2)))) : A (F (((DAGE + 1 <= GStarPgP3) AND G ((X ((1 <= GStarP3kP3)) U (3 <= GStarP3)))))) : A (G ((PtP3 <= KdStarPgStarP2))) : A (F ((((3 <= KdStarGStarPgStar) U (Pg <= DAG)) U (Pg <= KdStarGStarPg)))) : A (NOT(F (((2 <= KdStarGStar) AND X ((2 <= KdStarGStar)))))) : A (F ((((KdStarGStarP3kP3 <= P3k) U (((1 <= PtP3P2) AND (1 <= KdStarGStarP3kStarP3P2)) U ((KdStarGStarP3kP3 <= P3k) AND F ((1 <= KdStarGStarP3kStarP3P2))))) U (1 <= KdStarGStarP3kStarP3P2)))) : A (((G ((0 <= KdStarPgStar)) AND F ((3 <= KdStarGStarP3kP3))) AND F ((F ((KdStar <= GStarPgP3)) U (0 <= KdStarPgStar))))) : A (((G (((Pten <= KdStarGP3) OR G ((KdStarPg <= PtP2)))) U X ((KdStarGStarP3kP3 <= GStarP3kP3))) U X (G (F ((2 <= KdStarG)))))) : A (F ((X ((1 <= KdStarPg)) AND NOT(F (NOT(G ((1 <= KdStarPg)))))))) : A ((F ((AktP3 + 1 <= KdStarPgStarP2)) AND F ((((GStarP3 <= PtP2) OR (KdStarGStarP3kStarP2 <= Pip2)) U F ((X (F ((GStarP3 <= PtP2))) U (2 <= KdStarGStarP3kStar))))))) : A ((NOT(X (((PtP2 <= KdStarGStar) U (2 <= GP3)))) AND F ((GP3 <= 1))))
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:431
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:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((2 <= KdStarGStarP3kStar) AND X ((2 <= KdStarGStarP3kStar))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((2 <= KdStarGStarP3kStar) AND X ((2 <= KdStarGStarP3kStar))))))
lola: processed formula length: 73
lola: 69 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: add low 57
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((GStarP3kP3 <= PtP2) AND A (X (F ((F ((DAGE + 1 <= KdStarGStarPgStarP3)) AND (F (G ((1 <= KdStarGStarPg))) OR G (F ((DAGE + 1 <= KdStarGStarPgStarP3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (GStarP3kP3 <= PtP2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (GStarP3kP3 <= PtP2)
lola: processed formula length: 20
lola: 69 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: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F ((DAGE + 1 <= KdStarGStarPgStarP3)) AND (F (G ((1 <= KdStarGStarPg))) OR G (F ((DAGE + 1 <= KdStarGStarPgStarP3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F ((DAGE + 1 <= KdStarGStarPgStarP3)) AND (F (G ((1 <= KdStarGStarPg))) OR G (F ((DAGE + 1 <= KdStarGStarPgStarP3))))))))
lola: processed formula length: 131
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3) OR (G ((3 <= KdStarGStarPg)) OR X (F ((KdStarGStarP3kStarP3 + 1 <= KdStarGStarP3kP3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3) OR (G ((3 <= KdStarGStarPg)) OR X (F ((KdStarGStarP3kStarP3 + 1 <= KdStarGStarP3kP3))))))
lola: processed formula length: 136
lola: 69 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((DAGE + 1 <= GStarPgP3) AND G ((F ((3 <= GStarP3)) AND (X ((1 <= GStarP3kP3)) OR (3 <= GStarP3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((DAGE + 1 <= GStarPgP3) AND G ((F ((3 <= GStarP3)) AND (X ((1 <= GStarP3kP3)) OR (3 <= GStarP3)))))))
lola: processed formula length: 108
lola: 69 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStar <= 1) OR X ((KdStarGStar <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((KdStarGStar <= 1) OR X ((KdStarGStar <= 1)))))
lola: processed formula length: 54
lola: 69 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: 14545 markings, 29983 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((1 <= KdStarPg)) AND G ((1 <= KdStarPg)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((1 <= KdStarPg)) AND G ((1 <= KdStarPg)))))
lola: processed formula length: 53
lola: 69 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1)))) AND A (F ((GP3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((GP3 <= 1)))
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: (2 <= GP3)
lola: processed formula length: 10
lola: 71 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1))))
lola: processed formula length: 48
lola: 69 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: 2031365 markings, 4378937 edges, 406273 markings/sec, 0 secs
lola: 3819862 markings, 8205610 edges, 357699 markings/sec, 5 secs
lola: 5467970 markings, 11811662 edges, 329622 markings/sec, 10 secs
lola: 7158789 markings, 15363694 edges, 338164 markings/sec, 15 secs
lola: 8727880 markings, 18817308 edges, 313818 markings/sec, 20 secs
lola: 10284740 markings, 22223584 edges, 311372 markings/sec, 25 secs
lola: 11764328 markings, 25561292 edges, 295918 markings/sec, 30 secs
lola: 13400916 markings, 28946519 edges, 327318 markings/sec, 35 secs
lola: 14974598 markings, 32276241 edges, 314736 markings/sec, 40 secs
lola: 16490981 markings, 35545141 edges, 303277 markings/sec, 45 secs
lola: 18138577 markings, 38896559 edges, 329519 markings/sec, 50 secs
lola: 19555601 markings, 42075675 edges, 283405 markings/sec, 55 secs
lola: 20999759 markings, 45233839 edges, 288832 markings/sec, 60 secs
lola: 22402464 markings, 48326847 edges, 280541 markings/sec, 65 secs
lola: 23939837 markings, 51497599 edges, 307475 markings/sec, 70 secs
lola: 25361386 markings, 54590480 edges, 284310 markings/sec, 75 secs
lola: 26734913 markings, 57648788 edges, 274705 markings/sec, 80 secs
lola: 28101082 markings, 60680979 edges, 273234 markings/sec, 85 secs
lola: 29439058 markings, 63693324 edges, 267595 markings/sec, 90 secs
lola: 30866267 markings, 66752785 edges, 285442 markings/sec, 95 secs
lola: 32243649 markings, 69758903 edges, 275476 markings/sec, 100 secs
lola: 33557465 markings, 72724545 edges, 262763 markings/sec, 105 secs
lola: 34896741 markings, 75707889 edges, 267855 markings/sec, 110 secs
lola: 36259610 markings, 78693353 edges, 272574 markings/sec, 115 secs
lola: 37556828 markings, 81618240 edges, 259444 markings/sec, 120 secs
lola: 38874431 markings, 84565731 edges, 263521 markings/sec, 125 secs
lola: 40227369 markings, 87497057 edges, 270588 markings/sec, 130 secs
lola: 41523393 markings, 90423550 edges, 259205 markings/sec, 135 secs
lola: 42897728 markings, 93363398 edges, 274867 markings/sec, 140 secs
lola: 44158992 markings, 96248168 edges, 252253 markings/sec, 145 secs
lola: 45444011 markings, 99135269 edges, 257004 markings/sec, 150 secs
lola: 46687932 markings, 101979624 edges, 248784 markings/sec, 155 secs
lola: 47941774 markings, 104836755 edges, 250768 markings/sec, 160 secs
lola: 49227910 markings, 107725173 edges, 257227 markings/sec, 165 secs
lola: 50481833 markings, 110583453 edges, 250785 markings/sec, 170 secs
lola: 51758058 markings, 113426069 edges, 255245 markings/sec, 175 secs
lola: 53298848 markings, 116519827 edges, 308158 markings/sec, 180 secs
lola: 54645389 markings, 119400173 edges, 269308 markings/sec, 185 secs
lola: 56119135 markings, 122339986 edges, 294749 markings/sec, 190 secs
lola: 57414858 markings, 125191759 edges, 259145 markings/sec, 195 secs
lola: 58694727 markings, 128046790 edges, 255974 markings/sec, 200 secs
lola: 59921879 markings, 130870409 edges, 245430 markings/sec, 205 secs
lola: 61255916 markings, 133737034 edges, 266807 markings/sec, 210 secs
lola: 62497862 markings, 136523989 edges, 248389 markings/sec, 215 secs
lola: 63708776 markings, 139293285 edges, 242183 markings/sec, 220 secs
lola: 64978533 markings, 142078323 edges, 253951 markings/sec, 225 secs
lola: 66278647 markings, 144899079 edges, 260023 markings/sec, 230 secs
lola: 67465089 markings, 147635159 edges, 237288 markings/sec, 235 secs
lola: 68662222 markings, 150398522 edges, 239427 markings/sec, 240 secs
lola: 70013477 markings, 153227298 edges, 270251 markings/sec, 245 secs
lola: 71199377 markings, 155971444 edges, 237180 markings/sec, 250 secs
lola: 72527774 markings, 158773775 edges, 265679 markings/sec, 255 secs
lola: 73537381 markings, 160981261 edges, 201921 markings/sec, 260 secs
lola: 73841363 markings, 161652500 edges, 60796 markings/sec, 265 secs
lola: 73968694 markings, 161954793 edges, 25466 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((PtP3 <= KdStarPgStarP2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((PtP3 <= KdStarPgStarP2)))
lola: processed formula length: 32
lola: 71 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (KdStarPgStarP2 + 1 <= PtP3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 138 markings, 215 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= KdStarGStarP3kStarP3P2)))
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: (KdStarGStarP3kStarP3P2 <= 0)
lola: processed formula length: 29
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= KdStarGStarP3kP3)))
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: (KdStarGStarP3kP3 <= 2)
lola: processed formula length: 23
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Pg <= KdStarGStarPg)))
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: (KdStarGStarPg + 1 <= Pg)
lola: processed formula length: 25
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= KdStarG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= KdStarG))))
lola: processed formula length: 26
lola: 69 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((KdStar <= GStarP3kP3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((KdStar <= GStarP3kP3))))
lola: processed formula length: 34
lola: 69 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((KdStarGStarP3 <= KdStarGStarP3k)) OR (F ((3 <= PtP3)) U (GP3 <= PtP3P2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((KdStarGStarP3 <= KdStarGStarP3k)) OR (F ((3 <= PtP3)) U (GP3 <= PtP3P2))))
lola: processed formula length: 82
lola: 69 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: 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: 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 15 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((AktP3 + 1 <= KdStarPgStarP2))) AND A (F ((2 <= KdStarGStarP3kStar))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= KdStarGStarP3kStar)))
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: (KdStarGStarP3kStar <= 1)
lola: processed formula length: 25
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1)))) AND A (F ((GP3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((GP3 <= 1)))
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: (2 <= GP3)
lola: processed formula length: 10
lola: 71 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: ========================================
lola: ...considering subproblem: A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((KdStarGStar + 1 <= PtP2) R (GP3 <= 1))))
lola: processed formula length: 48
lola: 69 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: 1896999 markings, 4088812 edges, 379400 markings/sec, 0 secs
lola: 3564585 markings, 7659576 edges, 333517 markings/sec, 5 secs
lola: 5229619 markings, 11295722 edges, 333007 markings/sec, 10 secs
lola: 6837866 markings, 14709230 edges, 321649 markings/sec, 15 secs
lola: 8363855 markings, 18025247 edges, 305198 markings/sec, 20 secs
lola: 9927065 markings, 21415549 edges, 312642 markings/sec, 25 secs
lola: 11412514 markings, 24772602 edges, 297090 markings/sec, 30 secs
lola: 12979459 markings, 28091651 edges, 313389 markings/sec, 35 secs
lola: 14616301 markings, 31468862 edges, 327368 markings/sec, 40 secs
lola: 16104417 markings, 34724854 edges, 297623 markings/sec, 45 secs
lola: 17764348 markings, 38076487 edges, 331986 markings/sec, 50 secs
lola: 19199038 markings, 41262971 edges, 286938 markings/sec, 55 secs
lola: 20640956 markings, 44408152 edges, 288384 markings/sec, 60 secs
lola: 22059044 markings, 47552695 edges, 283618 markings/sec, 65 secs
lola: 23599343 markings, 50727624 edges, 308060 markings/sec, 70 secs
lola: 24982866 markings, 53837531 edges, 276705 markings/sec, 75 secs
lola: 26385620 markings, 56892101 edges, 280551 markings/sec, 80 secs
lola: 27765289 markings, 59942938 edges, 275934 markings/sec, 85 secs
lola: 29102005 markings, 62968569 edges, 267343 markings/sec, 90 secs
lola: 30508569 markings, 66024156 edges, 281313 markings/sec, 95 secs
lola: 31925133 markings, 69061403 edges, 283313 markings/sec, 100 secs
lola: 33272557 markings, 72072729 edges, 269485 markings/sec, 105 secs
lola: 34622194 markings, 75064487 edges, 269927 markings/sec, 110 secs
lola: 35971504 markings, 78077991 edges, 269862 markings/sec, 115 secs
lola: 37296383 markings, 81037541 edges, 264976 markings/sec, 120 secs
lola: 38629251 markings, 84016611 edges, 266574 markings/sec, 125 secs
lola: 39968849 markings, 86951695 edges, 267920 markings/sec, 130 secs
lola: 41288355 markings, 89903633 edges, 263901 markings/sec, 135 secs
lola: 42656973 markings, 92859672 edges, 273724 markings/sec, 140 secs
lola: 43957486 markings, 95795533 edges, 260103 markings/sec, 145 secs
lola: 45263701 markings, 98708694 edges, 261243 markings/sec, 150 secs
lola: 46514020 markings, 101582455 edges, 250064 markings/sec, 155 secs
lola: 47783558 markings, 104465641 edges, 253908 markings/sec, 160 secs
lola: 49083431 markings, 107372095 edges, 259975 markings/sec, 165 secs
lola: 50337058 markings, 110249453 edges, 250725 markings/sec, 170 secs
lola: 51608281 markings, 113106043 edges, 254245 markings/sec, 175 secs
lola: 53121590 markings, 116176761 edges, 302662 markings/sec, 180 secs
lola: 54512122 markings, 119120713 edges, 278106 markings/sec, 185 secs
lola: 56004866 markings, 122085873 edges, 298549 markings/sec, 190 secs
lola: 57311313 markings, 124953240 edges, 261289 markings/sec, 195 secs
lola: 58598914 markings, 127829234 edges, 257520 markings/sec, 200 secs
lola: 59831991 markings, 130671861 edges, 246615 markings/sec, 205 secs
lola: 61174287 markings, 133557956 edges, 268459 markings/sec, 210 secs
lola: 62430761 markings, 136357473 edges, 251295 markings/sec, 215 secs
lola: 63645102 markings, 139146333 edges, 242868 markings/sec, 220 secs
lola: 64912362 markings, 141950525 edges, 253452 markings/sec, 225 secs
lola: 66237999 markings, 144805829 edges, 265127 markings/sec, 230 secs
lola: 67435668 markings, 147564566 edges, 239534 markings/sec, 235 secs
lola: 68639612 markings, 150350453 edges, 240789 markings/sec, 240 secs
lola: 70001009 markings, 153200355 edges, 272279 markings/sec, 245 secs
lola: 71196008 markings, 155964670 edges, 239000 markings/sec, 250 secs
lola: 72533884 markings, 158784793 edges, 267575 markings/sec, 255 secs
lola: 73539376 markings, 160985790 edges, 201098 markings/sec, 260 secs
lola: 73842305 markings, 161654262 edges, 60586 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no no no no no no no no unknown
lola:
preliminary result: no no no no yes yes no no no no no no no no no unknown
lola: ========================================
lola: memory consumption: 22232 KB
lola: time consumption: 554 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589282646449

--------------------
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="Angiogenesis-PT-10"
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 Angiogenesis-PT-10, 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 r015-smll-158897552800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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