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-158897741200081.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-V20P10N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-oct2-158897741200081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.7K Mar 26 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 25 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K Mar 25 20:55 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 7.8K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 129K Mar 25 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 376K Mar 25 12:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 2.5M 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-V20P10N50-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-15

=== Now, execution of the tool begins

BK_START 1589306023403

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N50-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1897
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P10N50

{
"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:53:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 220
},
"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": 126
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"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 (F (G ((F ((SUR_PONT_A <= ATTENTE_B)) AND ((SORTI_A <= SUR_PONT_B) OR (X ((SORTI_A <= SUR_PONT_B)) OR (SUR_PONT_A <= ATTENTE_B)))))))",
"processed_size": 135,
"rewrites": 126
},
"result":
{
"edges": 60268953,
"markings": 12260581,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 309
},
"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": 126
},
"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": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((1 <= CAPACITE) OR F ((X (X ((SUR_PONT_B + 1 <= SORTI_A))) AND (((CAPACITE <= 0) OR (SUR_PONT_B + 1 <= SORTI_A)) OR F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)))))))",
"processed_size": 174,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((X (G ((1 <= SORTI_B))) OR (F ((1 <= SUR_PONT_B)) AND X (G ((ROUTE_B <= SUR_PONT_B))))))",
"processed_size": 91,
"rewrites": 126
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 425
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"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 ((VIDANGE_2 + 1 <= CONTROLEUR_2))))",
"processed_size": 43,
"rewrites": 126
},
"result":
{
"edges": 38887,
"markings": 7231,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((CHOIX_1 + 1 <= SUR_PONT_A) OR (COMPTEUR_26 <= 0)) OR (G ((COMPTEUR_26 <= 0)) OR G ((CHOIX_2 <= SUR_PONT_A)))))",
"processed_size": 117,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((ATTENTE_A <= CAPACITE))))",
"processed_size": 35,
"rewrites": 126
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (F ((((CHOIX_2 + 1 <= COMPTEUR_34) OR (CAPACITE + 1 <= SUR_PONT_A)) AND ((2 <= ROUTE_A) AND X (F (((3 <= SUR_PONT_B) OR (COMPTEUR_34 <= CHOIX_2)))))))))",
"processed_size": 159,
"rewrites": 126
},
"result":
{
"edges": 329,
"markings": 328,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 702
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((ATTENTE_B <= 2)))",
"processed_size": 24,
"rewrites": 128
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 936
},
"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": 128
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 1405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "A (((ATTENTE_A <= 1) OR G ((ATTENTE_A + 1 <= COMPTEUR_5))))",
"processed_size": 59,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2810
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((ROUTE_A <= SORTI_A) OR G (F ((ROUTE_A <= SORTI_A)))))",
"processed_size": 58,
"rewrites": 126
},
"result":
{
"edges": 45659534,
"markings": 10577540,
"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"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))",
"processed_size": 76,
"rewrites": 126
},
"result":
{
"edges": 365898180,
"markings": 49736896,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))))",
"processed_size": 110,
"rewrites": 126
},
"result":
{
"edges": 31785918,
"markings": 9080862,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 89500,
"runtime": 1649.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR G(F(**)))) : A((** OR F((X(X(*)) AND (* OR F(*)))))) : A(F(G((F(**) AND (** OR (X(**) OR **)))))) : A(X(TRUE)) : TRUE : TRUE : FALSE : TRUE : A((X(G(**)) OR (F(**) AND X(G(**))))) : (A(X(X(G(**)))) AND A(F(G(*)))) : A(G(*)) : (A((* OR (G(*) OR G(*)))) AND A(X(F(**)))) : A((* OR G(*))) : A(G(*)) : (A(F(G((G(**) OR X(G(*)))))) AND A(X(G((** OR G((G(**) OR X(G(*))))))))) : A(X(F((* AND (** AND X(F(**)))))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "yes yes yes yes yes yes no yes no no no yes yes no yes no ",
"value": "yes yes yes yes yes yes no yes no no no yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: 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: place invariant simplifies atomic proposition
lola: before: (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 <= CAPACITE)
lola: after: (1 <= CAPACITE)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= 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: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (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 <= 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 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50)
lola: after: (0 <= 0)
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: place invariant simplifies atomic proposition
lola: before: (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: (1 <= 0)
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: (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 <= 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: (0 <= 0)
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 (((ROUTE_A <= SORTI_A) OR X (G (((VIDANGE_1 + VIDANGE_2 <= 1) AND F ((ROUTE_A <= SORTI_A))))))) : A (((1 <= CAPACITE) OR F (NOT(G ((X (X ((SORTI_A <= SUR_PONT_B))) OR (((1 <= CAPACITE) AND (SORTI_A <= SUR_PONT_B)) AND G ((ROUTE_B <= CONTROLEUR_1 + CONTROLEUR_2))))))))) : A (X (((3 <= CONTROLEUR_1 + CONTROLEUR_2) OR F (G ((((SORTI_A <= SUR_PONT_B) OR X ((SORTI_A <= SUR_PONT_B))) U (SUR_PONT_A <= ATTENTE_B))))))) : A (F (X (NOT((X ((1 <= CAPACITE)) AND X (G ((2 <= CHOIX_1 + CHOIX_2)))))))) : A (G (((0 <= 0) OR F (NOT((X (G (NOT(X ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))))) OR F ((VIDANGE_1 + VIDANGE_2 <= ATTENTE_B)))))))) : A (NOT(F (NOT(F (G (((1 <= CONTROLEUR_1 + CONTROLEUR_2) U G (())))))))) : A (((X (((SORTI_A <= 0) U (1 <= 0))) AND G ((CAPACITE <= ATTENTE_B))) OR ((3 <= VIDANGE_1 + VIDANGE_2) U X ((3 <= VIDANGE_1 + VIDANGE_2))))) : A ((G ((0 <= CHOIX_1 + CHOIX_2)) OR X ((0 <= 0)))) : A ((G (X ((1 <= SORTI_B))) OR (F ((1 <= SUR_PONT_B)) AND X (G ((ROUTE_B <= SUR_PONT_B)))))) : A (X ((G (X ((NB_ATTENTE_B_18 <= ATTENTE_A))) AND NOT(G (F ((CONTROLEUR_2 <= VIDANGE_2))))))) : A (NOT((NOT(G (F (NOT(F (G ((3 <= CONTROLEUR_1))))))) OR F (((3 <= CONTROLEUR_1) U (3 <= ATTENTE_B)))))) : A ((NOT(((((SUR_PONT_A <= CHOIX_1) AND (1 <= COMPTEUR_26)) AND F ((1 <= COMPTEUR_26))) AND F ((SUR_PONT_A + 1 <= CHOIX_2)))) AND F (X ((ATTENTE_A <= CAPACITE))))) : A (NOT(((2 <= ATTENTE_A) AND F ((COMPTEUR_5 <= ATTENTE_A))))) : A (NOT(F (((CONTROLEUR_2 <= CAPACITE) U (CAPACITE <= ATTENTE_A))))) : A (G (X (((COMPTEUR_38 <= ROUTE_A) U NOT(F ((NOT(G ((SUR_PONT_B <= ROUTE_A))) AND X (F ((ROUTE_A + 1 <= SUR_PONT_B)))))))))) : A (X (F (NOT((((COMPTEUR_34 <= CHOIX_2) AND (SUR_PONT_A <= CAPACITE)) OR NOT(((2 <= ROUTE_A) AND X (F (((3 <= SUR_PONT_B) OR (COMPTEUR_34 <= CHOIX_2)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:118
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 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: 126 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 126 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 251 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: 126 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 270 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: 126 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 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((SUR_PONT_A <= ATTENTE_B)) AND ((SORTI_A <= SUR_PONT_B) OR (X ((SORTI_A <= SUR_PONT_B)) OR (SUR_PONT_A <= ATTENTE_B)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((SUR_PONT_A <= ATTENTE_B)) AND ((SORTI_A <= SUR_PONT_B) OR (X ((SORTI_A <= SUR_PONT_B)) OR (SUR_PONT_A <= ATTENTE_B)))))))
lola: processed formula length: 135
lola: 126 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: 594215 markings, 2471602 edges, 118843 markings/sec, 0 secs
lola: 1114234 markings, 5139625 edges, 104004 markings/sec, 5 secs
lola: 1626691 markings, 7923810 edges, 102491 markings/sec, 10 secs
lola: 2135917 markings, 10718953 edges, 101845 markings/sec, 15 secs
lola: 2627629 markings, 13582669 edges, 98342 markings/sec, 20 secs
lola: 3102256 markings, 16375566 edges, 94925 markings/sec, 25 secs
lola: 3560248 markings, 19137967 edges, 91598 markings/sec, 30 secs
lola: 3998753 markings, 21884884 edges, 87701 markings/sec, 35 secs
lola: 4496497 markings, 24162320 edges, 99549 markings/sec, 40 secs
lola: 4971308 markings, 26518462 edges, 94962 markings/sec, 45 secs
lola: 5468738 markings, 29094655 edges, 99486 markings/sec, 50 secs
lola: 5963871 markings, 31358952 edges, 99027 markings/sec, 55 secs
lola: 6450847 markings, 33670440 edges, 97395 markings/sec, 60 secs
lola: 6954084 markings, 36143447 edges, 100647 markings/sec, 65 secs
lola: 7466105 markings, 38431026 edges, 102404 markings/sec, 70 secs
lola: 7978155 markings, 40928483 edges, 102410 markings/sec, 75 secs
lola: 8488399 markings, 43179444 edges, 102049 markings/sec, 80 secs
lola: 9020926 markings, 45662864 edges, 106505 markings/sec, 85 secs
lola: 9549118 markings, 48046185 edges, 105638 markings/sec, 90 secs
lola: 10093280 markings, 50496470 edges, 108832 markings/sec, 95 secs
lola: 10641301 markings, 52952292 edges, 109604 markings/sec, 100 secs
lola: 11204143 markings, 55471572 edges, 112568 markings/sec, 105 secs
lola: 11768275 markings, 57954200 edges, 112826 markings/sec, 110 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: 12260581 markings, 60268953 edges
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
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: 126 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 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= CAPACITE) OR F ((X (X ((SUR_PONT_B + 1 <= SORTI_A))) AND (((CAPACITE <= 0) OR (SUR_PONT_B + 1 <= SORTI_A)) OR 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 (((1 <= CAPACITE) OR F ((X (X ((SUR_PONT_B + 1 <= SORTI_A))) AND (((CAPACITE <= 0) OR (SUR_PONT_B + 1 <= SORTI_A)) OR F ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)))))))
lola: processed formula length: 174
lola: 126 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= SORTI_B))) OR (F ((1 <= SUR_PONT_B)) AND X (G ((ROUTE_B <= SUR_PONT_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= SORTI_B))) OR (F ((1 <= SUR_PONT_B)) AND X (G ((ROUTE_B <= SUR_PONT_B))))))
lola: processed formula length: 91
lola: 126 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (G ((NB_ATTENTE_B_18 <= ATTENTE_A))))) AND A (F (G ((VIDANGE_2 + 1 <= CONTROLEUR_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((VIDANGE_2 + 1 <= CONTROLEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((VIDANGE_2 + 1 <= CONTROLEUR_2))))
lola: processed formula length: 43
lola: 126 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: 7231 markings, 38887 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((CHOIX_1 + 1 <= SUR_PONT_A) OR (COMPTEUR_26 <= 0)) OR (G ((COMPTEUR_26 <= 0)) OR G ((CHOIX_2 <= SUR_PONT_A))))) AND A (X (F ((ATTENTE_A <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((CHOIX_1 + 1 <= SUR_PONT_A) OR (COMPTEUR_26 <= 0)) OR (G ((COMPTEUR_26 <= 0)) OR G ((CHOIX_2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((CHOIX_1 + 1 <= SUR_PONT_A) OR (COMPTEUR_26 <= 0)) OR (G ((COMPTEUR_26 <= 0)) OR G ((CHOIX_2 <= SUR_PONT_A)))))
lola: processed formula length: 117
lola: 126 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: 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 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((ATTENTE_A <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((ATTENTE_A <= CAPACITE))))
lola: processed formula length: 35
lola: 126 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 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A))))))) AND A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))
lola: processed formula length: 76
lola: 126 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: 407654 markings, 4227450 edges, 81531 markings/sec, 0 secs
lola: 817473 markings, 8200113 edges, 81964 markings/sec, 5 secs
lola: 1223329 markings, 11853360 edges, 81171 markings/sec, 10 secs
lola: 1649347 markings, 15442757 edges, 85204 markings/sec, 15 secs
lola: 2092139 markings, 18986706 edges, 88558 markings/sec, 20 secs
lola: 2515009 markings, 22333157 edges, 84574 markings/sec, 25 secs
lola: 2970840 markings, 25607594 edges, 91166 markings/sec, 30 secs
lola: 3416049 markings, 28938406 edges, 89042 markings/sec, 35 secs
lola: 3857822 markings, 32185968 edges, 88355 markings/sec, 40 secs
lola: 4325764 markings, 35445201 edges, 93588 markings/sec, 45 secs
lola: 4765182 markings, 38628407 edges, 87884 markings/sec, 50 secs
lola: 5244340 markings, 41840807 edges, 95832 markings/sec, 55 secs
lola: 5688239 markings, 44963277 edges, 88780 markings/sec, 60 secs
lola: 6177075 markings, 48179971 edges, 97767 markings/sec, 65 secs
lola: 6623313 markings, 51264309 edges, 89248 markings/sec, 70 secs
lola: 7127570 markings, 54443646 edges, 100851 markings/sec, 75 secs
lola: 7593027 markings, 57613318 edges, 93091 markings/sec, 80 secs
lola: 8076926 markings, 60634984 edges, 96780 markings/sec, 85 secs
lola: 8573118 markings, 63966264 edges, 99238 markings/sec, 90 secs
lola: 9045737 markings, 66873875 edges, 94524 markings/sec, 95 secs
lola: 9520816 markings, 69911787 edges, 95016 markings/sec, 100 secs
lola: 9989487 markings, 73002342 edges, 93734 markings/sec, 105 secs
lola: 10448760 markings, 75977424 edges, 91855 markings/sec, 110 secs
lola: 10966999 markings, 79090327 edges, 103648 markings/sec, 115 secs
lola: 11441192 markings, 82164456 edges, 94839 markings/sec, 120 secs
lola: 11906298 markings, 85149449 edges, 93021 markings/sec, 125 secs
lola: 12426092 markings, 88128163 edges, 103959 markings/sec, 130 secs
lola: 12904278 markings, 91225046 edges, 95637 markings/sec, 135 secs
lola: 13370201 markings, 94152154 edges, 93185 markings/sec, 140 secs
lola: 13877653 markings, 97080933 edges, 101490 markings/sec, 145 secs
lola: 14383067 markings, 100248585 edges, 101083 markings/sec, 150 secs
lola: 14852633 markings, 103226854 edges, 93913 markings/sec, 155 secs
lola: 15322083 markings, 106132665 edges, 93890 markings/sec, 160 secs
lola: 15821468 markings, 109174300 edges, 99877 markings/sec, 165 secs
lola: 16223924 markings, 112532090 edges, 80491 markings/sec, 170 secs
lola: 16658826 markings, 115533698 edges, 86980 markings/sec, 175 secs
lola: 17110705 markings, 118485688 edges, 90376 markings/sec, 180 secs
lola: 17576838 markings, 121467470 edges, 93227 markings/sec, 185 secs
lola: 18051419 markings, 124360902 edges, 94916 markings/sec, 190 secs
lola: 18516886 markings, 127388953 edges, 93093 markings/sec, 195 secs
lola: 18911928 markings, 130852219 edges, 79008 markings/sec, 200 secs
lola: 19338967 markings, 133932923 edges, 85408 markings/sec, 205 secs
lola: 19783612 markings, 137029371 edges, 88929 markings/sec, 210 secs
lola: 20249608 markings, 140058634 edges, 93199 markings/sec, 215 secs
lola: 20725386 markings, 142951853 edges, 95156 markings/sec, 220 secs
lola: 21212895 markings, 145968860 edges, 97502 markings/sec, 225 secs
lola: 21625194 markings, 149340044 edges, 82460 markings/sec, 230 secs
lola: 22029427 markings, 152693511 edges, 80847 markings/sec, 235 secs
lola: 22455339 markings, 155834225 edges, 85182 markings/sec, 240 secs
lola: 22906555 markings, 158924751 edges, 90243 markings/sec, 245 secs
lola: 23364143 markings, 162004643 edges, 91518 markings/sec, 250 secs
lola: 23841413 markings, 164953531 edges, 95454 markings/sec, 255 secs
lola: 24326684 markings, 168106686 edges, 97054 markings/sec, 260 secs
lola: 24769514 markings, 171330424 edges, 88566 markings/sec, 265 secs
lola: 25156507 markings, 174899198 edges, 77399 markings/sec, 270 secs
lola: 25572979 markings, 178190441 edges, 83294 markings/sec, 275 secs
lola: 26014942 markings, 181415890 edges, 88393 markings/sec, 280 secs
lola: 26481756 markings, 184650128 edges, 93363 markings/sec, 285 secs
lola: 26973530 markings, 187733509 edges, 98355 markings/sec, 290 secs
lola: 27470521 markings, 191055366 edges, 99398 markings/sec, 295 secs
lola: 27962959 markings, 194101422 edges, 98488 markings/sec, 300 secs
lola: 28375552 markings, 197860105 edges, 82519 markings/sec, 305 secs
lola: 28778072 markings, 201377897 edges, 80504 markings/sec, 310 secs
lola: 29187635 markings, 204801441 edges, 81913 markings/sec, 315 secs
lola: 29628300 markings, 208105286 edges, 88133 markings/sec, 320 secs
lola: 30094014 markings, 211412410 edges, 93143 markings/sec, 325 secs
lola: 30580746 markings, 214533108 edges, 97346 markings/sec, 330 secs
lola: 31057208 markings, 217915443 edges, 95292 markings/sec, 335 secs
lola: 31562420 markings, 221093975 edges, 101042 markings/sec, 340 secs
lola: 32006749 markings, 224484152 edges, 88866 markings/sec, 345 secs
lola: 32382076 markings, 228281399 edges, 75065 markings/sec, 350 secs
lola: 32793966 markings, 231848003 edges, 82378 markings/sec, 355 secs
lola: 33224472 markings, 235358151 edges, 86101 markings/sec, 360 secs
lola: 33692336 markings, 238740196 edges, 93573 markings/sec, 365 secs
lola: 34178318 markings, 242184074 edges, 97196 markings/sec, 370 secs
lola: 34663957 markings, 245737479 edges, 97128 markings/sec, 375 secs
lola: 35173567 markings, 249091072 edges, 101922 markings/sec, 380 secs
lola: 35683952 markings, 252284804 edges, 102077 markings/sec, 385 secs
lola: 36106834 markings, 255976028 edges, 84576 markings/sec, 390 secs
lola: 36475510 markings, 259842084 edges, 73735 markings/sec, 395 secs
lola: 36888167 markings, 263402527 edges, 82531 markings/sec, 400 secs
lola: 37315359 markings, 266924585 edges, 85438 markings/sec, 405 secs
lola: 37760979 markings, 270558243 edges, 89124 markings/sec, 410 secs
lola: 38226804 markings, 274160507 edges, 93165 markings/sec, 415 secs
lola: 38728095 markings, 277568226 edges, 100258 markings/sec, 420 secs
lola: 39227626 markings, 280878419 edges, 99906 markings/sec, 425 secs
lola: 39709844 markings, 284436845 edges, 96444 markings/sec, 430 secs
lola: 40202618 markings, 287816375 edges, 98555 markings/sec, 435 secs
lola: 40579849 markings, 291719372 edges, 75446 markings/sec, 440 secs
lola: 40959084 markings, 295596357 edges, 75847 markings/sec, 445 secs
lola: 41363634 markings, 299360712 edges, 80910 markings/sec, 450 secs
lola: 41800399 markings, 302987570 edges, 87353 markings/sec, 455 secs
lola: 42258238 markings, 306527714 edges, 91568 markings/sec, 460 secs
lola: 42719479 markings, 310300025 edges, 92248 markings/sec, 465 secs
lola: 43220843 markings, 313833940 edges, 100273 markings/sec, 470 secs
lola: 43724014 markings, 317207066 edges, 100634 markings/sec, 475 secs
lola: 44226830 markings, 320798078 edges, 100563 markings/sec, 480 secs
lola: 44728305 markings, 324344826 edges, 100295 markings/sec, 485 secs
lola: 45129952 markings, 328371585 edges, 80329 markings/sec, 490 secs
lola: 45499947 markings, 332479835 edges, 73999 markings/sec, 495 secs
lola: 45900250 markings, 336379631 edges, 80061 markings/sec, 500 secs
lola: 46318768 markings, 340232686 edges, 83704 markings/sec, 505 secs
lola: 46775561 markings, 343904870 edges, 91359 markings/sec, 510 secs
lola: 47230259 markings, 347694135 edges, 90940 markings/sec, 515 secs
lola: 47735890 markings, 351203082 edges, 101126 markings/sec, 520 secs
lola: 48216158 markings, 355164432 edges, 96054 markings/sec, 525 secs
lola: 48717999 markings, 358853098 edges, 100368 markings/sec, 530 secs
lola: 49229511 markings, 362419275 edges, 102302 markings/sec, 535 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: 49736896 markings, 365898180 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))))
lola: processed formula length: 110
lola: 126 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: 653915 markings, 2158794 edges, 130783 markings/sec, 0 secs
lola: 1281402 markings, 4302258 edges, 125497 markings/sec, 5 secs
lola: 1910401 markings, 6484145 edges, 125800 markings/sec, 10 secs
lola: 2548436 markings, 8707125 edges, 127607 markings/sec, 15 secs
lola: local time limit reached - aborting
lola: lola: caught signal User defined signal 1 - aborting LoLA

