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

About the Execution of LoLA for NeighborGrid-PT-d5n4m1t35

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7216.590 2619505.00 2682561.00 187.50 FFFFTFFFFFTFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r104-oct2-155272225400114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 3.6K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 59M 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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552776365728

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3570 seconds

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 950
rslt: Output for LTLCardinality @ NeighborGrid-PT-d5n4m1t35

{
"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": "Sat Mar 16 22:46:05 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 204
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (G ((p_1_3_1_2_3 <= p_3_3_3_2_1)))))",
"processed_size": 44,
"rewrites": 26
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((G ((2 <= p_3_1_3_0_1)) OR (G ((p_2_2_3_1_1 <= p_2_0_0_0_1)) AND F (G ((2 <= p_3_1_3_0_1)))))))",
"processed_size": 101,
"rewrites": 26
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((F ((3 <= p_1_1_0_3_2)) OR (G ((2 <= p_0_2_1_2_0)) AND F ((3 <= p_1_1_0_3_2))))))",
"processed_size": 87,
"rewrites": 26
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((X (G ((1 <= p_3_0_0_0_3))) U ((p_1_1_3_3_1 <= p_1_3_2_0_0) U (p_2_3_1_1_1 <= p_2_1_1_3_2))))",
"processed_size": 96,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"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 (X (G ((2 <= p_0_3_1_1_2))))))",
"processed_size": 38,
"rewrites": 26
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((X ((3 <= p_1_3_1_2_0)) U ((p_2_2_0_1_1 <= p_3_1_3_1_3) U (p_1_1_0_1_3 <= p_2_0_3_2_2))))",
"processed_size": 92,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 407
},
"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 <= p_3_3_2_1_0)))",
"processed_size": 26,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"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": 465
},
"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 ((p_2_1_3_3_1 <= p_3_2_3_1_3)))",
"processed_size": 36,
"rewrites": 28
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 543
},
"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": "(p_2_2_1_2_3 <= 2)",
"processed_size": 18,
"rewrites": 28
},
"result":
{
"edges": 3939,
"markings": 3939,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 384
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 646
},
"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 <= p_0_3_0_2_0))))",
"processed_size": 30,
"rewrites": 26
},
"result":
{
"edges": 5437,
"markings": 5437,
"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": 782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p_1_2_3_0_0 <= p_1_3_1_2_0) U G ((1 <= p_3_0_0_1_1))))",
"processed_size": 59,
"rewrites": 26
},
"result":
{
"edges": 29699,
"markings": 29641,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1125
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F ((3 <= p_1_2_0_0_1)) OR (G ((p_3_2_1_0_3 <= p_1_1_1_0_0)) AND F ((3 <= p_1_2_0_0_1)))))",
"processed_size": 93,
"rewrites": 26
},
"result":
{
"edges": 4042,
"markings": 4042,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"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 ((p_3_1_2_3_1 <= p_2_0_3_2_2))))",
"processed_size": 40,
"rewrites": 26
},
"result":
{
"edges": 65498,
"markings": 60947,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"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": 2970784,
"runtime": 2595.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A(G(F(**))) : A(F(G(**))) : A(G(**)) : A((** U (** U **))) : A(X(X(G(**)))) : A(X((G(**) OR (G(**) AND F(G(**)))))) : A(X((F(**) OR (G(**) AND F(**))))) : A(G(**)) : A((** U G(**))) : A((X(G(**)) U (** U **))) : A((F(**) OR (G(**) AND F(**)))) : A(X((X(**) U **))) : A((X(G(**)) U **)) : A(X(X(X(G(**))))) : A((X(**) U (** U **)))"
},
"net":
{
"arcs": 393216,
"conflict_clusters": 1024,
"places": 1024,
"places_significant": 1023,
"singleton_clusters": 0,
"transitions": 196608
},
"result":
{
"preliminary_value": "no no no no yes no no no no no yes no no yes no yes ",
"value": "no no no no yes no no no no no yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 197632/268435456 symbol table entries, 5872 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 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 ((3 <= p_2_2_1_2_3))) : A (G ((F ((1 <= p_0_3_1_1_0)) U F ((2 <= p_0_3_0_2_0))))) : A (F (G (X ((p_3_1_2_3_1 <= p_2_0_3_2_2))))) : A (G (G ((3 <= p_3_3_2_1_0)))) : A (((1 <= p_3_2_3_0_3) U ((p_1_2_1_3_0 <= p_0_3_3_1_3) U (p_2_0_1_2_3 <= p_2_1_3_2_1)))) : A (X (G (G (X ((p_1_3_1_2_3 <= p_3_3_3_2_1)))))) : A ((G (X ((p_2_2_3_1_1 <= p_2_0_0_0_1))) U X (G ((2 <= p_3_1_3_0_1))))) : A ((G (X ((2 <= p_0_2_1_2_0))) U F (X ((3 <= p_1_1_0_3_2))))) : A (G (G (G ((p_2_1_3_3_1 <= p_3_2_3_1_3))))) : A (((p_1_2_3_0_0 <= p_1_3_1_2_0) U G ((1 <= p_3_0_0_1_1)))) : A ((G (X ((1 <= p_3_0_0_0_3))) U ((p_1_1_3_3_1 <= p_1_3_2_0_0) U (p_2_3_1_1_1 <= p_2_1_1_3_2)))) : A ((G (G ((p_3_2_1_0_3 <= p_1_1_1_0_0))) U F (F ((3 <= p_1_2_0_0_1))))) : A (X ((X ((1 <= p_3_2_3_2_0)) U (2 <= p_0_1_3_2_2)))) : A ((X (G ((p_3_2_3_0_1 <= p_2_0_1_0_1))) U (1 <= p_1_3_1_2_0))) : A (G (X (X (X ((2 <= p_0_3_1_1_2)))))) : A ((X ((3 <= p_1_3_1_2_0)) U ((p_2_2_0_1_1 <= p_3_1_3_1_3) U (p_1_1_0_1_3 <= p_2_0_3_2_2))))
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:350
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p_1_3_1_2_3 <= p_3_3_3_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p_1_3_1_2_3 <= p_3_3_3_2_1)))))
lola: processed formula length: 44
lola: 26 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 1 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((2 <= p_3_1_3_0_1)) OR (G ((p_2_2_3_1_1 <= p_2_0_0_0_1)) AND F (G ((2 <= p_3_1_3_0_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((2 <= p_3_1_3_0_1)) OR (G ((p_2_2_3_1_1 <= p_2_0_0_0_1)) AND F (G ((2 <= p_3_1_3_0_1)))))))
lola: processed formula length: 101
lola: 26 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: 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p_1_1_0_3_2)) OR (G ((2 <= p_0_2_1_2_0)) AND F ((3 <= p_1_1_0_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= p_1_1_0_3_2)) OR (G ((2 <= p_0_2_1_2_0)) AND F ((3 <= p_1_1_0_3_2))))))
lola: processed formula length: 87
lola: 26 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p_3_0_0_0_3))) U ((p_1_1_3_3_1 <= p_1_3_2_0_0) U (p_2_3_1_1_1 <= p_2_1_1_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= p_3_0_0_0_3))) U ((p_1_1_3_3_1 <= p_1_3_2_0_0) U (p_2_3_1_1_1 <= p_2_1_1_3_2))))
lola: processed formula length: 96
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= p_3_2_3_2_0)) U (2 <= p_0_1_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((1 <= p_3_2_3_2_0)) U (2 <= p_0_1_3_2_2))))
lola: processed formula length: 53
lola: 26 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: 2568 markings, 2568 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p_3_2_3_0_1 <= p_2_0_1_0_1))) U (1 <= p_1_3_1_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p_3_2_3_0_1 <= p_2_0_1_0_1))) U (1 <= p_1_3_1_2_0)))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((2 <= p_0_3_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((2 <= p_0_3_1_1_2))))))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= p_1_3_1_2_0)) U ((p_2_2_0_1_1 <= p_3_1_3_1_3) U (p_1_1_0_1_3 <= p_2_0_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= p_1_3_1_2_0)) U ((p_2_2_0_1_1 <= p_3_1_3_1_3) U (p_1_1_0_1_3 <= p_2_0_3_2_2))))
lola: processed formula length: 92
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p_3_3_2_1_0)))
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 <= p_3_3_2_1_0)))
lola: processed formula length: 26
lola: 28 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: (p_3_3_2_1_0 <= 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_2_1_3_3_1 <= p_3_2_3_1_3)))
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 ((p_2_1_3_3_1 <= p_3_2_3_1_3)))
lola: processed formula length: 36
lola: 28 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: (p_3_2_3_1_3 + 1 <= p_2_1_3_3_1)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p_2_2_1_2_3)))
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: (p_2_2_1_2_3 <= 2)
lola: processed formula length: 18
lola: 28 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: 1505 markings, 1504 edges, 301 markings/sec, 0 secs
lola: 2337 markings, 2336 edges, 166 markings/sec, 5 secs
lola: 2902 markings, 2901 edges, 113 markings/sec, 10 secs
lola: 3505 markings, 3504 edges, 121 markings/sec, 15 secs
lola: 3781 markings, 3780 edges, 55 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3939 markings, 3939 edges
lola: ========================================
lola: subprocess 11 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p_0_3_0_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p_0_3_0_2_0))))
lola: processed formula length: 30
lola: 26 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: 1413 markings, 1412 edges, 283 markings/sec, 0 secs
lola: 2134 markings, 2133 edges, 144 markings/sec, 5 secs
lola: 2726 markings, 2725 edges, 118 markings/sec, 10 secs
lola: 3344 markings, 3343 edges, 124 markings/sec, 15 secs
lola: 3813 markings, 3812 edges, 94 markings/sec, 20 secs
lola: 4247 markings, 4246 edges, 87 markings/sec, 25 secs
lola: 4481 markings, 4480 edges, 47 markings/sec, 30 secs
lola: 4603 markings, 4602 edges, 24 markings/sec, 35 secs
lola: 4700 markings, 4699 edges, 19 markings/sec, 40 secs
lola: 4770 markings, 4769 edges, 14 markings/sec, 45 secs
lola: 4930 markings, 4929 edges, 32 markings/sec, 50 secs
lola: 5170 markings, 5169 edges, 48 markings/sec, 55 secs
lola: 5373 markings, 5372 edges, 41 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5437 markings, 5437 edges
lola: ========================================
lola: subprocess 12 will run for 790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p_3_1_2_3_1 <= p_2_0_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p_3_1_2_3_1 <= p_2_0_3_2_2))))
lola: processed formula length: 40
lola: 26 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: 718 markings, 717 edges, 144 markings/sec, 0 secs
lola: 1063 markings, 1062 edges, 69 markings/sec, 5 secs
lola: 1300 markings, 1299 edges, 47 markings/sec, 10 secs
lola: 1502 markings, 1501 edges, 40 markings/sec, 15 secs
lola: 1621 markings, 1620 edges, 24 markings/sec, 20 secs
lola: 1646 markings, 1645 edges, 5 markings/sec, 25 secs
lola: 1670 markings, 1669 edges, 5 markings/sec, 30 secs
lola: 1702 markings, 1701 edges, 6 markings/sec, 35 secs
lola: 1725 markings, 1724 edges, 5 markings/sec, 40 secs
lola: 1753 markings, 1752 edges, 6 markings/sec, 45 secs
lola: 1766 markings, 1765 edges, 3 markings/sec, 50 secs
lola: 1790 markings, 1789 edges, 5 markings/sec, 55 secs
lola: 1837 markings, 1836 edges, 9 markings/sec, 60 secs
lola: 1923 markings, 1922 edges, 17 markings/sec, 65 secs
lola: 1942 markings, 1941 edges, 4 markings/sec, 70 secs
lola: 1974 markings, 1973 edges, 6 markings/sec, 75 secs
lola: 2029 markings, 2028 edges, 11 markings/sec, 80 secs
lola: 2044 markings, 2043 edges, 3 markings/sec, 85 secs
lola: 2071 markings, 2070 edges, 5 markings/sec, 90 secs
lola: 2127 markings, 2126 edges, 11 markings/sec, 95 secs
lola: 2177 markings, 2176 edges, 10 markings/sec, 100 secs
lola: 2207 markings, 2206 edges, 6 markings/sec, 105 secs
lola: 2264 markings, 2263 edges, 11 markings/sec, 110 secs
lola: 2292 markings, 2291 edges, 6 markings/sec, 115 secs
lola: 2319 markings, 2318 edges, 5 markings/sec, 120 secs
lola: 2355 markings, 2354 edges, 7 markings/sec, 125 secs
lola: 2393 markings, 2392 edges, 8 markings/sec, 130 secs
lola: 2411 markings, 2410 edges, 4 markings/sec, 135 secs
lola: 2454 markings, 2461 edges, 9 markings/sec, 140 secs
lola: 2499 markings, 2515 edges, 9 markings/sec, 145 secs
lola: 2543 markings, 2568 edges, 9 markings/sec, 150 secs
lola: 2588 markings, 2622 edges, 9 markings/sec, 155 secs
lola: 2621 markings, 2659 edges, 7 markings/sec, 160 secs
lola: 2655 markings, 2693 edges, 7 markings/sec, 165 secs
lola: 2706 markings, 2744 edges, 10 markings/sec, 170 secs
lola: 2785 markings, 2823 edges, 16 markings/sec, 175 secs
lola: 2839 markings, 2885 edges, 11 markings/sec, 180 secs
lola: 2898 markings, 2954 edges, 12 markings/sec, 185 secs
lola: 2952 markings, 3018 edges, 11 markings/sec, 190 secs
lola: 3007 markings, 3081 edges, 11 markings/sec, 195 secs
lola: 3061 markings, 3145 edges, 11 markings/sec, 200 secs
lola: 3119 markings, 3207 edges, 12 markings/sec, 205 secs
lola: 3147 markings, 3235 edges, 6 markings/sec, 210 secs
lola: 3216 markings, 3313 edges, 14 markings/sec, 215 secs
lola: 3308 markings, 3420 edges, 18 markings/sec, 220 secs
lola: 3399 markings, 3526 edges, 18 markings/sec, 225 secs
lola: 3454 markings, 3588 edges, 11 markings/sec, 230 secs
lola: 3478 markings, 3612 edges, 5 markings/sec, 235 secs
lola: 3498 markings, 3632 edges, 4 markings/sec, 240 secs
lola: 3553 markings, 3696 edges, 11 markings/sec, 245 secs
lola: 3629 markings, 3787 edges, 15 markings/sec, 250 secs
lola: 3716 markings, 3888 edges, 17 markings/sec, 255 secs
lola: 3738 markings, 3910 edges, 4 markings/sec, 260 secs
lola: 3777 markings, 3951 edges, 8 markings/sec, 265 secs
lola: 3838 markings, 4020 edges, 12 markings/sec, 270 secs
lola: 3878 markings, 4060 edges, 8 markings/sec, 275 secs
lola: 3934 markings, 4116 edges, 11 markings/sec, 280 secs
lola: 3960 markings, 4142 edges, 5 markings/sec, 285 secs
lola: 3996 markings, 4179 edges, 7 markings/sec, 290 secs
lola: 4049 markings, 4232 edges, 11 markings/sec, 295 secs
lola: 4114 markings, 4297 edges, 13 markings/sec, 300 secs
lola: 4189 markings, 4372 edges, 15 markings/sec, 305 secs
lola: 4261 markings, 4444 edges, 14 markings/sec, 310 secs
lola: 4337 markings, 4520 edges, 15 markings/sec, 315 secs
lola: 4386 markings, 4571 edges, 10 markings/sec, 320 secs
lola: 4457 markings, 4642 edges, 14 markings/sec, 325 secs
lola: 4548 markings, 4735 edges, 18 markings/sec, 330 secs
lola: 4598 markings, 4785 edges, 10 markings/sec, 335 secs
lola: 4666 markings, 4853 edges, 14 markings/sec, 340 secs
lola: 4746 markings, 4933 edges, 16 markings/sec, 345 secs
lola: 4826 markings, 5013 edges, 16 markings/sec, 350 secs
lola: 4906 markings, 5093 edges, 16 markings/sec, 355 secs
lola: 4986 markings, 5173 edges, 16 markings/sec, 360 secs
lola: 5068 markings, 5261 edges, 16 markings/sec, 365 secs
lola: 5161 markings, 5360 edges, 19 markings/sec, 370 secs
lola: 5227 markings, 5434 edges, 13 markings/sec, 375 secs
lola: 5281 markings, 5490 edges, 11 markings/sec, 380 secs
lola: 5322 markings, 5531 edges, 8 markings/sec, 385 secs
lola: 5363 markings, 5572 edges, 8 markings/sec, 390 secs
lola: 5452 markings, 5661 edges, 18 markings/sec, 395 secs
lola: 5543 markings, 5752 edges, 18 markings/sec, 400 secs
lola: 5591 markings, 5800 edges, 10 markings/sec, 405 secs
lola: 5668 markings, 5880 edges, 15 markings/sec, 410 secs
lola: 5721 markings, 5934 edges, 11 markings/sec, 415 secs
lola: 5787 markings, 6004 edges, 13 markings/sec, 420 secs
lola: 5823 markings, 6040 edges, 7 markings/sec, 425 secs
lola: 5919 markings, 6144 edges, 19 markings/sec, 430 secs
lola: 6023 markings, 6258 edges, 21 markings/sec, 435 secs
lola: 6123 markings, 6367 edges, 20 markings/sec, 440 secs
lola: 6227 markings, 6480 edges, 21 markings/sec, 445 secs
lola: 6307 markings, 6567 edges, 16 markings/sec, 450 secs
lola: 6382 markings, 6642 edges, 15 markings/sec, 455 secs
lola: 6415 markings, 6675 edges, 7 markings/sec, 460 secs
lola: 6493 markings, 6758 edges, 16 markings/sec, 465 secs
lola: 6606 markings, 6876 edges, 23 markings/sec, 470 secs
lola: 6714 markings, 6990 edges, 22 markings/sec, 475 secs
lola: 6822 markings, 7104 edges, 22 markings/sec, 480 secs
lola: 6912 markings, 7200 edges, 18 markings/sec, 485 secs
lola: 7020 markings, 7315 edges, 22 markings/sec, 490 secs
lola: 7137 markings, 7440 edges, 23 markings/sec, 495 secs
lola: 7245 markings, 7555 edges, 22 markings/sec, 500 secs
lola: 7357 markings, 7674 edges, 22 markings/sec, 505 secs
lola: 7470 markings, 7795 edges, 23 markings/sec, 510 secs
lola: 7576 markings, 7907 edges, 21 markings/sec, 515 secs
lola: 7696 markings, 8036 edges, 24 markings/sec, 520 secs
lola: 7819 markings, 8168 edges, 25 markings/sec, 525 secs
lola: 7943 markings, 8302 edges, 25 markings/sec, 530 secs
lola: 8066 markings, 8434 edges, 25 markings/sec, 535 secs
lola: 8190 markings, 8568 edges, 25 markings/sec, 540 secs
lola: 8313 markings, 8700 edges, 25 markings/sec, 545 secs
lola: 8437 markings, 8834 edges, 25 markings/sec, 550 secs
lola: 8559 markings, 8965 edges, 24 markings/sec, 555 secs
lola: 8649 markings, 9061 edges, 18 markings/sec, 560 secs
lola: 8742 markings, 9154 edges, 19 markings/sec, 565 secs
lola: 8879 markings, 9291 edges, 27 markings/sec, 570 secs
lola: 9016 markings, 9428 edges, 27 markings/sec, 575 secs
lola: 9132 markings, 9544 edges, 23 markings/sec, 580 secs
lola: 9221 markings, 9638 edges, 18 markings/sec, 585 secs
lola: 9324 markings, 9743 edges, 21 markings/sec, 590 secs
lola: 9413 markings, 9835 edges, 18 markings/sec, 595 secs
lola: 9540 markings, 9966 edges, 25 markings/sec, 600 secs
lola: 9674 markings, 10119 edges, 27 markings/sec, 605 secs
lola: 9813 markings, 10279 edges, 28 markings/sec, 610 secs
lola: 9947 markings, 10434 edges, 27 markings/sec, 615 secs
lola: 10085 markings, 10595 edges, 28 markings/sec, 620 secs
lola: 10222 markings, 10754 edges, 27 markings/sec, 625 secs
lola: 10356 markings, 10909 edges, 27 markings/sec, 630 secs
lola: 10491 markings, 11065 edges, 27 markings/sec, 635 secs
lola: 10630 markings, 11225 edges, 28 markings/sec, 640 secs
lola: 10769 markings, 11387 edges, 28 markings/sec, 645 secs
lola: 10908 markings, 11548 edges, 28 markings/sec, 650 secs
lola: 11048 markings, 11709 edges, 28 markings/sec, 655 secs
lola: 11182 markings, 11864 edges, 27 markings/sec, 660 secs
lola: 11324 markings, 12030 edges, 28 markings/sec, 665 secs
lola: 11460 markings, 12187 edges, 27 markings/sec, 670 secs
lola: 11599 markings, 12347 edges, 28 markings/sec, 675 secs
lola: 11692 markings, 12448 edges, 19 markings/sec, 680 secs
lola: 11747 markings, 12503 edges, 11 markings/sec, 685 secs
lola: 11838 markings, 12602 edges, 18 markings/sec, 690 secs
lola: 11922 markings, 12690 edges, 17 markings/sec, 695 secs
lola: 11978 markings, 12746 edges, 11 markings/sec, 700 secs
lola: 12067 markings, 12838 edges, 18 markings/sec, 705 secs
lola: 12142 markings, 12913 edges, 15 markings/sec, 710 secs
lola: 12208 markings, 12979 edges, 13 markings/sec, 715 secs
lola: 12352 markings, 13131 edges, 29 markings/sec, 720 secs
lola: 12492 markings, 13271 edges, 28 markings/sec, 725 secs
lola: 12632 markings, 13411 edges, 28 markings/sec, 730 secs
lola: 12773 markings, 13552 edges, 28 markings/sec, 735 secs
lola: 12913 markings, 13692 edges, 28 markings/sec, 740 secs
lola: 13053 markings, 13832 edges, 28 markings/sec, 745 secs
lola: 13193 markings, 13972 edges, 28 markings/sec, 750 secs
lola: 13333 markings, 14112 edges, 28 markings/sec, 755 secs
lola: 13475 markings, 14256 edges, 28 markings/sec, 760 secs
lola: 13723 markings, 14514 edges, 50 markings/sec, 765 secs
lola: 13932 markings, 14731 edges, 42 markings/sec, 770 secs
lola: 14069 markings, 14868 edges, 27 markings/sec, 775 secs
lola: 14228 markings, 15035 edges, 32 markings/sec, 780 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown no unknown no no no no unknown yes unknown no yes no yes
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no no unknown no unknown no no no no unknown yes unknown no yes no yes
lola: memory consumption: 3496552 KB
lola: time consumption: 1199 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: memory consumption: 3497108 KB
lola: time consumption: 1199 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p_1_2_3_0_0 <= p_1_3_1_2_0) U G ((1 <= p_3_0_0_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p_1_2_3_0_0 <= p_1_3_1_2_0) U G ((1 <= p_3_0_0_1_1))))
lola: processed formula length: 59
lola: 26 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: 667 markings, 666 edges, 133 markings/sec, 0 secs
lola: 907 markings, 906 edges, 48 markings/sec, 5 secs
lola: 1056 markings, 1062 edges, 30 markings/sec, 10 secs
lola: 1081 markings, 1087 edges, 5 markings/sec, 15 secs
lola: 2044 markings, 2050 edges, 193 markings/sec, 20 secs
lola: 2731 markings, 2737 edges, 137 markings/sec, 25 secs
lola: 3267 markings, 3280 edges, 107 markings/sec, 30 secs
lola: 3588 markings, 3610 edges, 64 markings/sec, 35 secs
lola: 3861 markings, 3904 edges, 55 markings/sec, 40 secs
lola: 4006 markings, 4052 edges, 29 markings/sec, 45 secs
lola: 4115 markings, 4172 edges, 22 markings/sec, 50 secs
lola: 4206 markings, 4263 edges, 18 markings/sec, 55 secs
lola: 4287 markings, 4344 edges, 16 markings/sec, 60 secs
lola: 4394 markings, 4451 edges, 21 markings/sec, 65 secs
lola: 4488 markings, 4545 edges, 19 markings/sec, 70 secs
lola: 4583 markings, 4640 edges, 19 markings/sec, 75 secs
lola: 4677 markings, 4734 edges, 19 markings/sec, 80 secs
lola: 4782 markings, 4839 edges, 21 markings/sec, 85 secs
lola: 18572 markings, 18629 edges, 2758 markings/sec, 90 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29641 markings, 29699 edges
lola: ========================================
lola: subprocess 14 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p_1_2_0_0_1)) OR (G ((p_3_2_1_0_3 <= p_1_1_1_0_0)) AND F ((3 <= p_1_2_0_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p_1_2_0_0_1)) OR (G ((p_3_2_1_0_3 <= p_1_1_1_0_0)) AND F ((3 <= p_1_2_0_0_1)))))
lola: processed formula length: 93
lola: 26 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: 1584 markings, 1583 edges, 317 markings/sec, 0 secs
lola: 2315 markings, 2314 edges, 146 markings/sec, 5 secs
lola: 2948 markings, 2947 edges, 127 markings/sec, 10 secs
lola: 3393 markings, 3392 edges, 89 markings/sec, 15 secs
lola: 3775 markings, 3774 edges, 76 markings/sec, 20 secs
lola: 4007 markings, 4006 edges, 46 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4042 markings, 4042 edges
lola: ========================================
lola: subprocess 15 will run for 2219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p_3_2_3_0_3) U ((p_1_2_1_3_0 <= p_0_3_3_1_3) U (p_2_0_1_2_3 <= p_2_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p_3_2_3_0_3) U ((p_1_2_1_3_0 <= p_0_3_3_1_3) U (p_2_0_1_2_3 <= p_2_1_3_2_1))))
lola: processed formula length: 88
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((p_3_1_2_3_1 <= p_2_0_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p_3_1_2_3_1 <= p_2_0_3_2_2))))
lola: processed formula length: 40
lola: 26 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: 744 markings, 743 edges, 149 markings/sec, 0 secs
lola: 1102 markings, 1101 edges, 72 markings/sec, 5 secs
lola: 1345 markings, 1344 edges, 49 markings/sec, 10 secs
lola: 1548 markings, 1547 edges, 41 markings/sec, 15 secs
lola: 1631 markings, 1630 edges, 17 markings/sec, 20 secs
lola: 1656 markings, 1655 edges, 5 markings/sec, 25 secs
lola: 1678 markings, 1677 edges, 4 markings/sec, 30 secs
lola: 1711 markings, 1710 edges, 7 markings/sec, 35 secs
lola: 1746 markings, 1745 edges, 7 markings/sec, 40 secs
lola: 1761 markings, 1760 edges, 3 markings/sec, 45 secs
lola: 1779 markings, 1778 edges, 4 markings/sec, 50 secs
lola: 1820 markings, 1819 edges, 8 markings/sec, 55 secs
lola: 1911 markings, 1910 edges, 18 markings/sec, 60 secs
lola: 1937 markings, 1936 edges, 5 markings/sec, 65 secs
lola: 1967 markings, 1966 edges, 6 markings/sec, 70 secs
lola: 2029 markings, 2028 edges, 12 markings/sec, 75 secs
lola: 2045 markings, 2044 edges, 3 markings/sec, 80 secs
lola: 2079 markings, 2078 edges, 7 markings/sec, 85 secs
lola: 2137 markings, 2136 edges, 12 markings/sec, 90 secs
lola: 2181 markings, 2180 edges, 9 markings/sec, 95 secs
lola: 2228 markings, 2227 edges, 9 markings/sec, 100 secs
lola: 2276 markings, 2275 edges, 10 markings/sec, 105 secs
lola: 2306 markings, 2305 edges, 6 markings/sec, 110 secs
lola: 2331 markings, 2330 edges, 5 markings/sec, 115 secs
lola: 2381 markings, 2380 edges, 10 markings/sec, 120 secs
lola: 2403 markings, 2402 edges, 4 markings/sec, 125 secs
lola: 2438 markings, 2442 edges, 7 markings/sec, 130 secs
lola: 2479 markings, 2491 edges, 8 markings/sec, 135 secs
lola: 2524 markings, 2545 edges, 9 markings/sec, 140 secs
lola: 2568 markings, 2598 edges, 9 markings/sec, 145 secs
lola: 2612 markings, 2650 edges, 9 markings/sec, 150 secs
lola: 2631 markings, 2669 edges, 4 markings/sec, 155 secs
lola: 2689 markings, 2727 edges, 12 markings/sec, 160 secs
lola: 2754 markings, 2792 edges, 13 markings/sec, 165 secs
lola: 2820 markings, 2864 edges, 13 markings/sec, 170 secs
lola: 2875 markings, 2927 edges, 11 markings/sec, 175 secs
lola: 2934 markings, 2996 edges, 12 markings/sec, 180 secs
lola: 2988 markings, 3060 edges, 11 markings/sec, 185 secs
lola: 3043 markings, 3123 edges, 11 markings/sec, 190 secs
lola: 3111 markings, 3199 edges, 14 markings/sec, 195 secs
lola: 3140 markings, 3228 edges, 6 markings/sec, 200 secs
lola: 3194 markings, 3287 edges, 11 markings/sec, 205 secs
lola: 3290 markings, 3399 edges, 19 markings/sec, 210 secs
lola: 3386 markings, 3511 edges, 19 markings/sec, 215 secs
lola: 3450 markings, 3584 edges, 13 markings/sec, 220 secs
lola: 3476 markings, 3610 edges, 5 markings/sec, 225 secs
lola: 3497 markings, 3631 edges, 4 markings/sec, 230 secs
lola: 3553 markings, 3696 edges, 11 markings/sec, 235 secs
lola: 3635 markings, 3794 edges, 16 markings/sec, 240 secs
lola: 3717 markings, 3889 edges, 16 markings/sec, 245 secs
lola: 3743 markings, 3915 edges, 5 markings/sec, 250 secs
lola: 3783 markings, 3958 edges, 8 markings/sec, 255 secs
lola: 3851 markings, 4033 edges, 14 markings/sec, 260 secs
lola: 3884 markings, 4066 edges, 7 markings/sec, 265 secs
lola: 3943 markings, 4125 edges, 12 markings/sec, 270 secs
lola: 3972 markings, 4155 edges, 6 markings/sec, 275 secs
lola: 4009 markings, 4192 edges, 7 markings/sec, 280 secs
lola: 4069 markings, 4252 edges, 12 markings/sec, 285 secs
lola: 4144 markings, 4327 edges, 15 markings/sec, 290 secs
lola: 4219 markings, 4402 edges, 15 markings/sec, 295 secs
lola: 4294 markings, 4477 edges, 15 markings/sec, 300 secs
lola: 4357 markings, 4542 edges, 13 markings/sec, 305 secs
lola: 4413 markings, 4598 edges, 11 markings/sec, 310 secs
lola: 4514 markings, 4699 edges, 20 markings/sec, 315 secs
lola: 4570 markings, 4757 edges, 11 markings/sec, 320 secs
lola: 4616 markings, 4803 edges, 9 markings/sec, 325 secs
lola: 4696 markings, 4883 edges, 16 markings/sec, 330 secs
lola: 4776 markings, 4963 edges, 16 markings/sec, 335 secs
lola: 4856 markings, 5043 edges, 16 markings/sec, 340 secs
lola: 4936 markings, 5123 edges, 16 markings/sec, 345 secs
lola: 5017 markings, 5204 edges, 16 markings/sec, 350 secs
lola: 5094 markings, 5290 edges, 15 markings/sec, 355 secs
lola: 5182 markings, 5383 edges, 18 markings/sec, 360 secs
lola: 5252 markings, 5461 edges, 14 markings/sec, 365 secs
lola: 5297 markings, 5506 edges, 9 markings/sec, 370 secs
lola: 5338 markings, 5547 edges, 8 markings/sec, 375 secs
lola: 5391 markings, 5600 edges, 11 markings/sec, 380 secs
lola: 5487 markings, 5696 edges, 19 markings/sec, 385 secs
lola: 5561 markings, 5770 edges, 15 markings/sec, 390 secs
lola: 5614 markings, 5823 edges, 11 markings/sec, 395 secs
lola: 5693 markings, 5906 edges, 16 markings/sec, 400 secs
lola: 5750 markings, 5963 edges, 11 markings/sec, 405 secs
lola: 5803 markings, 6020 edges, 11 markings/sec, 410 secs
lola: 5856 markings, 6076 edges, 11 markings/sec, 415 secs
lola: 5957 markings, 6186 edges, 20 markings/sec, 420 secs
lola: 6061 markings, 6299 edges, 21 markings/sec, 425 secs
lola: 6161 markings, 6408 edges, 20 markings/sec, 430 secs
lola: 6263 markings, 6520 edges, 20 markings/sec, 435 secs
lola: 6336 markings, 6596 edges, 15 markings/sec, 440 secs
lola: 6393 markings, 6653 edges, 11 markings/sec, 445 secs
lola: 6440 markings, 6702 edges, 9 markings/sec, 450 secs
lola: 6534 markings, 6802 edges, 19 markings/sec, 455 secs
lola: 6636 markings, 6908 edges, 20 markings/sec, 460 secs
lola: 6749 markings, 7027 edges, 23 markings/sec, 465 secs
lola: 6844 markings, 7128 edges, 19 markings/sec, 470 secs
lola: 6943 markings, 7233 edges, 20 markings/sec, 475 secs
lola: 7057 markings, 7354 edges, 23 markings/sec, 480 secs
lola: 7170 markings, 7475 edges, 23 markings/sec, 485 secs
lola: 7282 markings, 7594 edges, 22 markings/sec, 490 secs
lola: 7394 markings, 7714 edges, 22 markings/sec, 495 secs
lola: 7506 markings, 7833 edges, 22 markings/sec, 500 secs
lola: 7611 markings, 7944 edges, 21 markings/sec, 505 secs
lola: 7729 markings, 8071 edges, 24 markings/sec, 510 secs
lola: 7852 markings, 8204 edges, 25 markings/sec, 515 secs
lola: 7974 markings, 8335 edges, 24 markings/sec, 520 secs
lola: 8096 markings, 8467 edges, 24 markings/sec, 525 secs
lola: 8216 markings, 8596 edges, 24 markings/sec, 530 secs
lola: 8338 markings, 8727 edges, 24 markings/sec, 535 secs
lola: 8460 markings, 8859 edges, 24 markings/sec, 540 secs
lola: 8580 markings, 8988 edges, 24 markings/sec, 545 secs
lola: 8656 markings, 9068 edges, 15 markings/sec, 550 secs
lola: 8762 markings, 9174 edges, 21 markings/sec, 555 secs
lola: 8899 markings, 9311 edges, 27 markings/sec, 560 secs
lola: 9032 markings, 9444 edges, 27 markings/sec, 565 secs
lola: 9146 markings, 9558 edges, 23 markings/sec, 570 secs
lola: 9230 markings, 9647 edges, 17 markings/sec, 575 secs
lola: 9339 markings, 9759 edges, 22 markings/sec, 580 secs
lola: 9420 markings, 9842 edges, 16 markings/sec, 585 secs
lola: 9559 markings, 9986 edges, 28 markings/sec, 590 secs
lola: 9694 markings, 10142 edges, 27 markings/sec, 595 secs
lola: 9832 markings, 10301 edges, 28 markings/sec, 600 secs
lola: 9971 markings, 10463 edges, 28 markings/sec, 605 secs
lola: 10110 markings, 10624 edges, 28 markings/sec, 610 secs
lola: 10244 markings, 10779 edges, 27 markings/sec, 615 secs
lola: 10383 markings, 10939 edges, 28 markings/sec, 620 secs
lola: 10516 markings, 11093 edges, 27 markings/sec, 625 secs
lola: 10655 markings, 11255 edges, 28 markings/sec, 630 secs
lola: 10794 markings, 11416 edges, 28 markings/sec, 635 secs
lola: 10928 markings, 11571 edges, 27 markings/sec, 640 secs
lola: 11065 markings, 11729 edges, 27 markings/sec, 645 secs
lola: 11201 markings, 11886 edges, 27 markings/sec, 650 secs
lola: 11343 markings, 12052 edges, 28 markings/sec, 655 secs
lola: 11478 markings, 12208 edges, 27 markings/sec, 660 secs
lola: 11613 markings, 12364 edges, 27 markings/sec, 665 secs
lola: 11698 markings, 12454 edges, 17 markings/sec, 670 secs
lola: 11752 markings, 12508 edges, 11 markings/sec, 675 secs
lola: 11847 markings, 12612 edges, 19 markings/sec, 680 secs
lola: 11926 markings, 12694 edges, 16 markings/sec, 685 secs
lola: 11982 markings, 12750 edges, 11 markings/sec, 690 secs
lola: 12079 markings, 12850 edges, 19 markings/sec, 695 secs
lola: 12147 markings, 12918 edges, 14 markings/sec, 700 secs
lola: 12220 markings, 12992 edges, 15 markings/sec, 705 secs
lola: 12361 markings, 13140 edges, 28 markings/sec, 710 secs
lola: 12501 markings, 13280 edges, 28 markings/sec, 715 secs
lola: 12637 markings, 13416 edges, 27 markings/sec, 720 secs
lola: 12773 markings, 13552 edges, 27 markings/sec, 725 secs
lola: 12913 markings, 13692 edges, 28 markings/sec, 730 secs
lola: 13052 markings, 13831 edges, 28 markings/sec, 735 secs
lola: 13189 markings, 13968 edges, 27 markings/sec, 740 secs
lola: 13328 markings, 14107 edges, 28 markings/sec, 745 secs
lola: 13463 markings, 14244 edges, 27 markings/sec, 750 secs
lola: 13718 markings, 14509 edges, 51 markings/sec, 755 secs
lola: 13926 markings, 14725 edges, 42 markings/sec, 760 secs
lola: 14068 markings, 14867 edges, 28 markings/sec, 765 secs
lola: 14227 markings, 15034 edges, 32 markings/sec, 770 secs
lola: 14344 markings, 15151 edges, 23 markings/sec, 775 secs
lola: 14510 markings, 15317 edges, 33 markings/sec, 780 secs
lola: 14606 markings, 15413 edges, 19 markings/sec, 785 secs
lola: 14771 markings, 15586 edges, 33 markings/sec, 790 secs
lola: 14911 markings, 15726 edges, 28 markings/sec, 795 secs
lola: 15193 markings, 16031 edges, 56 markings/sec, 800 secs
lola: 15354 markings, 16200 edges, 32 markings/sec, 805 secs
lola: 15478 markings, 16324 edges, 25 markings/sec, 810 secs
lola: 15601 markings, 16447 edges, 25 markings/sec, 815 secs
lola: 15725 markings, 16571 edges, 25 markings/sec, 820 secs
lola: 15850 markings, 16696 edges, 25 markings/sec, 825 secs
lola: 16107 markings, 16969 edges, 51 markings/sec, 830 secs
lola: 16383 markings, 17270 edges, 55 markings/sec, 835 secs
lola: 16653 markings, 17567 edges, 54 markings/sec, 840 secs
lola: 16916 markings, 17854 edges, 53 markings/sec, 845 secs
lola: 17182 markings, 18144 edges, 53 markings/sec, 850 secs
lola: 17452 markings, 18439 edges, 54 markings/sec, 855 secs
lola: 17722 markings, 18735 edges, 54 markings/sec, 860 secs
lola: 17989 markings, 19027 edges, 53 markings/sec, 865 secs
lola: 18252 markings, 19314 edges, 53 markings/sec, 870 secs
lola: 18521 markings, 19607 edges, 54 markings/sec, 875 secs
lola: 18791 markings, 19902 edges, 54 markings/sec, 880 secs
lola: 19061 markings, 20199 edges, 54 markings/sec, 885 secs
lola: 19324 markings, 20486 edges, 53 markings/sec, 890 secs
lola: 19595 markings, 20781 edges, 54 markings/sec, 895 secs
lola: 19860 markings, 21071 edges, 53 markings/sec, 900 secs
lola: 20134 markings, 21372 edges, 55 markings/sec, 905 secs
lola: 20400 markings, 21662 edges, 53 markings/sec, 910 secs
lola: 20674 markings, 21961 edges, 55 markings/sec, 915 secs
lola: 20947 markings, 22260 edges, 55 markings/sec, 920 secs
lola: 21223 markings, 22560 edges, 55 markings/sec, 925 secs
lola: 21537 markings, 22899 edges, 63 markings/sec, 930 secs
lola: 21853 markings, 23242 edges, 63 markings/sec, 935 secs
lola: 22163 markings, 23580 edges, 62 markings/sec, 940 secs
lola: 22477 markings, 23919 edges, 63 markings/sec, 945 secs
lola: 22793 markings, 24262 edges, 63 markings/sec, 950 secs
lola: 23102 markings, 24599 edges, 62 markings/sec, 955 secs
lola: 23418 markings, 24940 edges, 63 markings/sec, 960 secs
lola: 23722 markings, 25271 edges, 61 markings/sec, 965 secs
lola: 24041 markings, 25618 edges, 64 markings/sec, 970 secs
lola: 24367 markings, 25972 edges, 65 markings/sec, 975 secs
lola: 24692 markings, 26324 edges, 65 markings/sec, 980 secs
lola: 25009 markings, 26667 edges, 63 markings/sec, 985 secs
lola: 25335 markings, 27021 edges, 65 markings/sec, 990 secs
lola: 25646 markings, 27359 edges, 62 markings/sec, 995 secs
lola: 25970 markings, 27711 edges, 65 markings/sec, 1000 secs
lola: 26292 markings, 28060 edges, 64 markings/sec, 1005 secs
lola: 26607 markings, 28401 edges, 63 markings/sec, 1010 secs
lola: 26925 markings, 28746 edges, 64 markings/sec, 1015 secs
lola: 27241 markings, 29090 edges, 63 markings/sec, 1020 secs
lola: 27566 markings, 29443 edges, 65 markings/sec, 1025 secs
lola: 27883 markings, 29785 edges, 63 markings/sec, 1030 secs
lola: 28204 markings, 30134 edges, 64 markings/sec, 1035 secs
lola: 28524 markings, 30481 edges, 64 markings/sec, 1040 secs
lola: 28845 markings, 30830 edges, 64 markings/sec, 1045 secs
lola: 29168 markings, 31181 edges, 65 markings/sec, 1050 secs
lola: 29495 markings, 31536 edges, 65 markings/sec, 1055 secs
lola: 29808 markings, 31873 edges, 63 markings/sec, 1060 secs
lola: 30090 markings, 32177 edges, 56 markings/sec, 1065 secs
lola: 30333 markings, 32451 edges, 49 markings/sec, 1070 secs
lola: 30646 markings, 32795 edges, 63 markings/sec, 1075 secs
lola: 31085 markings, 33264 edges, 88 markings/sec, 1080 secs
lola: 31628 markings, 33849 edges, 109 markings/sec, 1085 secs
lola: 32168 markings, 34430 edges, 108 markings/sec, 1090 secs
lola: 32701 markings, 35003 edges, 107 markings/sec, 1095 secs
lola: 33233 markings, 35575 edges, 106 markings/sec, 1100 secs
lola: 33768 markings, 36150 edges, 107 markings/sec, 1105 secs
lola: 34313 markings, 36735 edges, 109 markings/sec, 1110 secs
lola: 34948 markings, 37414 edges, 127 markings/sec, 1115 secs
lola: 35667 markings, 38188 edges, 144 markings/sec, 1120 secs
lola: 36401 markings, 38978 edges, 147 markings/sec, 1125 secs
lola: 37140 markings, 39773 edges, 148 markings/sec, 1130 secs
lola: 37875 markings, 40563 edges, 147 markings/sec, 1135 secs
lola: 38614 markings, 41355 edges, 148 markings/sec, 1140 secs
lola: 39723 markings, 42496 edges, 222 markings/sec, 1145 secs
lola: 40799 markings, 43647 edges, 215 markings/sec, 1150 secs
lola: 41864 markings, 44785 edges, 213 markings/sec, 1155 secs
lola: 42927 markings, 45924 edges, 213 markings/sec, 1160 secs
lola: 43999 markings, 47072 edges, 214 markings/sec, 1165 secs
lola: 45063 markings, 48209 edges, 213 markings/sec, 1170 secs
lola: 46127 markings, 49348 edges, 213 markings/sec, 1175 secs
lola: 47196 markings, 50493 edges, 214 markings/sec, 1180 secs
lola: 48267 markings, 51639 edges, 214 markings/sec, 1185 secs
lola: 49327 markings, 52772 edges, 212 markings/sec, 1190 secs
lola: 50389 markings, 53910 edges, 212 markings/sec, 1195 secs
lola: 51464 markings, 55061 edges, 215 markings/sec, 1200 secs
lola: 52528 markings, 56198 edges, 213 markings/sec, 1205 secs
lola: 53589 markings, 57334 edges, 212 markings/sec, 1210 secs
lola: 54659 markings, 58480 edges, 214 markings/sec, 1215 secs
lola: 55722 markings, 59616 edges, 213 markings/sec, 1220 secs
lola: 56786 markings, 60755 edges, 213 markings/sec, 1225 secs
lola: 57854 markings, 61899 edges, 214 markings/sec, 1230 secs
lola: 58991 markings, 63115 edges, 227 markings/sec, 1235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 60947 markings, 65498 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no no yes no no yes no yes
lola:
preliminary result: no no no no yes no no no no no yes no no yes no yes
lola: memory consumption: 2970784 KB
lola: time consumption: 2595 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552778985233

--------------------
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="NeighborGrid-PT-d5n4m1t35"
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-3954"
echo " Executing tool lola"
echo " Input is NeighborGrid-PT-d5n4m1t35, 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 r104-oct2-155272225400114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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