About the Execution of 2019-Gold for BridgeAndVehicles-PT-V20P10N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5076.640 | 708341.00 | 721268.00 | 122.50 | TTFTFFFTFTFFFFTT | normal |
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-158897741200079.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-PT-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-oct2-158897741200079
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.0K Mar 26 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K Mar 25 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 275K Mar 25 20:52 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 6.4K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 142K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 25 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K Mar 25 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 215K Mar 25 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-PT-V20P10N20-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-15
=== Now, execution of the tool begins
BK_START 1589305303169
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N20 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V20P10N20-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P10N20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2862
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P10N20
{
"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 17:41:43 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": 160
},
"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": 160
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((G ((1 <= CHOIX_1 + CHOIX_2)) OR (G (((1 <= CHOIX_1 + CHOIX_2) OR X (G ((SORTI_A <= SUR_PONT_B))))) AND F (G ((1 <= CHOIX_1 + CHOIX_2))))))",
"processed_size": 142,
"rewrites": 160
},
"result":
{
"edges": 167,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((ROUTE_A <= 1))))",
"processed_size": 26,
"rewrites": 160
},
"result":
{
"edges": 25048482,
"markings": 7860979,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 289
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (X (G ((F ((G ((VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)) OR (G ((ROUTE_B <= 0)) AND (VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)))) AND ((ROUTE_B <= 0) OR G ((ATTENTE_B + 1 <= VIDANGE_1 + VIDANGE_2))))))))",
"processed_size": 222,
"rewrites": 160
},
"result":
{
"edges": 267568162,
"markings": 28394292,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F (((ROUTE_A <= SORTI_A) OR X ((ROUTE_A <= SORTI_A))))))",
"processed_size": 62,
"rewrites": 160
},
"result":
{
"edges": 54850749,
"markings": 12679005,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 314
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"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": "(SUR_PONT_B + 1 <= SORTI_A)",
"processed_size": 27,
"rewrites": 162
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B))))",
"processed_size": 56,
"rewrites": 160
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((CHOIX_2 <= SUR_PONT_A)) U ((CHOIX_2 <= SUR_PONT_A) AND (ATTENTE_A <= CAPACITE))))",
"processed_size": 89,
"rewrites": 160
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (G (((COMPTEUR_8 <= 0) OR (CHOIX_2 <= SUR_PONT_A)))))",
"processed_size": 58,
"rewrites": 160
},
"result":
{
"edges": 166,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((SUR_PONT_B <= ROUTE_B)))",
"processed_size": 31,
"rewrites": 162
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 449
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((X ((SUR_PONT_B <= ROUTE_A)) AND G ((SUR_PONT_A <= ROUTE_A))))))",
"processed_size": 73,
"rewrites": 160
},
"result":
{
"edges": 221936410,
"markings": 38559737,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((SUR_PONT_A <= CAPACITE) U X (F ((X ((CHOIX_1 + 1 <= ATTENTE_A)) OR F ((G ((ROUTE_A <= 1)) OR ((ATTENTE_A <= CHOIX_1) AND (ROUTE_A <= 1)))))))))",
"processed_size": 148,
"rewrites": 160
},
"result":
{
"edges": 46381,
"markings": 12691,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 577
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((ATTENTE_A + 1 <= CAPACITE)))",
"processed_size": 35,
"rewrites": 162
},
"result":
{
"edges": 10,
"markings": 11,
"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": 721
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((SORTI_A + 1 <= CAPACITE))))",
"processed_size": 37,
"rewrites": 160
},
"result":
{
"edges": 168,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 962
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (((2 <= ROUTE_A) OR G ((1 <= VIDANGE_1)))))",
"processed_size": 48,
"rewrites": 160
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1443
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((ROUTE_B <= 0) AND ((1 <= ROUTE_B) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND F ((1 <= ROUTE_B))))) U (1 <= SORTI_B)))",
"processed_size": 122,
"rewrites": 160
},
"result":
{
"edges": 169,
"markings": 169,
"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": 2886
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2886
},
"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": "(1 <= SORTI_A)",
"processed_size": 14,
"rewrites": 160
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 42816,
"runtime": 684.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F((** OR X(**))))) : (A(F(**)) AND A(X(F(*)))) : A((G(**) OR (G((** OR X(G(**)))) AND F(G(**))))) : A(X(F(*))) : A(X(X(G((F((G(*) OR (G(*) AND *))) AND (* OR G(*))))))) : A(F(G(*))) : (** AND A((** OR G(**)))) : TRUE : A(((* AND (** OR (G(**) AND F(**)))) U **)) : A(F((** OR G(**)))) : FALSE : (A(X(G((* OR **)))) AND A((F(**) U **))) : (A(G(**)) AND A(X(G(*)))) : A(G(*)) : A(F(G((X(**) AND G(**))))) : A((** U X(F((X(*) OR F((G(*) OR (* AND *))))))))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "yes yes no yes no no no yes no yes no no no no yes yes ",
"value": "yes yes no yes no no no yes no yes no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: (VIDANGE_1 + VIDANGE_2 <= NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9)
lola: after: (VIDANGE_1 + VIDANGE_2 <= 1)
lola: LP says that atomic proposition is always true: (VIDANGE_1 + VIDANGE_2 <= 1)
lola: LP says that atomic proposition is always false: (3 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (CHOIX_1 + CHOIX_2 <= NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9)
lola: after: (CHOIX_1 + CHOIX_2 <= 1)
lola: LP says that atomic proposition is always true: (CHOIX_1 + CHOIX_2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20 <= SORTI_A)
lola: after: (1 <= SORTI_A)
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 <= ROUTE_A)
lola: after: (1 <= ROUTE_A)
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_B <= NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20)
lola: after: (SUR_PONT_B <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_B <= NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20)
lola: after: (SUR_PONT_B <= 1)
lola: LP says that atomic proposition is always false: (3 <= CONTROLEUR_1)
lola: LP says that atomic proposition is always false: (3 <= CONTROLEUR_1)
lola: A (G ((F (((SORTI_A + 1 <= ROUTE_A) U ((ROUTE_A <= SORTI_A) OR X ((ROUTE_A <= SORTI_A))))) OR F ((2 <= VIDANGE_1 + VIDANGE_2))))) : A (((F ((SORTI_A <= SUR_PONT_B)) AND X ((0 <= ROUTE_A))) AND NOT(G (X ((ROUTE_B <= CONTROLEUR_1 + CONTROLEUR_2)))))) : A ((G (((1 <= CHOIX_1 + CHOIX_2) OR G (((G ((SUR_PONT_A <= ATTENTE_B)) U (3 <= CONTROLEUR_1 + CONTROLEUR_2)) U X ((SORTI_A <= SUR_PONT_B)))))) U G ((1 <= CHOIX_1 + CHOIX_2)))) : A (F (X ((X (X ((2 <= CHOIX_1 + CHOIX_2))) U NOT((() AND G ((2 <= ROUTE_A)))))))) : A (G (X (NOT(X (F ((G ((F ((1 <= ROUTE_B)) U (CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR ((1 <= ROUTE_B) AND F ((VIDANGE_1 + VIDANGE_2 <= ATTENTE_B)))))))))) : A (F (X (G (NOT(G (F ((CAPACITE <= SORTI_A)))))))) : A ((((1 <= SORTI_A) OR F (((3 <= VIDANGE_1 + VIDANGE_2) OR X ((3 <= VIDANGE_1 + VIDANGE_2))))) AND ((ROUTE_A <= 0) OR G ((CAPACITE <= ATTENTE_B))))) : A (G (((0 <= CHOIX_1 + CHOIX_2) OR ((0 <= CHOIX_1 + CHOIX_2) AND ((SUR_PONT_B <= 1) OR G ((SUR_PONT_B <= 1))))))) : A ((NOT(((1 <= ROUTE_B) OR NOT((G ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= ROUTE_B))))) U ((1 <= SORTI_B) AND F ((1 <= SORTI_B))))) : A ((F ((2 <= ROUTE_A)) OR X (G (((ROUTE_A <= 1) U F (G ((1 <= VIDANGE_1)))))))) : A ((NOT(G ((ROUTE_B + 1 <= ROUTE_A))) AND (G (NOT(G ((3 <= CONTROLEUR_1)))) U X (X (((ATTENTE_B <= CONTROLEUR_1) U (3 <= CONTROLEUR_1))))))) : A ((NOT(F ((X ((1 <= COMPTEUR_8)) AND NOT(X ((CHOIX_2 <= SUR_PONT_A)))))) AND (F ((CHOIX_2 <= SUR_PONT_A)) U ((CHOIX_2 <= SUR_PONT_A) AND (ATTENTE_A <= CAPACITE))))) : A (G ((G ((SUR_PONT_B <= ROUTE_B)) AND X (NOT(F (((COMPTEUR_2 <= ATTENTE_A) OR (ATTENTE_A <= 1)))))))) : A (NOT(F ((F ((COMPTEUR_9 <= NB_ATTENTE_B_15)) U (CAPACITE <= ATTENTE_A))))) : A (F (NOT(F (NOT(X (G ((X ((SUR_PONT_B <= ROUTE_A)) AND G ((SUR_PONT_A <= ROUTE_A)))))))))) : A (((SUR_PONT_A <= CAPACITE) U NOT(G (X (G ((X ((ATTENTE_A <= CHOIX_1)) AND G (((CHOIX_1 + 1 <= ATTENTE_A) U (2 <= ROUTE_A))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:497
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 160 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: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= CHOIX_1 + CHOIX_2)) OR (G (((1 <= CHOIX_1 + CHOIX_2) OR X (G ((SORTI_A <= SUR_PONT_B))))) AND F (G ((1 <= CHOIX_1 + CHOIX_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((1 <= CHOIX_1 + CHOIX_2)) OR (G (((1 <= CHOIX_1 + CHOIX_2) OR X (G ((SORTI_A <= SUR_PONT_B))))) AND F (G ((1 <= CHOIX_1 + CHOIX_2))))))
lola: processed formula length: 142
lola: 160 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 167 markings, 167 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((ROUTE_A <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((ROUTE_A <= 1))))
lola: processed formula length: 26
lola: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1079156 markings, 3222524 edges, 215831 markings/sec, 0 secs
lola: 2092719 markings, 6465781 edges, 202713 markings/sec, 5 secs
lola: 3074037 markings, 9585562 edges, 196264 markings/sec, 10 secs
lola: 4049913 markings, 12685221 edges, 195175 markings/sec, 15 secs
lola: 5021748 markings, 15779351 edges, 194367 markings/sec, 20 secs
lola: 5978917 markings, 18892495 edges, 191434 markings/sec, 25 secs
lola: 6946373 markings, 22052197 edges, 193491 markings/sec, 30 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: 7860979 markings, 25048482 edges
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((F ((G ((VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)) OR (G ((ROUTE_B <= 0)) AND (VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)))) AND ((ROUTE_B <= 0) OR G ((ATTENTE_B + 1 <= VIDANGE_1 + VIDANGE_2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F ((G ((VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)) OR (G ((ROUTE_B <= 0)) AND (VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2)))) AND ((ROUTE_B <= 0) OR G ((ATTENTE_B + 1 <= VIDANGE_1 + VIDANGE_2))))))))
lola: processed formula length: 222
lola: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 611814 markings, 5274952 edges, 122363 markings/sec, 0 secs
lola: 1197613 markings, 10529010 edges, 117160 markings/sec, 5 secs
lola: 1802249 markings, 15984924 edges, 120927 markings/sec, 10 secs
lola: 2384974 markings, 21329718 edges, 116545 markings/sec, 15 secs
lola: 2964737 markings, 26599912 edges, 115953 markings/sec, 20 secs
lola: 3548799 markings, 31973244 edges, 116812 markings/sec, 25 secs
lola: 4112249 markings, 37208551 edges, 112690 markings/sec, 30 secs
lola: 4687851 markings, 42451507 edges, 115120 markings/sec, 35 secs
lola: 5273692 markings, 47786904 edges, 117168 markings/sec, 40 secs
lola: 5839512 markings, 53134352 edges, 113164 markings/sec, 45 secs
lola: 6410346 markings, 58371109 edges, 114167 markings/sec, 50 secs
lola: 7002628 markings, 63775282 edges, 118456 markings/sec, 55 secs
lola: 7539203 markings, 68911170 edges, 107315 markings/sec, 60 secs
lola: 8140160 markings, 74334909 edges, 120191 markings/sec, 65 secs
lola: 8673613 markings, 79478250 edges, 106691 markings/sec, 70 secs
lola: 9278112 markings, 84918609 edges, 120900 markings/sec, 75 secs
lola: 9812483 markings, 90055617 edges, 106874 markings/sec, 80 secs
lola: 10390064 markings, 95470606 edges, 115516 markings/sec, 85 secs
lola: 10941443 markings, 100532750 edges, 110276 markings/sec, 90 secs
lola: 11483466 markings, 105678571 edges, 108405 markings/sec, 95 secs
lola: 12024475 markings, 110863133 edges, 108202 markings/sec, 100 secs
lola: 12578306 markings, 116036071 edges, 110766 markings/sec, 105 secs
lola: 13119606 markings, 121141090 edges, 108260 markings/sec, 110 secs
lola: 13661637 markings, 126332658 edges, 108406 markings/sec, 115 secs
lola: 14193426 markings, 131493707 edges, 106358 markings/sec, 120 secs
lola: 14751968 markings, 136632921 edges, 111708 markings/sec, 125 secs
lola: 15288064 markings, 141726704 edges, 107219 markings/sec, 130 secs
lola: 15833056 markings, 146940665 edges, 108998 markings/sec, 135 secs
lola: 16370214 markings, 152144035 edges, 107432 markings/sec, 140 secs
lola: 16922133 markings, 157293746 edges, 110384 markings/sec, 145 secs
lola: 17465027 markings, 162433080 edges, 108579 markings/sec, 150 secs
lola: 18013901 markings, 167716349 edges, 109775 markings/sec, 155 secs
lola: 18558993 markings, 172968644 edges, 109018 markings/sec, 160 secs
lola: 19100736 markings, 178258887 edges, 108349 markings/sec, 165 secs
lola: 19661318 markings, 183418654 edges, 112116 markings/sec, 170 secs
lola: 20207360 markings, 188636510 edges, 109208 markings/sec, 175 secs
lola: 20755834 markings, 193918394 edges, 109695 markings/sec, 180 secs
lola: 21291909 markings, 199122091 edges, 107215 markings/sec, 185 secs
lola: 21824365 markings, 204333339 edges, 106491 markings/sec, 190 secs
lola: 22357752 markings, 209263449 edges, 106677 markings/sec, 195 secs
lola: 22875004 markings, 214203945 edges, 103450 markings/sec, 200 secs
lola: 23398351 markings, 219233615 edges, 104669 markings/sec, 205 secs
lola: 23952092 markings, 224617176 edges, 110748 markings/sec, 210 secs
lola: 24504229 markings, 230004760 edges, 110427 markings/sec, 215 secs
lola: 25065123 markings, 235404586 edges, 112179 markings/sec, 220 secs
lola: 25622922 markings, 240617072 edges, 111560 markings/sec, 225 secs
lola: 26165187 markings, 245816754 edges, 108453 markings/sec, 230 secs
lola: 26703186 markings, 251023105 edges, 107600 markings/sec, 235 secs
lola: 27260857 markings, 256467543 edges, 111534 markings/sec, 240 secs
lola: 27805714 markings, 261818290 edges, 108971 markings/sec, 245 secs
lola: 28358868 markings, 267209356 edges, 110631 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28394292 markings, 267568162 edges
lola: ========================================
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((ROUTE_A <= SORTI_A) OR X ((ROUTE_A <= SORTI_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((ROUTE_A <= SORTI_A) OR X ((ROUTE_A <= SORTI_A))))))
lola: processed formula length: 62
lola: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1086379 markings, 3386167 edges, 217276 markings/sec, 0 secs
lola: 2034023 markings, 6403987 edges, 189529 markings/sec, 5 secs
lola: 3018289 markings, 9595100 edges, 196853 markings/sec, 10 secs
lola: 4001178 markings, 12867213 edges, 196578 markings/sec, 15 secs
lola: 4859207 markings, 16404271 edges, 171606 markings/sec, 20 secs
lola: 5631947 markings, 20382682 edges, 154548 markings/sec, 25 secs
lola: 6387149 markings, 24350030 edges, 151040 markings/sec, 30 secs
lola: 7159963 markings, 28105478 edges, 154563 markings/sec, 35 secs
lola: 7964605 markings, 31747056 edges, 160928 markings/sec, 40 secs
lola: 8754699 markings, 35473152 edges, 158019 markings/sec, 45 secs
lola: 9541443 markings, 39247361 edges, 157349 markings/sec, 50 secs
lola: 10329300 markings, 42996033 edges, 157571 markings/sec, 55 secs
lola: 11116383 markings, 46799841 edges, 157417 markings/sec, 60 secs
lola: 11902292 markings, 50699373 edges, 157182 markings/sec, 65 secs
lola: 12656768 markings, 54703144 edges, 150895 markings/sec, 70 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: 12679005 markings, 54850749 edges
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((SORTI_A <= SUR_PONT_B))) AND A (X (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((SORTI_A <= SUR_PONT_B)))
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: (SUR_PONT_B + 1 <= SORTI_A)
lola: processed formula length: 27
lola: 162 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B))))
lola: processed formula length: 56
lola: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (((COMPTEUR_8 <= 0) OR (CHOIX_2 <= SUR_PONT_A))))) AND A ((F ((CHOIX_2 <= SUR_PONT_A)) U ((CHOIX_2 <= SUR_PONT_A) AND (ATTENTE_A <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((CHOIX_2 <= SUR_PONT_A)) U ((CHOIX_2 <= SUR_PONT_A) AND (ATTENTE_A <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((CHOIX_2 <= SUR_PONT_A)) U ((CHOIX_2 <= SUR_PONT_A) AND (ATTENTE_A <= CAPACITE))))
lola: processed formula length: 89
lola: 160 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((COMPTEUR_8 <= 0) OR (CHOIX_2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((COMPTEUR_8 <= 0) OR (CHOIX_2 <= SUR_PONT_A)))))
lola: processed formula length: 58
lola: 160 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: 166 markings, 166 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((SUR_PONT_B <= ROUTE_B))) AND A (X (G (((ATTENTE_A + 1 <= COMPTEUR_2) AND (2 <= ATTENTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SUR_PONT_B <= ROUTE_B)))
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 ((SUR_PONT_B <= ROUTE_B)))
lola: processed formula length: 31
lola: 162 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (ROUTE_B + 1 <= SUR_PONT_B)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X ((SUR_PONT_B <= ROUTE_A)) AND G ((SUR_PONT_A <= ROUTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X ((SUR_PONT_B <= ROUTE_A)) AND G ((SUR_PONT_A <= ROUTE_A))))))
lola: processed formula length: 73
lola: 160 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 812432 markings, 4560366 edges, 162486 markings/sec, 0 secs
lola: 1599373 markings, 8912749 edges, 157388 markings/sec, 5 secs
lola: 2348747 markings, 13262315 edges, 149875 markings/sec, 10 secs
lola: 3141224 markings, 17507722 edges, 158495 markings/sec, 15 secs
lola: 3911742 markings, 21851623 edges, 154104 markings/sec, 20 secs
lola: 4669031 markings, 26149696 edges, 151458 markings/sec, 25 secs
lola: 5435408 markings, 30463011 edges, 153275 markings/sec, 30 secs
lola: 6155040 markings, 34821341 edges, 143926 markings/sec, 35 secs
lola: 6892139 markings, 39238859 edges, 147420 markings/sec, 40 secs
lola: 7679954 markings, 43488711 edges, 157563 markings/sec, 45 secs
lola: 8434054 markings, 47771480 edges, 150820 markings/sec, 50 secs
lola: 9152045 markings, 52151652 edges, 143598 markings/sec, 55 secs
lola: 9947523 markings, 56369917 edges, 159096 markings/sec, 60 secs
lola: 10633607 markings, 60765177 edges, 137217 markings/sec, 65 secs
lola: 11447226 markings, 64927959 edges, 162724 markings/sec, 70 secs
lola: 12174509 markings, 69115045 edges, 145457 markings/sec, 75 secs
lola: 12904788 markings, 73360211 edges, 146056 markings/sec, 80 secs
lola: 13641966 markings, 77536922 edges, 147436 markings/sec, 85 secs
lola: 14369756 markings, 81747838 edges, 145558 markings/sec, 90 secs
lola: 15100758 markings, 86000260 edges, 146200 markings/sec, 95 secs
lola: 15834164 markings, 90193087 edges, 146681 markings/sec, 100 secs
lola: 16563721 markings, 94385617 edges, 145911 markings/sec, 105 secs
lola: 17280140 markings, 98585774 edges, 143284 markings/sec, 110 secs
lola: 18012084 markings, 102785584 edges, 146389 markings/sec, 115 secs
lola: 18745506 markings, 106973397 edges, 146684 markings/sec, 120 secs
lola: 19470796 markings, 111264632 edges, 145058 markings/sec, 125 secs
lola: 20213300 markings, 115534917 edges, 148501 markings/sec, 130 secs
lola: 20943517 markings, 119685744 edges, 146043 markings/sec, 135 secs
lola: 21679276 markings, 123938609 edges, 147152 markings/sec, 140 secs
lola: 22417286 markings, 128250847 edges, 147602 markings/sec, 145 secs
lola: 23148422 markings, 132508315 edges, 146227 markings/sec, 150 secs
lola: 23898186 markings, 136810740 edges, 149953 markings/sec, 155 secs
lola: 24635713 markings, 141044532 edges, 147505 markings/sec, 160 secs
lola: 25376622 markings, 145362032 edges, 148182 markings/sec, 165 secs
lola: 26098674 markings, 149699479 edges, 144410 markings/sec, 170 secs
lola: 26859238 markings, 153968475 edges, 152113 markings/sec, 175 secs
lola: 27602598 markings, 158227553 edges, 148672 markings/sec, 180 secs
lola: 28334678 markings, 162584841 edges, 146416 markings/sec, 185 secs
lola: 29089611 markings, 166908567 edges, 150987 markings/sec, 190 secs
lola: 29827457 markings, 171254595 edges, 147569 markings/sec, 195 secs
lola: 30576236 markings, 175537633 edges, 149756 markings/sec, 200 secs
lola: 31311458 markings, 179805982 edges, 147044 markings/sec, 205 secs
lola: 32050368 markings, 184125854 edges, 147782 markings/sec, 210 secs
lola: 32797911 markings, 188503042 edges, 149509 markings/sec, 215 secs
lola: 33537682 markings, 192885308 edges, 147954 markings/sec, 220 secs
lola: 34314473 markings, 197225230 edges, 155358 markings/sec, 225 secs
lola: 35056228 markings, 201585014 edges, 148351 markings/sec, 230 secs
lola: 35793114 markings, 205826313 edges, 147377 markings/sec, 235 secs
lola: 36536199 markings, 210268844 edges, 148617 markings/sec, 240 secs
lola: 37286577 markings, 214670639 edges, 150076 markings/sec, 245 secs
lola: 38055153 markings, 219017746 edges, 153715 markings/sec, 250 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: 38559737 markings, 221936410 edges
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((SUR_PONT_A <= CAPACITE) U X (F ((X ((CHOIX_1 + 1 <= ATTENTE_A)) OR F ((G ((ROUTE_A <= 1)) OR ((ATTENTE_A <= CHOIX_1) AND (ROUTE_A <= 1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((SUR_PONT_A <= CAPACITE) U X (F ((X ((CHOIX_1 + 1 <= ATTENTE_A)) OR F ((G ((ROUTE_A <= 1)) OR ((ATTENTE_A <= CHOIX_1) AND (ROUTE_A <= 1)))))))))
lola: processed formula length: 148
lola: 160 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12691 markings, 46381 edges
lola: ========================================
lola: subprocess 11 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ATTENTE_A + 1 <= CAPACITE)))
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:788
lola: processed formula: A (G ((ATTENTE_A + 1 <= CAPACITE)))
lola: processed formula length: 35
lola: 162 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CAPACITE <= ATTENTE_A)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((SORTI_A + 1 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((SORTI_A + 1 <= CAPACITE))))
lola: processed formula length: 37
lola: 160 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: 167 markings, 168 edges
lola: subprocess 13 will run for 962 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= ROUTE_A) OR G ((1 <= VIDANGE_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= ROUTE_A) OR G ((1 <= VIDANGE_1)))))
lola: processed formula length: 48
lola: 160 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: 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 14 will run for 1443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((ROUTE_B <= 0) AND ((1 <= ROUTE_B) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND F ((1 <= ROUTE_B))))) U (1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((ROUTE_B <= 0) AND ((1 <= ROUTE_B) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND F ((1 <= ROUTE_B))))) U (1 <= SORTI_B)))
lola: processed formula length: 122
lola: 160 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: 169 markings, 169 edges
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= SORTI_A) AND A (((ROUTE_A <= 0) OR G ((CAPACITE <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= SORTI_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= SORTI_A)
lola: processed formula length: 14
lola: 160 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no yes no yes no no no no yes yes
lola:
preliminary result: yes yes no yes no no no yes no yes no no no no yes yes
lola: memory consumption: 42816 KB
lola: time consumption: 684 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589306011510
--------------------
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-PT-V20P10N20"
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-PT-V20P10N20, 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-158897741200079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 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 '
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 ;