preliminary result: unknown yes yes yes yes yes no yes no no unknown yes unknown unknown unknown unknown lola:

preliminary result: unknown yes yes yes yes yes no yes no no unknown yes unknown unknown unknown unknown
lola: memory consumption: 459936 KB
lola: time consumption: 736 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: memory consumption: 459936 KB
lola: time consumption: 736 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes yes yes yes yes no yes no no unknown yes unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes yes yes yes yes no yes no no unknown yes unknown unknown unknown unknown
lola: memory consumption: 89316 KB
lola: time consumption: 740 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((((CHOIX_2 + 1 <= COMPTEUR_34) OR (CAPACITE + 1 <= SUR_PONT_A)) AND ((2 <= ROUTE_A) AND X (F (((3 <= SUR_PONT_B) OR (COMPTEUR_34 <= CHOIX_2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((((CHOIX_2 + 1 <= COMPTEUR_34) OR (CAPACITE + 1 <= SUR_PONT_A)) AND ((2 <= ROUTE_A) AND X (F (((3 <= SUR_PONT_B) OR (COMPTEUR_34 <= CHOIX_2)))))))))
lola: processed formula length: 159
lola: 126 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: 328 markings, 329 edges
lola: ========================================
lola: subprocess 12 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ATTENTE_B <= 2)))
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_B <= 2)))
lola: processed formula length: 24
lola: 128 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: (3 <= ATTENTE_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: 4 markings, 3 edges
lola: subprocess 13 will run for 936 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: 128 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 14 will run for 1405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ATTENTE_A <= 1) OR G ((ATTENTE_A + 1 <= COMPTEUR_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((ATTENTE_A <= 1) OR G ((ATTENTE_A + 1 <= COMPTEUR_5))))
lola: processed formula length: 59
lola: 126 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ROUTE_A <= SORTI_A) OR G (F ((ROUTE_A <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((ROUTE_A <= SORTI_A) OR G (F ((ROUTE_A <= SORTI_A)))))
lola: processed formula length: 58
lola: 126 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: 234694 markings, 673289 edges, 46939 markings/sec, 0 secs
lola: 473980 markings, 1439907 edges, 47857 markings/sec, 5 secs
lola: 729972 markings, 2296610 edges, 51198 markings/sec, 10 secs
lola: 952234 markings, 3013198 edges, 44452 markings/sec, 15 secs
lola: 1166426 markings, 3659608 edges, 42838 markings/sec, 20 secs
lola: 1388220 markings, 4345422 edges, 44359 markings/sec, 25 secs
lola: 1614763 markings, 5056647 edges, 45309 markings/sec, 30 secs
lola: 1867028 markings, 5863241 edges, 50453 markings/sec, 35 secs
lola: 2115836 markings, 6657788 edges, 49762 markings/sec, 40 secs
lola: 2382234 markings, 7524225 edges, 53280 markings/sec, 45 secs
lola: 2650435 markings, 8410809 edges, 53640 markings/sec, 50 secs
lola: 2906555 markings, 9295506 edges, 51224 markings/sec, 55 secs
lola: 3066164 markings, 9817636 edges, 31922 markings/sec, 60 secs
lola: 3233502 markings, 10404903 edges, 33468 markings/sec, 65 secs
lola: 3405178 markings, 11014096 edges, 34335 markings/sec, 70 secs
lola: 3577511 markings, 11668429 edges, 34467 markings/sec, 75 secs
lola: 3755303 markings, 12475510 edges, 35558 markings/sec, 80 secs
lola: 3937573 markings, 13305407 edges, 36454 markings/sec, 85 secs
lola: 4108453 markings, 14059021 edges, 34176 markings/sec, 90 secs
lola: 4300690 markings, 15024553 edges, 38447 markings/sec, 95 secs
lola: 4496591 markings, 16009519 edges, 39180 markings/sec, 100 secs
lola: 4692131 markings, 17130621 edges, 39108 markings/sec, 105 secs
lola: 4887869 markings, 18281024 edges, 39148 markings/sec, 110 secs
lola: 5084626 markings, 19396664 edges, 39351 markings/sec, 115 secs
lola: 5237478 markings, 20166066 edges, 30570 markings/sec, 120 secs
lola: 5402671 markings, 20874241 edges, 33039 markings/sec, 125 secs
lola: 5561743 markings, 21660686 edges, 31814 markings/sec, 130 secs
lola: 5723559 markings, 22298006 edges, 32363 markings/sec, 135 secs
lola: 5903885 markings, 23253708 edges, 36065 markings/sec, 140 secs
lola: 6054133 markings, 23799769 edges, 30050 markings/sec, 145 secs
lola: 6228224 markings, 24596680 edges, 34818 markings/sec, 150 secs
lola: 6401233 markings, 25510331 edges, 34602 markings/sec, 155 secs
lola: 6561977 markings, 26090389 edges, 32149 markings/sec, 160 secs
lola: 6743617 markings, 26984899 edges, 36328 markings/sec, 165 secs
lola: 6919720 markings, 27905346 edges, 35221 markings/sec, 170 secs
lola: 7082405 markings, 28485858 edges, 32537 markings/sec, 175 secs
lola: 7267437 markings, 29361730 edges, 37006 markings/sec, 180 secs
lola: 7459687 markings, 30496279 edges, 38450 markings/sec, 185 secs
lola: 7627220 markings, 31053110 edges, 33507 markings/sec, 190 secs
lola: 7811112 markings, 31875571 edges, 36778 markings/sec, 195 secs
lola: 7995576 markings, 32855721 edges, 36893 markings/sec, 200 secs
lola: 8187045 markings, 33836623 edges, 38294 markings/sec, 205 secs
lola: 8364783 markings, 34483427 edges, 35548 markings/sec, 210 secs
lola: 8552182 markings, 35373444 edges, 37480 markings/sec, 215 secs
lola: 8756031 markings, 36561901 edges, 40770 markings/sec, 220 secs
lola: 8939627 markings, 37435380 edges, 36719 markings/sec, 225 secs
lola: 9127776 markings, 38133174 edges, 37630 markings/sec, 230 secs
lola: 9321824 markings, 39061463 edges, 38810 markings/sec, 235 secs
lola: 9515154 markings, 40140810 edges, 38666 markings/sec, 240 secs
lola: 9715449 markings, 41288712 edges, 40059 markings/sec, 245 secs
lola: 9913279 markings, 41998461 edges, 39566 markings/sec, 250 secs
lola: 10105626 markings, 42877636 edges, 38469 markings/sec, 255 secs
lola: 10299867 markings, 43897756 edges, 38848 markings/sec, 260 secs
lola: 10502651 markings, 45126303 edges, 40557 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: 10577540 markings, 45659534 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A))))))) AND A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))
lola: processed formula length: 76
lola: 126 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: 425985 markings, 4382798 edges, 85197 markings/sec, 0 secs
lola: 850697 markings, 8510921 edges, 84942 markings/sec, 5 secs
lola: 1268867 markings, 12218626 edges, 83634 markings/sec, 10 secs
lola: 1686010 markings, 15745528 edges, 83429 markings/sec, 15 secs
lola: 2130673 markings, 19306701 edges, 88933 markings/sec, 20 secs
lola: 2578695 markings, 22830821 edges, 89604 markings/sec, 25 secs
lola: 3036071 markings, 26160146 edges, 91475 markings/sec, 30 secs
lola: 3498667 markings, 29495149 edges, 92519 markings/sec, 35 secs
lola: 3938451 markings, 32785774 edges, 87957 markings/sec, 40 secs
lola: 4411805 markings, 36048736 edges, 94671 markings/sec, 45 secs
lola: 4867589 markings, 39262072 edges, 91157 markings/sec, 50 secs
lola: 5339417 markings, 42538472 edges, 94366 markings/sec, 55 secs
lola: 5808166 markings, 45621572 edges, 93750 markings/sec, 60 secs
lola: 6279902 markings, 48903251 edges, 94347 markings/sec, 65 secs
lola: 6736402 markings, 51966043 edges, 91300 markings/sec, 70 secs
lola: 7236422 markings, 55185906 edges, 100004 markings/sec, 75 secs
lola: 7693982 markings, 58321004 edges, 91512 markings/sec, 80 secs
lola: 8205279 markings, 61535780 edges, 102259 markings/sec, 85 secs
lola: 8695863 markings, 64742541 edges, 98117 markings/sec, 90 secs
lola: 9174536 markings, 67727068 edges, 95735 markings/sec, 95 secs
lola: 9665291 markings, 70851176 edges, 98151 markings/sec, 100 secs
lola: 10140188 markings, 73981351 edges, 94979 markings/sec, 105 secs
lola: 10633941 markings, 76889344 edges, 98751 markings/sec, 110 secs
lola: 11137101 markings, 80125317 edges, 100632 markings/sec, 115 secs
lola: 11612278 markings, 83268020 edges, 95035 markings/sec, 120 secs
lola: 12094837 markings, 86133101 edges, 96512 markings/sec, 125 secs
lola: 12612522 markings, 89314513 edges, 103537 markings/sec, 130 secs
lola: 13092110 markings, 92411481 edges, 95918 markings/sec, 135 secs
lola: 13563609 markings, 95383090 edges, 94300 markings/sec, 140 secs
lola: 14091538 markings, 98386810 edges, 105586 markings/sec, 145 secs
lola: 14577422 markings, 101448202 edges, 97177 markings/sec, 150 secs
lola: 15052880 markings, 104495181 edges, 95092 markings/sec, 155 secs
lola: 15531931 markings, 107345170 edges, 95810 markings/sec, 160 secs
lola: 15999084 markings, 110774389 edges, 93431 markings/sec, 165 secs
lola: 16422750 markings, 113924597 edges, 84733 markings/sec, 170 secs
lola: 16865833 markings, 116913879 edges, 88617 markings/sec, 175 secs
lola: 17326975 markings, 119861702 edges, 92228 markings/sec, 180 secs
lola: 17795408 markings, 122818235 edges, 93687 markings/sec, 185 secs
lola: 18281004 markings, 125737509 edges, 97119 markings/sec, 190 secs
lola: 18693837 markings, 129072133 edges, 82567 markings/sec, 195 secs
lola: 19107114 markings, 132314927 edges, 82655 markings/sec, 200 secs
lola: 19545866 markings, 135357980 edges, 87750 markings/sec, 205 secs
lola: 20000224 markings, 138454474 edges, 90872 markings/sec, 210 secs
lola: 20472998 markings, 141444567 edges, 94555 markings/sec, 215 secs
lola: 20953802 markings, 144367130 edges, 96161 markings/sec, 220 secs
lola: 21426289 markings, 147404505 edges, 94497 markings/sec, 225 secs
lola: 21816151 markings, 150946418 edges, 77972 markings/sec, 230 secs
lola: 22236885 markings, 154155978 edges, 84147 markings/sec, 235 secs
lola: 22669909 markings, 157363799 edges, 86605 markings/sec, 240 secs
lola: 23136157 markings, 160469685 edges, 93250 markings/sec, 245 secs
lola: 23606341 markings, 163558778 edges, 94037 markings/sec, 250 secs
lola: 24097351 markings, 166533531 edges, 98202 markings/sec, 255 secs
lola: 24571204 markings, 169507509 edges, 94771 markings/sec, 260 secs
lola: 24965805 markings, 173206945 edges, 78920 markings/sec, 265 secs
lola: 25377462 markings, 176567631 edges, 82331 markings/sec, 270 secs
lola: 25798687 markings, 179881584 edges, 84245 markings/sec, 275 secs
lola: 26259690 markings, 183092882 edges, 92201 markings/sec, 280 secs
lola: 26727465 markings, 186289660 edges, 93555 markings/sec, 285 secs
lola: 27218510 markings, 189350302 edges, 98209 markings/sec, 290 secs
lola: 27697605 markings, 192598550 edges, 95819 markings/sec, 295 secs
lola: 28178073 markings, 195746405 edges, 96094 markings/sec, 300 secs
lola: 28550336 markings, 199490524 edges, 74453 markings/sec, 305 secs
lola: 28956373 markings, 202937327 edges, 81207 markings/sec, 310 secs
lola: 29384583 markings, 206287715 edges, 85642 markings/sec, 315 secs
lola: 29837095 markings, 209598390 edges, 90502 markings/sec, 320 secs
lola: 30316034 markings, 212712802 edges, 95788 markings/sec, 325 secs
lola: 30800903 markings, 216153966 edges, 96974 markings/sec, 330 secs
lola: 31295903 markings, 219241104 edges, 99000 markings/sec, 335 secs
lola: 31786682 markings, 222410622 edges, 98156 markings/sec, 340 secs
lola: 32178995 markings, 226253489 edges, 78463 markings/sec, 345 secs
lola: 32570856 markings, 229871589 edges, 78372 markings/sec, 350 secs
lola: 32983295 markings, 233372244 edges, 82488 markings/sec, 355 secs
lola: 33424940 markings, 236730448 edges, 88329 markings/sec, 360 secs
lola: 33884809 markings, 240092592 edges, 91974 markings/sec, 365 secs
lola: 34349695 markings, 243600711 edges, 92977 markings/sec, 370 secs
lola: 34852661 markings, 246834500 edges, 100593 markings/sec, 375 secs
lola: 35341854 markings, 250027751 edges, 97839 markings/sec, 380 secs
lola: 35835527 markings, 253396903 edges, 98735 markings/sec, 385 secs
lola: 36223374 markings, 257287566 edges, 77569 markings/sec, 390 secs
lola: 36602467 markings, 261054311 edges, 75819 markings/sec, 395 secs
lola: 37008118 markings, 264640214 edges, 81130 markings/sec, 400 secs
lola: 37436906 markings, 268135607 edges, 85758 markings/sec, 405 secs
lola: 37894390 markings, 271588091 edges, 91497 markings/sec, 410 secs
lola: 38368209 markings, 275042241 edges, 94764 markings/sec, 415 secs
lola: 38857565 markings, 278379547 edges, 97871 markings/sec, 420 secs
lola: 39336650 markings, 282005604 edges, 95817 markings/sec, 425 secs
lola: 39836286 markings, 285325033 edges, 99927 markings/sec, 430 secs
lola: 40319879 markings, 288714959 edges, 96719 markings/sec, 435 secs
lola: 40677433 markings, 292761528 edges, 71511 markings/sec, 440 secs
lola: 41071152 markings, 296486551 edges, 78744 markings/sec, 445 secs
lola: 41478534 markings, 300168167 edges, 81476 markings/sec, 450 secs
lola: 41898668 markings, 303847764 edges, 84027 markings/sec, 455 secs
lola: 42359152 markings, 307406868 edges, 92097 markings/sec, 460 secs
lola: 42820067 markings, 311008561 edges, 92183 markings/sec, 465 secs
lola: 43324612 markings, 314377869 edges, 100909 markings/sec, 470 secs
lola: 43812858 markings, 318026948 edges, 97649 markings/sec, 475 secs
lola: 44303372 markings, 321651706 edges, 98103 markings/sec, 480 secs
lola: 44807950 markings, 325017310 edges, 100916 markings/sec, 485 secs
lola: 45181537 markings, 329056961 edges, 74717 markings/sec, 490 secs
lola: 45565301 markings, 332997612 edges, 76753 markings/sec, 495 secs
lola: 45967389 markings, 336813166 edges, 80418 markings/sec, 500 secs
lola: 46373928 markings, 340644136 edges, 81308 markings/sec, 505 secs
lola: 46816896 markings, 344407265 edges, 88594 markings/sec, 510 secs
lola: 47287905 markings, 348038572 edges, 94202 markings/sec, 515 secs
lola: 47774568 markings, 351653279 edges, 97333 markings/sec, 520 secs
lola: 48249971 markings, 355527742 edges, 95081 markings/sec, 525 secs
lola: 48755597 markings, 359065935 edges, 101125 markings/sec, 530 secs
lola: 49268463 markings, 362617412 edges, 102573 markings/sec, 535 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: 49736896 markings, 365898180 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((COMPTEUR_38 <= ROUTE_A) OR G ((G ((SUR_PONT_B <= ROUTE_A)) OR X (G ((SUR_PONT_B <= ROUTE_A)))))))))
lola: processed formula length: 110
lola: 126 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: 644350 markings, 2127241 edges, 128870 markings/sec, 0 secs
lola: 1259987 markings, 4231790 edges, 123127 markings/sec, 5 secs
lola: 1885997 markings, 6397247 edges, 125202 markings/sec, 10 secs
lola: 2515594 markings, 8591373 edges, 125919 markings/sec, 15 secs
lola: 3110964 markings, 10645624 edges, 119074 markings/sec, 20 secs
lola: 3701543 markings, 12697580 edges, 118116 markings/sec, 25 secs
lola: 4298949 markings, 14788233 edges, 119481 markings/sec, 30 secs
lola: 4911729 markings, 16944087 edges, 122556 markings/sec, 35 secs
lola: 5532137 markings, 19140632 edges, 124082 markings/sec, 40 secs
lola: 6146550 markings, 21317165 edges, 122883 markings/sec, 45 secs
lola: 6764307 markings, 23498936 edges, 123551 markings/sec, 50 secs
lola: 7395611 markings, 25740238 edges, 126261 markings/sec, 55 secs
lola: 8041616 markings, 28066460 edges, 129201 markings/sec, 60 secs
lola: 8673791 markings, 30308639 edges, 126435 markings/sec, 65 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: 9080862 markings, 31785918 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no no yes yes no yes no
lola:
preliminary result: yes yes yes yes yes yes no yes no no no yes yes no yes no
lola: ========================================
lola: memory consumption: 89500 KB
lola: time consumption: 1649 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589307696994

--------------------
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-V20P10N50"
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-V20P10N50, 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-158897741200081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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