About the Execution of LoLA for BART-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5236.440 | 18462.00 | 27836.00 | 10.10 | TFTFFFTFFFFTFFTF | 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.r181-csrt-155344534700054.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 BART-PT-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534700054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 4.2K Mar 10 19:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 10 19:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 10 19:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 10 19:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:46 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:46 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Mar 10 19:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 10 19:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 10 19:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Mar 10 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 10 17:46 NewModel
-rw-r--r-- 1 mcc users 5.2K Mar 10 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 10 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 Mar 10 18:58 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 Mar 10 18:58 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.6K Mar 10 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 10 19:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 10 19:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 10 19:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 10 17:46 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 10 17:46 instance
-rw-r--r-- 1 mcc users 6 Mar 10 17:46 iscolored
-rw-r--r-- 1 mcc users 9.3M Mar 10 17:46 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 BART-PT-040-ReachabilityFireability-00
FORMULA_NAME BART-PT-040-ReachabilityFireability-01
FORMULA_NAME BART-PT-040-ReachabilityFireability-02
FORMULA_NAME BART-PT-040-ReachabilityFireability-03
FORMULA_NAME BART-PT-040-ReachabilityFireability-04
FORMULA_NAME BART-PT-040-ReachabilityFireability-05
FORMULA_NAME BART-PT-040-ReachabilityFireability-06
FORMULA_NAME BART-PT-040-ReachabilityFireability-07
FORMULA_NAME BART-PT-040-ReachabilityFireability-08
FORMULA_NAME BART-PT-040-ReachabilityFireability-09
FORMULA_NAME BART-PT-040-ReachabilityFireability-10
FORMULA_NAME BART-PT-040-ReachabilityFireability-11
FORMULA_NAME BART-PT-040-ReachabilityFireability-12
FORMULA_NAME BART-PT-040-ReachabilityFireability-13
FORMULA_NAME BART-PT-040-ReachabilityFireability-14
FORMULA_NAME BART-PT-040-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553467810369
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BART-PT-040 @ 3570 seconds
FORMULA BART-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-040-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3552
rslt: Output for ReachabilityFireability @ BART-PT-040
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 24 22:50:10 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(TrainStable_40_2_3_7_5_4_6)))",
"processed_size": 48,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"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": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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(TrainAcc_3_3_34_31_30_10)))",
"processed_size": 42,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 4,
"problems": 4
},
"type": "reachability",
"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": 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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(TrainAcc_7_2_17_15_14_6)))",
"processed_size": 45,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(TrainStable_25_4_10_19_15_14_15) AND FIREABLE(TrainAcc_8_1_11_10_9_3))))",
"processed_size": 88,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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(TrainStable_26_4_10_28_24_23_15) OR NOT FIREABLE(TrainAcc_7_2_33_31_30_6))))",
"processed_size": 97,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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(TrainAcc_16_2_23_21_20_6) AND FIREABLE(TrainAcc_19_2_12_10_9_6) AND (FIREABLE(TrainAcc_31_3_17_14_13_10) OR FIREABLE(AtStation_19_39)))))",
"processed_size": 154,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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": 22,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G (((NOT FIREABLE(TrainStable_40_1_1_24_23_22_3) AND NOT FIREABLE(AtStation_32_9)) OR NOT FIREABLE(TrainAcc_20_2_26_24_23_6) OR NOT FIREABLE(TrainStable_27_1_1_22_21_20_3))))",
"processed_size": 179,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"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": 25,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((NOT FIREABLE(AtStation_17_37) OR NOT FIREABLE(TrainStable_38_4_10_26_22_21_15) OR (FIREABLE(TrainAcc_20_3_19_16_15_10) AND NOT FIREABLE(TrainStable_8_1_1_3_2_1_3)) OR (NOT FIREABLE(TrainStable_10_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_37_4_10_15_11_10_15)))))",
"processed_size": 274,
"rewrites": 2
},
"result":
{
"edges": 7,
"markings": 8,
"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": 112,
"problems": 8
},
"type": "invariance",
"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": 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": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(TrainStable_28_1_1_25_24_23_3) AND FIREABLE(AtStation_22_5) AND FIREABLE(TrainAcc_16_1_19_18_17_3) AND (NOT FIREABLE(TrainAcc_10_1_39_38_37_3) OR NOT FIREABLE(AtStation_12_5)) AND FIREABLE(TrainDecc_22_2_3_5_3_2_6))))",
"processed_size": 234,
"rewrites": 1
},
"result":
{
"edges": 598,
"markings": 390,
"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": 68,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((((FIREABLE(TrainAcc_27_2_24_22_21_6) AND FIREABLE(AtStation_2_6)) OR (FIREABLE(TrainStable_13_4_10_31_27_26_15) AND FIREABLE(TrainAcc_3_3_33_30_29_10)) OR FIREABLE(TrainAcc_27_2_36_34_33_6)) AND FIREABLE(TrainStable_40_4_10_34_30_29_15))))",
"processed_size": 248,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 34,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"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": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(TrainDecc_4_3_6_9_6_5_10) AND (FIREABLE(AtStation_3_17) OR FIREABLE(TrainStable_36_4_10_19_15_14_15) OR (FIREABLE(AtStation_39_31) AND FIREABLE(TrainAcc_18_1_26_25_24_3))) AND FIREABLE(TrainAcc_24_1_33_32_31_3))))",
"processed_size": 231,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 3
},
"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": 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": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G (((NOT FIREABLE(TrainStable_34_3_6_11_8_7_10) AND NOT FIREABLE(TrainStable_4_4_10_19_15_14_15)) OR (NOT FIREABLE(TrainAcc_13_3_36_33_32_10) AND NOT FIREABLE(TrainAcc_25_2_31_29_28_6)) OR (NOT FIREABLE(TrainAcc_12_2_37_35_34_6) AND NOT FIREABLE(TrainAcc_38_3_24_21_20_10) AND NOT FIREABLE(TrainAcc_10_2_28_26_25_6)))))",
"processed_size": 324,
"rewrites": 2
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 156,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((FIREABLE(TrainAcc_15_1_20_19_18_3) AND FIREABLE(TrainStable_13_4_10_30_26_25_15) AND FIREABLE(TrainStable_39_4_10_24_20_19_15) AND FIREABLE(TrainAcc_13_3_20_17_16_10) AND FIREABLE(TrainAcc_30_1_38_37_36_3) AND FIREABLE(TrainAcc_21_2_37_35_34_6) AND NOT FIREABLE(TrainStable_39_4_10_20_16_15_15) AND FIREABLE(AtStation_35_18))))",
"processed_size": 334,
"rewrites": 1
},
"result":
{
"edges": 1395,
"markings": 907,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 58,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (G (((NOT FIREABLE(TrainStable_16_1_1_7_6_5_3) AND (FIREABLE(TrainStable_16_1_1_38_37_36_3) OR FIREABLE(TrainAcc_5_2_21_19_18_6))) OR (NOT FIREABLE(TrainStable_23_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_9_1_1_17_16_15_3)) OR ((NOT FIREABLE(AtStation_29_34) OR NOT FIREABLE(TrainAcc_35_2_27_25_24_6)) AND (NOT FIREABLE(TrainStable_28_1_1_26_25_24_3) OR NOT FIREABLE(TrainAcc_34_2_26_24_23_6))))))",
"processed_size": 406,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G ((NOT FIREABLE(TrainAcc_40_3_22_19_18_10) OR (FIREABLE(TrainStable_24_1_1_16_15_14_3) AND FIREABLE(TrainAcc_2_3_22_19_18_10)) OR (FIREABLE(TrainAcc_9_3_21_18_17_10) AND FIREABLE(TrainAcc_25_3_34_31_30_10) AND (FIREABLE(TrainStable_7_1_1_33_32_31_3) OR FIREABLE(TrainAcc_16_2_32_30_29_6))) OR FIREABLE(TrainAcc_3_2_26_24_23_6) OR FIREABLE(TrainAcc_19_1_28_27_26_3) OR NOT FIREABLE(TrainStable_24_1_1_16_15_14_3) OR FIREABLE(TrainAcc_35_2_38_36_35_6))))",
"processed_size": 463,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 12,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 12
},
"processed": "E (F (((FIREABLE(TrainAcc_17_2_37_35_34_6) OR FIREABLE(TrainStable_3_1_1_29_28_27_3)) AND NOT FIREABLE(TrainAcc_11_1_16_15_14_3) AND (FIREABLE(TrainAcc_31_1_21_20_19_3) OR FIREABLE(TrainDecc_40_3_6_7_4_3_10)) AND (FIREABLE(TrainAcc_10_1_15_14_13_3) OR FIREABLE(TrainAcc_20_2_35_33_32_6)) AND FIREABLE(TrainStable_29_1_1_24_23_22_3) AND FIREABLE(TrainStable_39_4_10_28_24_23_15) AND FIREABLE(TrainStable_5_1_1_29_28_27_3) AND FIREABLE(AtStation_5_36) AND NOT FIREABLE(TrainDecc_13_4_10_11_7_6_15))))",
"processed_size": 501,
"rewrites": 1
},
"result":
{
"edges": 207199,
"markings": 118298,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2304,
"problems": 72
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 977724,
"runtime": 18.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 64800,
"conflict_clusters": 42,
"places": 5490,
"places_significant": 5240,
"singleton_clusters": 0,
"transitions": 8080
},
"result":
{
"preliminary_value": "yes no yes no no no yes no no no no yes no no yes no ",
"value": "yes no yes no no no yes no no no no yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 13570/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5490
lola: finding significant places
lola: 5490 places, 8080 transitions, 5240 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: E (F ((FIREABLE(TrainAcc_16_2_23_21_20_6) AND FIREABLE(TrainAcc_19_2_12_10_9_6) AND (FIREABLE(TrainAcc_31_3_17_14_13_10) OR FIREABLE(AtStation_19_39))))) : A (G (NOT FIREABLE(TrainStable_40_2_3_7_5_4_6))) : E (F ((FIREABLE(TrainDecc_4_3_6_9_6_5_10) AND (FIREABLE(AtStation_3_17) OR FIREABLE(TrainStable_36_4_10_19_15_14_15) OR (FIREABLE(AtStation_39_31) AND FIREABLE(TrainAcc_18_1_26_25_24_3))) AND FIREABLE(TrainAcc_24_1_33_32_31_3)))) : A (G ((NOT FIREABLE(TrainAcc_40_3_22_19_18_10) OR (FIREABLE(TrainStable_24_1_1_16_15_14_3) AND FIREABLE(TrainAcc_2_3_22_19_18_10)) OR (FIREABLE(TrainAcc_9_3_21_18_17_10) AND FIREABLE(TrainAcc_25_3_34_31_30_10) AND (FIREABLE(TrainStable_7_1_1_33_32_31_3) OR FIREABLE(TrainAcc_16_2_32_30_29_6))) OR FIREABLE(TrainAcc_3_2_26_24_23_6) OR FIREABLE(TrainAcc_19_1_28_27_26_3) OR NOT FIREABLE(TrainStable_24_1_1_16_15_14_3) OR FIREABLE(TrainAcc_35_2_38_36_35_6)))) : A (G (((NOT FIREABLE(TrainStable_40_1_1_24_23_22_3) AND NOT FIREABLE(AtStation_32_9)) OR NOT FIREABLE(TrainAcc_20_2_26_24_23_6) OR NOT FIREABLE(TrainStable_27_1_1_22_21_20_3)))) : A (G (((NOT FIREABLE(TrainStable_16_1_1_7_6_5_3) AND (FIREABLE(TrainStable_16_1_1_38_37_36_3) OR FIREABLE(TrainAcc_5_2_21_19_18_6))) OR (NOT FIREABLE(TrainStable_23_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_9_1_1_17_16_15_3)) OR ((NOT FIREABLE(AtStation_29_34) OR NOT FIREABLE(TrainAcc_35_2_27_25_24_6)) AND (NOT FIREABLE(TrainStable_28_1_1_26_25_24_3) OR NOT FIREABLE(TrainAcc_34_2_26_24_23_6)))))) : E (F (FIREABLE(TrainAcc_3_3_34_31_30_10))) : A (G ((NOT FIREABLE(AtStation_17_37) OR NOT FIREABLE(TrainStable_38_4_10_26_22_21_15) OR (FIREABLE(TrainAcc_20_3_19_16_15_10) AND NOT FIREABLE(TrainStable_8_1_1_3_2_1_3)) OR (NOT FIREABLE(TrainStable_10_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_37_4_10_15_11_10_15))))) : A (G (((NOT FIREABLE(TrainStable_34_3_6_11_8_7_10) AND NOT FIREABLE(TrainStable_4_4_10_19_15_14_15)) OR (NOT FIREABLE(TrainAcc_13_3_36_33_32_10) AND NOT FIREABLE(TrainAcc_25_2_31_29_28_6)) OR (NOT FIREABLE(TrainAcc_12_2_37_35_34_6) AND NOT FIREABLE(TrainAcc_38_3_24_21_20_10) AND NOT FIREABLE(TrainAcc_10_2_28_26_25_6))))) : E (F (((FIREABLE(TrainAcc_17_2_37_35_34_6) OR FIREABLE(TrainStable_3_1_1_29_28_27_3)) AND NOT FIREABLE(TrainAcc_11_1_16_15_14_3) AND (FIREABLE(TrainAcc_31_1_21_20_19_3) OR FIREABLE(TrainDecc_40_3_6_7_4_3_10)) AND (FIREABLE(TrainAcc_10_1_15_14_13_3) OR FIREABLE(TrainAcc_20_2_35_33_32_6)) AND FIREABLE(TrainStable_29_1_1_24_23_22_3) AND FIREABLE(TrainStable_39_4_10_28_24_23_15) AND FIREABLE(TrainStable_5_1_1_29_28_27_3) AND FIREABLE(AtStation_5_36) AND NOT FIREABLE(TrainDecc_13_4_10_11_7_6_15)))) : A (G (NOT FIREABLE(TrainAcc_7_2_17_15_14_6))) : E (F ((FIREABLE(TrainStable_25_4_10_19_15_14_15) AND FIREABLE(TrainAcc_8_1_11_10_9_3)))) : E (F ((FIREABLE(TrainStable_28_1_1_25_24_23_3) AND FIREABLE(AtStation_22_5) AND FIREABLE(TrainAcc_16_1_19_18_17_3) AND (NOT FIREABLE(TrainAcc_10_1_39_38_37_3) OR NOT FIREABLE(AtStation_12_5)) AND FIREABLE(TrainDecc_22_2_3_5_3_2_6)))) : E (F ((FIREABLE(TrainAcc_15_1_20_19_18_3) AND FIREABLE(TrainStable_13_4_10_30_26_25_15) AND FIREABLE(TrainStable_39_4_10_24_20_19_15) AND FIREABLE(TrainAcc_13_3_20_17_16_10) AND FIREABLE(TrainAcc_30_1_38_37_36_3) AND FIREABLE(TrainAcc_21_2_37_35_34_6) AND NOT FIREABLE(TrainStable_39_4_10_20_16_15_15) AND FIREABLE(AtStation_35_18)))) : E (F ((((FIREABLE(TrainAcc_27_2_24_22_21_6) AND FIREABLE(AtStation_2_6)) OR (FIREABLE(TrainStable_13_4_10_31_27_26_15) AND FIREABLE(TrainAcc_3_3_33_30_29_10)) OR FIREABLE(TrainAcc_27_2_36_34_33_6)) AND FIREABLE(TrainStable_40_4_10_34_30_29_15)))) : A (G ((NOT FIREABLE(TrainStable_26_4_10_28_24_23_15) OR NOT FIREABLE(TrainAcc_7_2_33_31_30_6))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(TrainStable_40_2_3_7_5_4_6)))
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(TrainStable_40_2_3_7_5_4_6)))
lola: processed formula length: 48
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(TrainStable_40_2_3_7_5_4_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(TrainAcc_3_3_34_31_30_10)))
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(TrainAcc_3_3_34_31_30_10)))
lola: processed formula length: 42
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(TrainAcc_3_3_34_31_30_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(TrainAcc_7_2_17_15_14_6)))
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(TrainAcc_7_2_17_15_14_6)))
lola: processed formula length: 45
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(TrainAcc_7_2_17_15_14_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainStable_25_4_10_19_15_14_15) AND FIREABLE(TrainAcc_8_1_11_10_9_3))))
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(TrainStable_25_4_10_19_15_14_15) AND FIREABLE(TrainAcc_8_1_11_10_9_3))))
lola: processed formula length: 88
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(TrainStable_25_4_10_19_15_14_15) AND FIREABLE(TrainAcc_8_1_11_10_9_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainStable_26_4_10_28_24_23_15) OR NOT FIREABLE(TrainAcc_7_2_33_31_30_6))))
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(TrainStable_26_4_10_28_24_23_15) OR NOT FIREABLE(TrainAcc_7_2_33_31_30_6))))
lola: processed formula length: 97
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(TrainStable_26_4_10_28_24_23_15) AND FIREABLE(TrainAcc_7_2_33_31_30_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainAcc_16_2_23_21_20_6) AND FIREABLE(TrainAcc_19_2_12_10_9_6) AND (FIREABLE(TrainAcc_31_3_17_14_13_10) OR FIREABLE(AtStation_19_39)))))
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(TrainAcc_16_2_23_21_20_6) AND FIREABLE(TrainAcc_19_2_12_10_9_6) AND (FIREABLE(TrainAcc_31_3_17_14_13_10) OR FIREABLE(AtStation_19_39)))))
lola: processed formula length: 154
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(TrainAcc_16_2_23_21_20_6) AND FIREABLE(TrainAcc_19_2_12_10_9_6) AND (FIREABLE(TrainAcc_31_3_17_14_13_10) OR FIREABLE(AtStation_19_39)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(TrainStable_40_1_1_24_23_22_3) AND NOT FIREABLE(AtStation_32_9)) OR NOT FIREABLE(TrainAcc_20_2_26_24_23_6) OR NOT FIREABLE(TrainStable_27_1_1_22_21_20_3))))
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(TrainStable_40_1_1_24_23_22_3) AND NOT FIREABLE(AtStation_32_9)) OR NOT FIREABLE(TrainAcc_20_2_26_24_23_6) OR NOT FIREABLE(TrainStable_27_1_1_22_21_20_3))))
lola: processed formula length: 179
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(TrainStable_40_1_1_24_23_22_3) OR FIREABLE(AtStation_32_9)) AND FIREABLE(TrainAcc_20_2_26_24_23_6) AND FIREABLE(TrainStable_27_1_1_22_21_20_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 25 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AtStation_17_37) OR NOT FIREABLE(TrainStable_38_4_10_26_22_21_15) OR (FIREABLE(TrainAcc_20_3_19_16_15_10) AND NOT FIREABLE(TrainStable_8_1_1_3_2_1_3)) OR (NOT FIREABLE(TrainStable_10_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_37_4_10_15_11_10_15)))))
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(AtStation_17_37) OR NOT FIREABLE(TrainStable_38_4_10_26_22_21_15) OR (FIREABLE(TrainAcc_20_3_19_16_15_10) AND NOT FIREABLE(TrainStable_8_1_1_3_2_1_3)) OR (NOT FIREABLE(TrainStable_10_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_37_4_10_15_11_10_15)))))
lola: processed formula length: 274
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(AtStation_17_37) AND FIREABLE(TrainStable_38_4_10_26_22_21_15) AND (NOT FIREABLE(TrainAcc_20_3_19_16_15_10) OR FIREABLE(TrainStable_8_1_1_3_2_1_3)) AND (FIREABLE(TrainStable_10_3_6_10_7_6_10) OR FIREABLE(TrainStable_37_4_10_15_11_10_15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 112 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainStable_28_1_1_25_24_23_3) AND FIREABLE(AtStation_22_5) AND FIREABLE(TrainAcc_16_1_19_18_17_3) AND (NOT FIREABLE(TrainAcc_10_1_39_38_37_3) OR NOT FIREABLE(AtStation_12_5)) AND FIREABLE(TrainDecc_22_2_3_5_3_2_6))))
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(TrainStable_28_1_1_25_24_23_3) AND FIREABLE(AtStation_22_5) AND FIREABLE(TrainAcc_16_1_19_18_17_3) AND (NOT FIREABLE(TrainAcc_10_1_39_38_37_3) OR NOT FIREABLE(AtStation_12_5)) AND FIREABLE(TrainDecc_22_2_3_5_3_2_6))))
lola: processed formula length: 234
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(TrainStable_28_1_1_25_24_23_3) AND FIREABLE(AtStation_22_5) AND FIREABLE(TrainAcc_16_1_19_18_17_3) AND (NOT FIREABLE(TrainAcc_10_1_39_38_37_3) OR NOT FIREABLE(AtStation_12_5)) AND FIREABLE(TrainDecc_22_2_3_5_3_2_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 68 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 390 markings, 598 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(TrainAcc_27_2_24_22_21_6) AND FIREABLE(AtStation_2_6)) OR (FIREABLE(TrainStable_13_4_10_31_27_26_15) AND FIREABLE(TrainAcc_3_3_33_30_29_10)) OR FIREABLE(TrainAcc_27_2_36_34_33_6)) AND FIREABLE(TrainStable_40_4_10_34_30_29_15))))
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(TrainAcc_27_2_24_22_21_6) AND FIREABLE(AtStation_2_6)) OR (FIREABLE(TrainStable_13_4_10_31_27_26_15) AND FIREABLE(TrainAcc_3_3_33_30_29_10)) OR FIREABLE(TrainAcc_27_2_36_34_33_6)) AND FIREABLE(TrainStable_40_4_10_34_30_29_15))))
lola: processed formula length: 248
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(TrainAcc_27_2_24_22_21_6) AND FIREABLE(AtStation_2_6)) OR (FIREABLE(TrainStable_13_4_10_31_27_26_15) AND FIREABLE(TrainAcc_3_3_33_30_29_10)) OR FIREABLE(TrainAcc_27_2_36_34_33_6)) AND FIREABLE(TrainStable_40_4_10_34_30_29_15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 34 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainDecc_4_3_6_9_6_5_10) AND (FIREABLE(AtStation_3_17) OR FIREABLE(TrainStable_36_4_10_19_15_14_15) OR (FIREABLE(AtStation_39_31) AND FIREABLE(TrainAcc_18_1_26_25_24_3))) AND FIREABLE(TrainAcc_24_1_33_32_31_3))))
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(TrainDecc_4_3_6_9_6_5_10) AND (FIREABLE(AtStation_3_17) OR FIREABLE(TrainStable_36_4_10_19_15_14_15) OR (FIREABLE(AtStation_39_31) AND FIREABLE(TrainAcc_18_1_26_25_24_3))) AND FIREABLE(TrainAcc_24_1_33_32_31_3))))
lola: processed formula length: 231
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(TrainDecc_4_3_6_9_6_5_10) AND (FIREABLE(AtStation_3_17) OR FIREABLE(TrainStable_36_4_10_19_15_14_15) OR (FIREABLE(AtStation_39_31) AND FIREABLE(TrainAcc_18_1_26_25_24_3))) AND FIREABLE(TrainAcc_24_1_33_32_31_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(TrainStable_34_3_6_11_8_7_10) AND NOT FIREABLE(TrainStable_4_4_10_19_15_14_15)) OR (NOT FIREABLE(TrainAcc_13_3_36_33_32_10) AND NOT FIREABLE(TrainAcc_25_2_31_29_28_6)) OR (NOT FIREABLE(TrainAcc_12_2_37_35_34_6) AND NOT FIREABLE(TrainAcc_38_3_24_21_20_10) AND NOT FIREABLE(TrainAcc_10_2_28_26_25_6)))))
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(TrainStable_34_3_6_11_8_7_10) AND NOT FIREABLE(TrainStable_4_4_10_19_15_14_15)) OR (NOT FIREABLE(TrainAcc_13_3_36_33_32_10) AND NOT FIREABLE(TrainAcc_25_2_31_29_28_6)) OR (NOT FIREABLE(TrainAcc_12_2_37_35_34_6) AND NOT FIREABLE(TrainAcc_38_3_24_21_20_10) AND NOT FIREABLE(TrainAcc_10_2_28_26_25_6)))))
lola: processed formula length: 324
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(TrainStable_34_3_6_11_8_7_10) OR FIREABLE(TrainStable_4_4_10_19_15_14_15)) AND (FIREABLE(TrainAcc_13_3_36_33_32_10) OR FIREABLE(TrainAcc_25_2_31_29_28_6)) AND (FIREABLE(TrainAcc_12_2_37_35_34_6) OR FIREABLE(TrainAcc_38_3_24_21_20_10) OR FIREABLE(TrainAcc_10_2_28_26_25_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 156 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainAcc_15_1_20_19_18_3) AND FIREABLE(TrainStable_13_4_10_30_26_25_15) AND FIREABLE(TrainStable_39_4_10_24_20_19_15) AND FIREABLE(TrainAcc_13_3_20_17_16_10) AND FIREABLE(TrainAcc_30_1_38_37_36_3) AND FIREABLE(TrainAcc_21_2_37_35_34_6) AND NOT FIREABLE(TrainStable_39_4_10_20_16_15_15) AND FIREABLE(AtStation_35_18))))
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(TrainAcc_15_1_20_19_18_3) AND FIREABLE(TrainStable_13_4_10_30_26_25_15) AND FIREABLE(TrainStable_39_4_10_24_20_19_15) AND FIREABLE(TrainAcc_13_3_20_17_16_10) AND FIREABLE(TrainAcc_30_1_38_37_36_3) AND FIREABLE(TrainAcc_21_2_37_35_34_6) AND NOT FIREABLE(TrainStable_39_4_10_20_16_15_15) AND FIREABLE(AtStation_35_18))))
lola: processed formula length: 334
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(TrainAcc_15_1_20_19_18_3) AND FIREABLE(TrainStable_13_4_10_30_26_25_15) AND FIREABLE(TrainStable_39_4_10_24_20_19_15) AND FIREABLE(TrainAcc_13_3_20_17_16_10) AND FIREABLE(TrainAcc_30_1_38_37_36_3) AND FIREABLE(TrainAcc_21_2_37_35_34_6) AND NOT FIREABLE(TrainStable_39_4_10_20_16_15_15) AND FIREABLE(AtStation_35_18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 58 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 907 markings, 1395 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(TrainStable_16_1_1_7_6_5_3) AND (FIREABLE(TrainStable_16_1_1_38_37_36_3) OR FIREABLE(TrainAcc_5_2_21_19_18_6))) OR (NOT FIREABLE(TrainStable_23_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_9_1_1_17_16_15_3)) OR ((NOT FIREABLE(AtStation_29_34) OR NOT FIREABLE(TrainAcc_35_2_27_25_24_6)) AND (NOT FIREABLE(TrainStable_28_1_1_26_25_24_3) OR NOT FIREABLE(TrainAcc_34_2_26_24_23_6... (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(TrainStable_16_1_1_7_6_5_3) AND (FIREABLE(TrainStable_16_1_1_38_37_36_3) OR FIREABLE(TrainAcc_5_2_21_19_18_6))) OR (NOT FIREABLE(TrainStable_23_3_6_10_7_6_10) AND NOT FIREABLE(TrainStable_9_1_1_17_16_15_3)) OR ((NOT FIREABLE(AtStation_29_34) OR NOT FIREABLE(TrainAcc_35_2_27_25_24_6)) AND (NOT FIREABLE(TrainStable_28_1_1_26_25_24_3) OR NOT FIREABLE(TrainAcc_34_2_26_24_23_6... (shortened)
lola: processed formula length: 406
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(TrainStable_16_1_1_7_6_5_3) OR (NOT FIREABLE(TrainStable_16_1_1_38_37_36_3) AND NOT FIREABLE(TrainAcc_5_2_21_19_18_6))) AND (FIREABLE(TrainStable_23_3_6_10_7_6_10) OR FIREABLE(TrainStable_9_1_1_17_16_15_3)) AND ((FIREABLE(AtStation_29_34) AND FIREABLE(TrainAcc_35_2_27_25_24_6)) OR (FIREABLE(TrainStable_28_1_1_26_25_24_3) AND FIREABLE(TrainAcc_34_2_26_24_23_6))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainAcc_40_3_22_19_18_10) OR (FIREABLE(TrainStable_24_1_1_16_15_14_3) AND FIREABLE(TrainAcc_2_3_22_19_18_10)) OR (FIREABLE(TrainAcc_9_3_21_18_17_10) AND FIREABLE(TrainAcc_25_3_34_31_30_10) AND (FIREABLE(TrainStable_7_1_1_33_32_31_3) OR FIREABLE(TrainAcc_16_2_32_30_29_6))) OR FIREABLE(TrainAcc_3_2_26_24_23_6) OR FIREABLE(TrainAcc_19_1_28_27_26_3) OR NOT FIREABLE(TrainStab... (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(TrainAcc_40_3_22_19_18_10) OR (FIREABLE(TrainStable_24_1_1_16_15_14_3) AND FIREABLE(TrainAcc_2_3_22_19_18_10)) OR (FIREABLE(TrainAcc_9_3_21_18_17_10) AND FIREABLE(TrainAcc_25_3_34_31_30_10) AND (FIREABLE(TrainStable_7_1_1_33_32_31_3) OR FIREABLE(TrainAcc_16_2_32_30_29_6))) OR FIREABLE(TrainAcc_3_2_26_24_23_6) OR FIREABLE(TrainAcc_19_1_28_27_26_3) OR NOT FIREABLE(TrainStab... (shortened)
lola: processed formula length: 463
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(TrainAcc_40_3_22_19_18_10) AND (NOT FIREABLE(TrainStable_24_1_1_16_15_14_3) OR NOT FIREABLE(TrainAcc_2_3_22_19_18_10)) AND (NOT FIREABLE(TrainAcc_9_3_21_18_17_10) OR NOT FIREABLE(TrainAcc_25_3_34_31_30_10) OR (NOT FIREABLE(TrainStable_7_1_1_33_32_31_3) AND NOT FIREABLE(TrainAcc_16_2_32_30_29_6))) AND NOT FIREABLE(TrainAcc_3_2_26_24_23_6) AND NOT FIREABLE(TrainAcc_19_1_28_27_26_3) AND FIREABLE(TrainStable_24_1_1_16_15_14_3) AND NOT FIREABLE(TrainAcc_35_2_38_36_35_6))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TrainAcc_17_2_37_35_34_6) OR FIREABLE(TrainStable_3_1_1_29_28_27_3)) AND NOT FIREABLE(TrainAcc_11_1_16_15_14_3) AND (FIREABLE(TrainAcc_31_1_21_20_19_3) OR FIREABLE(TrainDecc_40_3_6_7_4_3_10)) AND (FIREABLE(TrainAcc_10_1_15_14_13_3) OR FIREABLE(TrainAcc_20_2_35_33_32_6)) AND FIREABLE(TrainStable_29_1_1_24_23_22_3) AND FIREABLE(TrainStable_39_4_10_28_24_23_15) AND FIREABLE(TrainS... (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(TrainAcc_17_2_37_35_34_6) OR FIREABLE(TrainStable_3_1_1_29_28_27_3)) AND NOT FIREABLE(TrainAcc_11_1_16_15_14_3) AND (FIREABLE(TrainAcc_31_1_21_20_19_3) OR FIREABLE(TrainDecc_40_3_6_7_4_3_10)) AND (FIREABLE(TrainAcc_10_1_15_14_13_3) OR FIREABLE(TrainAcc_20_2_35_33_32_6)) AND FIREABLE(TrainStable_29_1_1_24_23_22_3) AND FIREABLE(TrainStable_39_4_10_28_24_23_15) AND FIREABLE(TrainS... (shortened)
lola: processed formula length: 501
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(TrainAcc_17_2_37_35_34_6) OR FIREABLE(TrainStable_3_1_1_29_28_27_3)) AND NOT FIREABLE(TrainAcc_11_1_16_15_14_3) AND (FIREABLE(TrainAcc_31_1_21_20_19_3) OR FIREABLE(TrainDecc_40_3_6_7_4_3_10)) AND (FIREABLE(TrainAcc_10_1_15_14_13_3) OR FIREABLE(TrainAcc_20_2_35_33_32_6)) AND FIREABLE(TrainStable_29_1_1_24_23_22_3) AND FIREABLE(TrainStable_39_4_10_28_24_23_15) AND FIREABLE(TrainStable_5_1_1_29_28_27_3) AND FIREABLE(AtStation_5_36) AND NOT FIREABLE(TrainDecc_13_4_10_11_7_6_15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2304 literals and 72 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-15-0.sara.
lola: sara is running 0 secs || 74952 markings, 118627 edges, 14990 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 118298 markings, 207199 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes no no no no yes no no yes no
lola:
preliminary result: yes no yes no no no yes no no no no yes no no yes no
lola: memory consumption: 977724 KB
lola: time consumption: 18 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553467828831
--------------------
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="BART-PT-040"
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 BART-PT-040, 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 r181-csrt-155344534700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-040.tgz
mv BART-PT-040 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 '
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 ;