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.r016-csrt-155225065400384.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 BridgeAndVehicles-COL-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225065400384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 9 07:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 5 04:55 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 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 2 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 29 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 29 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 41K 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 BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552515870843

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3031
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P20N50

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 22:24:30 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": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p55 <= p54)",
"processed_size": 12,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"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 <= p29)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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 <= p0)",
"processed_size": 9,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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 <= p56)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((2 <= p5)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"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 (TRUE) U (p1 <= p55)))",
"processed_size": 28,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (((2 <= p0) U X (F ((p30 + p31 <= p55)))))",
"processed_size": 44,
"rewrites": 39
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X ((2 <= p1))))",
"processed_size": 21,
"rewrites": 39
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p2)))",
"processed_size": 17,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (G ((1 <= p55))))",
"processed_size": 22,
"rewrites": 39
},
"result":
{
"edges": 35077733,
"markings": 9790134,
"produced_by": "LTL model checker",
"value": true
},
"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": 1010
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((2 <= p5))))",
"processed_size": 21,
"rewrites": 39
},
"result":
{
"edges": 168,
"markings": 168,
"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": 1515
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((1 <= p29) U ((1 <= p2) U (3 <= p55))))",
"processed_size": 43,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3031
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3031
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p3 + p4 <= p32) OR (1 <= p55))))",
"processed_size": 40,
"rewrites": 44
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 122020,
"runtime": 539.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : A(G(**)) : A(X(**)) : ** : A((** U (** U **))) : ** : FALSE : A((** U X(F(**)))) : A(X(X(**))) : (A(G(F(**))) AND A(G((** OR **)))) : ** : A((X(TRUE) U **)) : A(G(F(**))) : ** : A(F(G(**))) : **"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no no yes no yes no no yes no no yes yes no yes yes no ",
"value": "no no yes no yes no no yes no no yes yes no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 108, Transitions: 2228
lola: @ trans altern_cpt
lola: @ trans timeout_B
lola: @ trans enregistrement_B
lola: @ trans timeout_A
lola: @ trans liberation_B
lola: @ trans enregistrement_A
lola: @ trans liberation_A
lola: @ trans autorisation_B
lola: @ trans basculement
lola: @ trans decision
lola: @ trans autorisation_A
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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 <= p30 + p31)
lola: place invariant simplifies atomic proposition
lola: before: (p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p29)
lola: after: (1 <= p29)
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p2)
lola: after: (1 <= p2)
lola: LP says that atomic proposition is always false: (3 <= p3 + p4)
lola: LP says that atomic proposition is always false: (3 <= p30 + p31)
lola: LP says that atomic proposition is always false: (2 <= p3 + p4)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= p30 + p31)
lola: A ((3 <= p30 + p31)) : A (G (G (G ((2 <= p2))))) : A (X ((2 <= p5))) : A ((p55 <= p54)) : A (((1 <= p29) U ((1 <= p2) U (3 <= p55)))) : A ((2 <= p29)) : A (F (G (F (F ((3 <= p3 + p4)))))) : A (((2 <= p0) U X (F ((p30 + p31 <= p55))))) : A ((G (X ((3 <= p30 + p31))) U X (X ((2 <= p1))))) : A (G (G (((p3 + p4 <= p32) U (1 <= p55))))) : A ((G (X ((2 <= p3 + p4))) U (p1 <= p0))) : A ((G (X ((0 <= 0))) U ((3 <= p30 + p31) U (p1 <= p55)))) : A (G (X (F (X ((2 <= p5)))))) : A ((2 <= p0)) : A (F (X (G ((1 <= p55))))) : A ((2 <= p56))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 39 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p55 <= p54)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p55 <= p54)
lola: processed formula length: 12
lola: 39 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 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p29)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 273 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: 39 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 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p0)
lola: processed formula length: 10
lola: 39 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 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p56)
lola: processed formula length: 10
lola: 39 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 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p5)))
lola: processed formula length: 17
lola: 39 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) U (p1 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) U (p1 <= p55)))
lola: processed formula length: 28
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p0) U X (F ((p30 + p31 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p0) U X (F ((p30 + p31 <= p55)))))
lola: processed formula length: 44
lola: 39 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= p1))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= p2)))
lola: processed formula length: 17
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p55))))
lola: processed formula length: 22
lola: 39 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: 109529 markings, 341036 edges, 21906 markings/sec, 0 secs
lola: 208404 markings, 674895 edges, 19775 markings/sec, 5 secs
lola: 310739 markings, 1022061 edges, 20467 markings/sec, 10 secs
lola: 403094 markings, 1334680 edges, 18471 markings/sec, 15 secs
lola: 508809 markings, 1700108 edges, 21143 markings/sec, 20 secs
lola: 603088 markings, 2030349 edges, 18856 markings/sec, 25 secs
lola: 712140 markings, 2408169 edges, 21810 markings/sec, 30 secs
lola: 805812 markings, 2736043 edges, 18734 markings/sec, 35 secs
lola: 920566 markings, 3133377 edges, 22951 markings/sec, 40 secs
lola: 1000936 markings, 3420526 edges, 16074 markings/sec, 45 secs
lola: 1102244 markings, 3781514 edges, 20262 markings/sec, 50 secs
lola: 1210717 markings, 4154095 edges, 21695 markings/sec, 55 secs
lola: 1291069 markings, 4442555 edges, 16070 markings/sec, 60 secs
lola: 1396190 markings, 4815892 edges, 21024 markings/sec, 65 secs
lola: 1522828 markings, 5251756 edges, 25328 markings/sec, 70 secs
lola: 1600417 markings, 5535726 edges, 15518 markings/sec, 75 secs
lola: 1684583 markings, 5829307 edges, 16833 markings/sec, 80 secs
lola: 1793924 markings, 6227143 edges, 21868 markings/sec, 85 secs
lola: 1908594 markings, 6617121 edges, 22934 markings/sec, 90 secs
lola: 1981575 markings, 6886016 edges, 14596 markings/sec, 95 secs
lola: 2063380 markings, 7176457 edges, 16361 markings/sec, 100 secs
lola: 2160406 markings, 7522735 edges, 19405 markings/sec, 105 secs
lola: 2280796 markings, 7971259 edges, 24078 markings/sec, 110 secs
lola: 2378681 markings, 8290821 edges, 19577 markings/sec, 115 secs
lola: 2457366 markings, 8580320 edges, 15737 markings/sec, 120 secs
lola: 2545405 markings, 8889517 edges, 17608 markings/sec, 125 secs
lola: 2646194 markings, 9251851 edges, 20158 markings/sec, 130 secs
lola: 2769241 markings, 9712264 edges, 24609 markings/sec, 135 secs
lola: 2869736 markings, 10037596 edges, 20099 markings/sec, 140 secs
lola: 2945262 markings, 10317933 edges, 15105 markings/sec, 145 secs
lola: 3022038 markings, 10597803 edges, 15355 markings/sec, 150 secs
lola: 3108478 markings, 10897486 edges, 17288 markings/sec, 155 secs
lola: 3213306 markings, 11280721 edges, 20966 markings/sec, 160 secs
lola: 3331243 markings, 11722535 edges, 23587 markings/sec, 165 secs
lola: 3434107 markings, 12051955 edges, 20573 markings/sec, 170 secs
lola: 3509551 markings, 12333116 edges, 15089 markings/sec, 175 secs
lola: 3584235 markings, 12609406 edges, 14937 markings/sec, 180 secs
lola: 3665021 markings, 12899763 edges, 16157 markings/sec, 185 secs
lola: 3757362 markings, 13221471 edges, 18468 markings/sec, 190 secs
lola: 3869318 markings, 13634758 edges, 22391 markings/sec, 195 secs
lola: 4002579 markings, 14099468 edges, 26652 markings/sec, 200 secs
lola: 4094979 markings, 14419411 edges, 18480 markings/sec, 205 secs
lola: 4169983 markings, 14700721 edges, 15001 markings/sec, 210 secs
lola: 4245075 markings, 14979407 edges, 15018 markings/sec, 215 secs
lola: 4321553 markings, 15258838 edges, 15296 markings/sec, 220 secs
lola: 4407228 markings, 15557307 edges, 17135 markings/sec, 225 secs
lola: 4504822 markings, 15908724 edges, 19519 markings/sec, 230 secs
lola: 4627491 markings, 16365591 edges, 24534 markings/sec, 235 secs
lola: 4765425 markings, 16814800 edges, 27587 markings/sec, 240 secs
lola: 4841480 markings, 17101650 edges, 15211 markings/sec, 245 secs
lola: 4917285 markings, 17386761 edges, 15161 markings/sec, 250 secs
lola: 4992774 markings, 17667967 edges, 15098 markings/sec, 255 secs
lola: 5065815 markings, 17937614 edges, 14608 markings/sec, 260 secs
lola: 5141998 markings, 18212161 edges, 15237 markings/sec, 265 secs
lola: 5230221 markings, 18516899 edges, 17645 markings/sec, 270 secs
lola: 5338606 markings, 18914045 edges, 21677 markings/sec, 275 secs
lola: 5457572 markings, 19358422 edges, 23793 markings/sec, 280 secs
lola: 5588925 markings, 19778012 edges, 26271 markings/sec, 285 secs
lola: 5661340 markings, 20051631 edges, 14483 markings/sec, 290 secs
lola: 5735205 markings, 20330314 edges, 14773 markings/sec, 295 secs
lola: 5808081 markings, 20604253 edges, 14575 markings/sec, 300 secs
lola: 5882710 markings, 20881787 edges, 14926 markings/sec, 305 secs
lola: 5956738 markings, 21154469 edges, 14806 markings/sec, 310 secs
lola: 6036074 markings, 21439511 edges, 15867 markings/sec, 315 secs
lola: 6123838 markings, 21741886 edges, 17553 markings/sec, 320 secs
lola: 6227849 markings, 22123276 edges, 20802 markings/sec, 325 secs
lola: 6343558 markings, 22558371 edges, 23142 markings/sec, 330 secs
lola: 6489508 markings, 23023308 edges, 29190 markings/sec, 335 secs
lola: 6562566 markings, 23301477 edges, 14612 markings/sec, 340 secs
lola: 6634833 markings, 23573608 edges, 14453 markings/sec, 345 secs
lola: 6708849 markings, 23852030 edges, 14803 markings/sec, 350 secs
lola: 6785391 markings, 24139378 edges, 15308 markings/sec, 355 secs
lola: 6859046 markings, 24413892 edges, 14731 markings/sec, 360 secs
lola: 6933412 markings, 24688427 edges, 14873 markings/sec, 365 secs
lola: 7012209 markings, 24973458 edges, 15759 markings/sec, 370 secs
lola: 7104639 markings, 25291187 edges, 18486 markings/sec, 375 secs
lola: 7212430 markings, 25685711 edges, 21558 markings/sec, 380 secs
lola: 7336590 markings, 26149901 edges, 24832 markings/sec, 385 secs
lola: 7486661 markings, 26643746 edges, 30014 markings/sec, 390 secs
lola: 7575899 markings, 26962750 edges, 17848 markings/sec, 395 secs
lola: 7653323 markings, 27256038 edges, 15485 markings/sec, 400 secs
lola: 7731345 markings, 27551284 edges, 15604 markings/sec, 405 secs
lola: 7809343 markings, 27844320 edges, 15600 markings/sec, 410 secs
lola: 7887458 markings, 28137285 edges, 15623 markings/sec, 415 secs
lola: 7966159 markings, 28430433 edges, 15740 markings/sec, 420 secs
lola: 8045730 markings, 28723733 edges, 15914 markings/sec, 425 secs
lola: 8128469 markings, 29021704 edges, 16548 markings/sec, 430 secs
lola: 8219308 markings, 29333253 edges, 18168 markings/sec, 435 secs
lola: 8321659 markings, 29708051 edges, 20470 markings/sec, 440 secs
lola: 8436508 markings, 30136241 edges, 22970 markings/sec, 445 secs
lola: 8565450 markings, 30601989 edges, 25788 markings/sec, 450 secs
lola: 8679972 markings, 30961766 edges, 22904 markings/sec, 455 secs
lola: 8754867 markings, 31245518 edges, 14979 markings/sec, 460 secs
lola: 8829299 markings, 31527381 edges, 14886 markings/sec, 465 secs
lola: 8903721 markings, 31808936 edges, 14884 markings/sec, 470 secs
lola: 8979207 markings, 32094104 edges, 15097 markings/sec, 475 secs
lola: 9055326 markings, 32380953 edges, 15224 markings/sec, 480 secs
lola: 9127550 markings, 32651702 edges, 14445 markings/sec, 485 secs
lola: 9204650 markings, 32937768 edges, 15420 markings/sec, 490 secs
lola: 9279754 markings, 33213648 edges, 15021 markings/sec, 495 secs
lola: 9358645 markings, 33496204 edges, 15778 markings/sec, 500 secs
lola: 9480068 markings, 33933060 edges, 24285 markings/sec, 505 secs
lola: 9612849 markings, 34430888 edges, 26556 markings/sec, 510 secs
lola: 9730111 markings, 34864531 edges, 23452 markings/sec, 515 secs
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: 9790134 markings, 35077733 edges
lola: ========================================
lola: subprocess 13 will run for 1010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p5))))
lola: processed formula length: 21
lola: 39 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 14 will run for 1515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p29) U ((1 <= p2) U (3 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p29) U ((1 <= p2) U (3 <= p55))))
lola: processed formula length: 43
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3031 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= p55)))) AND A (G (((p3 + p4 <= p32) OR (1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3031 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 + p4 <= p32) OR (1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G (((p3 + p4 <= p32) OR (1 <= p55))))
lola: processed formula length: 40
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p32 + 1 <= p3 + p4) AND (p55 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 63 markings, 62 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no yes no no yes yes no yes yes no
lola:
preliminary result: no no yes no yes no no yes no no yes yes no yes yes no
lola: memory consumption: 122020 KB
lola: time consumption: 539 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552516409981

--------------------
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="BridgeAndVehicles-COL-V20P20N50"
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 BridgeAndVehicles-COL-V20P20N50, 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 r016-csrt-155225065400384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 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 ;