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.r115-smll-155272315400078.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 Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-smll-155272315400078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.9K Feb 12 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 8 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 56K Mar 10 17:31 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 unfinite

--------------------
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 Planning-PT-none-LTLCardinality-00
FORMULA_NAME Planning-PT-none-LTLCardinality-01
FORMULA_NAME Planning-PT-none-LTLCardinality-02
FORMULA_NAME Planning-PT-none-LTLCardinality-03
FORMULA_NAME Planning-PT-none-LTLCardinality-04
FORMULA_NAME Planning-PT-none-LTLCardinality-05
FORMULA_NAME Planning-PT-none-LTLCardinality-06
FORMULA_NAME Planning-PT-none-LTLCardinality-07
FORMULA_NAME Planning-PT-none-LTLCardinality-08
FORMULA_NAME Planning-PT-none-LTLCardinality-09
FORMULA_NAME Planning-PT-none-LTLCardinality-10
FORMULA_NAME Planning-PT-none-LTLCardinality-11
FORMULA_NAME Planning-PT-none-LTLCardinality-12
FORMULA_NAME Planning-PT-none-LTLCardinality-13
FORMULA_NAME Planning-PT-none-LTLCardinality-14
FORMULA_NAME Planning-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552825222731

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Planning-PT-none @ 3570 seconds

FORMULA Planning-PT-none-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-LTLCardinality-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2824
rslt: Output for LTLCardinality @ Planning-PT-none

