fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r016-csrt-155225065600504
Last Updated
Apr 15, 2019

About the Execution of LoLA for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4265.450 5398.00 6628.00 7.40 TTTTFFFFTTFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r016-csrt-155225065600504.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is BridgeAndVehicles-PT-V04P05N02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225065600504
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 9 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 5 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 5 04:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 2 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 2 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jan 29 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Jan 29 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:18 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 57K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1552525120812

info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-PT-V04P05N02 @ 3570 seconds

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-PT-V04P05N02

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 00:58:40 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(timeout_B_0_2_1_0)))",
"processed_size": 35,
"rewrites": 1
},
"result":
{
"edges": 4675,
"markings": 2297,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(basculement_1) OR NOT FIREABLE(timeout_A_2_1_0_2))))",
"processed_size": 73,
"rewrites": 2
},
"result":
{
"edges": 4568,
"markings": 2315,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(autorisation_A_1_1) OR NOT FIREABLE(timeout_B_0_2_2_0))))",
"processed_size": 78,
"rewrites": 2
},
"result":
{
"edges": 3399,
"markings": 1791,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((FIREABLE(basculement_2) AND FIREABLE(timeout_A_1_1_0_4)) OR (FIREABLE(timeout_B_1_2_2_0) AND FIREABLE(decision_0_2)))))",
"processed_size": 128,
"rewrites": 1
},
"result":
{
"edges": 4720,
"markings": 2290,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((FIREABLE(autorisation_B_2_2) OR ((NOT FIREABLE(timeout_B_1_2_3_0) OR NOT FIREABLE(timeout_A_1_1_0_3)) AND NOT FIREABLE(timeout_A_0_1_0_4)))))",
"processed_size": 150,
"rewrites": 2
},
"result":
{
"edges": 5032,
"markings": 2348,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 47,
"problems": 7
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(timeout_B_1_2_4_0) OR NOT FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_1_1_0_3) OR NOT FIREABLE(autorisation_B_2_3) OR ((NOT FIREABLE(timeout_A_0_1_0_4) OR NOT FIREABLE(enregistrement_B_0)) AND FIREABLE(enregistrement_B_4)))))",
"processed_size": 261,
"rewrites": 2
},
"result":
{
"edges": 3824,
"markings": 2102,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 56,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 5,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "E (F (((((FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND FIREABLE(timeout_A_0_1_0_4)) OR ((FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_3)) AND (FIREABLE(enregistrement_A_4) OR FIREABLE(timeout_A_0_1_0_3)))) AND (FIREABLE(enregistrement_B_3) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(liberation_B))))))",
"processed_size": 351,
"rewrites": 1
},
"result":
{
"edges": 5637,
"markings": 2508,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 164,
"problems": 18
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 12,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(autorisation_B_2_3) AND (FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_4) OR (FIREABLE(timeout_A_2_1_0_2) AND FIREABLE(timeout_B_1_2_3_0))) AND FIREABLE(timeout_B_0_2_3_0) AND FIREABLE(basculement_2) AND FIREABLE(decision_0_1) AND FIREABLE(timeout_A_0_1_0_1) AND (FIREABLE(timeout_A_2_1_0_3) OR (FIREABLE(timeout_A_0_1_0_1) AND FIREABLE(autorisation_A_1_2))))))",
"processed_size": 392,
"rewrites": 1
},
"result":
{
"edges": 5437,
"markings": 2562,
"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": 156,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 17,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 17,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 17
},
"processed": "E (F ((FIREABLE(liberation_A) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)))))",
"processed_size": 528,
"rewrites": 1
},
"result":
{
"edges": 4314,
"markings": 2145,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 336,
"problems": 48
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 17,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 28,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 17
},
"processed": "A (G (((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))) AND (FIREABLE(liberation_A) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR FIREABLE(liberation_A) OR ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))))))",
"processed_size": 925,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 24,
"unfir": 16,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2))))))",
"processed_size": 807,
"rewrites": 1
},
"result":
{
"edges": 5660,
"markings": 2594,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 23,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 29,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 23
},
"processed": "A (G ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR FIREABLE(liberation_B) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4))))))",
"processed_size": 938,
"rewrites": 2
},
"result":
{
"edges": 4554,
"markings": 2232,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 37,
"unfir": 25,
"visible_places": 0,
"visible_transitions": 25
},
"processed": "A (G ((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0) OR NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0)))))",
"processed_size": 1286,
"rewrites": 2
},
"result":
{
"edges": 4622,
"markings": 2225,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 26,
"unfir": 14,
"visible_places": 0,
"visible_transitions": 26
},
"processed": "A (G ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR NOT FIREABLE(liberation_A) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4)) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)))))",
"processed_size": 881,
"rewrites": 2
},
"result":
{
"edges": 3738,
"markings": 1963,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 5,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 24,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 35,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 28
},
"processed": "E (F (((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)))) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND ((NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2))))))",
"processed_size": 1164,
"rewrites": 1
},
"result":
{
"edges": 5207,
"markings": 2482,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 31,
"unfir": 19,
"visible_places": 0,
"visible_transitions": 31
},
"processed": "A (G ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(liberation_A)) OR FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0))))",
"processed_size": 1072,
"rewrites": 2
},
"result":
{
"edges": 4332,
"markings": 2135,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 15304,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes yes yes yes no no no no yes yes no no yes no no yes ",
"value": "yes yes yes yes no no no no yes yes no no yes 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: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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 ReachabilityFireability.xml
lola: A (G ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR NOT FIREABLE(liberation_A) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4)) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2))))) : A (G ((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0) OR NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0))))) : A (G ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR FIREABLE(liberation_B) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)))))) : A (G ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR (NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(liberation_A)) OR FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)))) : E (F ((FIREABLE(liberation_A) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2))))) : E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)))))) : A (G (((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))) AND (FIREABLE(liberation_A) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR FIREABLE(liberation_A) OR ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2))))))) : E (F (((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)))) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND ((NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)))))) : A (G ((NOT FIREABLE(autorisation_A_1_1) OR NOT FIREABLE(timeout_B_0_2_2_0)))) : A (G ((NOT FIREABLE(timeout_B_1_2_4_0) OR NOT FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_1_1_0_3) OR NOT FIREABLE(autorisation_B_2_3) OR ((NOT FIREABLE(timeout_A_0_1_0_4) OR NOT FIREABLE(enregistrement_B_0)) AND FIREABLE(enregistrement_B_4))))) : E (F (((((FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND FIREABLE(timeout_A_0_1_0_4)) OR ((FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_3)) AND (FIREABLE(enregistrement_A_4) OR FIREABLE(timeout_A_0_1_0_3)))) AND (FIREABLE(enregistrement_B_3) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(liberation_B)))))) : E (F ((FIREABLE(autorisation_B_2_3) AND (FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_4) OR (FIREABLE(timeout_A_2_1_0_2) AND FIREABLE(timeout_B_1_2_3_0))) AND FIREABLE(timeout_B_0_2_3_0) AND FIREABLE(basculement_2) AND FIREABLE(decision_0_1) AND FIREABLE(timeout_A_0_1_0_1) AND (FIREABLE(timeout_A_2_1_0_3) OR (FIREABLE(timeout_A_0_1_0_1) AND FIREABLE(autorisation_A_1_2)))))) : A (G ((NOT FIREABLE(basculement_1) OR NOT FIREABLE(timeout_A_2_1_0_2)))) : E (F (FIREABLE(timeout_B_0_2_1_0))) : E (F (((FIREABLE(basculement_2) AND FIREABLE(timeout_A_1_1_0_4)) OR (FIREABLE(timeout_B_1_2_2_0) AND FIREABLE(decision_0_2))))) : A (G ((FIREABLE(autorisation_B_2_2) OR ((NOT FIREABLE(timeout_B_1_2_3_0) OR NOT FIREABLE(timeout_A_1_1_0_3)) AND NOT FIREABLE(timeout_A_0_1_0_4)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(timeout_B_0_2_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(timeout_B_0_2_1_0)))
lola: processed formula length: 35
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(timeout_B_0_2_1_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2297 markings, 4675 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(basculement_1) OR NOT FIREABLE(timeout_A_2_1_0_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:787
lola: processed formula: A (G ((NOT FIREABLE(basculement_1) OR NOT FIREABLE(timeout_A_2_1_0_2))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(basculement_1) AND FIREABLE(timeout_A_2_1_0_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2315 markings, 4568 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(autorisation_A_1_1) OR NOT FIREABLE(timeout_B_0_2_2_0))))
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 ((NOT FIREABLE(autorisation_A_1_1) OR NOT FIREABLE(timeout_B_0_2_2_0))))
lola: processed formula length: 78
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(autorisation_A_1_1) AND FIREABLE(timeout_B_0_2_2_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1791 markings, 3399 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(basculement_2) AND FIREABLE(timeout_A_1_1_0_4)) OR (FIREABLE(timeout_B_1_2_2_0) AND FIREABLE(decision_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(basculement_2) AND FIREABLE(timeout_A_1_1_0_4)) OR (FIREABLE(timeout_B_1_2_2_0) AND FIREABLE(decision_0_2)))))
lola: processed formula length: 128
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(basculement_2) AND FIREABLE(timeout_A_1_1_0_4)) OR (FIREABLE(timeout_B_1_2_2_0) AND FIREABLE(decision_0_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2290 markings, 4720 edges
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(autorisation_B_2_2) OR ((NOT FIREABLE(timeout_B_1_2_3_0) OR NOT FIREABLE(timeout_A_1_1_0_3)) AND NOT FIREABLE(timeout_A_0_1_0_4)))))
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 ((FIREABLE(autorisation_B_2_2) OR ((NOT FIREABLE(timeout_B_1_2_3_0) OR NOT FIREABLE(timeout_A_1_1_0_3)) AND NOT FIREABLE(timeout_A_0_1_0_4)))))
lola: processed formula length: 150
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(autorisation_B_2_2) AND ((FIREABLE(timeout_B_1_2_3_0) AND FIREABLE(timeout_A_1_1_0_3)) OR FIREABLE(timeout_A_0_1_0_4)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 47 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2348 markings, 5032 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(timeout_B_1_2_4_0) OR NOT FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_1_1_0_3) OR NOT FIREABLE(autorisation_B_2_3) OR ((NOT FIREABLE(timeout_A_0_1_0_4) OR NOT FIREABLE(enregistrement_B_0)) AND FIREABLE(enregistrement_B_4)))))
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 ((NOT FIREABLE(timeout_B_1_2_4_0) OR NOT FIREABLE(autorisation_A_1_3) OR NOT FIREABLE(timeout_A_1_1_0_3) OR NOT FIREABLE(autorisation_B_2_3) OR ((NOT FIREABLE(timeout_A_0_1_0_4) OR NOT FIREABLE(enregistrement_B_0)) AND FIREABLE(enregistrement_B_4)))))
lola: processed formula length: 261
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(timeout_B_1_2_4_0) AND FIREABLE(autorisation_A_1_3) AND FIREABLE(timeout_A_1_1_0_3) AND FIREABLE(autorisation_B_2_3) AND ((FIREABLE(timeout_A_0_1_0_4) AND FIREABLE(enregistrement_B_0)) OR NOT FIREABLE(enregistrement_B_4)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 56 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2102 markings, 3824 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND FIREABLE(timeout_A_0_1_0_4)) OR ((FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_3)) AND (FIREABLE(enregistrement_A_4) OR FIREABLE(timeout_A_0_1_0_3)))) AND (FIREABLE(enregistrement_B_3) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(liberation_B))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND FIREABLE(timeout_A_0_1_0_4)) OR ((FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_3)) AND (FIREABLE(enregistrement_A_4) OR FIREABLE(timeout_A_0_1_0_3)))) AND (FIREABLE(enregistrement_B_3) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(liberation_B))))))
lola: processed formula length: 351
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND FIREABLE(timeout_A_0_1_0_4)) OR ((FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_3)) AND (FIREABLE(enregistrement_A_4) OR FIREABLE(timeout_A_0_1_0_3)))) AND (FIREABLE(enregistrement_B_3) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(liberation_B))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 164 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2508 markings, 5637 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(autorisation_B_2_3) AND (FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_4) OR (FIREABLE(timeout_A_2_1_0_2) AND FIREABLE(timeout_B_1_2_3_0))) AND FIREABLE(timeout_B_0_2_3_0) AND FIREABLE(basculement_2) AND FIREABLE(decision_0_1) AND FIREABLE(timeout_A_0_1_0_1) AND (FIREABLE(timeout_A_2_1_0_3) OR (FIREABLE(timeout_A_0_1_0_1) AND FIREABLE(autorisation_A_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(autorisation_B_2_3) AND (FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_4) OR (FIREABLE(timeout_A_2_1_0_2) AND FIREABLE(timeout_B_1_2_3_0))) AND FIREABLE(timeout_B_0_2_3_0) AND FIREABLE(basculement_2) AND FIREABLE(decision_0_1) AND FIREABLE(timeout_A_0_1_0_1) AND (FIREABLE(timeout_A_2_1_0_3) OR (FIREABLE(timeout_A_0_1_0_1) AND FIREABLE(autorisation_A_1_2))))))
lola: processed formula length: 392
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(autorisation_B_2_3) AND (FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_4) OR (FIREABLE(timeout_A_2_1_0_2) AND FIREABLE(timeout_B_1_2_3_0))) AND FIREABLE(timeout_B_0_2_3_0) AND FIREABLE(basculement_2) AND FIREABLE(decision_0_1) AND FIREABLE(timeout_A_0_1_0_1) AND (FIREABLE(timeout_A_2_1_0_3) OR (FIREABLE(timeout_A_0_1_0_1) AND FIREABLE(autorisation_A_1_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 156 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2562 markings, 5437 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(liberation_A) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(time... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(liberation_A) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(time... (shortened)
lola: processed formula length: 528
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(liberation_A) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 336 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2145 markings, 4314 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))) AND (FIREABLE(liberation... (shortened)
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 (((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))) AND (FIREABLE(liberation... (shortened)
lola: processed formula length: 925
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(liberation_B) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4))) OR (NOT FIREABLE(liberation_A) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(liberation_A) AND ((NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)))))
sara: try reading problem file ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT F... (shortened)
lola: processed formula length: 807
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2594 markings, 5660 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR FIREABLE(liberation_B) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(alt... (shortened)
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 ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR FIREABLE(liberation_B) OR FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(alt... (shortened)
lola: processed formula length: 938
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2) AND NOT FIREABLE(liberation_B) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND ((NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2232 markings, 4554 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0) OR NOT FIREA... (shortened)
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 ((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0) OR NOT FIREA... (shortened)
lola: processed formula length: 1286
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2225 markings, 4622 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR NOT FIREA... (shortened)
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 ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR NOT FIREA... (shortened)
lola: processed formula length: 881
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING

lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4) AND FIREABLE(liberation_A) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) AND (FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1963 markings, 3738 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR F... (shortened)
lola: processed formula length: 1164
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)))) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND ((NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2482 markings, 5207 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND N... (shortened)
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 ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND N... (shortened)
lola: processed formula length: 1072
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(liberation_B) AND (FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR FIREABLE(liberation_A)) AND NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2135 markings, 4332 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes yes no no yes no no yes
lola:
preliminary result: yes yes yes yes no no no no yes yes no no yes no no yes
lola: memory consumption: 15304 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

BK_STOP 1552525126210

--------------------
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-V04P05N02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-csrt-155225065600504"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "ReachabilityFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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