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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.1K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 26 02:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Mar 25 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 237K Mar 25 20:59 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.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 25 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 25 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Mar 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 242K Mar 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-15

=== Now, execution of the tool begins

BK_START 1589306155072

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

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

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

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

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

FORMULA BridgeAndVehicles-PT-V20P20N20-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BridgeAndVehicles-PT-V20P20N20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 12 17:55:55 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": 96
},
"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": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (((F ((3 <= SORTI_A)) AND G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR X (F ((G (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))) AND X ((ROUTE_A <= SORTI_A)))))))",
"processed_size": 154,
"rewrites": 96
},
"result":
{
"edges": 167734290,
"markings": 31226705,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 1,
"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": 235
},
"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": 96
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 253
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 ((F ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= SORTI_B)))",
"processed_size": 56,
"rewrites": 96
},
"result":
{
"edges": 894319,
"markings": 400449,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X ((ROUTE_B <= SUR_PONT_B)) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND X (F ((ROUTE_B <= SUR_PONT_B))))))",
"processed_size": 108,
"rewrites": 96
},
"result":
{
"edges": 25168128,
"markings": 7872986,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((ROUTE_B <= CHOIX_2) OR (1 <= VIDANGE_1)) OR (F (G ((NB_ATTENTE_B_18 <= ATTENTE_A))) OR X (G ((NB_ATTENTE_B_18 <= ATTENTE_A))))))",
"processed_size": 135,
"rewrites": 96
},
"result":
{
"edges": 36958997,
"markings": 10584356,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 290
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 290
},
"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_A <= CHOIX_1)))",
"processed_size": 31,
"rewrites": 98
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (((ATTENTE_A + 1 <= CAPACITE) OR G ((CAPACITE + 1 <= CONTROLEUR_2)))))",
"processed_size": 75,
"rewrites": 96
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((ATTENTE_A + 1 <= COMPTEUR_2) AND (CHOIX_2 <= ATTENTE_A))))",
"processed_size": 66,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(ROUTE_A <= 1)",
"processed_size": 14,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 456
},
"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": "(ATTENTE_B + 1 <= CAPACITE)",
"processed_size": 27,
"rewrites": 98
},
"result":
{
"edges": 185,
"markings": 186,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 532
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((CAPACITE <= SORTI_A))))",
"processed_size": 33,
"rewrites": 96
},
"result":
{
"edges": 132534627,
"markings": 19063781,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 568
},
"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 ((ROUTE_A + 1 <= COMPTEUR_17))))",
"processed_size": 40,
"rewrites": 96
},
"result":
{
"edges": 171,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"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 (G (F (((ROUTE_A <= ROUTE_B) OR F ((ROUTE_A <= ROUTE_B))))))",
"processed_size": 62,
"rewrites": 96
},
"result":
{
"edges": 42823391,
"markings": 9650543,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 916
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((1 <= CHOIX_1 + CHOIX_2) R ((CHOIX_1 + CHOIX_2 <= 0) OR F ((ROUTE_B <= 1)))))))",
"processed_size": 89,
"rewrites": 96
},
"result":
{
"edges": 61812352,
"markings": 13330680,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1327
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F ((VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2))))",
"processed_size": 60,
"rewrites": 96
},
"result":
{
"edges": 209,
"markings": 209,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 2655
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B) AND (SUR_PONT_B + 1 <= SORTI_A)) U (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)) U (SORTI_A <= SUR_PONT_B))))",
"processed_size": 161,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 43880,
"runtime": 915.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((F(**) AND G(**)) OR X(F((G(F(**)) AND X(**)))))) : A((** U (** U **))) : A(F(G((* R (* OR F(*)))))) : TRUE : A(G(F(*))) : A(F(G(**))) : A(F(**)) : A(X(TRUE)) : (A((X(**) OR (G(**) AND X(F(**))))) AND A((F(**) U **))) : A((** OR (F(G(**)) OR X(G(**))))) : A(G(F((** OR F(**))))) : (A(G(**)) AND A(X(F(**)))) : A(G(*)) : (A(X(G((* AND (F(*) OR G(*)))))) AND A(G((* OR G(*))))) : A(F(G(*))) : A(F(**))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no yes no yes yes no no no no yes ",
"value": "yes yes yes yes no yes no yes no yes yes no no no no 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: (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_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: 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: (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: (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: 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: 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: (2 <= CONTROLEUR_1 + CONTROLEUR_2)
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: A (((F ((3 <= SORTI_A)) AND G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR F (X (F ((G (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))) AND X ((ROUTE_A <= SORTI_A)))))))) : A ((((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B) AND (SUR_PONT_B + 1 <= SORTI_A)) U (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)) U (SORTI_A <= SUR_PONT_B)))) : A (F (X (F (G (NOT(X (((CHOIX_1 + CHOIX_2 <= 0) U ((1 <= CHOIX_1 + CHOIX_2) AND G ((2 <= ROUTE_B))))))))))) : A ((NOT(G ((CHOIX_1 + CHOIX_2 <= 1))) U ())) : A (F (NOT((X (F ((((VIDANGE_1 + VIDANGE_2 <= ATTENTE_B) OR X ((VIDANGE_1 + VIDANGE_2 <= ATTENTE_B))) OR G (F ((0 <= 0)))))) U G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))) : A ((((ATTENTE_A <= CHOIX_1 + CHOIX_2) AND G (F (X (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))))))) U G (F (G ((CAPACITE <= SORTI_A)))))) : A ((NOT(F ((1 <= 0))) U (CAPACITE <= ATTENTE_B))) : A (((0 <= 0) AND G (((0 <= 0) AND G ((X ((0 <= CHOIX_1 + CHOIX_2)) OR (G ((2 <= CONTROLEUR_1 + CONTROLEUR_2)) AND X ((SUR_PONT_B <= 1))))))))) : A (((G ((NB_ATTENTE_B_18 <= CAPACITE)) U X ((ROUTE_B <= SUR_PONT_B))) AND (F ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= SORTI_B)))) : A (((((ROUTE_B <= CHOIX_2) OR (1 <= VIDANGE_1)) OR F (G ((NB_ATTENTE_B_18 <= ATTENTE_A)))) OR X (G ((NB_ATTENTE_B_18 <= ATTENTE_A))))) : A (F ((X ((3 <= CONTROLEUR_1)) U X (X (G (F (((ROUTE_A <= ROUTE_B) OR F ((ROUTE_A <= ROUTE_B)))))))))) : A ((G ((SUR_PONT_A <= CHOIX_1)) AND X (F ((CHOIX_2 <= SUR_PONT_A))))) : A (G (NOT(F (((COMPTEUR_2 <= ATTENTE_A) OR (ATTENTE_A + 1 <= CHOIX_2)))))) : A (NOT(F ((X ((G ((SORTI_A <= ATTENTE_A)) U (CAPACITE <= ATTENTE_A))) OR ((CAPACITE <= ATTENTE_A) AND F ((CONTROLEUR_2 <= CAPACITE))))))) : A (((CHOIX_1 + 1 <= 0) U G (NOT(G (F ((COMPTEUR_17 <= ROUTE_A))))))) : A (F ((2 <= ROUTE_A)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:188
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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: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: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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:185
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: 96 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: A (((F ((3 <= SORTI_A)) AND G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR X (F ((G (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))) AND X ((ROUTE_A <= SORTI_A)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((3 <= SORTI_A)) AND G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR X (F ((G (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))) AND X ((ROUTE_A <= SORTI_A)))))))
lola: processed formula length: 154
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1021718 markings, 4345741 edges, 204344 markings/sec, 0 secs
lola: 1940379 markings, 8362657 edges, 183732 markings/sec, 5 secs
lola: 2847997 markings, 12424539 edges, 181524 markings/sec, 10 secs
lola: 3727948 markings, 16404139 edges, 175990 markings/sec, 15 secs
lola: 4672154 markings, 19706024 edges, 188841 markings/sec, 20 secs
lola: 5534085 markings, 23275272 edges, 172386 markings/sec, 25 secs
lola: 6340713 markings, 26841008 edges, 161326 markings/sec, 30 secs
lola: 7077231 markings, 30322471 edges, 147304 markings/sec, 35 secs
lola: 7873240 markings, 33946300 edges, 159202 markings/sec, 40 secs
lola: 8676862 markings, 37315735 edges, 160724 markings/sec, 45 secs
lola: 9482390 markings, 40743615 edges, 161106 markings/sec, 50 secs
lola: 10276869 markings, 44157646 edges, 158896 markings/sec, 55 secs
lola: 11054687 markings, 47623728 edges, 155564 markings/sec, 60 secs
lola: 11839983 markings, 51047453 edges, 157059 markings/sec, 65 secs
lola: 12648121 markings, 54444200 edges, 161628 markings/sec, 70 secs
lola: 13435221 markings, 57878831 edges, 157420 markings/sec, 75 secs
lola: 14221004 markings, 61474851 edges, 157157 markings/sec, 80 secs
lola: 15059844 markings, 64966966 edges, 167768 markings/sec, 85 secs
lola: 15849384 markings, 68793349 edges, 157908 markings/sec, 90 secs
lola: 16697832 markings, 72224302 edges, 169690 markings/sec, 95 secs
lola: 17477069 markings, 76058101 edges, 155847 markings/sec, 100 secs
lola: 18190803 markings, 79899861 edges, 142747 markings/sec, 105 secs
lola: 18858534 markings, 83986741 edges, 133546 markings/sec, 110 secs
lola: 19492909 markings, 88268334 edges, 126875 markings/sec, 115 secs
lola: 20121523 markings, 92508429 edges, 125723 markings/sec, 120 secs
lola: 20719498 markings, 96839562 edges, 119595 markings/sec, 125 secs
lola: 21329397 markings, 101285313 edges, 121980 markings/sec, 130 secs
lola: 21962040 markings, 105545608 edges, 126529 markings/sec, 135 secs
lola: 22597753 markings, 109690252 edges, 127143 markings/sec, 140 secs
lola: 23229173 markings, 113856169 edges, 126284 markings/sec, 145 secs
lola: 23843967 markings, 118122185 edges, 122959 markings/sec, 150 secs
lola: 24484409 markings, 122244811 edges, 128088 markings/sec, 155 secs
lola: 25128651 markings, 126392342 edges, 128848 markings/sec, 160 secs
lola: 25737166 markings, 130754241 edges, 121703 markings/sec, 165 secs
lola: 26389313 markings, 134789255 edges, 130429 markings/sec, 170 secs
lola: 26996192 markings, 139117513 edges, 121376 markings/sec, 175 secs
lola: 27651507 markings, 143220848 edges, 131063 markings/sec, 180 secs
lola: 28253046 markings, 147599345 edges, 120308 markings/sec, 185 secs
lola: 28912502 markings, 151657741 edges, 131891 markings/sec, 190 secs
lola: 29516565 markings, 156035579 edges, 120813 markings/sec, 195 secs
lola: 30178480 markings, 160100755 edges, 132383 markings/sec, 200 secs
lola: 30794456 markings, 164463257 edges, 123195 markings/sec, 205 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31226705 markings, 167734290 edges
lola: lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 96 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 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((X ((ROUTE_B <= SUR_PONT_B)) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND X (F ((ROUTE_B <= SUR_PONT_B)))))) AND A ((F ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= SORTI_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((NB_ATTENTE_B_18 <= CAPACITE)) U (1 <= SORTI_B)))
lola: processed formula length: 56
lola: 96 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: 390713 markings, 877431 edges, 78143 markings/sec, 0 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: 400449 markings, 894319 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((ROUTE_B <= SUR_PONT_B)) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND X (F ((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 ((ROUTE_B <= SUR_PONT_B)) OR (G ((NB_ATTENTE_B_18 <= CAPACITE)) AND X (F ((ROUTE_B <= SUR_PONT_B))))))
lola: processed formula length: 108
lola: 96 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: 1029043 markings, 3028076 edges, 205809 markings/sec, 0 secs
lola: 2000162 markings, 6008989 edges, 194224 markings/sec, 5 secs
lola: 2937350 markings, 9004200 edges, 187438 markings/sec, 10 secs
lola: 3873400 markings, 12025812 edges, 187210 markings/sec, 15 secs
lola: 4817555 markings, 15080753 edges, 188831 markings/sec, 20 secs
lola: 5755800 markings, 18172629 edges, 187649 markings/sec, 25 secs
lola: 6698326 markings, 21269927 edges, 188505 markings/sec, 30 secs
lola: 7637415 markings, 24380506 edges, 187818 markings/sec, 35 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: 7872986 markings, 25168128 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((ROUTE_B <= CHOIX_2) OR (1 <= VIDANGE_1)) OR (F (G ((NB_ATTENTE_B_18 <= ATTENTE_A))) OR X (G ((NB_ATTENTE_B_18 <= ATTENTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((ROUTE_B <= CHOIX_2) OR (1 <= VIDANGE_1)) OR (F (G ((NB_ATTENTE_B_18 <= ATTENTE_A))) OR X (G ((NB_ATTENTE_B_18 <= ATTENTE_A))))))
lola: processed formula length: 135
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 983940 markings, 3263534 edges, 196788 markings/sec, 0 secs
lola: 1937707 markings, 6513508 edges, 190753 markings/sec, 5 secs
lola: 2867349 markings, 9731557 edges, 185928 markings/sec, 10 secs
lola: 3780101 markings, 12891707 edges, 182550 markings/sec, 15 secs
lola: 4671102 markings, 15993866 edges, 178200 markings/sec, 20 secs
lola: 5559311 markings, 19126545 edges, 177642 markings/sec, 25 secs
lola: 6453228 markings, 22276552 edges, 178783 markings/sec, 30 secs
lola: 7339447 markings, 25419868 edges, 177244 markings/sec, 35 secs
lola: 8231002 markings, 28587937 edges, 178311 markings/sec, 40 secs
lola: 9120217 markings, 31737407 edges, 177843 markings/sec, 45 secs
lola: 10004011 markings, 34859150 edges, 176759 markings/sec, 50 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: 10584356 markings, 36958997 edges
lola: ========================================
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((SUR_PONT_A <= CHOIX_1))) AND A (X (F ((CHOIX_2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SUR_PONT_A <= CHOIX_1)))
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_A <= CHOIX_1)))
lola: processed formula length: 31
lola: 98 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: SUBRESULT
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: (CHOIX_1 + 1 <= SUR_PONT_A)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (((ATTENTE_A + 1 <= CAPACITE) AND (F ((ATTENTE_A + 1 <= SORTI_A)) OR G ((ATTENTE_A + 1 <= CAPACITE))))))) AND A (G (((ATTENTE_A + 1 <= CAPACITE) OR G ((CAPACITE + 1 <= CONTROLEUR_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ATTENTE_A + 1 <= CAPACITE) OR G ((CAPACITE + 1 <= CONTROLEUR_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((ATTENTE_A + 1 <= CAPACITE) OR G ((CAPACITE + 1 <= CONTROLEUR_2)))))
lola: processed formula length: 75
lola: 96 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ATTENTE_A + 1 <= COMPTEUR_2) AND (CHOIX_2 <= ATTENTE_A))))
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 <= COMPTEUR_2) AND (CHOIX_2 <= ATTENTE_A))))
lola: processed formula length: 66
lola: 98 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: ((COMPTEUR_2 <= ATTENTE_A) OR (ATTENTE_A + 1 <= CHOIX_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= ROUTE_A)))
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: (ROUTE_A <= 1)
lola: processed formula length: 14
lola: 98 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 9 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CAPACITE <= ATTENTE_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: (ATTENTE_B + 1 <= CAPACITE)
lola: processed formula length: 27
lola: 98 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 186 markings, 185 edges
lola: subprocess 10 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((CAPACITE <= SORTI_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((CAPACITE <= SORTI_A))))
lola: processed formula length: 33
lola: 96 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: ========================================
lola: 273799 markings, 1497475 edges, 54760 markings/sec, 0 secs
lola: 537637 markings, 3139127 edges, 52768 markings/sec, 5 secs
lola: 810396 markings, 4905862 edges, 54552 markings/sec, 10 secs
lola: 1071648 markings, 6592512 edges, 52250 markings/sec, 15 secs
lola: 1321338 markings, 8214968 edges, 49938 markings/sec, 20 secs
lola: 1565797 markings, 9727910 edges, 48892 markings/sec, 25 secs
lola: 1810306 markings, 11272959 edges, 48902 markings/sec, 30 secs
lola: 2055026 markings, 12825505 edges, 48944 markings/sec, 35 secs
lola: 2299615 markings, 14386947 edges, 48918 markings/sec, 40 secs
lola: 2546189 markings, 15983784 edges, 49315 markings/sec, 45 secs
lola: 2788259 markings, 17468792 edges, 48414 markings/sec, 50 secs
lola: 3031170 markings, 18968183 edges, 48582 markings/sec, 55 secs
lola: 3280554 markings, 20624614 edges, 49877 markings/sec, 60 secs
lola: 3554571 markings, 22463185 edges, 54803 markings/sec, 65 secs
lola: 3809259 markings, 24215338 edges, 50938 markings/sec, 70 secs
lola: 4063419 markings, 25986740 edges, 50832 markings/sec, 75 secs
lola: 4342581 markings, 27885991 edges, 55832 markings/sec, 80 secs
lola: 4598842 markings, 29643765 edges, 51252 markings/sec, 85 secs
lola: 4853189 markings, 31420492 edges, 50869 markings/sec, 90 secs
lola: 5103455 markings, 33172005 edges, 50053 markings/sec, 95 secs
lola: 5387201 markings, 35109413 edges, 56749 markings/sec, 100 secs
lola: 5651767 markings, 36947506 edges, 52913 markings/sec, 105 secs
lola: 5911569 markings, 38776864 edges, 51960 markings/sec, 110 secs
lola: 6166423 markings, 40589366 edges, 50971 markings/sec, 115 secs
lola: 6458513 markings, 42610663 edges, 58418 markings/sec, 120 secs
lola: 6719800 markings, 44409859 edges, 52257 markings/sec, 125 secs
lola: 6983204 markings, 46265563 edges, 52681 markings/sec, 130 secs
lola: 7248459 markings, 48151831 edges, 53051 markings/sec, 135 secs
lola: 7513049 markings, 49984998 edges, 52918 markings/sec, 140 secs
lola: 7808205 markings, 52078913 edges, 59031 markings/sec, 145 secs
lola: 8075503 markings, 53944110 edges, 53460 markings/sec, 150 secs
lola: 8338607 markings, 55801535 edges, 52621 markings/sec, 155 secs
lola: 8604204 markings, 57708868 edges, 53119 markings/sec, 160 secs
lola: 8868405 markings, 59614488 edges, 52840 markings/sec, 165 secs
lola: 9174066 markings, 61743296 edges, 61132 markings/sec, 170 secs
lola: 9438889 markings, 63578787 edges, 52965 markings/sec, 175 secs
lola: 9717847 markings, 65552939 edges, 55792 markings/sec, 180 secs
lola: 9984771 markings, 67465564 edges, 53385 markings/sec, 185 secs
lola: 10258107 markings, 69428352 edges, 54667 markings/sec, 190 secs
lola: 10522037 markings, 71300492 edges, 52786 markings/sec, 195 secs
lola: 10834936 markings, 73528651 edges, 62580 markings/sec, 200 secs
lola: 11104958 markings, 75398669 edges, 54004 markings/sec, 205 secs
lola: 11384110 markings, 77389799 edges, 55830 markings/sec, 210 secs
lola: 11658429 markings, 79356557 edges, 54864 markings/sec, 215 secs
lola: 11917601 markings, 81228683 edges, 51834 markings/sec, 220 secs
lola: 12202160 markings, 83282683 edges, 56912 markings/sec, 225 secs
lola: 12489599 markings, 85296022 edges, 57488 markings/sec, 230 secs
lola: 12790993 markings, 87455415 edges, 60279 markings/sec, 235 secs
lola: 13061460 markings, 89349703 edges, 54093 markings/sec, 240 secs
lola: 13342306 markings, 91348759 edges, 56169 markings/sec, 245 secs
lola: 13619694 markings, 93352065 edges, 55478 markings/sec, 250 secs
lola: 13882506 markings, 95254923 edges, 52562 markings/sec, 255 secs
lola: 14160422 markings, 97272756 edges, 55583 markings/sec, 260 secs
lola: 14448395 markings, 99276477 edges, 57595 markings/sec, 265 secs
lola: 14757843 markings, 101530080 edges, 61890 markings/sec, 270 secs
lola: 15028187 markings, 103411105 edges, 54069 markings/sec, 275 secs
lola: 15319608 markings, 105501489 edges, 58284 markings/sec, 280 secs
lola: 15596258 markings, 107490975 edges, 55330 markings/sec, 285 secs
lola: 15867585 markings, 109451613 edges, 54265 markings/sec, 290 secs
lola: 16141794 markings, 111441753 edges, 54842 markings/sec, 295 secs
lola: 16424123 markings, 113508880 edges, 56466 markings/sec, 300 secs
lola: 16708977 markings, 115485083 edges, 56971 markings/sec, 305 secs
lola: 17016741 markings, 117736306 edges, 61553 markings/sec, 310 secs
lola: 17294478 markings, 119673179 edges, 55547 markings/sec, 315 secs
lola: 17579140 markings, 121718167 edges, 56932 markings/sec, 320 secs
lola: 17872740 markings, 123836456 edges, 58720 markings/sec, 325 secs
lola: 18149536 markings, 125842104 edges, 55359 markings/sec, 330 secs
lola: 18438641 markings, 127955591 edges, 57821 markings/sec, 335 secs
lola: 18712676 markings, 129949650 edges, 54807 markings/sec, 340 secs
lola: 18988874 markings, 131976313 edges, 55240 markings/sec, 345 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: 19063781 markings, 132534627 edges
lola: ========================================
lola: subprocess 11 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ROUTE_A + 1 <= COMPTEUR_17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ROUTE_A + 1 <= COMPTEUR_17))))
lola: processed formula length: 40
lola: 96 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: 170 markings, 171 edges
lola: ========================================
lola: subprocess 12 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((ROUTE_A <= ROUTE_B) OR F ((ROUTE_A <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((ROUTE_A <= ROUTE_B) OR F ((ROUTE_A <= ROUTE_B))))))
lola: processed formula length: 62
lola: 96 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: 502728 markings, 1400192 edges, 100546 markings/sec, 0 secs
lola: 1086555 markings, 3147411 edges, 116765 markings/sec, 5 secs
lola: 1580094 markings, 4628633 edges, 98708 markings/sec, 10 secs
lola: 2112002 markings, 6353857 edges, 106382 markings/sec, 15 secs
lola: 2580942 markings, 7909674 edges, 93788 markings/sec, 20 secs
lola: 3073731 markings, 10313475 edges, 98558 markings/sec, 25 secs
lola: 3617688 markings, 13156061 edges, 108791 markings/sec, 30 secs
lola: 4165264 markings, 16103712 edges, 109515 markings/sec, 35 secs
lola: 4670503 markings, 18341368 edges, 101048 markings/sec, 40 secs
lola: 5173106 markings, 20689042 edges, 100521 markings/sec, 45 secs
lola: 5687463 markings, 23153422 edges, 102871 markings/sec, 50 secs
lola: 6221896 markings, 25776108 edges, 106887 markings/sec, 55 secs
lola: 6745435 markings, 28492326 edges, 104708 markings/sec, 60 secs
lola: 7286576 markings, 31159818 edges, 108228 markings/sec, 65 secs
lola: 7827281 markings, 33833964 edges, 108141 markings/sec, 70 secs
lola: 8380647 markings, 36761839 edges, 110673 markings/sec, 75 secs
lola: 8917374 markings, 39150815 edges, 107345 markings/sec, 80 secs
lola: 9471671 markings, 41930858 edges, 110859 markings/sec, 85 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: 9650543 markings, 42823391 edges
lola: ========================================
lola: subprocess 13 will run for 916 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= CHOIX_1 + CHOIX_2) R ((CHOIX_1 + CHOIX_2 <= 0) OR F ((ROUTE_B <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((1 <= CHOIX_1 + CHOIX_2) R ((CHOIX_1 + CHOIX_2 <= 0) OR F ((ROUTE_B <= 1)))))))
lola: processed formula length: 89
lola: 96 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: 738363 markings, 2839560 edges, 147673 markings/sec, 0 secs
lola: 1484235 markings, 6056145 edges, 149174 markings/sec, 5 secs
lola: 2229433 markings, 9420003 edges, 149040 markings/sec, 10 secs
lola: 2971649 markings, 12790959 edges, 148443 markings/sec, 15 secs
lola: 3685030 markings, 16015493 edges, 142676 markings/sec, 20 secs
lola: 4384660 markings, 19130548 edges, 139926 markings/sec, 25 secs
lola: 5089726 markings, 22240772 edges, 141013 markings/sec, 30 secs
lola: 5796007 markings, 25354337 edges, 141256 markings/sec, 35 secs
lola: 6501658 markings, 28559537 edges, 141130 markings/sec, 40 secs
lola: 7197559 markings, 31919172 edges, 139180 markings/sec, 45 secs
lola: 7910036 markings, 35058538 edges, 142495 markings/sec, 50 secs
lola: 8614974 markings, 38394455 edges, 140988 markings/sec, 55 secs
lola: 9309703 markings, 41717733 edges, 138946 markings/sec, 60 secs
lola: 10006241 markings, 45146054 edges, 139308 markings/sec, 65 secs
lola: 10703202 markings, 48478220 edges, 139392 markings/sec, 70 secs
lola: 11386265 markings, 52058155 edges, 136613 markings/sec, 75 secs
lola: 12093264 markings, 55345716 edges, 141400 markings/sec, 80 secs
lola: 12780342 markings, 58887843 edges, 137416 markings/sec, 85 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: 13330680 markings, 61812352 edges
lola: ========================================
lola: subprocess 14 will run for 1327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((VIDANGE_1 + VIDANGE_2 + 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 (F ((VIDANGE_1 + VIDANGE_2 + 1 <= CHOIX_1 + CHOIX_2))))
lola: processed formula length: 60
lola: 96 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: 209 markings, 209 edges
lola: ========================================
lola: subprocess 15 will run for 2655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B) AND (SUR_PONT_B + 1 <= SORTI_A)) U (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)) U (SORTI_A <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B) AND (SUR_PONT_B + 1 <= SORTI_A)) U (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B)) U (SORTI_A <= SUR_PONT_B))))
lola: processed formula length: 161
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no yes no yes yes no no no no yes
lola:
preliminary result: yes yes yes yes no yes no yes no yes yes no no no no yes
lola: ========================================
lola: memory consumption: 43880 KB
lola: time consumption: 915 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589307094561

--------------------
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-V20P20N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is BridgeAndVehicles-PT-V20P20N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-oct2-158897741200085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;