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-155272225500186.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 NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225500186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 19K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 13K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 320K 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 NeoElection-PT-2-LTLCardinality-00
FORMULA_NAME NeoElection-PT-2-LTLCardinality-01
FORMULA_NAME NeoElection-PT-2-LTLCardinality-02
FORMULA_NAME NeoElection-PT-2-LTLCardinality-03
FORMULA_NAME NeoElection-PT-2-LTLCardinality-04
FORMULA_NAME NeoElection-PT-2-LTLCardinality-05
FORMULA_NAME NeoElection-PT-2-LTLCardinality-06
FORMULA_NAME NeoElection-PT-2-LTLCardinality-07
FORMULA_NAME NeoElection-PT-2-LTLCardinality-08
FORMULA_NAME NeoElection-PT-2-LTLCardinality-09
FORMULA_NAME NeoElection-PT-2-LTLCardinality-10
FORMULA_NAME NeoElection-PT-2-LTLCardinality-11
FORMULA_NAME NeoElection-PT-2-LTLCardinality-12
FORMULA_NAME NeoElection-PT-2-LTLCardinality-13
FORMULA_NAME NeoElection-PT-2-LTLCardinality-14
FORMULA_NAME NeoElection-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552780366326

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NeoElection-PT-2 @ 3570 seconds

FORMULA NeoElection-PT-2-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-PT-2-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for LTLCardinality @ NeoElection-PT-2

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Mar 16 23:52:46 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(1 <= P-poll__handlingMessage_2 + P-poll__handlingMessage_1 + P-poll__handlingMessage_0)",
"processed_size": 88,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1188
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19288,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : TRUE : FALSE : FALSE : ** : FALSE : FALSE : FALSE : TRUE : TRUE : TRUE : TRUE : A(X(TRUE)) : A(X(TRUE)) : A(X(TRUE)) : A(X(TRUE))"
},
"net":
{
"arcs": 1998,
"conflict_clusters": 288,
"places": 438,
"places_significant": 153,
"singleton_clusters": 0,
"transitions": 357
},
"result":
{
"preliminary_value": "no yes no no no no no no yes yes yes yes yes yes yes yes ",
"value": "no yes no no no no no no yes yes yes yes yes yes yes 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: 795/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 438
lola: finding significant places
lola: 438 places, 357 transitions, 153 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: place invariant simplifies atomic proposition
lola: before: (P-stage_2_PRIM + P-stage_0_NEG + P-stage_1_PRIM + P-stage_1_NEG + P-stage_0_SEC + P-stage_1_SEC + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_SEC <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_1_1_RP_2 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_1_RP_0 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_2 + P-poll__networl_0_2_RP_0 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_0_RI_0 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_0_2_RI_2 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_0 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_1_AI_0 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_2 + P-poll__networl_2_2_RI_0 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_2 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_2_2_AI_2 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_0_0_AskP_0 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_2 + P-poll__networl_2_2_AI_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 + P-poll__networl_1_2_AskP_2 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_0 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_2_0_RP_2 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_2_AskP_1 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_1_AskP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_0 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_1_2_AI_2 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_0)
lola: after: (2 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2)
lola: LP says that atomic proposition is always false: (2 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2)
lola: LP says that atomic proposition is always false: (3 <= P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P-dead_2 + P-dead_1 + P-dead_0)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_1_1_RP_2 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_1_RP_0 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_2 + P-poll__networl_0_2_RP_0 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_0_RI_0 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_0_2_RI_2 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_0 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_1_AI_0 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_2 + P-poll__networl_2_2_RI_0 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_2 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_2_2_AI_2 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_0_0_AskP_0 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_2 + P-poll__networl_2_2_AI_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 + P-poll__networl_1_2_AskP_2 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_0 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_2_0_RP_2 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_2_AskP_1 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_1_AskP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_0 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_1_2_AI_2 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_0)
lola: after: (3 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2)
lola: LP says that atomic proposition is always false: (3 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-stage_2_PRIM + P-stage_0_NEG + P-stage_1_PRIM + P-stage_1_NEG + P-stage_0_SEC + P-stage_1_SEC + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_SEC)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-crashed_0 + P-crashed_1 + P-crashed_2)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-crashed_0 + P-crashed_1 + P-crashed_2)
lola: after: (3 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-crashed_0 + P-crashed_1 + P-crashed_2 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: after: (0 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: LP says that atomic proposition is always false: (1 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_1_2_2 + P-masterList_1_2_1 + P-masterList_1_2_0 + P-masterList_1_1_2 + P-masterList_1_1_1 + P-masterList_1_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: after: (2 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: LP says that atomic proposition is always false: (2 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_2_0_AI_2 <= P-network_0_0_RP_0)
lola: after: (0 <= P-network_0_0_RP_0)
lola: LP says that atomic proposition is always true: (P-masterState_2_F_0 <= P-masterState_0_T_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_2_AI_2 <= P-negotiation_0_1_DONE)
lola: after: (0 <= P-negotiation_0_1_DONE)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_2_AnnP_2 <= P-network_2_0_AskP_2)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_2_2_DONE <= P-electionFailed_0)
lola: after: (P-negotiation_2_2_DONE <= 0)
lola: LP says that atomic proposition is always false: (P-negotiation_2_2_DONE <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_0_0_RP_2 <= P-poll__networl_1_1_AI_0)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_0_2_AI_0 <= P-polling_0)
lola: after: (0 <= P-polling_0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_0_0_RI_2 <= P-masterList_2_2_1)
lola: after: (0 <= 0)
lola: A (G (X (G ((2 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2))))) : A ((G ((3 <= P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)) U G (G ((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0))))) : A (F (G (((2 <= 0) U (3 <= P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_2_AnsP_2))))) : A (F (G (((1 <= 0) U (1 <= 0))))) : A ((1 <= P-poll__handlingMessage_2 + P-poll__handlingMessage_1 + P-poll__handlingMessage_0)) : A (G ((3 <= 0))) : A (X ((X ((0 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1)) U X ((1 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1))))) : A (X ((2 <= P-poll__waitingMessage_2 + P-poll__waitingMessage_0 + P-poll__waitingMessage_1))) : A (G (G (F (G ((0 <= P-network_0_0_RP_0)))))) : A ((P-masterState_2_F_0 <= P-masterState_0_T_2)) : A ((0 <= P-negotiation_0_1_DONE)) : A ((0 <= 0)) : A (X ((X ((P-negotiation_2_2_DONE <= 0)) U F ((0 <= 0))))) : A (X (F (F (F ((0 <= 0)))))) : A (F (G (X (X ((0 <= P-polling_0)))))) : A (G (X (X ((0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P-poll__handlingMessage_2 + P-poll__handlingMessage_1 + P-poll__handlingMessage_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-poll__handlingMessage_2 + P-poll__handlingMessage_1 + P-poll__handlingMessage_0)
lola: processed formula length: 88
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 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: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 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: 68 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 68 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 68 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 68 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 68 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: 3 markings, 2 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes yes yes yes yes yes yes yes
lola:
preliminary result: no yes no no no no no no yes yes yes yes yes yes yes yes
lola: memory consumption: 19288 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552780394718

--------------------
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="NeoElection-PT-2"
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 NeoElection-PT-2, 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-155272225500186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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