fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r137-smll-155284909800339
Last Updated
Apr 15, 2019

About the Execution of LoLA for RefineWMG-PT-010011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.750 1010206.00 1024795.00 4438.70 TF??FF?TFFFTFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 2.8K Feb 12 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 01:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 1 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 24K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553057984882

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-010011 @ 3570 seconds

FORMULA RefineWMG-PT-010-011-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010-011-LTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2559
rslt: Output for LTLCardinality @ RefineWMG-PT-010011

{
"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": "Wed Mar 20 04:59:44 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(p25 <= p3)",
"processed_size": 11,
"rewrites": 34
},
"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": 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": "(p45 <= p6)",
"processed_size": 11,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"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 ((((p21 <= p29) U (2 <= p39)) U X (F ((2 <= p1)))))",
"processed_size": 53,
"rewrites": 34
},
"result":
{
"edges": 12,
"markings": 12,
"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": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (G ((1 <= p30)))))",
"processed_size": 26,
"rewrites": 34
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= p8)))",
"processed_size": 17,
"rewrites": 36
},
"result":
{
"edges": 76,
"markings": 77,
"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": 467
},
"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": "(p10 + 1 <= pprime)",
"processed_size": 19,
"rewrites": 36
},
"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": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"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": "(p33 + 1 <= p43)",
"processed_size": 16,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"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 <= p30))))",
"processed_size": 22,
"rewrites": 34
},
"result":
{
"edges": 7,
"markings": 7,
"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": 1089
},
"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 (F (G ((1 <= p41))))",
"processed_size": 22,
"rewrites": 34
},
"result":
{
"edges": 9,
"markings": 8,
"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": 3066
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3066
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p44 <= p27) OR (p41 <= pprime))))",
"processed_size": 41,
"rewrites": 39
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15604,
"runtime": 1011.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A(X(X(G(**)))) : A(X(G(**))) : A(X((G(**) OR (G(**) AND F(G(**)))))) : A(F(G(**))) : A(G(F(**))) : A(G((F(**) OR (G(**) AND F(**))))) : ** : A(F(**)) : A(((** U **) U X(F(**)))) : (A(G(F(**))) AND A(G((** OR **)))) : ** : ** : A(G(F(**))) : ** : A(G(**))"
},
"net":
{
"arcs": 126,
"conflict_clusters": 35,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "yes no unknown unknown no no unknown yes no no no yes no no yes no ",
"value": "yes no unknown unknown no no unknown yes no no no yes 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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (F (F (F (F ((p43 <= p33)))))) : A (G (X (X (G ((1 <= p30)))))) : A (G (G (X (G ((p32 <= p47)))))) : A ((X (G ((p21 <= p48))) U X (G ((p49 <= p8))))) : A (F (G (X (X ((1 <= p41)))))) : A ((F ((p4 <= p11)) U G (F ((2 <= p30))))) : A (G ((G ((p37 <= p35)) U F ((2 <= p48))))) : A ((p25 <= p3)) : A (F ((pprime <= p10))) : A ((((p21 <= p29) U (2 <= p39)) U X (F ((2 <= p1))))) : A (G (G (((p44 <= p27) U (p41 <= pprime))))) : A ((p45 <= p6)) : A ((3 <= p)) : A (F (G (G (F ((3 <= p30)))))) : A ((p26 <= p22)) : A (G (G (G (G ((3 <= p8))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p25 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p25 <= p3)
lola: processed formula length: 11
lola: 34 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p45 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 <= p6)
lola: processed formula length: 11
lola: 34 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p)
lola: processed formula length: 8
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p26 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p26 <= p22)
lola: processed formula length: 12
lola: 34 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p21 <= p29) U (2 <= p39)) U X (F ((2 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p21 <= p29) U (2 <= p39)) U X (F ((2 <= p1)))))
lola: processed formula length: 53
lola: 34 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p32 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p32 <= p47))))
lola: processed formula length: 24
lola: 34 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: 2682880 markings, 4082642 edges, 536576 markings/sec, 0 secs
lola: 5276263 markings, 8029090 edges, 518677 markings/sec, 5 secs
lola: 7860630 markings, 11961823 edges, 516873 markings/sec, 10 secs
lola: 10414995 markings, 15848902 edges, 510873 markings/sec, 15 secs
lola: 12951484 markings, 19708778 edges, 507298 markings/sec, 20 secs
lola: 15492281 markings, 23575204 edges, 508159 markings/sec, 25 secs
lola: 18005488 markings, 27399652 edges, 502641 markings/sec, 30 secs
lola: 20504534 markings, 31202546 edges, 499809 markings/sec, 35 secs
lola: 22980403 markings, 34970175 edges, 495174 markings/sec, 40 secs
lola: 25431428 markings, 38699996 edges, 490205 markings/sec, 45 secs
lola: 27860018 markings, 42395678 edges, 485718 markings/sec, 50 secs
lola: 30263408 markings, 46053008 edges, 480678 markings/sec, 55 secs
lola: 32673066 markings, 49719882 edges, 481932 markings/sec, 60 secs
lola: 35062528 markings, 53356016 edges, 477892 markings/sec, 65 secs
lola: 37454346 markings, 56995741 edges, 478364 markings/sec, 70 secs
lola: 39844003 markings, 60632176 edges, 477931 markings/sec, 75 secs
lola: 42210828 markings, 64233864 edges, 473365 markings/sec, 80 secs
lola: 44598172 markings, 67866782 edges, 477469 markings/sec, 85 secs
lola: 46937057 markings, 71425951 edges, 467777 markings/sec, 90 secs
lola: 49284171 markings, 74997651 edges, 469423 markings/sec, 95 secs
lola: 51636280 markings, 78576943 edges, 470422 markings/sec, 100 secs
lola: 53963650 markings, 82118593 edges, 465474 markings/sec, 105 secs
lola: 56297763 markings, 85670504 edges, 466823 markings/sec, 110 secs
lola: 58596370 markings, 89168386 edges, 459721 markings/sec, 115 secs
lola: 60895042 markings, 92666363 edges, 459734 markings/sec, 120 secs
lola: 63207417 markings, 96185194 edges, 462475 markings/sec, 125 secs
lola: 65504292 markings, 99680439 edges, 459375 markings/sec, 130 secs
lola: 67804758 markings, 103181152 edges, 460093 markings/sec, 135 secs
lola: 70090084 markings, 106658822 edges, 457065 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p49 <= p8)) OR (G ((p21 <= p48)) AND F (G ((p49 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p49 <= p8)) OR (G ((p21 <= p48)) AND F (G ((p49 <= p8)))))))
lola: processed formula length: 71
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2604293 markings, 3963052 edges, 520859 markings/sec, 0 secs
lola: 5137939 markings, 7818597 edges, 506729 markings/sec, 5 secs
lola: 7667298 markings, 11667623 edges, 505872 markings/sec, 10 secs
lola: 10178809 markings, 15489489 edges, 502302 markings/sec, 15 secs
lola: 12667206 markings, 19276182 edges, 497679 markings/sec, 20 secs
lola: 15174178 markings, 23091137 edges, 501394 markings/sec, 25 secs
lola: 17659028 markings, 26872430 edges, 496970 markings/sec, 30 secs
lola: 20136890 markings, 30643091 edges, 495572 markings/sec, 35 secs
lola: 22589530 markings, 34375366 edges, 490528 markings/sec, 40 secs
lola: 25022906 markings, 38078329 edges, 486675 markings/sec, 45 secs
lola: 27427704 markings, 41737807 edges, 480960 markings/sec, 50 secs
lola: 29805848 markings, 45356720 edges, 475629 markings/sec, 55 secs
lola: 32190771 markings, 48985952 edges, 476985 markings/sec, 60 secs
lola: 34551793 markings, 52578813 edges, 472204 markings/sec, 65 secs
lola: 36910143 markings, 56167606 edges, 471670 markings/sec, 70 secs
lola: 39274083 markings, 59764905 edges, 472788 markings/sec, 75 secs
lola: 41626093 markings, 63344052 edges, 470402 markings/sec, 80 secs
lola: 43982858 markings, 66930434 edges, 471353 markings/sec, 85 secs
lola: 46305612 markings, 70465055 edges, 464551 markings/sec, 90 secs
lola: 48580228 markings, 73926431 edges, 454923 markings/sec, 95 secs
lola: 50906269 markings, 77466059 edges, 465208 markings/sec, 100 secs
lola: 53208146 markings, 80968912 edges, 460375 markings/sec, 105 secs
lola: 55512316 markings, 84475261 edges, 460834 markings/sec, 110 secs
lola: 57794831 markings, 87948651 edges, 456503 markings/sec, 115 secs
lola: 60057049 markings, 91391160 edges, 452444 markings/sec, 120 secs
lola: 62360546 markings, 94896482 edges, 460699 markings/sec, 125 secs
lola: 64631438 markings, 98352182 edges, 454178 markings/sec, 130 secs
lola: 66896764 markings, 101799421 edges, 453065 markings/sec, 135 secs
lola: 69154651 markings, 105235337 edges, 451577 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= p30)))))
lola: processed formula length: 26
lola: 34 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p8)))
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 ((3 <= p8)))
lola: processed formula length: 17
lola: 36 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: (p8 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 77 markings, 76 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pprime <= p10)))
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: (p10 + 1 <= pprime)
lola: processed formula length: 19
lola: 36 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 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p43 <= p33)))
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: (p33 + 1 <= p43)
lola: processed formula length: 16
lola: 36 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 11 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p30))))
lola: processed formula length: 22
lola: 34 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p30))))
lola: processed formula length: 22
lola: 34 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p41))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p41))))
lola: processed formula length: 22
lola: 34 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: add low 32
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 14 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((2 <= p48)) OR (G ((p37 <= p35)) AND F ((2 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((2 <= p48)) OR (G ((p37 <= p35)) AND F ((2 <= p48))))))
lola: processed formula length: 65
lola: 34 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: 2668982 markings, 3336225 edges, 533796 markings/sec, 0 secs
lola: 5231360 markings, 6539199 edges, 512476 markings/sec, 5 secs
lola: 7755528 markings, 9694409 edges, 504834 markings/sec, 10 secs
lola: 10274031 markings, 12842537 edges, 503701 markings/sec, 15 secs
lola: 12758410 markings, 15948011 edges, 496876 markings/sec, 20 secs
lola: 15204602 markings, 19005750 edges, 489238 markings/sec, 25 secs
lola: 17570890 markings, 21963611 edges, 473258 markings/sec, 30 secs
lola: 20070521 markings, 25088150 edges, 499926 markings/sec, 35 secs
lola: 22555195 markings, 28193992 edges, 496935 markings/sec, 40 secs
lola: 25011029 markings, 31263785 edges, 491167 markings/sec, 45 secs
lola: 27443302 markings, 34304125 edges, 486455 markings/sec, 50 secs
lola: 29819158 markings, 37273947 edges, 475171 markings/sec, 55 secs
lola: 32200016 markings, 40250019 edges, 476172 markings/sec, 60 secs
lola: 34600674 markings, 43250841 edges, 480132 markings/sec, 65 secs
lola: 37032661 markings, 46290825 edges, 486397 markings/sec, 70 secs
lola: 39423244 markings, 49279054 edges, 478117 markings/sec, 75 secs
lola: 41832034 markings, 52290041 edges, 481758 markings/sec, 80 secs
lola: 44242426 markings, 55303031 edges, 482078 markings/sec, 85 secs
lola: 46615073 markings, 58268840 edges, 474529 markings/sec, 90 secs
lola: 49000211 markings, 61250263 edges, 477028 markings/sec, 95 secs
lola: 51392288 markings, 64240358 edges, 478415 markings/sec, 100 secs
lola: 53784557 markings, 67230695 edges, 478454 markings/sec, 105 secs
lola: 56162041 markings, 70202550 edges, 475497 markings/sec, 110 secs
lola: 58532349 markings, 73165434 edges, 474062 markings/sec, 115 secs
lola: 60934216 markings, 76167769 edges, 480373 markings/sec, 120 secs
lola: 63308107 markings, 79135132 edges, 474778 markings/sec, 125 secs
lola: 65688806 markings, 82111006 edges, 476140 markings/sec, 130 secs
lola: 68077294 markings, 85096616 edges, 477698 markings/sec, 135 secs
lola: 70495916 markings, 88119894 edges, 483724 markings/sec, 140 secs
lola: 72895607 markings, 91119506 edges, 479938 markings/sec, 145 secs
lola: 75278441 markings, 94098050 edges, 476567 markings/sec, 150 secs
lola: 77674579 markings, 97093223 edges, 479228 markings/sec, 155 secs
lola: 80041075 markings, 100051343 edges, 473299 markings/sec, 160 secs
lola: 82415529 markings, 103019410 edges, 474891 markings/sec, 165 secs
lola: 84769572 markings, 105961964 edges, 470809 markings/sec, 170 secs
lola: 87126874 markings, 108908591 edges, 471460 markings/sec, 175 secs
lola: 89462146 markings, 111827681 edges, 467054 markings/sec, 180 secs
lola: 91788179 markings, 114735223 edges, 465207 markings/sec, 185 secs
lola: 94157453 markings, 117696815 edges, 473855 markings/sec, 190 secs
lola: 94937129 markings, 118671410 edges, 155935 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p41 <= pprime)))) AND A (G (((p44 <= p27) OR (p41 <= pprime)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p44 <= p27) OR (p41 <= pprime))))
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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G (((p44 <= p27) OR (p41 <= pprime))))
lola: processed formula length: 41
lola: 39 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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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: ((p27 + 1 <= p44) AND (pprime + 1 <= p41))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((p32 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p32 <= p47))))
lola: processed formula length: 24
lola: 34 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: 2586037 markings, 3935268 edges, 517207 markings/sec, 0 secs
lola: 5110402 markings, 7776694 edges, 504873 markings/sec, 5 secs
lola: 7615300 markings, 11588499 edges, 500980 markings/sec, 10 secs
lola: 10099528 markings, 15368845 edges, 496846 markings/sec, 15 secs
lola: 12558575 markings, 19110874 edges, 491809 markings/sec, 20 secs
lola: 15033594 markings, 22877202 edges, 495004 markings/sec, 25 secs
lola: 17488074 markings, 26612286 edges, 490896 markings/sec, 30 secs
lola: 19933766 markings, 30333985 edges, 489138 markings/sec, 35 secs
lola: 22359397 markings, 34025165 edges, 485126 markings/sec, 40 secs
lola: 24762884 markings, 37682648 edges, 480697 markings/sec, 45 secs
lola: 27148262 markings, 41312570 edges, 477076 markings/sec, 50 secs
lola: 29518638 markings, 44919666 edges, 474075 markings/sec, 55 secs
lola: 31883868 markings, 48518927 edges, 473046 markings/sec, 60 secs
lola: 34207840 markings, 52055404 edges, 464794 markings/sec, 65 secs
lola: 36547181 markings, 55615273 edges, 467868 markings/sec, 70 secs
lola: 38901969 markings, 59198647 edges, 470958 markings/sec, 75 secs
lola: 41241537 markings, 62758857 edges, 467914 markings/sec, 80 secs
lola: 43578174 markings, 66314610 edges, 467327 markings/sec, 85 secs
lola: 45893946 markings, 69838611 edges, 463154 markings/sec, 90 secs
lola: 48168951 markings, 73300575 edges, 455001 markings/sec, 95 secs
lola: 50502546 markings, 76851697 edges, 466719 markings/sec, 100 secs
lola: 52797649 markings, 80344247 edges, 459021 markings/sec, 105 secs
lola: 55093504 markings, 83837936 edges, 459171 markings/sec, 110 secs
lola: 57360212 markings, 87287276 edges, 453342 markings/sec, 115 secs
lola: 59621806 markings, 90728830 edges, 452319 markings/sec, 120 secs
lola: 61904312 markings, 94202210 edges, 456501 markings/sec, 125 secs
lola: 64165786 markings, 97643584 edges, 452295 markings/sec, 130 secs
lola: 66432116 markings, 101092347 edges, 453266 markings/sec, 135 secs
lola: 68729399 markings, 104588211 edges, 459457 markings/sec, 140 secs
lola: 70461553 markings, 107224257 edges, 346431 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p49 <= p8)) OR (G ((p21 <= p48)) AND F (G ((p49 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p49 <= p8)) OR (G ((p21 <= p48)) AND F (G ((p49 <= p8)))))))
lola: processed formula length: 71
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2506149 markings, 3813704 edges, 501230 markings/sec, 0 secs
lola: 4979368 markings, 7577295 edges, 494644 markings/sec, 5 secs
lola: 7443370 markings, 11326864 edges, 492800 markings/sec, 10 secs
lola: 9897033 markings, 15060698 edges, 490733 markings/sec, 15 secs
lola: 12319946 markings, 18747741 edges, 484583 markings/sec, 20 secs
lola: 14772249 markings, 22479505 edges, 490461 markings/sec, 25 secs
lola: 17199581 markings, 26173273 edges, 485466 markings/sec, 30 secs
lola: 19616725 markings, 29851537 edges, 483429 markings/sec, 35 secs
lola: 22019064 markings, 33507266 edges, 480468 markings/sec, 40 secs
lola: 24392817 markings, 37119501 edges, 474751 markings/sec, 45 secs
lola: 26753437 markings, 40711749 edges, 472124 markings/sec, 50 secs
lola: 29089759 markings, 44267023 edges, 467264 markings/sec, 55 secs
lola: 31418261 markings, 47810393 edges, 465700 markings/sec, 60 secs
lola: 33729852 markings, 51328032 edges, 462318 markings/sec, 65 secs
lola: 36028100 markings, 54825367 edges, 459650 markings/sec, 70 secs
lola: 38356138 markings, 58368034 edges, 465608 markings/sec, 75 secs
lola: 40659323 markings, 61872878 edges, 460637 markings/sec, 80 secs
lola: 42960501 markings, 65374672 edges, 460236 markings/sec, 85 secs
lola: 45248420 markings, 68856285 edges, 457584 markings/sec, 90 secs
lola: 47509072 markings, 72296411 edges, 452130 markings/sec, 95 secs
lola: 49639623 markings, 75538551 edges, 426110 markings/sec, 100 secs
lola: 51942190 markings, 79042462 edges, 460513 markings/sec, 105 secs
lola: 54218870 markings, 82506973 edges, 455336 markings/sec, 110 secs
lola: 56503220 markings, 85983157 edges, 456870 markings/sec, 115 secs
lola: 58758637 markings, 89415313 edges, 451083 markings/sec, 120 secs
lola: 61020459 markings, 92857215 edges, 452364 markings/sec, 125 secs
lola: 63288717 markings, 96308913 edges, 453652 markings/sec, 130 secs
lola: 65540848 markings, 99736072 edges, 450426 markings/sec, 135 secs
lola: 67797072 markings, 103169454 edges, 451245 markings/sec, 140 secs
lola: 70037409 markings, 106578661 edges, 448067 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((F ((2 <= p48)) OR (G ((p37 <= p35)) AND F ((2 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((2 <= p48)) OR (G ((p37 <= p35)) AND F ((2 <= p48))))))
lola: processed formula length: 65
lola: 34 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: 2645489 markings, 3306862 edges, 529098 markings/sec, 0 secs
lola: 5190848 markings, 6488560 edges, 509072 markings/sec, 5 secs
lola: 7708186 markings, 9635232 edges, 503468 markings/sec, 10 secs
lola: 10211339 markings, 12764175 edges, 500631 markings/sec, 15 secs
lola: 12679946 markings, 15849933 edges, 493721 markings/sec, 20 secs
lola: 15153305 markings, 18941632 edges, 494672 markings/sec, 25 secs
lola: 17616839 markings, 22021048 edges, 492707 markings/sec, 30 secs
lola: 20111179 markings, 25138974 edges, 498868 markings/sec, 35 secs
lola: 22599106 markings, 28248882 edges, 497585 markings/sec, 40 secs
lola: 25055887 markings, 31319859 edges, 491356 markings/sec, 45 secs
lola: 27543151 markings, 34428938 edges, 497453 markings/sec, 50 secs
lola: 29985158 markings, 37481447 edges, 488401 markings/sec, 55 secs
lola: 32404632 markings, 40505790 edges, 483895 markings/sec, 60 secs
lola: 34858893 markings, 43573616 edges, 490852 markings/sec, 65 secs
lola: 37329394 markings, 46661743 edges, 494100 markings/sec, 70 secs
lola: 39756332 markings, 49695415 edges, 485388 markings/sec, 75 secs
lola: 42212621 markings, 52765776 edges, 491258 markings/sec, 80 secs
lola: 44652293 markings, 55815365 edges, 487934 markings/sec, 85 secs
lola: 47068225 markings, 58835281 edges, 483186 markings/sec, 90 secs
lola: 49488903 markings, 61861129 edges, 484136 markings/sec, 95 secs
lola: 51927411 markings, 64909264 edges, 487702 markings/sec, 100 secs
lola: 54339346 markings, 67924183 edges, 482387 markings/sec, 105 secs
lola: 56737883 markings, 70922354 edges, 479707 markings/sec, 110 secs
lola: 59129627 markings, 73912034 edges, 478349 markings/sec, 115 secs
lola: 61529211 markings, 76911513 edges, 479917 markings/sec, 120 secs
lola: 63924167 markings, 79905208 edges, 478991 markings/sec, 125 secs
lola: 66310514 markings, 82888142 edges, 477269 markings/sec, 130 secs
lola: 68724869 markings, 85906086 edges, 482871 markings/sec, 135 secs
lola: 71162847 markings, 88953559 edges, 487596 markings/sec, 140 secs
lola: 73582366 markings, 91977958 edges, 483904 markings/sec, 145 secs
lola: 75991954 markings, 94989942 edges, 481918 markings/sec, 150 secs
lola: 78399549 markings, 97999436 edges, 481519 markings/sec, 155 secs
lola: 80789753 markings, 100987191 edges, 478041 markings/sec, 160 secs
lola: 83181504 markings, 103976880 edges, 478350 markings/sec, 165 secs
lola: 85577904 markings, 106972380 edges, 479280 markings/sec, 170 secs
lola: 87946571 markings, 109933214 edges, 473733 markings/sec, 175 secs
lola: 90288816 markings, 112861020 edges, 468449 markings/sec, 180 secs
lola: 92654675 markings, 115818344 edges, 473172 markings/sec, 185 secs
lola: 94719336 markings, 118399169 edges, 412932 markings/sec, 190 secs
lola: 95063172 markings, 118828988 edges, 68767 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown unknown no no unknown yes no no no yes no no yes no
lola:
preliminary result: yes no unknown unknown no no unknown yes no no no yes no no yes no
lola: memory consumption: 15604 KB
lola: time consumption: 1011 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1553058995088

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool lola"
echo " Input is RefineWMG-PT-010011, 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 r137-smll-155284909800339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
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 ;