Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550000753.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 HypercubeGrid-PT-C4K3P3B12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550000753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 5.0K Feb 11 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 11 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 7 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 00:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 3 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Jan 31 03:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 31 03:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rwxr-xr-x 1 mcc users 3.0M 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 HypercubeGrid-PT-C4K3P3B12-LTLCardinality-00
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-01
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-02
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-03
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-04
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-05
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-06
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-07
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-08
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-09
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-10
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-11
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-12
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-13
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-14
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552680027833

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3570 seconds

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3268
rslt: Output for LTLCardinality @ HypercubeGrid-PT-C4K3P3B12

{
"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": "Fri Mar 15 20:00:27 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"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": 235
},
"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": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"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": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"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": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= pb_d1_n2_3_3_2_3)",
"processed_size": 23,
"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": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"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 ((F ((2 <= pb_d4_n1_2_3_2_2)) U G ((1 <= po_d2_n1_3_3_3_1)))))",
"processed_size": 67,
"rewrites": 33
},
"result":
{
"edges": 13158,
"markings": 13158,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X ((pb_d2_n2_1_1_2_1 <= pil_d3_n1_2_1_1_2)) U (pb_d1_n2_3_2_1_3 <= pol_d4_n1_3_1_2_4)))",
"processed_size": 91,
"rewrites": 33
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"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 <= pbl_2_3_2_2))))",
"processed_size": 30,
"rewrites": 33
},
"result":
{
"edges": 648,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((pol_d4_n1_1_1_2_1 <= pi_d3_n1_1_3_3_1)))",
"processed_size": 47,
"rewrites": 33
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((3 <= pb_d4_n1_3_1_2_2))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 589
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((2 <= pb_d2_n1_1_2_1_3))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 13075,
"markings": 13075,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"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": "(pil_d1_n1_2_1_2_1 + 1 <= pb_d1_n1_1_3_2_3)",
"processed_size": 43,
"rewrites": 35
},
"result":
{
"edges": 1995,
"markings": 1995,
"produced_by": "state space / EG",
"value": false
},
"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": 884
},
"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 ((1 <= po_d3_n1_1_1_4_3))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 1935,
"markings": 1935,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1179
},
"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 ((pil_d1_n1_4_2_3_2 <= pol_d1_n1_1_2_3_2))))",
"processed_size": 52,
"rewrites": 33
},
"result":
{
"edges": 17618,
"markings": 16609,
"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": 1719
},
"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 ((pol_d3_n1_3_1_4_3 <= pb_d2_n2_1_2_1_1))))",
"processed_size": 51,
"rewrites": 33
},
"result":
{
"edges": 15601,
"markings": 15527,
"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": 3268
},
"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 (((pb_d2_n1_3_1_1_2 <= pbl_3_1_1_3) U ((pi_d1_n1_1_1_2_3 <= pi_d3_n1_1_3_3_3) U (2 <= pbl_1_2_2_1))))",
"processed_size": 103,
"rewrites": 33
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 115496,
"runtime": 302.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(**)) : A(F(G(**))) : A(F(G(**))) : A(X(G(**))) : FALSE : A(X(G(**))) : A(G(F(**))) : FALSE : A(X((F(**) U G(**)))) : A((** U (** U **))) : A((X(**) U **)) : A(X(F(**))) : FALSE : A(F(**)) : FALSE : **"
},
"net":
{
"arcs": 21600,
"conflict_clusters": 945,
"places": 2457,
"places_significant": 1511,
"singleton_clusters": 0,
"transitions": 5400
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no yes no no no yes ",
"value": "no no no no no no no no no yes no yes no no 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: 7857/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 78624
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= po_d4_n1_3_1_2_4)
lola: LP says that atomic proposition is always false: (2 <= pil_d3_n1_2_2_3_1)
lola: LP says that atomic proposition is always false: (2 <= pil_d2_n1_2_2_2_3)
lola: LP says that atomic proposition is always false: (3 <= pi_d4_n1_1_1_2_3)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_3_3_2_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_4_2_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_1_1_2_3)
lola: A ((G (G ((3 <= po_d4_n1_3_1_2_4))) U X ((pol_d4_n1_1_1_2_1 <= pi_d3_n1_1_3_3_1)))) : A (F ((F ((pb_d2_n2_2_1_3_1 <= pil_d3_n1_2_1_2_3)) U G ((pil_d1_n1_4_2_3_2 <= pol_d1_n1_1_2_3_2))))) : A (F (((pil_d4_n1_3_2_1_4 <= po_d3_n1_2_3_3_1) U G ((pol_d3_n1_3_1_4_3 <= pb_d2_n2_1_2_1_1))))) : A (X (G ((2 <= pb_d2_n1_1_2_1_3)))) : A (X ((2 <= pil_d3_n1_2_2_3_1))) : A (G (X (((2 <= pil_d2_n1_2_2_2_3) U (3 <= pb_d4_n1_3_1_2_2))))) : A (G (F ((1 <= po_d3_n1_1_1_4_3)))) : A ((F (X ((3 <= pi_d4_n1_1_1_2_3))) U F (X ((3 <= po_d1_n1_3_3_2_1))))) : A (X ((F ((2 <= pb_d4_n1_2_3_2_2)) U G ((1 <= po_d2_n1_3_3_3_1))))) : A (((pb_d2_n1_3_1_1_2 <= pbl_3_1_1_3) U ((pi_d1_n1_1_1_2_3 <= pi_d3_n1_1_3_3_3) U (2 <= pbl_1_2_2_1)))) : A ((X ((pb_d2_n2_1_1_2_1 <= pil_d3_n1_2_1_1_2)) U (pb_d1_n2_3_2_1_3 <= pol_d4_n1_3_1_2_4))) : A (X ((X ((3 <= pb_d4_n2_2_3_2_1)) U F ((1 <= pbl_2_3_2_2))))) : A (G (F (((3 <= pb_d3_n1_2_1_3_2) U (3 <= pi_d2_n1_1_4_2_1))))) : A (F (F ((pb_d1_n1_1_3_2_3 <= pil_d1_n1_2_1_2_1)))) : A (G ((F ((2 <= pb_d4_n1_2_1_2_3)) U F ((3 <= pi_d3_n1_1_1_2_3))))) : A ((2 <= pb_d1_n2_3_3_2_3))
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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 235 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 2 will run for 252 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 3 will run for 272 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 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= pb_d1_n2_3_3_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pb_d1_n2_3_3_2_3)
lola: processed formula length: 23
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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= pb_d4_n1_2_3_2_2)) U G ((1 <= po_d2_n1_3_3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= pb_d4_n1_2_3_2_2)) U G ((1 <= po_d2_n1_3_3_3_1)))))
lola: processed formula length: 67
lola: 33 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: 13158 markings, 13158 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((pb_d2_n2_1_1_2_1 <= pil_d3_n1_2_1_1_2)) U (pb_d1_n2_3_2_1_3 <= pol_d4_n1_3_1_2_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((pb_d2_n2_1_1_2_1 <= pil_d3_n1_2_1_1_2)) U (pb_d1_n2_3_2_1_3 <= pol_d4_n1_3_1_2_4)))
lola: processed formula length: 91
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: 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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= pbl_2_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= pbl_2_3_2_2))))
lola: processed formula length: 30
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: 649 markings, 648 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((pol_d4_n1_1_1_2_1 <= pi_d3_n1_1_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((pol_d4_n1_1_1_2_1 <= pi_d3_n1_1_3_3_1)))
lola: processed formula length: 47
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: 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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= pb_d4_n1_3_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= pb_d4_n1_3_1_2_2))))
lola: processed formula length: 35
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: 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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= pb_d2_n1_1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= pb_d2_n1_1_2_1_3))))
lola: processed formula length: 35
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: 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: 13075 markings, 13075 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d1_n1_1_3_2_3 <= pil_d1_n1_2_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (pil_d1_n1_2_1_2_1 + 1 <= pb_d1_n1_1_3_2_3)
lola: processed formula length: 43
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1995 markings, 1995 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= po_d3_n1_1_1_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= po_d3_n1_1_1_4_3))))
lola: processed formula length: 35
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: 1935 markings, 1935 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pil_d1_n1_4_2_3_2 <= pol_d1_n1_1_2_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pil_d1_n1_4_2_3_2 <= pol_d1_n1_1_2_3_2))))
lola: processed formula length: 52
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: 2441 markings, 2459 edges, 488 markings/sec, 0 secs
lola: 2516 markings, 2534 edges, 15 markings/sec, 5 secs
lola: 2580 markings, 2598 edges, 13 markings/sec, 10 secs
lola: 2657 markings, 2675 edges, 15 markings/sec, 15 secs
lola: 2763 markings, 2781 edges, 21 markings/sec, 20 secs
lola: 2937 markings, 2955 edges, 35 markings/sec, 25 secs
lola: 3063 markings, 3081 edges, 25 markings/sec, 30 secs
lola: 3324 markings, 3342 edges, 52 markings/sec, 35 secs
lola: 3618 markings, 3636 edges, 59 markings/sec, 40 secs
lola: 4013 markings, 4031 edges, 79 markings/sec, 45 secs
lola: 5264 markings, 5282 edges, 250 markings/sec, 50 secs
lola: 6171 markings, 6189 edges, 181 markings/sec, 55 secs
lola: 7253 markings, 7271 edges, 216 markings/sec, 60 secs
lola: 8634 markings, 8652 edges, 276 markings/sec, 65 secs
lola: 10000 markings, 10018 edges, 273 markings/sec, 70 secs
lola: 11032 markings, 11050 edges, 206 markings/sec, 75 secs
lola: 12021 markings, 12039 edges, 198 markings/sec, 80 secs
lola: 12919 markings, 12937 edges, 180 markings/sec, 85 secs
lola: 13994 markings, 14076 edges, 215 markings/sec, 90 secs
lola: add low 1091
lola: add low 1506
lola: add low 3036
lola: add low 2056
lola: add low 449
lola: add low 3319
lola: add low 4621
lola: add low 2300
lola: add low 3379
lola: add low 4927
lola: add low 3188
lola: add low 401
lola: add low 1573
lola: add low 2389
lola: add low 2805
lola: add low 4302
lola: add low 3318
lola: add low 4620
lola: add low 303
lola: add low 1359
lola: add low 2174
lola: add low 1209
lola: add low 2975
lola: add low 2001
lola: add low 3452
lola: add low 660
lola: add low 2138
lola: add low 4728
lola: add low 654
lola: add low 1944
lola: add low 4794
lola: add low 1290
lola: add low 561
lola: add low 2451
lola: add low 5349
lola: add low 727
lola: add low 1828
lola: add low 3158
lola: add low 807
lola: add low 1894
lola: add low 2701
lola: add low 241
lola: add low 1418
lola: add low 2225
lola: add low 2150
lola: add low 1421
lola: add low 1264
lola: add low 2318
lola: add low 437
lola: add low 3021
lola: add low 2095
lola: add low 3179
lola: add low 3564
lola: add low 5023
lola: add low 4030
lola: add low 230
lola: add low 1013
lola: add low 1553
lola: add low 4158
lola: add low 3099
lola: add low 4159
lola: add low 4470
lola: add low 4275
lola: add low 5066
lola: add low 1002
lola: add low 3210
lola: add low 644
lola: add low 1976
lola: add low 3028
lola: add low 4097
lola: add low 4895
lola: add low 3911
lola: add low 3749
lola: add low 2774
lola: add low 559
lola: add low 1371
lola: add low 4753
lola: add low 464
lola: add low 1777
lola: add low 3155
lola: add low 2399
lola: add low 4891
lola: add low 342
lola: add low 1631
lola: add low 3713
lola: add low 4795
lola: add low 262
lola: add low 4879
lola: add low 825
lola: add low 3012
lola: add low 499
lola: add low 1822
lola: add low 2845
lola: add low 3910
lola: add low 1383
lola: add low 419
lola: add low 2211
lola: add low 5089
lola: add low 1025
lola: add low 4819
lola: add low 4113
lola: add low 827
lola: add low 1639
lola: add low 2951
lola: add low 3049
lola: add low 4112
lola: add low 72
lola: add low 624
lola: add low 1716
lola: add low 131
lola: add low 2963
lola: add low 4293
lola: add low 1977
lola: add low 3040
lola: add low 4638
lola: add low 3852
lola: add low 1111
lola: add low 1963
lola: add low 3041
lola: add low 4639
lola: add low 3853
lola: add low 1112
lola: add low 1910
lola: add low 2965
lola: add low 4295
lola: add low 1979
lola: add low 3042
lola: add low 4640
lola: add low 2804
lola: add low 79
lola: add low 3224
lola: add low 3985
lola: add low 2104
lola: add low 3194
lola: add low 2099
lola: add low 3195
lola: add low 3436
lola: add low 4236
lola: add low 5030
lola: add low 311
lola: add low 1113
lola: add low 1366
lola: add low 3225
lola: add low 3986
lola: add low 2039
lola: add low 3108
lola: add low 4438
lola: add low 2819
lola: add low 2125
lola: add low 2276
lola: add low 3107
lola: add low 4437
lola: add low 404
lola: add low 5029
lola: add low 1216
lola: add low 2002
lola: add low 3453
lola: add low 661
lola: add low 215
lola: add low 2773
lola: add low 558
lola: add low 1370
lola: add low 2374
lola: add low 3443
lola: add low 2428
lola: add low 3500
lola: add low 4806
lola: add low 696
lola: add low 3554
lola: add low 2440
lola: add low 1725
lola: add low 3038
lola: add low 2634
lola: add low 3709
lola: add low 2589
lola: add low 1902
lola: add low 3226
lola: add low 2808
lola: add low 3876
lola: add low 4356
lola: add low 4812
lola: add low 3807
lola: add low 5151
lola: add low 2984
lola: add low 477
lola: add low 2787
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: 16609 markings, 17618 edges
lola: ========================================
lola: subprocess 14 will run for 1719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pol_d3_n1_3_1_4_3 <= pb_d2_n2_1_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pol_d3_n1_3_1_4_3 <= pb_d2_n2_1_2_1_1))))
lola: processed formula length: 51
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: 2486 markings, 2504 edges, 497 markings/sec, 0 secs
lola: 2720 markings, 2738 edges, 47 markings/sec, 5 secs
lola: 2927 markings, 2945 edges, 41 markings/sec, 10 secs
lola: 3087 markings, 3105 edges, 32 markings/sec, 15 secs
lola: 3167 markings, 3185 edges, 16 markings/sec, 20 secs
lola: 3248 markings, 3266 edges, 16 markings/sec, 25 secs
lola: 3361 markings, 3379 edges, 23 markings/sec, 30 secs
lola: 3462 markings, 3480 edges, 20 markings/sec, 35 secs
lola: 3562 markings, 3580 edges, 20 markings/sec, 40 secs
lola: 3666 markings, 3684 edges, 21 markings/sec, 45 secs
lola: 3776 markings, 3794 edges, 22 markings/sec, 50 secs
lola: 3881 markings, 3899 edges, 21 markings/sec, 55 secs
lola: 3936 markings, 3954 edges, 11 markings/sec, 60 secs
lola: 3986 markings, 4004 edges, 10 markings/sec, 65 secs
lola: 4048 markings, 4066 edges, 12 markings/sec, 70 secs
lola: 4122 markings, 4140 edges, 15 markings/sec, 75 secs
lola: 4189 markings, 4207 edges, 13 markings/sec, 80 secs
lola: 4266 markings, 4284 edges, 15 markings/sec, 85 secs
lola: 4373 markings, 4391 edges, 21 markings/sec, 90 secs
lola: 4504 markings, 4522 edges, 26 markings/sec, 95 secs
lola: 4633 markings, 4651 edges, 26 markings/sec, 100 secs
lola: 4769 markings, 4787 edges, 27 markings/sec, 105 secs
lola: 4927 markings, 4945 edges, 32 markings/sec, 110 secs
lola: 5066 markings, 5084 edges, 28 markings/sec, 115 secs
lola: 5234 markings, 5252 edges, 34 markings/sec, 120 secs
lola: 6985 markings, 7003 edges, 350 markings/sec, 125 secs
lola: 8651 markings, 8669 edges, 333 markings/sec, 130 secs
lola: 9319 markings, 9337 edges, 134 markings/sec, 135 secs
lola: 9948 markings, 9966 edges, 126 markings/sec, 140 secs
lola: 10678 markings, 10696 edges, 146 markings/sec, 145 secs
lola: 11566 markings, 11584 edges, 178 markings/sec, 150 secs
lola: 12458 markings, 12476 edges, 178 markings/sec, 155 secs
lola: 13262 markings, 13280 edges, 161 markings/sec, 160 secs
lola: 14725 markings, 14797 edges, 293 markings/sec, 165 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: 15527 markings, 15601 edges
lola: ========================================
lola: subprocess 15 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((pb_d2_n1_3_1_1_2 <= pbl_3_1_1_3) U ((pi_d1_n1_1_1_2_3 <= pi_d3_n1_1_3_3_3) U (2 <= pbl_1_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((pb_d2_n1_3_1_1_2 <= pbl_3_1_1_3) U ((pi_d1_n1_1_1_2_3 <= pi_d3_n1_1_3_3_3) U (2 <= pbl_1_2_2_1))))
lola: processed formula length: 103
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: 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: RESULT
lola:
SUMMARY: no no no no no no no no no yes no yes no no no yes
lola:
preliminary result: no no no no no no no no no yes no yes no no no yes
lola: ========================================
lola: memory consumption: 115496 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552680329969

--------------------
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="HypercubeGrid-PT-C4K3P3B12"
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 HypercubeGrid-PT-C4K3P3B12, 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 r082-csrt-155246550000753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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