fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r221-tajo-159033501900083
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for ShieldIIPt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.350 1232249.00 1218950.00 5011.70 TT??FTTTFFTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r221-tajo-159033501900083.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ShieldIIPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r221-tajo-159033501900083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.1K May 14 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 159K May 12 20:42 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 ShieldIIPt-PT-030A-00
FORMULA_NAME ShieldIIPt-PT-030A-01
FORMULA_NAME ShieldIIPt-PT-030A-02
FORMULA_NAME ShieldIIPt-PT-030A-03
FORMULA_NAME ShieldIIPt-PT-030A-04
FORMULA_NAME ShieldIIPt-PT-030A-05
FORMULA_NAME ShieldIIPt-PT-030A-06
FORMULA_NAME ShieldIIPt-PT-030A-07
FORMULA_NAME ShieldIIPt-PT-030A-08
FORMULA_NAME ShieldIIPt-PT-030A-09
FORMULA_NAME ShieldIIPt-PT-030A-10
FORMULA_NAME ShieldIIPt-PT-030A-11
FORMULA_NAME ShieldIIPt-PT-030A-12
FORMULA_NAME ShieldIIPt-PT-030A-13
FORMULA_NAME ShieldIIPt-PT-030A-14
FORMULA_NAME ShieldIIPt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1590885523434

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-030A @ 3570 seconds

FORMULA ShieldIIPt-PT-030A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2338
rslt: Output for LTLCardinality @ ShieldIIPt-PT-030A