{
"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 Mar 17 12:20:22 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": 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": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": "(p126 <= p36)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "(p48 <= p100)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 532
},
"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 ((p44 <= p17)))",
"processed_size": 20,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 638
},
"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": "(p10 <= 0)",
"processed_size": 10,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1064
},
"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 <= p111))))",
"processed_size": 23,
"rewrites": 33
},
"result":
{
"edges": 12,
"markings": 12,
"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": 1596
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p43 <= p14))))",
"processed_size": 24,
"rewrites": 33
},
"result":
{
"edges": 17,
"markings": 15,
"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": 3193
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((p59 <= p3))))",
"processed_size": 23,
"rewrites": 33
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19680,
"runtime": 746.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : ** : TRUE : FALSE : A(G(F(**))) : A(X(F(**))) : A(F(**)) : A((** U X(F(**)))) : TRUE : A(G(**)) : A(F(**)) : A(F(G(**))) : A(X(G((F(**) AND (** OR **))))) : A(X(F(**))) : ** : A(G(F(**)))"
},
"net":
{
"arcs": 652,
"conflict_clusters": 65,
"places": 126,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "no yes yes no no yes yes unknown yes no yes no unknown unknown yes no ",
"value": "no yes yes no no yes yes unknown yes no yes no unknown unknown 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: 254/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4032
lola: finding significant places
lola: 126 places, 128 transitions, 82 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: (2 <= p47)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always true: (p27 <= p119)
lola: LP says that atomic proposition is always false: (3 <= p52)
lola: LP says that atomic proposition is always false: (3 <= p46)
lola: LP says that atomic proposition is always true: (p43 <= p119)
lola: A (F ((G ((2 <= p47)) U (2 <= p3)))) : A ((p126 <= p36)) : A (F ((X ((p111 <= p46)) U (p27 <= p119)))) : A (G (X (G (G ((3 <= p52)))))) : A (G (((p60 <= p102) U F ((3 <= p111))))) : A ((G (G ((3 <= p46))) U F (X ((1 <= p16))))) : A (F ((p31 <= p51))) : A (((p117 <= p57) U X (F ((1 <= p76))))) : A ((p43 <= p119)) : A (G ((p44 <= p17))) : A (((1 <= p17) U F ((1 <= p10)))) : A (F (G (X ((p43 <= p14))))) : A (X (G (((1 <= p103) U (p22 <= p108))))) : A (X (F (((1 <= p60) U (2 <= p123))))) : A ((p48 <= p100)) : A (G (F ((p59 <= p3))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p126 <= p36)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p126 <= p36)
lola: processed formula length: 13
lola: 33 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 33 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: 33 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 297 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: 33 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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p48 <= p100)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p48 <= p100)
lola: processed formula length: 13
lola: 33 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p16))))
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: processed formula length: 66
lola: 33 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: 2326154 markings, 2326153 edges, 465231 markings/sec, 0 secs
lola: 4662059 markings, 4662059 edges, 467181 markings/sec, 5 secs
lola: 6993982 markings, 6993982 edges, 466385 markings/sec, 10 secs
lola: 9304993 markings, 9304993 edges, 462202 markings/sec, 15 secs
lola: 11587569 markings, 11587569 edges, 456515 markings/sec, 20 secs
lola: 13871764 markings, 13871763 edges, 456839 markings/sec, 25 secs
lola: 16110963 markings, 16110962 edges, 447840 markings/sec, 30 secs
lola: 18345713 markings, 18345713 edges, 446950 markings/sec, 35 secs
lola: 20562135 markings, 20562135 edges, 443284 markings/sec, 40 secs
lola: 22777094 markings, 22777094 edges, 442992 markings/sec, 45 secs
lola: 24982552 markings, 24982551 edges, 441092 markings/sec, 50 secs
lola: 27192725 markings, 27192725 edges, 442035 markings/sec, 55 secs
lola: 29384208 markings, 29384208 edges, 438297 markings/sec, 60 secs
lola: 31582825 markings, 31582825 edges, 439723 markings/sec, 65 secs
lola: 33768581 markings, 33768581 edges, 437151 markings/sec, 70 secs
lola: 35982333 markings, 35982333 edges, 442750 markings/sec, 75 secs
lola: 38168178 markings, 38168178 edges, 437169 markings/sec, 80 secs
lola: 40343809 markings, 40343809 edges, 435126 markings/sec, 85 secs
lola: 42522056 markings, 42522055 edges, 435649 markings/sec, 90 secs
lola: 44705458 markings, 44705458 edges, 436680 markings/sec, 95 secs
lola: 46868771 markings, 46868771 edges, 432663 markings/sec, 100 secs
lola: 49023933 markings, 49023933 edges, 431032 markings/sec, 105 secs
lola: 51187745 markings, 51187744 edges, 432762 markings/sec, 110 secs
lola: 53366605 markings, 53366605 edges, 435772 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p123))))
lola: processed formula length: 23
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2270663 markings, 2270663 edges, 454133 markings/sec, 0 secs
lola: 4566517 markings, 4566517 edges, 459171 markings/sec, 5 secs
lola: 6847867 markings, 6847867 edges, 456270 markings/sec, 10 secs
lola: 9105009 markings, 9105009 edges, 451428 markings/sec, 15 secs
lola: 11343215 markings, 11343215 edges, 447641 markings/sec, 20 secs
lola: 13576318 markings, 13576317 edges, 446621 markings/sec, 25 secs
lola: 15804134 markings, 15804134 edges, 445563 markings/sec, 30 secs
lola: 18014831 markings, 18014830 edges, 442139 markings/sec, 35 secs
lola: 20212771 markings, 20212771 edges, 439588 markings/sec, 40 secs
lola: 22410019 markings, 22410019 edges, 439450 markings/sec, 45 secs
lola: 24605841 markings, 24605841 edges, 439164 markings/sec, 50 secs
lola: 26795197 markings, 26795197 edges, 437871 markings/sec, 55 secs
lola: 28974097 markings, 28974097 edges, 435780 markings/sec, 60 secs
lola: 31150340 markings, 31150340 edges, 435249 markings/sec, 65 secs
lola: 33313041 markings, 33313041 edges, 432540 markings/sec, 70 secs
lola: 35494545 markings, 35494545 edges, 436301 markings/sec, 75 secs
lola: 37655694 markings, 37655693 edges, 432230 markings/sec, 80 secs
lola: 39820698 markings, 39820698 edges, 433001 markings/sec, 85 secs
lola: 41968097 markings, 41968096 edges, 429480 markings/sec, 90 secs
lola: 44139650 markings, 44139650 edges, 434311 markings/sec, 95 secs
lola: 46280327 markings, 46280326 edges, 428135 markings/sec, 100 secs
lola: 48422853 markings, 48422853 edges, 428505 markings/sec, 105 secs
lola: 50558483 markings, 50558482 edges, 427126 markings/sec, 110 secs
lola: 52731380 markings, 52731380 edges, 434579 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: processed formula length: 40
lola: 33 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: 2225051 markings, 2225051 edges, 445010 markings/sec, 0 secs
lola: 4473716 markings, 4473716 edges, 449733 markings/sec, 5 secs
lola: 6709743 markings, 6709743 edges, 447205 markings/sec, 10 secs
lola: 8917726 markings, 8917726 edges, 441597 markings/sec, 15 secs
lola: 11114981 markings, 11114980 edges, 439451 markings/sec, 20 secs
lola: 13313469 markings, 13313468 edges, 439698 markings/sec, 25 secs
lola: 15500984 markings, 15500984 edges, 437503 markings/sec, 30 secs
lola: 17666268 markings, 17666268 edges, 433057 markings/sec, 35 secs
lola: 19829772 markings, 19829772 edges, 432701 markings/sec, 40 secs
lola: 21995528 markings, 21995528 edges, 433151 markings/sec, 45 secs
lola: 24154757 markings, 24154757 edges, 431846 markings/sec, 50 secs
lola: 26303757 markings, 26303757 edges, 429800 markings/sec, 55 secs
lola: 28444506 markings, 28444506 edges, 428150 markings/sec, 60 secs
lola: 30570647 markings, 30570647 edges, 425228 markings/sec, 65 secs
lola: 32676589 markings, 32676589 edges, 421188 markings/sec, 70 secs
lola: 34811354 markings, 34811354 edges, 426953 markings/sec, 75 secs
lola: 36945714 markings, 36945713 edges, 426872 markings/sec, 80 secs
lola: 39083189 markings, 39083189 edges, 427495 markings/sec, 85 secs
lola: 41201584 markings, 41201584 edges, 423679 markings/sec, 90 secs
lola: 43338823 markings, 43338823 edges, 427448 markings/sec, 95 secs
lola: 45459204 markings, 45459204 edges, 424076 markings/sec, 100 secs
lola: 47566483 markings, 47566483 edges, 421456 markings/sec, 105 secs
lola: 49660035 markings, 49660035 edges, 418710 markings/sec, 110 secs
lola: 51786518 markings, 51786517 edges, 425297 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p44 <= p17)))
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 ((p44 <= p17)))
lola: processed formula length: 20
lola: 35 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: (p17 + 1 <= p44)
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 638 seconds at most (--localtimelimit=0)
lola: state equation: write sara problem file to LTLCardinality-10-0.sara
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= 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 <= 0)
lola: processed formula length: 10
lola: 35 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 12 will run for 798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p31 <= p51)))
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: (p51 + 1 <= p31)
lola: processed formula length: 16
lola: 35 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 13 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p111))))
lola: processed formula length: 23
lola: 33 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 14 will run for 1596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p43 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p43 <= p14))))
lola: processed formula length: 24
lola: 33 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 126
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: 15 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p59 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p59 <= p3))))
lola: processed formula length: 23
lola: 33 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: 11 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: processed formula length: 66
lola: 33 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: 2307892 markings, 2307892 edges, 461578 markings/sec, 0 secs
lola: 4651335 markings, 4651335 edges, 468689 markings/sec, 5 secs
lola: 6963184 markings, 6963183 edges, 462370 markings/sec, 10 secs
lola: 9260664 markings, 9260664 edges, 459496 markings/sec, 15 secs
lola: 11531893 markings, 11531893 edges, 454246 markings/sec, 20 secs
lola: 13808475 markings, 13808474 edges, 455316 markings/sec, 25 secs
lola: 16067033 markings, 16067033 edges, 451712 markings/sec, 30 secs
lola: 18313466 markings, 18313466 edges, 449287 markings/sec, 35 secs
lola: 20544482 markings, 20544482 edges, 446203 markings/sec, 40 secs
lola: 22774553 markings, 22774553 edges, 446014 markings/sec, 45 secs
lola: 24980857 markings, 24980857 edges, 441261 markings/sec, 50 secs
lola: 27210934 markings, 27210934 edges, 446015 markings/sec, 55 secs
lola: 29420977 markings, 29420977 edges, 442009 markings/sec, 60 secs
lola: 31600115 markings, 31600115 edges, 435828 markings/sec, 65 secs
lola: 33765436 markings, 33765436 edges, 433064 markings/sec, 70 secs
lola: 35972756 markings, 35972756 edges, 441464 markings/sec, 75 secs
lola: 38160408 markings, 38160408 edges, 437530 markings/sec, 80 secs
lola: 40344689 markings, 40344689 edges, 436856 markings/sec, 85 secs
lola: 42523637 markings, 42523637 edges, 435790 markings/sec, 90 secs
lola: 44705991 markings, 44705991 edges, 436471 markings/sec, 95 secs
lola: 46881697 markings, 46881697 edges, 435141 markings/sec, 100 secs
lola: 49051000 markings, 49051000 edges, 433861 markings/sec, 105 secs
lola: 51240104 markings, 51240104 edges, 437821 markings/sec, 110 secs
lola: 53436334 markings, 53436334 edges, 439246 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p123))))
lola: processed formula length: 23
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2258779 markings, 2258779 edges, 451756 markings/sec, 0 secs
lola: 4548033 markings, 4548033 edges, 457851 markings/sec, 5 secs
lola: 6764443 markings, 6764443 edges, 443282 markings/sec, 10 secs
lola: 8872480 markings, 8872480 edges, 421607 markings/sec, 15 secs
lola: 11108353 markings, 11108353 edges, 447175 markings/sec, 20 secs
lola: 13333686 markings, 13333686 edges, 445067 markings/sec, 25 secs
lola: 15558094 markings, 15558094 edges, 444882 markings/sec, 30 secs
lola: 17758491 markings, 17758491 edges, 440079 markings/sec, 35 secs
lola: 19958224 markings, 19958223 edges, 439947 markings/sec, 40 secs
lola: 22149047 markings, 22149047 edges, 438165 markings/sec, 45 secs
lola: 24336017 markings, 24336017 edges, 437394 markings/sec, 50 secs
lola: 26517875 markings, 26517875 edges, 436372 markings/sec, 55 secs
lola: 28695213 markings, 28695212 edges, 435468 markings/sec, 60 secs
lola: 30866068 markings, 30866068 edges, 434171 markings/sec, 65 secs
lola: 33014326 markings, 33014326 edges, 429652 markings/sec, 70 secs
lola: 35178803 markings, 35178803 edges, 432895 markings/sec, 75 secs
lola: 37330945 markings, 37330944 edges, 430428 markings/sec, 80 secs
lola: 39478707 markings, 39478707 edges, 429552 markings/sec, 85 secs
lola: 41609344 markings, 41609344 edges, 426127 markings/sec, 90 secs
lola: 43770781 markings, 43770781 edges, 432287 markings/sec, 95 secs
lola: 45904027 markings, 45904026 edges, 426649 markings/sec, 100 secs
lola: 48027545 markings, 48027544 edges, 424704 markings/sec, 105 secs
lola: 50135238 markings, 50135238 edges, 421539 markings/sec, 110 secs
lola: 52290825 markings, 52290825 edges, 431117 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: processed formula length: 40
lola: 33 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: 2131115 markings, 2131115 edges, 426223 markings/sec, 0 secs
lola: 4365505 markings, 4365505 edges, 446878 markings/sec, 5 secs
lola: 6574346 markings, 6574346 edges, 441768 markings/sec, 10 secs
lola: 8775465 markings, 8775465 edges, 440224 markings/sec, 15 secs
lola: 10960179 markings, 10960179 edges, 436943 markings/sec, 20 secs
lola: 13140900 markings, 13140900 edges, 436144 markings/sec, 25 secs
lola: 15328913 markings, 15328913 edges, 437603 markings/sec, 30 secs
lola: 17499653 markings, 17499653 edges, 434148 markings/sec, 35 secs
lola: 19659911 markings, 19659911 edges, 432052 markings/sec, 40 secs
lola: 21804358 markings, 21804358 edges, 428889 markings/sec, 45 secs
lola: 23945418 markings, 23945418 edges, 428212 markings/sec, 50 secs
lola: 26081158 markings, 26081158 edges, 427148 markings/sec, 55 secs
lola: 28212461 markings, 28212460 edges, 426261 markings/sec, 60 secs
lola: 30335425 markings, 30335424 edges, 424593 markings/sec, 65 secs
lola: 32430010 markings, 32430010 edges, 418917 markings/sec, 70 secs
lola: 34424183 markings, 34424183 edges, 398835 markings/sec, 75 secs
lola: 36566038 markings, 36566038 edges, 428371 markings/sec, 80 secs
lola: 38692629 markings, 38692629 edges, 425318 markings/sec, 85 secs
lola: 40807291 markings, 40807291 edges, 422932 markings/sec, 90 secs
lola: 42934471 markings, 42934470 edges, 425436 markings/sec, 95 secs
lola: 45057087 markings, 45057087 edges, 424523 markings/sec, 100 secs
lola: 47164235 markings, 47164234 edges, 421430 markings/sec, 105 secs
lola: 49238630 markings, 49238629 edges, 414879 markings/sec, 110 secs
lola: 51336867 markings, 51336867 edges, 419647 markings/sec, 115 secs
lola: 53447417 markings, 53447417 edges, 422110 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown yes no yes no unknown unknown yes no
lola:
preliminary result: no yes yes no no yes yes unknown yes no yes no unknown unknown yes no
lola: memory consumption: 19680 KB
lola: time consumption: 746 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552825968954

--------------------
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="Planning-PT-none"
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 Planning-PT-none, 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 r115-smll-155272315400078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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