Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r030-oct2-158897741100045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is BridgeAndVehicles-COL-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-oct2-158897741100045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 20:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 40K Mar 24 05:37 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-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-15

=== Now, execution of the tool begins

BK_START 1589300376850

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

FORMULA BridgeAndVehicles-COL-V20P20N20-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA BridgeAndVehicles-COL-V20P20N20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-COL-V20P20N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA BridgeAndVehicles-COL-V20P20N20-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-COL-V20P20N20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2872
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P20N20

{
"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": "Tue May 12 16:19:36 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (X (G ((p55 <= 2)))) OR (X ((p30 + p31 + 1 <= p2)) AND F ((1 <= p30 + p31)))))",
"processed_size": 84,
"rewrites": 105
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (((F ((3 <= p2)) AND G ((1 <= p3 + p4))) OR X (F ((G (F ((p27 + p28 <= p0))) AND X ((p5 <= p2)))))))",
"processed_size": 102,
"rewrites": 105
},
"result":
{
"edges": 167734290,
"markings": 31226705,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"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": 105
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((((p56 <= 1)) R X (G ((p56 <= 1))))))",
"processed_size": 43,
"rewrites": 105
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 416
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (((p56 <= p5) OR (X (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))) OR (G ((p56 <= p5)) AND F (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))))))))",
"processed_size": 145,
"rewrites": 105
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (X ((X ((1 <= p2)) AND (F ((1 <= p2)) AND F ((p32 <= p0)))))))",
"processed_size": 67,
"rewrites": 105
},
"result":
{
"edges": 839571,
"markings": 371942,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 555
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p56 + 1 <= p55)",
"processed_size": 16,
"rewrites": 107
},
"result":
{
"edges": 169,
"markings": 170,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 666
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p55 <= p2))))",
"processed_size": 23,
"rewrites": 105
},
"result":
{
"edges": 134398627,
"markings": 19062430,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((1 <= p30 + p31) R ((p30 + p31 <= 0) OR F ((p0 <= 1)))))))",
"processed_size": 68,
"rewrites": 105
},
"result":
{
"edges": 133719316,
"markings": 22848893,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 965
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 (G (F ((p27 + p28 + 1 <= p30 + p31))))",
"processed_size": 40,
"rewrites": 105
},
"result":
{
"edges": 255,
"markings": 254,
"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": 1448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (F (((1 <= p0) AND (F ((p54 + 1 <= p55)) AND G (((1 <= p0) OR ((1 <= p0) AND (1 <= p27 + p28))))))))",
"processed_size": 103,
"rewrites": 105
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2896
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p3 + p4 + 1 <= p0) AND (p32 + 1 <= p2)) U (((p3 + p4 + 1 <= p0)) U (p2 <= p32))))",
"processed_size": 87,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 94288,
"runtime": 674.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((F(**) AND G(**)) OR X(F((G(F(**)) AND X(**)))))) : A((** U (** U **))) : A(F(G((* R (* OR F(*)))))) : TRUE : A(G(F(*))) : A(F(G(**))) : A(F(**)) : A(X(TRUE)) : A((X(X(G(*))) OR (X(**) AND F(**)))) : FALSE : TRUE : A(X(G(*))) : A(X((* R X(G(*))))) : A(X((** OR (X(G(**)) OR (G(**) AND F(G(**))))))) : A(F((** AND (F(*) AND G(**))))) : A(X(X((X(**) AND (F(**) AND F(**))))))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no yes no no yes no no yes no no ",
"value": "yes yes yes yes no yes no yes no no yes no no yes no 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: 78, Transitions: 968
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: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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: (p30 + p31 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (p30 + p31 <= 1)
lola: LP says that atomic proposition is always true: (p30 + p31 <= 1)
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 <= p55)
lola: after: (1 <= p55)
lola: place invariant simplifies atomic proposition
lola: before: (p30 + p31 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (p30 + p31 <= 1)
lola: LP says that atomic proposition is always true: (p30 + p31 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (1 <= 0)
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 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (0 <= 0)
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 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (2 <= p3 + p4)
lola: place invariant simplifies atomic proposition
lola: before: (p32 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (p32 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (0 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p2)
lola: after: (1 <= p2)
lola: place invariant simplifies atomic proposition
lola: before: (p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77 <= p0)
lola: after: (1 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77 <= p0)
lola: after: (1 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77 <= p0)
lola: after: (1 <= p0)
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 <= p27 + p28)
lola: after: (1 <= p27 + p28)
lola: place invariant simplifies atomic proposition
lola: before: (p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77 <= p2)
lola: after: (1 <= p2)
lola: place invariant simplifies atomic proposition
lola: before: (p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77 <= p2)
lola: after: (1 <= p2)
lola: place invariant simplifies atomic proposition
lola: before: (p3 + p4 <= p76 + p75 + p74 + p73 + p72 + p71 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p77)
lola: after: (p3 + p4 <= 1)
lola: LP says that atomic proposition is always true: (p3 + p4 <= 1)
lola: A (((F ((3 <= p2)) AND G ((1 <= p3 + p4))) OR F (X (F ((G (F ((p27 + p28 <= p0))) AND X ((p5 <= p2)))))))) : A ((((p3 + p4 + 1 <= p0) AND (p32 + 1 <= p2)) U (((p3 + p4 + 1 <= p0)) U (p2 <= p32)))) : A (F (X (F (G (NOT(X (((p30 + p31 <= 0) U ((1 <= p30 + p31) AND G ((2 <= p0))))))))))) : A ((NOT(G ((p30 + p31 <= 1))) U ())) : A (F (NOT((X (F ((((p27 + p28 <= p56) OR X ((p27 + p28 <= p56))) OR G (F ((0 <= 0)))))) U G ((p30 + p31 <= p27 + p28)))))) : A ((((p54 <= p30 + p31) AND G (F (X (X (G ((p30 + p31 <= p27 + p28))))))) U G (F (G ((p55 <= p2)))))) : A ((NOT(F ((1 <= 0))) U (p55 <= p56))) : A (((0 <= 0) AND G (((0 <= 0) AND G ((X ((0 <= p30 + p31)) OR (G ((2 <= p3 + p4)) AND X ((p32 <= 1))))))))) : A ((G (NOT(X (X ((3 <= p55))))) OR (X ((p30 + p31 + 1 <= p2)) AND ((0 <= p55) U (1 <= p30 + p31))))) : A (NOT(G (NOT(F (NOT(F (((3 <= p1) OR X ((0 <= 1)))))))))) : A (((0 <= p27 + p28) OR G (F (((p2 <= p5)))))) : A (NOT(X ((G ((0 <= 0)) U (p2 <= p54))))) : A (X (NOT((((2 <= p56)) U F (X ((2 <= p56))))))) : A (X (((p56 <= p5) OR (G ((p56 <= p5)) U X (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))))))) : A (F ((((1 <= p0) AND NOT(G ((p55 <= p54)))) AND G (((1 <= p0) OR ((1 <= p0) AND (1 <= p27 + p28))))))) : A (X (X (((X ((1 <= p2)) AND F ((1 <= p2))) AND F (((p32 <= p0) AND F ((p3 + p4 <= 1))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:188
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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: 105 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 1 will run for 234 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: 105 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: subprocess 2 will run for 251 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: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G ((p55 <= 2)))) OR (X ((p30 + p31 + 1 <= p2)) AND F ((1 <= p30 + p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G ((p55 <= 2)))) OR (X ((p30 + p31 + 1 <= p2)) AND F ((1 <= p30 + p31)))))
lola: processed formula length: 84
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((3 <= p2)) AND G ((1 <= p3 + p4))) OR X (F ((G (F ((p27 + p28 <= p0))) AND X ((p5 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((3 <= p2)) AND G ((1 <= p3 + p4))) OR X (F ((G (F ((p27 + p28 <= p0))) AND X ((p5 <= p2)))))))
lola: processed formula length: 102
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 1127955 markings, 4922981 edges, 225591 markings/sec, 0 secs
lola: 2181671 markings, 9537664 edges, 210743 markings/sec, 5 secs
lola: 3200263 markings, 14146177 edges, 203718 markings/sec, 10 secs
lola: 4300189 markings, 18899596 edges, 219985 markings/sec, 15 secs
lola: 5407299 markings, 23604983 edges, 221422 markings/sec, 20 secs
lola: 6476168 markings, 28184474 edges, 213774 markings/sec, 25 secs
lola: 7527000 markings, 32640505 edges, 210166 markings/sec, 30 secs
lola: 8569392 markings, 36983556 edges, 208478 markings/sec, 35 secs
lola: 9572975 markings, 41377076 edges, 200717 markings/sec, 40 secs
lola: 10586036 markings, 45781740 edges, 202612 markings/sec, 45 secs
lola: 11586907 markings, 50141826 edges, 200174 markings/sec, 50 secs
lola: 12575495 markings, 54440951 edges, 197718 markings/sec, 55 secs
lola: 13583788 markings, 58792913 edges, 201659 markings/sec, 60 secs
lola: 14598142 markings, 63129291 edges, 202871 markings/sec, 65 secs
lola: 15542898 markings, 67595457 edges, 188951 markings/sec, 70 secs
lola: 16529771 markings, 71877374 edges, 197375 markings/sec, 75 secs
lola: 17522496 markings, 76393447 edges, 198545 markings/sec, 80 secs
lola: 18289926 markings, 81498228 edges, 153486 markings/sec, 85 secs
lola: 19034491 markings, 86477483 edges, 148913 markings/sec, 90 secs
lola: 19774369 markings, 91396307 edges, 147976 markings/sec, 95 secs
lola: 20512752 markings, 96169501 edges, 147677 markings/sec, 100 secs
lola: 21230389 markings, 100980384 edges, 143527 markings/sec, 105 secs
lola: 21944851 markings, 105727142 edges, 142892 markings/sec, 110 secs
lola: 22655685 markings, 110432089 edges, 142167 markings/sec, 115 secs
lola: 23369032 markings, 115126024 edges, 142669 markings/sec, 120 secs
lola: 24082685 markings, 119781254 edges, 142731 markings/sec, 125 secs
lola: 24815016 markings, 124539527 edges, 146466 markings/sec, 130 secs
lola: 25493113 markings, 129350566 edges, 135619 markings/sec, 135 secs
lola: 26199821 markings, 133924473 edges, 141342 markings/sec, 140 secs
lola: 26916886 markings, 138699560 edges, 143413 markings/sec, 145 secs
lola: 27614049 markings, 143507841 edges, 139433 markings/sec, 150 secs
lola: 28361017 markings, 148211701 edges, 149394 markings/sec, 155 secs
lola: 29034238 markings, 153093527 edges, 134644 markings/sec, 160 secs
lola: 29794222 markings, 157856807 edges, 151997 markings/sec, 165 secs
lola: 30467275 markings, 162743901 edges, 134611 markings/sec, 170 secs
lola: 31193953 markings, 167544694 edges, 145336 markings/sec, 175 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: 31226705 markings, 167734290 edges
lola: ========================================
lola: subprocess 5 will run for 303 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: 105 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 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p54 + 1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p54 + 1 <= p2))))
lola: processed formula length: 27
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p56 <= 1)) R X (G ((p56 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((p56 <= 1)) R X (G ((p56 <= 1))))))
lola: processed formula length: 43
lola: 105 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p56 <= p5) OR (X (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))) OR (G ((p56 <= p5)) AND F (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p56 <= p5) OR (X (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))) OR (G ((p56 <= p5)) AND F (G (((p30 + p31 + 1 <= p32) AND (1 <= p2)))))))))
lola: processed formula length: 145
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((X ((1 <= p2)) AND (F ((1 <= p2)) AND F ((p32 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X ((1 <= p2)) AND (F ((1 <= p2)) AND F ((p32 <= p0)))))))
lola: processed formula length: 67
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 371942 markings, 839571 edges
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p55 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p56 + 1 <= p55)
lola: processed formula length: 16
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 170 markings, 169 edges
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p55 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p55 <= p2))))
lola: processed formula length: 23
lola: 105 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: 366897 markings, 2342368 edges, 73379 markings/sec, 0 secs
lola: 719775 markings, 4731351 edges, 70576 markings/sec, 5 secs
lola: 1067797 markings, 7129538 edges, 69604 markings/sec, 10 secs
lola: 1417624 markings, 9548966 edges, 69965 markings/sec, 15 secs
lola: 1759386 markings, 11984166 edges, 68352 markings/sec, 20 secs
lola: 2097449 markings, 14285529 edges, 67613 markings/sec, 25 secs
lola: 2452938 markings, 16769511 edges, 71098 markings/sec, 30 secs
lola: 2785558 markings, 19121231 edges, 66524 markings/sec, 35 secs
lola: 3142734 markings, 21608279 edges, 71435 markings/sec, 40 secs
lola: 3473956 markings, 23947537 edges, 66244 markings/sec, 45 secs
lola: 3837691 markings, 26471723 edges, 72747 markings/sec, 50 secs
lola: 4165491 markings, 28788343 edges, 65560 markings/sec, 55 secs
lola: 4516246 markings, 31369823 edges, 70151 markings/sec, 60 secs
lola: 4869827 markings, 33769239 edges, 70716 markings/sec, 65 secs
lola: 5198571 markings, 36083389 edges, 65749 markings/sec, 70 secs
lola: 5567223 markings, 38647502 edges, 73730 markings/sec, 75 secs
lola: 5905103 markings, 41077413 edges, 67576 markings/sec, 80 secs
lola: 6232636 markings, 43379953 edges, 65507 markings/sec, 85 secs
lola: 6584239 markings, 45984306 edges, 70321 markings/sec, 90 secs
lola: 6944971 markings, 48402540 edges, 72146 markings/sec, 95 secs
lola: 7279928 markings, 50792527 edges, 66991 markings/sec, 100 secs
lola: 7615714 markings, 53197980 edges, 67157 markings/sec, 105 secs
lola: 7993972 markings, 55744430 edges, 75652 markings/sec, 110 secs
lola: 8331352 markings, 58209781 edges, 67476 markings/sec, 115 secs
lola: 8665893 markings, 60592213 edges, 66908 markings/sec, 120 secs
lola: 8999318 markings, 62990399 edges, 66685 markings/sec, 125 secs
lola: 9381764 markings, 65547428 edges, 76489 markings/sec, 130 secs
lola: 9723020 markings, 68035087 edges, 68251 markings/sec, 135 secs
lola: 10058456 markings, 70468977 edges, 67087 markings/sec, 140 secs
lola: 10387749 markings, 72774995 edges, 65859 markings/sec, 145 secs
lola: 10740005 markings, 75385637 edges, 70451 markings/sec, 150 secs
lola: 11120932 markings, 77867141 edges, 76185 markings/sec, 155 secs
lola: 11461200 markings, 80355672 edges, 68054 markings/sec, 160 secs
lola: 11797018 markings, 82780644 edges, 67164 markings/sec, 165 secs
lola: 12127423 markings, 85097155 edges, 66081 markings/sec, 170 secs
lola: 12481818 markings, 87723957 edges, 70879 markings/sec, 175 secs
lola: 12868797 markings, 90238616 edges, 77396 markings/sec, 180 secs
lola: 13213525 markings, 92744153 edges, 68946 markings/sec, 185 secs
lola: 13552469 markings, 95198994 edges, 67789 markings/sec, 190 secs
lola: 13887508 markings, 97539894 edges, 67008 markings/sec, 195 secs
lola: 14224719 markings, 99998627 edges, 67442 markings/sec, 200 secs
lola: 14595826 markings, 102574765 edges, 74221 markings/sec, 205 secs
lola: 14960417 markings, 105042766 edges, 72918 markings/sec, 210 secs
lola: 15307777 markings, 107557972 edges, 69472 markings/sec, 215 secs
lola: 15646944 markings, 110021837 edges, 67833 markings/sec, 220 secs
lola: 15986414 markings, 112405093 edges, 67894 markings/sec, 225 secs
lola: 16318086 markings, 114804394 edges, 66334 markings/sec, 230 secs
lola: 16678660 markings, 117506336 edges, 72115 markings/sec, 235 secs
lola: 17036931 markings, 119734845 edges, 71654 markings/sec, 240 secs
lola: 17386480 markings, 122272122 edges, 69910 markings/sec, 245 secs
lola: 17730687 markings, 124755605 edges, 68841 markings/sec, 250 secs
lola: 18068415 markings, 127182823 edges, 67546 markings/sec, 255 secs
lola: 18421623 markings, 129689379 edges, 70642 markings/sec, 260 secs
lola: 18786356 markings, 132411332 edges, 72947 markings/sec, 265 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: 19062430 markings, 134398627 edges
lola: subprocess 12 will run for 764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= p30 + p31) R ((p30 + p31 <= 0) OR F ((p0 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((1 <= p30 + p31) R ((p30 + p31 <= 0) OR F ((p0 <= 1)))))))
lola: processed formula length: 68
lola: 105 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: ========================================
lola: 876381 markings, 3867744 edges, 175276 markings/sec, 0 secs
lola: 1626526 markings, 8123717 edges, 150029 markings/sec, 5 secs
lola: 2380441 markings, 12286146 edges, 150783 markings/sec, 10 secs
lola: 3107813 markings, 16447554 edges, 145474 markings/sec, 15 secs
lola: 3829797 markings, 20515418 edges, 144397 markings/sec, 20 secs
lola: 4549212 markings, 24578824 edges, 143883 markings/sec, 25 secs
lola: 5245940 markings, 28771933 edges, 139346 markings/sec, 30 secs
lola: 5963521 markings, 32882189 edges, 143516 markings/sec, 35 secs
lola: 6674998 markings, 36852710 edges, 142295 markings/sec, 40 secs
lola: 7359513 markings, 41032460 edges, 136903 markings/sec, 45 secs
lola: 8069790 markings, 45021075 edges, 142055 markings/sec, 50 secs
lola: 8752217 markings, 49143651 edges, 136485 markings/sec, 55 secs
lola: 9459514 markings, 53158880 edges, 141459 markings/sec, 60 secs
lola: 10142884 markings, 57340262 edges, 136674 markings/sec, 65 secs
lola: 10848850 markings, 61287675 edges, 141193 markings/sec, 70 secs
lola: 11532156 markings, 65543836 edges, 136661 markings/sec, 75 secs
lola: 12251688 markings, 69396713 edges, 143906 markings/sec, 80 secs
lola: 12914800 markings, 73656024 edges, 132622 markings/sec, 85 secs
lola: 13583229 markings, 77744691 edges, 133686 markings/sec, 90 secs
lola: 14299096 markings, 81697125 edges, 143173 markings/sec, 95 secs
lola: 14970810 markings, 85971522 edges, 134343 markings/sec, 100 secs
lola: 15645393 markings, 90005756 edges, 134917 markings/sec, 105 secs
lola: 16358064 markings, 94017841 edges, 142534 markings/sec, 110 secs
lola: 17028438 markings, 98309009 edges, 134075 markings/sec, 115 secs
lola: 17690421 markings, 102421972 edges, 132397 markings/sec, 120 secs
lola: 18424785 markings, 106328962 edges, 146873 markings/sec, 125 secs
lola: 19073161 markings, 110593141 edges, 129675 markings/sec, 130 secs
lola: 19747220 markings, 114858597 edges, 134812 markings/sec, 135 secs
lola: 20467033 markings, 118732760 edges, 143963 markings/sec, 140 secs
lola: 21137176 markings, 122886524 edges, 134029 markings/sec, 145 secs
lola: 21783563 markings, 127082529 edges, 129277 markings/sec, 150 secs
lola: 22453788 markings, 131347135 edges, 134045 markings/sec, 155 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: 22848893 markings, 133719316 edges
lola: ========================================
lola: subprocess 13 will run for 965 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p27 + p28 + 1 <= p30 + p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p27 + p28 + 1 <= p30 + p31))))
lola: processed formula length: 40
lola: 105 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: 254 markings, 255 edges
lola: ========================================
lola: subprocess 14 will run for 1448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (F ((p54 + 1 <= p55)) AND G (((1 <= p0) OR ((1 <= p0) AND (1 <= p27 + p28))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= p0) AND (F ((p54 + 1 <= p55)) AND G (((1 <= p0) OR ((1 <= p0) AND (1 <= p27 + p28))))))))
lola: processed formula length: 103
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p3 + p4 + 1 <= p0) AND (p32 + 1 <= p2)) U (((p3 + p4 + 1 <= p0)) U (p2 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p3 + p4 + 1 <= p0) AND (p32 + 1 <= p2)) U (((p3 + p4 + 1 <= p0)) U (p2 <= p32))))
lola: processed formula length: 87
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no yes no no yes no no yes no no
lola:
preliminary result: yes yes yes yes no yes no yes no no yes no no yes no no
lola: ========================================
lola: memory consumption: 94288 KB
lola: time consumption: 674 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589301074667

--------------------
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-V20P20N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is BridgeAndVehicles-COL-V20P20N20, 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 r030-oct2-158897741100045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;