{
"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": "Sun May 31 00:38:43 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": 117
},
"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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 117
},
"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": 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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((p199 <= p207) OR (G ((p388 <= p476)) AND F ((p199 <= p207))))))",
"processed_size": 71,
"rewrites": 117
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((p212 <= p470) OR G (((p257 + 1 <= p398) AND X ((p402 <= p189))))))",
"processed_size": 71,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((p375 + 1 <= p278)) U X (((p51 <= 0) AND (p395 <= 0)))))",
"processed_size": 63,
"rewrites": 117
},
"result":
{
"edges": 4736,
"markings": 4735,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 730
},
"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 ((p0 <= p132)))",
"processed_size": 20,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 974
},
"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": "(1 <= p496)",
"processed_size": 11,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1461
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((p546 + 1 <= p413))))",
"processed_size": 30,
"rewrites": 117
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((1 <= p186)) AND ((p160 <= p22) OR (1 <= p186))))))",
"processed_size": 64,
"rewrites": 117
},
"result":
{
"edges": 28876,
"markings": 28644,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23664,
"runtime": 1232.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(X((** OR (G(**) AND F(**))))) : A(G(F((G(*) OR (** AND X(**)))))) : A(F((X(F(**)) AND G(F(**))))) : (A(F(**)) AND A(F(G((F(**) AND (** OR **)))))) : TRUE : A(F(**)) : TRUE : A(G(**)) : FALSE : TRUE : FALSE : FALSE : A(G(F(**))) : A((** OR G((** AND X(**))))) : A((F(**) U X(**)))"
},
"net":
{
"arcs": 1806,
"conflict_clusters": 213,
"places": 573,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 423
},
"result":
{
"preliminary_value": "yes yes unknown unknown no yes yes yes no no yes no no no yes no ",
"value": "yes yes unknown unknown no yes yes yes no no yes no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 996/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 573
lola: finding significant places
lola: 573 places, 423 transitions, 302 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 false: (3 <= p398)
lola: LP says that atomic proposition is always false: (3 <= p119)
lola: LP says that atomic proposition is always false: (2 <= p246)
lola: LP says that atomic proposition is always false: (3 <= p36)
lola: LP says that atomic proposition is always false: (3 <= p111)
lola: LP says that atomic proposition is always false: (3 <= p356)
lola: LP says that atomic proposition is always false: (2 <= p164)
lola: LP says that atomic proposition is always false: (2 <= p164)
lola: LP says that atomic proposition is always false: (3 <= p100)
lola: LP says that atomic proposition is always false: (3 <= p473)
lola: LP says that atomic proposition is always false: (3 <= p259)
lola: A (G (NOT(F (NOT(X (G ((p398 <= 2)))))))) : A (NOT(X (NOT((G ((p388 <= p476)) U (p199 <= p207)))))) : A (G ((NOT(X (G (F ((p335 <= p445))))) OR F (((p335 <= p445) AND X ((p467 <= p22))))))) : A (F ((F (X ((p275 <= p294))) AND G (F ((p7 <= p180)))))) : A ((F ((1 <= p186)) AND F (((p186 <= 0) U G (X (((p160 <= p22) U (1 <= p186)))))))) : A (F (G (NOT(X (X ((3 <= p119))))))) : A ((X ((p187 + 1 <= p99)) U F (((p496 <= 0) AND G (()))))) : A (NOT((((p194 <= p551) OR G ((2 <= p246))) U X (X (((p194 <= p551) U (3 <= p36))))))) : A (G ((p0 <= p132))) : A ((G (NOT(X ((0 <= p197)))) AND ((3 <= p111) OR NOT(X ((0 <= p197)))))) : A (F ((p356 <= 2))) : A (X (F (X (NOT(X (NOT(((2 <= p164) U ())))))))) : A (X ((F (X (())) AND X (X (F (NOT(F ((p408 <= p156))))))))) : A (G (X (G (NOT(G (NOT(((X ((p276 <= p369)) U X (F ((p413 <= p546)))) U (p546 + 1 <= p413))))))))) : A ((((3 <= p473) OR ((3 <= p259) U (p212 <= p470))) OR G (((p257 + 1 <= p398) AND X ((p402 <= p189)))))) : A (((((1 <= p473) U (p278 <= p375)) U F ((p375 + 1 <= p278))) U X (((p51 <= 0) AND (p395 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: 117 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: 117 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: 117 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 117 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 4 will run for 296 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: 117 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 5 will run for 323 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: 117 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 6 will run for 356 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: 117 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 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p199 <= p207) OR (G ((p388 <= p476)) AND F ((p199 <= p207))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p199 <= p207) OR (G ((p388 <= p476)) AND F ((p199 <= p207))))))
lola: processed formula length: 71
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((p445 + 1 <= p335)) OR ((p335 <= p445) AND X ((p467 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((p445 + 1 <= p335)) OR ((p335 <= p445) AND X ((p467 <= p22)))))))
lola: processed formula length: 78
lola: 117 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: 1389738 markings, 1634464 edges, 277948 markings/sec, 0 secs
lola: 2757401 markings, 3311586 edges, 273533 markings/sec, 5 secs
lola: 4151775 markings, 4997417 edges, 278875 markings/sec, 10 secs
lola: 5485908 markings, 6645414 edges, 266827 markings/sec, 15 secs
lola: 6834380 markings, 8307302 edges, 269694 markings/sec, 20 secs
lola: 8168877 markings, 9959797 edges, 266899 markings/sec, 25 secs
lola: 9485793 markings, 11607822 edges, 263383 markings/sec, 30 secs
lola: 10767901 markings, 13196283 edges, 256422 markings/sec, 35 secs
lola: 11979229 markings, 14708439 edges, 242266 markings/sec, 40 secs
lola: 13237588 markings, 16271417 edges, 251672 markings/sec, 45 secs
lola: 14445851 markings, 17810674 edges, 241653 markings/sec, 50 secs
lola: 15634951 markings, 19325970 edges, 237820 markings/sec, 55 secs
lola: 16882818 markings, 20880184 edges, 249573 markings/sec, 60 secs
lola: 18128301 markings, 22444344 edges, 249097 markings/sec, 65 secs
lola: 19319764 markings, 23956147 edges, 238293 markings/sec, 70 secs
lola: 20521760 markings, 25479564 edges, 240399 markings/sec, 75 secs
lola: 21711329 markings, 26992924 edges, 237914 markings/sec, 80 secs
lola: 22889116 markings, 28487917 edges, 235557 markings/sec, 85 secs
lola: 24099522 markings, 30020772 edges, 242081 markings/sec, 90 secs
lola: 25320778 markings, 31572133 edges, 244251 markings/sec, 95 secs
lola: 26503332 markings, 33101834 edges, 236511 markings/sec, 100 secs
lola: 27756109 markings, 34681240 edges, 250555 markings/sec, 105 secs
lola: 28924472 markings, 36157135 edges, 233673 markings/sec, 110 secs
lola: 30145265 markings, 37719033 edges, 244159 markings/sec, 115 secs
lola: 31387761 markings, 39286091 edges, 248499 markings/sec, 120 secs
lola: 32582166 markings, 40841687 edges, 238881 markings/sec, 125 secs
lola: 33717335 markings, 42294287 edges, 227034 markings/sec, 130 secs
lola: 34892074 markings, 43804722 edges, 234948 markings/sec, 135 secs
lola: 36059141 markings, 45325064 edges, 233413 markings/sec, 140 secs
lola: 37245327 markings, 46850461 edges, 237237 markings/sec, 145 secs
lola: 38452420 markings, 48386530 edges, 241419 markings/sec, 150 secs
lola: 39669717 markings, 49937367 edges, 243459 markings/sec, 155 secs
lola: 40859142 markings, 51480703 edges, 237885 markings/sec, 160 secs
lola: 42084750 markings, 53034040 edges, 245122 markings/sec, 165 secs
lola: 43243713 markings, 54528310 edges, 231793 markings/sec, 170 secs
lola: 44400457 markings, 56036635 edges, 231349 markings/sec, 175 secs
lola: 45574927 markings, 57555625 edges, 234894 markings/sec, 180 secs
lola: 46753194 markings, 59076251 edges, 235653 markings/sec, 185 secs
lola: 47949214 markings, 60614198 edges, 239204 markings/sec, 190 secs
lola: 49126865 markings, 62128614 edges, 235530 markings/sec, 195 secs
lola: 50282325 markings, 63649947 edges, 231092 markings/sec, 200 secs
lola: 51486212 markings, 65196821 edges, 240777 markings/sec, 205 secs
lola: 52705098 markings, 66758961 edges, 243777 markings/sec, 210 secs
lola: 53921444 markings, 68311074 edges, 243269 markings/sec, 215 secs
lola: 55148833 markings, 69886146 edges, 245478 markings/sec, 220 secs
lola: 56330090 markings, 71422193 edges, 236251 markings/sec, 225 secs
lola: 57492358 markings, 72954692 edges, 232454 markings/sec, 230 secs
lola: 58664738 markings, 74486891 edges, 234476 markings/sec, 235 secs
lola: 59847492 markings, 76035211 edges, 236551 markings/sec, 240 secs
lola: 61071845 markings, 77605788 edges, 244871 markings/sec, 245 secs
lola: 62302367 markings, 79175977 edges, 246104 markings/sec, 250 secs
lola: 63460189 markings, 80685336 edges, 231564 markings/sec, 255 secs
lola: 64650819 markings, 82230644 edges, 238126 markings/sec, 260 secs
lola: 65863692 markings, 83804471 edges, 242575 markings/sec, 265 secs
lola: 67042418 markings, 85349841 edges, 235745 markings/sec, 270 secs
lola: 68222012 markings, 86886367 edges, 235919 markings/sec, 275 secs
lola: 69362069 markings, 88405900 edges, 228011 markings/sec, 280 secs
lola: 70504654 markings, 89909578 edges, 228517 markings/sec, 285 secs
lola: 71711885 markings, 91462661 edges, 241446 markings/sec, 290 secs
lola: 72895018 markings, 93000340 edges, 236627 markings/sec, 295 secs
lola: 74061621 markings, 94528797 edges, 233321 markings/sec, 300 secs
lola: 74976592 markings, 95737857 edges, 182994 markings/sec, 305 secs
lola: 74976846 markings, 95738139 edges, 51 markings/sec, 310 secs
lola: 74985209 markings, 95749734 edges, 1673 markings/sec, 315 secs
lola: 74989294 markings, 95755389 edges, 817 markings/sec, 320 secs
lola: 74997514 markings, 95766425 edges, 1644 markings/sec, 325 secs
lola: 74997707 markings, 95766663 edges, 39 markings/sec, 330 secs
lola: 74997997 markings, 95767040 edges, 58 markings/sec, 335 secs
lola: 75053476 markings, 95844717 edges, 11096 markings/sec, 340 secs
lola: 75053562 markings, 95844872 edges, 17 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (F ((p275 <= p294))) AND G (F ((p7 <= p180))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (F ((p275 <= p294))) AND G (F ((p7 <= p180))))))
lola: processed formula length: 57
lola: 117 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: 1097409 markings, 1502979 edges, 219482 markings/sec, 0 secs
lola: 2063507 markings, 2891510 edges, 193220 markings/sec, 5 secs
lola: 3029654 markings, 4311453 edges, 193229 markings/sec, 10 secs
lola: 3949326 markings, 5658354 edges, 183934 markings/sec, 15 secs
lola: 4840260 markings, 7002575 edges, 178187 markings/sec, 20 secs
lola: 5754643 markings, 8378926 edges, 182877 markings/sec, 25 secs
lola: 6500309 markings, 9512094 edges, 149133 markings/sec, 30 secs
lola: 7321700 markings, 10757094 edges, 164278 markings/sec, 35 secs
lola: 8207329 markings, 12113476 edges, 177126 markings/sec, 40 secs
lola: 9019568 markings, 13360149 edges, 162448 markings/sec, 45 secs
lola: 9779000 markings, 14520103 edges, 151886 markings/sec, 50 secs
lola: 10543945 markings, 15697080 edges, 152989 markings/sec, 55 secs
lola: 11297467 markings, 16868430 edges, 150704 markings/sec, 60 secs
lola: 12083859 markings, 18114786 edges, 157278 markings/sec, 65 secs
lola: 12894802 markings, 19356881 edges, 162189 markings/sec, 70 secs
lola: 13709172 markings, 20613720 edges, 162874 markings/sec, 75 secs
lola: 14503950 markings, 21850950 edges, 158956 markings/sec, 80 secs
lola: 15292752 markings, 23082834 edges, 157760 markings/sec, 85 secs
lola: 16016369 markings, 24233609 edges, 144723 markings/sec, 90 secs
lola: 16826097 markings, 25499282 edges, 161946 markings/sec, 95 secs
lola: 17570019 markings, 26662343 edges, 148784 markings/sec, 100 secs
lola: 18372724 markings, 27903046 edges, 160541 markings/sec, 105 secs
lola: 19118535 markings, 29071274 edges, 149162 markings/sec, 110 secs
lola: 19863471 markings, 30259700 edges, 148987 markings/sec, 115 secs
lola: 20562977 markings, 31375557 edges, 139901 markings/sec, 120 secs
lola: 21300483 markings, 32558846 edges, 147501 markings/sec, 125 secs
lola: 22014817 markings, 33700389 edges, 142867 markings/sec, 130 secs
lola: 22745474 markings, 34856637 edges, 146131 markings/sec, 135 secs
lola: 23441641 markings, 35938255 edges, 139233 markings/sec, 140 secs
lola: 24173508 markings, 37081391 edges, 146373 markings/sec, 145 secs
lola: 24911156 markings, 38251259 edges, 147530 markings/sec, 150 secs
lola: 25620174 markings, 39415379 edges, 141804 markings/sec, 155 secs
lola: 26318023 markings, 40550411 edges, 139570 markings/sec, 160 secs
lola: 27139439 markings, 41840977 edges, 164283 markings/sec, 165 secs
lola: 27817277 markings, 42928822 edges, 135568 markings/sec, 170 secs
lola: 28516753 markings, 44065996 edges, 139895 markings/sec, 175 secs
lola: 29230431 markings, 45227517 edges, 142736 markings/sec, 180 secs
lola: 29886531 markings, 46268829 edges, 131220 markings/sec, 185 secs
lola: 30585223 markings, 47387103 edges, 139738 markings/sec, 190 secs
lola: 31319243 markings, 48555304 edges, 146804 markings/sec, 195 secs
lola: 32020846 markings, 49687151 edges, 140321 markings/sec, 200 secs
lola: 32712069 markings, 50789621 edges, 138245 markings/sec, 205 secs
lola: 33417148 markings, 51927572 edges, 141016 markings/sec, 210 secs
lola: 34139053 markings, 53104544 edges, 144381 markings/sec, 215 secs
lola: 34827874 markings, 54225429 edges, 137764 markings/sec, 220 secs
lola: 35526046 markings, 55355759 edges, 139634 markings/sec, 225 secs
lola: 36190311 markings, 56442159 edges, 132853 markings/sec, 230 secs
lola: 36902810 markings, 57580667 edges, 142500 markings/sec, 235 secs
lola: 37606795 markings, 58726465 edges, 140797 markings/sec, 240 secs
lola: 38367421 markings, 59930133 edges, 152125 markings/sec, 245 secs
lola: 39031796 markings, 61004658 edges, 132875 markings/sec, 250 secs
lola: 39752060 markings, 62163549 edges, 144053 markings/sec, 255 secs
lola: 40442134 markings, 63285081 edges, 138015 markings/sec, 260 secs
lola: 41202751 markings, 64502511 edges, 152123 markings/sec, 265 secs
lola: 41334881 markings, 64712914 edges, 26426 markings/sec, 270 secs
lola: 41340307 markings, 64720387 edges, 1085 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p212 <= p470) OR G (((p257 + 1 <= p398) AND X ((p402 <= p189))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p212 <= p470) OR G (((p257 + 1 <= p398) AND X ((p402 <= p189))))))
lola: processed formula length: 71
lola: 117 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 11 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p375 + 1 <= p278)) U X (((p51 <= 0) AND (p395 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p375 + 1 <= p278)) U X (((p51 <= 0) AND (p395 <= 0)))))
lola: processed formula length: 63
lola: 117 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: 4735 markings, 4736 edges
lola: ========================================
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p132)))
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 ((p0 <= p132)))
lola: processed formula length: 20
lola: 119 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: SUBRESULT
lola: result: no
lola: produced by: state space
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: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p132 + 1 <= p0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 13 will run for 974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p496 <= 0)))
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: (1 <= p496)
lola: processed formula length: 11
lola: 119 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p546 + 1 <= p413))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p546 + 1 <= p413))))
lola: processed formula length: 30
lola: 117 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 2922 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p186))) AND A (F (G ((F ((1 <= p186)) AND ((p160 <= p22) OR (1 <= p186)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2922 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p186)))
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: (p186 <= 0)
lola: processed formula length: 11
lola: 119 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((p445 + 1 <= p335)) OR ((p335 <= p445) AND X ((p467 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((p445 + 1 <= p335)) OR ((p335 <= p445) AND X ((p467 <= p22)))))))
lola: processed formula length: 78
lola: 117 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: 1188218 markings, 1393004 edges, 237644 markings/sec, 0 secs
lola: 2527423 markings, 3029161 edges, 267841 markings/sec, 5 secs
lola: 3890530 markings, 4679587 edges, 272621 markings/sec, 10 secs
lola: 5200479 markings, 6301373 edges, 261990 markings/sec, 15 secs
lola: 6555211 markings, 7959868 edges, 270946 markings/sec, 20 secs
lola: 7879147 markings, 9594724 edges, 264787 markings/sec, 25 secs
lola: 9190459 markings, 11231631 edges, 262262 markings/sec, 30 secs
lola: 10479674 markings, 12841360 edges, 257843 markings/sec, 35 secs
lola: 11772904 markings, 14453391 edges, 258646 markings/sec, 40 secs
lola: 13075204 markings, 16068721 edges, 260460 markings/sec, 45 secs
lola: 14327595 markings, 17656391 edges, 250478 markings/sec, 50 secs
lola: 15562388 markings, 19234119 edges, 246959 markings/sec, 55 secs
lola: 16853748 markings, 20842721 edges, 258272 markings/sec, 60 secs
lola: 18132769 markings, 22449877 edges, 255804 markings/sec, 65 secs
lola: 19379150 markings, 24027574 edges, 249276 markings/sec, 70 secs
lola: 20624305 markings, 25606804 edges, 249031 markings/sec, 75 secs
lola: 21861683 markings, 27183074 edges, 247476 markings/sec, 80 secs
lola: 23093976 markings, 28743059 edges, 246459 markings/sec, 85 secs
lola: 24337850 markings, 30322425 edges, 248775 markings/sec, 90 secs
lola: 25558567 markings, 31885429 edges, 244143 markings/sec, 95 secs
lola: 26779070 markings, 33454838 edges, 244101 markings/sec, 100 secs
lola: 28026209 markings, 35033114 edges, 249428 markings/sec, 105 secs
lola: 29287335 markings, 36617865 edges, 252225 markings/sec, 110 secs
lola: 30533380 markings, 38199294 edges, 249209 markings/sec, 115 secs
lola: 31741317 markings, 39747843 edges, 241587 markings/sec, 120 secs
lola: 32933291 markings, 41286594 edges, 238395 markings/sec, 125 secs
lola: 34142298 markings, 42850400 edges, 241801 markings/sec, 130 secs
lola: 35347695 markings, 44387513 edges, 241079 markings/sec, 135 secs
lola: 36523442 markings, 45932334 edges, 235149 markings/sec, 140 secs
lola: 37752908 markings, 47494451 edges, 245893 markings/sec, 145 secs
lola: 38978203 markings, 49065626 edges, 245059 markings/sec, 150 secs
lola: 40228263 markings, 50650689 edges, 250012 markings/sec, 155 secs
lola: 41426505 markings, 52210509 edges, 239648 markings/sec, 160 secs
lola: 42662706 markings, 53778194 edges, 247240 markings/sec, 165 secs
lola: 43800513 markings, 55256598 edges, 227561 markings/sec, 170 secs
lola: 44904468 markings, 56696635 edges, 220791 markings/sec, 175 secs
lola: 46064805 markings, 58179100 edges, 232067 markings/sec, 180 secs
lola: 47247569 markings, 59716515 edges, 236553 markings/sec, 185 secs
lola: 48450601 markings, 61259412 edges, 240606 markings/sec, 190 secs
lola: 49638007 markings, 62785046 edges, 237481 markings/sec, 195 secs
lola: 50793050 markings, 64307566 edges, 231009 markings/sec, 200 secs
lola: 51996115 markings, 65855487 edges, 240613 markings/sec, 205 secs
lola: 53221334 markings, 67422892 edges, 245044 markings/sec, 210 secs
lola: 54454538 markings, 68986640 edges, 246641 markings/sec, 215 secs
lola: 55641229 markings, 70524933 edges, 237338 markings/sec, 220 secs
lola: 56784417 markings, 72030796 edges, 228638 markings/sec, 225 secs
lola: 57950862 markings, 73564184 edges, 233289 markings/sec, 230 secs
lola: 59111215 markings, 75083302 edges, 232071 markings/sec, 235 secs
lola: 60318641 markings, 76635565 edges, 241485 markings/sec, 240 secs
lola: 61425942 markings, 78058431 edges, 221460 markings/sec, 245 secs
lola: 62582093 markings, 79545726 edges, 231230 markings/sec, 250 secs
lola: 63656983 markings, 80934794 edges, 214978 markings/sec, 255 secs
lola: 64791066 markings, 82409350 edges, 226817 markings/sec, 260 secs
lola: 65921292 markings, 83881381 edges, 226045 markings/sec, 265 secs
lola: 67019433 markings, 85320008 edges, 219628 markings/sec, 270 secs
lola: 68126566 markings, 86762542 edges, 221427 markings/sec, 275 secs
lola: 69208811 markings, 88206580 edges, 216449 markings/sec, 280 secs
lola: 70262387 markings, 89587233 edges, 210715 markings/sec, 285 secs
lola: 71443165 markings, 91118159 edges, 236156 markings/sec, 290 secs
lola: 72616050 markings, 92638921 edges, 234577 markings/sec, 295 secs
lola: 73777635 markings, 94153891 edges, 232317 markings/sec, 300 secs
lola: 74930559 markings, 95678945 edges, 230585 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((X (F ((p275 <= p294))) AND G (F ((p7 <= p180))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (F ((p275 <= p294))) AND G (F ((p7 <= p180))))))
lola: processed formula length: 57
lola: 117 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: 1080437 markings, 1477509 edges, 216087 markings/sec, 0 secs
lola: 2008651 markings, 2813829 edges, 185643 markings/sec, 5 secs
lola: 2946609 markings, 4187113 edges, 187592 markings/sec, 10 secs
lola: 3830057 markings, 5479790 edges, 176690 markings/sec, 15 secs
lola: 4675975 markings, 6752098 edges, 169184 markings/sec, 20 secs
lola: 5539622 markings, 8051985 edges, 172729 markings/sec, 25 secs
lola: 6364148 markings, 9305315 edges, 164905 markings/sec, 30 secs
lola: 7150795 markings, 10497647 edges, 157329 markings/sec, 35 secs
lola: 8002845 markings, 11793816 edges, 170410 markings/sec, 40 secs
lola: 8789178 markings, 13006200 edges, 157267 markings/sec, 45 secs
lola: 9528720 markings, 14142340 edges, 147908 markings/sec, 50 secs
lola: 10253478 markings, 15247813 edges, 144952 markings/sec, 55 secs
lola: 10989602 markings, 16390874 edges, 147225 markings/sec, 60 secs
lola: 11728151 markings, 17544989 edges, 147710 markings/sec, 65 secs
lola: 12529943 markings, 18793092 edges, 160358 markings/sec, 70 secs
lola: 13297389 markings, 19985071 edges, 153489 markings/sec, 75 secs
lola: 14101931 markings, 21231717 edges, 160908 markings/sec, 80 secs
lola: 14888266 markings, 22456811 edges, 157267 markings/sec, 85 secs
lola: 15706888 markings, 23737372 edges, 163724 markings/sec, 90 secs
lola: 16507788 markings, 24996578 edges, 160180 markings/sec, 95 secs
lola: 17296700 markings, 26236771 edges, 157782 markings/sec, 100 secs
lola: 18087918 markings, 27464623 edges, 158244 markings/sec, 105 secs
lola: 18866795 markings, 28674003 edges, 155775 markings/sec, 110 secs
lola: 19615129 markings, 29858033 edges, 149667 markings/sec, 115 secs
lola: 20325207 markings, 30999458 edges, 142016 markings/sec, 120 secs
lola: 21064350 markings, 32182747 edges, 147829 markings/sec, 125 secs
lola: 21808894 markings, 33367974 edges, 148909 markings/sec, 130 secs
lola: 22534496 markings, 34529880 edges, 145120 markings/sec, 135 secs
lola: 23320552 markings, 35754232 edges, 157211 markings/sec, 140 secs
lola: 24060856 markings, 36908021 edges, 148061 markings/sec, 145 secs
lola: 24846544 markings, 38148826 edges, 157138 markings/sec, 150 secs
lola: 25577971 markings, 39347266 edges, 146285 markings/sec, 155 secs
lola: 26293071 markings, 40507957 edges, 143020 markings/sec, 160 secs
lola: 27122056 markings, 41811888 edges, 165797 markings/sec, 165 secs
lola: 27815891 markings, 42926745 edges, 138767 markings/sec, 170 secs
lola: 28527474 markings, 44083840 edges, 142317 markings/sec, 175 secs
lola: 29252422 markings, 45263687 edges, 144990 markings/sec, 180 secs
lola: 29925457 markings, 46335599 edges, 134607 markings/sec, 185 secs
lola: 30636438 markings, 47469922 edges, 142196 markings/sec, 190 secs
lola: 31379187 markings, 48652186 edges, 148550 markings/sec, 195 secs
lola: 32094825 markings, 49799860 edges, 143128 markings/sec, 200 secs
lola: 32801272 markings, 50936417 edges, 141289 markings/sec, 205 secs
lola: 33562153 markings, 52161041 edges, 152176 markings/sec, 210 secs
lola: 34257582 markings, 53304128 edges, 139086 markings/sec, 215 secs
lola: 34949089 markings, 54422747 edges, 138301 markings/sec, 220 secs
lola: 35661294 markings, 55570532 edges, 142441 markings/sec, 225 secs
lola: 36357150 markings, 56720635 edges, 139171 markings/sec, 230 secs
lola: 37095243 markings, 57896900 edges, 147619 markings/sec, 235 secs
lola: 37819705 markings, 59057500 edges, 144892 markings/sec, 240 secs
lola: 38561865 markings, 60243027 edges, 148432 markings/sec, 245 secs
lola: 39270177 markings, 61392952 edges, 141662 markings/sec, 250 secs
lola: 39953593 markings, 62492492 edges, 136683 markings/sec, 255 secs
lola: 40640244 markings, 63609182 edges, 137330 markings/sec, 260 secs
lola: 41314205 markings, 64682154 edges, 134792 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p186))) AND A (F (G ((F ((1 <= p186)) AND ((p160 <= p22) OR (1 <= p186)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p186)))
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: (p186 <= 0)
lola: processed formula length: 11
lola: 119 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 (F (G ((F ((1 <= p186)) AND ((p160 <= p22) OR (1 <= p186))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((1 <= p186)) AND ((p160 <= p22) OR (1 <= p186))))))
lola: processed formula length: 64
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28644 markings, 28876 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown unknown no yes yes yes no no yes no no no yes no
lola:
preliminary result: yes yes unknown unknown no yes yes yes no no yes no no no yes no
lola: memory consumption: 23664 KB
lola: time consumption: 1232 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590886755683

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="ShieldIIPt-PT-030A"
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 ShieldIIPt-PT-030A, 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 r221-tajo-159033501900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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