About the Execution of LoLA for BART-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4270.590 | 5479.00 | 6948.00 | 17.20 | TTTTFTTTTFFTFTFT | 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-155344534600009.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-002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534600009
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 4.2K Mar 10 19:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 10 19:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 10 19:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 10 19:08 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.7K 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.4K Mar 10 19:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 10 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 10 17:46 NewModel
-rw-r--r-- 1 mcc users 3.9K Mar 10 19:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 10 19:03 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.4K Mar 10 18:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 10 18:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 506K 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-002-ReachabilityFireability-00
FORMULA_NAME BART-PT-002-ReachabilityFireability-01
FORMULA_NAME BART-PT-002-ReachabilityFireability-02
FORMULA_NAME BART-PT-002-ReachabilityFireability-03
FORMULA_NAME BART-PT-002-ReachabilityFireability-04
FORMULA_NAME BART-PT-002-ReachabilityFireability-05
FORMULA_NAME BART-PT-002-ReachabilityFireability-06
FORMULA_NAME BART-PT-002-ReachabilityFireability-07
FORMULA_NAME BART-PT-002-ReachabilityFireability-08
FORMULA_NAME BART-PT-002-ReachabilityFireability-09
FORMULA_NAME BART-PT-002-ReachabilityFireability-10
FORMULA_NAME BART-PT-002-ReachabilityFireability-11
FORMULA_NAME BART-PT-002-ReachabilityFireability-12
FORMULA_NAME BART-PT-002-ReachabilityFireability-13
FORMULA_NAME BART-PT-002-ReachabilityFireability-14
FORMULA_NAME BART-PT-002-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553467768069
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BART-PT-002 @ 3570 seconds
FORMULA BART-PT-002-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-002-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityFireability @ BART-PT-002
{
"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:49:28 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(TrainStable_4_2_10_32_28_27_15)))",
"processed_size": 48,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"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_1_29_26_25_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": 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(TrainStable_4_2_10_32_28_27_15)))",
"processed_size": 48,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 5,
"problems": 5
},
"type": "reachability",
"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": 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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(TrainAcc_3_1_17_14_13_10) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainAcc_3_2_25_22_21_10))))",
"processed_size": 127,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"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": 30,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(TrainAcc_2_2_16_14_13_6) AND FIREABLE(TrainDecc_3_2_6_7_4_3_10) AND FIREABLE(TrainStable_1_2_1_39_38_37_3))))",
"processed_size": 129,
"rewrites": 1
},
"result":
{
"edges": 202,
"markings": 132,
"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": 33,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 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": "E (F (((NOT FIREABLE(TrainAcc_1_2_13_12_11_3) OR NOT FIREABLE(TrainAcc_1_1_30_29_28_3)) AND FIREABLE(TrainStable_4_1_10_28_24_23_15) AND NOT FIREABLE(TrainAcc_1_2_29_28_27_3))))",
"processed_size": 178,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 224,
"problems": 32
},
"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": 0,
"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": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15) OR NOT FIREABLE(TrainAcc_2_1_35_33_32_6) OR FIREABLE(TrainStable_1_1_1_15_14_13_3) OR NOT FIREABLE(TrainAcc_1_1_28_27_26_3))))",
"processed_size": 177,
"rewrites": 2
},
"result":
{
"edges": 800,
"markings": 521,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 56,
"problems": 4
},
"type": "invariance",
"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": 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": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F (((FIREABLE(TrainStable_1_1_1_5_4_3_3) OR FIREABLE(TrainStable_1_2_1_19_18_17_3) OR NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15)) AND FIREABLE(TrainAcc_1_2_7_6_5_3) AND FIREABLE(TrainAcc_3_2_27_24_23_10))))",
"processed_size": 209,
"rewrites": 1
},
"result":
{
"edges": 26662,
"markings": 17292,
"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": 62,
"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": 2,
"adisj": 2,
"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": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F (((FIREABLE(TrainStable_1_1_1_21_20_19_3) AND FIREABLE(TrainStable_3_1_6_12_9_8_10)) OR (FIREABLE(TrainAcc_3_1_24_21_20_10) AND (FIREABLE(TrainAcc_3_2_35_32_31_10) OR NOT FIREABLE(TrainAcc_3_2_18_15_14_10))))))",
"processed_size": 217,
"rewrites": 1
},
"result":
{
"edges": 116,
"markings": 79,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 33,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F (((NOT FIREABLE(AtStation_2_37) OR NOT FIREABLE(TrainAcc_3_1_25_22_21_10) OR (NOT FIREABLE(TrainAcc_1_2_19_18_17_3) AND NOT FIREABLE(TrainStable_2_1_3_8_6_5_6))) AND FIREABLE(TrainAcc_3_2_21_18_17_10))))",
"processed_size": 210,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 145,
"problems": 25
},
"type": "reachability",
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(AtStation_2_15) AND (FIREABLE(TrainAcc_2_1_17_15_14_6) OR FIREABLE(TrainDecc_3_1_6_7_4_3_10) OR FIREABLE(AtStation_1_26)) AND FIREABLE(TrainAcc_3_2_23_20_19_10))))",
"processed_size": 181,
"rewrites": 1
},
"result":
{
"edges": 202,
"markings": 132,
"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"
},
"stateequation":
{
"literals": 29,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((NOT FIREABLE(TrainStable_1_1_1_34_33_32_3) OR (NOT FIREABLE(TrainAcc_2_2_13_11_10_6) AND NOT FIREABLE(TrainAcc_1_1_22_21_20_3)) OR NOT FIREABLE(TrainStable_3_2_6_10_7_6_10) OR NOT FIREABLE(TrainAcc_1_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_1_2_31_30_29_3) OR NOT FIREABLE(TrainAcc_3_1_24_21_20_10))))",
"processed_size": 311,
"rewrites": 2
},
"result":
{
"edges": 25847,
"markings": 16640,
"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"
},
"stateequation":
{
"literals": 52,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"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 ((FIREABLE(TrainStable_4_2_10_22_18_17_15) OR (NOT FIREABLE(TrainAcc_1_2_27_26_25_3) AND NOT FIREABLE(TrainStable_1_1_1_39_38_37_3)) OR ((NOT FIREABLE(AtStation_1_18) OR NOT FIREABLE(TrainAcc_2_2_31_29_28_6)) AND (NOT FIREABLE(AtStation_1_39) OR NOT FIREABLE(TrainStable_1_2_1_15_14_13_3))))))",
"processed_size": 302,
"rewrites": 2
},
"result":
{
"edges": 52590,
"markings": 17423,
"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"
},
"stateequation":
{
"literals": 240,
"problems": 20
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 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(TrainAcc_3_2_23_20_19_10) AND FIREABLE(AtStation_1_18) AND FIREABLE(TrainStable_4_2_10_26_22_21_15) AND FIREABLE(AtStation_1_34) AND NOT FIREABLE(TrainAcc_3_1_19_16_15_10) AND NOT FIREABLE(TrainDecc_4_2_10_12_8_7_15) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainStable_1_1_1_9_8_7_3) AND (FIREABLE(AtStation_2_24) OR FIREABLE(TrainStable_1_1_1_28_27_26_3)))))",
"processed_size": 389,
"rewrites": 1
},
"result":
{
"edges": 29517,
"markings": 16727,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 513,
"problems": 18
},
"type": "reachability",
"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": 3,
"adisj": 3,
"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": 10,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "E (F ((((FIREABLE(TrainStable_1_2_1_35_34_33_3) AND FIREABLE(TrainAcc_1_2_22_21_20_3)) OR FIREABLE(AtStation_1_22)) AND (FIREABLE(TrainStable_3_2_6_11_8_7_10) OR FIREABLE(TrainAcc_2_1_15_13_12_6) OR (FIREABLE(TrainAcc_1_1_25_24_23_3) AND FIREABLE(AtStation_1_17))) AND (NOT FIREABLE(TrainDecc_3_1_6_8_5_4_10) OR NOT FIREABLE(TrainAcc_1_1_24_23_22_3) OR NOT FIREABLE(TrainStable_1_2_1_38_37_36_3)))))",
"processed_size": 404,
"rewrites": 1
},
"result":
{
"edges": 198,
"markings": 185,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 746,
"problems": 67
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 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_3_2_36_33_32_10) OR FIREABLE(TrainAcc_3_2_37_34_33_10)) AND FIREABLE(TrainStable_1_1_1_14_13_12_3) AND FIREABLE(TrainAcc_3_1_21_18_17_10) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_2_1_13_11_10_6) AND FIREABLE(TrainAcc_2_1_20_18_17_6) AND (NOT FIREABLE(AtStation_2_11) OR NOT FIREABLE(TrainAcc_2_2_26_24_23_6) OR (FIREABLE(AtStation_2_19) AND FIREABLE(TrainStable_1_2_1_7_6_5_3)) OR FIREABLE(TrainStable_1_1_1_40_39_38_3)))))",
"processed_size": 476,
"rewrites": 1
},
"result":
{
"edges": 202,
"markings": 132,
"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": 398,
"problems": 14
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20180,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 3240,
"conflict_clusters": 4,
"places": 474,
"places_significant": 262,
"singleton_clusters": 0,
"transitions": 404
},
"result":
{
"preliminary_value": "yes yes yes yes no yes yes yes yes no no yes no yes no yes ",
"value": "yes yes yes yes no yes yes yes yes no no yes no yes 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: 878/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 474
lola: finding significant places
lola: 474 places, 404 transitions, 262 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 ((NOT FIREABLE(TrainAcc_3_1_17_14_13_10) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainAcc_3_2_25_22_21_10)))) : A (G ((FIREABLE(TrainStable_4_2_10_22_18_17_15) OR (NOT FIREABLE(TrainAcc_1_2_27_26_25_3) AND NOT FIREABLE(TrainStable_1_1_1_39_38_37_3)) OR ((NOT FIREABLE(AtStation_1_18) OR NOT FIREABLE(TrainAcc_2_2_31_29_28_6)) AND (NOT FIREABLE(AtStation_1_39) OR NOT FIREABLE(TrainStable_1_2_1_15_14_13_3)))))) : E (F (FIREABLE(TrainStable_4_2_10_32_28_27_15))) : A (G ((NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15) OR NOT FIREABLE(TrainAcc_2_1_35_33_32_6) OR FIREABLE(TrainStable_1_1_1_15_14_13_3) OR NOT FIREABLE(TrainAcc_1_1_28_27_26_3)))) : E (F ((NOT FIREABLE(TrainAcc_2_2_16_14_13_6) AND FIREABLE(TrainDecc_3_2_6_7_4_3_10) AND FIREABLE(TrainStable_1_2_1_39_38_37_3)))) : A (G ((NOT FIREABLE(TrainStable_1_1_1_34_33_32_3) OR (NOT FIREABLE(TrainAcc_2_2_13_11_10_6) AND NOT FIREABLE(TrainAcc_1_1_22_21_20_3)) OR NOT FIREABLE(TrainStable_3_2_6_10_7_6_10) OR NOT FIREABLE(TrainAcc_1_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_1_2_31_30_29_3) OR NOT FIREABLE(TrainAcc_3_1_24_21_20_10)))) : E (F (FIREABLE(TrainAcc_3_1_29_26_25_10))) : E (F (((NOT FIREABLE(TrainAcc_1_2_13_12_11_3) OR NOT FIREABLE(TrainAcc_1_1_30_29_28_3)) AND FIREABLE(TrainStable_4_1_10_28_24_23_15) AND NOT FIREABLE(TrainAcc_1_2_29_28_27_3)))) : E (F (((NOT FIREABLE(AtStation_2_37) OR NOT FIREABLE(TrainAcc_3_1_25_22_21_10) OR (NOT FIREABLE(TrainAcc_1_2_19_18_17_3) AND NOT FIREABLE(TrainStable_2_1_3_8_6_5_6))) AND FIREABLE(TrainAcc_3_2_21_18_17_10)))) : E (F ((FIREABLE(TrainAcc_3_2_23_20_19_10) AND FIREABLE(AtStation_1_18) AND FIREABLE(TrainStable_4_2_10_26_22_21_15) AND FIREABLE(AtStation_1_34) AND NOT FIREABLE(TrainAcc_3_1_19_16_15_10) AND NOT FIREABLE(TrainDecc_4_2_10_12_8_7_15) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainStable_1_1_1_9_8_7_3) AND (FIREABLE(AtStation_2_24) OR FIREABLE(TrainStable_1_1_1_28_27_26_3))))) : E (F (((FIREABLE(TrainStable_1_1_1_5_4_3_3) OR FIREABLE(TrainStable_1_2_1_19_18_17_3) OR NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15)) AND FIREABLE(TrainAcc_1_2_7_6_5_3) AND FIREABLE(TrainAcc_3_2_27_24_23_10)))) : E (F (((FIREABLE(TrainStable_1_1_1_21_20_19_3) AND FIREABLE(TrainStable_3_1_6_12_9_8_10)) OR (FIREABLE(TrainAcc_3_1_24_21_20_10) AND (FIREABLE(TrainAcc_3_2_35_32_31_10) OR NOT FIREABLE(TrainAcc_3_2_18_15_14_10)))))) : E (F (((FIREABLE(TrainAcc_3_2_36_33_32_10) OR FIREABLE(TrainAcc_3_2_37_34_33_10)) AND FIREABLE(TrainStable_1_1_1_14_13_12_3) AND FIREABLE(TrainAcc_3_1_21_18_17_10) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_2_1_13_11_10_6) AND FIREABLE(TrainAcc_2_1_20_18_17_6) AND (NOT FIREABLE(AtStation_2_11) OR NOT FIREABLE(TrainAcc_2_2_26_24_23_6) OR (FIREABLE(AtStation_2_19) AND FIREABLE(TrainStable_1_2_1_7_6_5_3)) OR FIREABLE(TrainStable_1_1_1_40_39_38_3))))) : E (F (FIREABLE(TrainStable_4_2_10_32_28_27_15))) : E (F ((FIREABLE(AtStation_2_15) AND (FIREABLE(TrainAcc_2_1_17_15_14_6) OR FIREABLE(TrainDecc_3_1_6_7_4_3_10) OR FIREABLE(AtStation_1_26)) AND FIREABLE(TrainAcc_3_2_23_20_19_10)))) : E (F ((((FIREABLE(TrainStable_1_2_1_35_34_33_3) AND FIREABLE(TrainAcc_1_2_22_21_20_3)) OR FIREABLE(AtStation_1_22)) AND (FIREABLE(TrainStable_3_2_6_11_8_7_10) OR FIREABLE(TrainAcc_2_1_15_13_12_6) OR (FIREABLE(TrainAcc_1_1_25_24_23_3) AND FIREABLE(AtStation_1_17))) AND (NOT FIREABLE(TrainDecc_3_1_6_8_5_4_10) OR NOT FIREABLE(TrainAcc_1_1_24_23_22_3) OR NOT FIREABLE(TrainStable_1_2_1_38_37_36_3)))))
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(TrainStable_4_2_10_32_28_27_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(TrainStable_4_2_10_32_28_27_15)))
lola: processed formula length: 48
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_4_2_10_32_28_27_15)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(TrainAcc_3_1_29_26_25_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_1_29_26_25_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_1_29_26_25_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: E (F (FIREABLE(TrainStable_4_2_10_32_28_27_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(TrainStable_4_2_10_32_28_27_15)))
lola: processed formula length: 48
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_4_2_10_32_28_27_15)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(TrainAcc_3_1_17_14_13_10) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainAcc_3_2_25_22_21_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 ((NOT FIREABLE(TrainAcc_3_1_17_14_13_10) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainAcc_3_2_25_22_21_10))))
lola: processed formula length: 127
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: (NOT FIREABLE(TrainAcc_3_1_17_14_13_10) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainAcc_3_2_25_22_21_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(TrainAcc_2_2_16_14_13_6) AND FIREABLE(TrainDecc_3_2_6_7_4_3_10) AND FIREABLE(TrainStable_1_2_1_39_38_37_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 ((NOT FIREABLE(TrainAcc_2_2_16_14_13_6) AND FIREABLE(TrainDecc_3_2_6_7_4_3_10) AND FIREABLE(TrainStable_1_2_1_39_38_37_3))))
lola: processed formula length: 129
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: (NOT FIREABLE(TrainAcc_2_2_16_14_13_6) AND FIREABLE(TrainDecc_3_2_6_7_4_3_10) AND FIREABLE(TrainStable_1_2_1_39_38_37_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 33 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 132 markings, 202 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(TrainAcc_1_2_13_12_11_3) OR NOT FIREABLE(TrainAcc_1_1_30_29_28_3)) AND FIREABLE(TrainStable_4_1_10_28_24_23_15) AND NOT FIREABLE(TrainAcc_1_2_29_28_27_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 (((NOT FIREABLE(TrainAcc_1_2_13_12_11_3) OR NOT FIREABLE(TrainAcc_1_1_30_29_28_3)) AND FIREABLE(TrainStable_4_1_10_28_24_23_15) AND NOT FIREABLE(TrainAcc_1_2_29_28_27_3))))
lola: processed formula length: 178
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: ((NOT FIREABLE(TrainAcc_1_2_13_12_11_3) OR NOT FIREABLE(TrainAcc_1_1_30_29_28_3)) AND FIREABLE(TrainStable_4_1_10_28_24_23_15) AND NOT FIREABLE(TrainAcc_1_2_29_28_27_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 224 literals and 32 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15) OR NOT FIREABLE(TrainAcc_2_1_35_33_32_6) OR FIREABLE(TrainStable_1_1_1_15_14_13_3) OR NOT FIREABLE(TrainAcc_1_1_28_27_26_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(TrainDecc_4_2_10_13_9_8_15) OR NOT FIREABLE(TrainAcc_2_1_35_33_32_6) OR FIREABLE(TrainStable_1_1_1_15_14_13_3) OR NOT FIREABLE(TrainAcc_1_1_28_27_26_3))))
lola: processed formula length: 177
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(TrainDecc_4_2_10_13_9_8_15) AND FIREABLE(TrainAcc_2_1_35_33_32_6) AND NOT FIREABLE(TrainStable_1_1_1_15_14_13_3) AND FIREABLE(TrainAcc_1_1_28_27_26_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 56 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 521 markings, 800 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TrainStable_1_1_1_5_4_3_3) OR FIREABLE(TrainStable_1_2_1_19_18_17_3) OR NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15)) AND FIREABLE(TrainAcc_1_2_7_6_5_3) AND FIREABLE(TrainAcc_3_2_27_24_23_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(TrainStable_1_1_1_5_4_3_3) OR FIREABLE(TrainStable_1_2_1_19_18_17_3) OR NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15)) AND FIREABLE(TrainAcc_1_2_7_6_5_3) AND FIREABLE(TrainAcc_3_2_27_24_23_10))))
lola: processed formula length: 209
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_1_1_1_5_4_3_3) OR FIREABLE(TrainStable_1_2_1_19_18_17_3) OR NOT FIREABLE(TrainDecc_4_2_10_13_9_8_15)) AND FIREABLE(TrainAcc_1_2_7_6_5_3) AND FIREABLE(TrainAcc_3_2_27_24_23_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 62 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: 17292 markings, 26662 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TrainStable_1_1_1_21_20_19_3) AND FIREABLE(TrainStable_3_1_6_12_9_8_10)) OR (FIREABLE(TrainAcc_3_1_24_21_20_10) AND (FIREABLE(TrainAcc_3_2_35_32_31_10) OR NOT FIREABLE(TrainAcc_3_2_18_15_14_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(TrainStable_1_1_1_21_20_19_3) AND FIREABLE(TrainStable_3_1_6_12_9_8_10)) OR (FIREABLE(TrainAcc_3_1_24_21_20_10) AND (FIREABLE(TrainAcc_3_2_35_32_31_10) OR NOT FIREABLE(TrainAcc_3_2_18_15_14_10))))))
lola: processed formula length: 217
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_1_1_1_21_20_19_3) AND FIREABLE(TrainStable_3_1_6_12_9_8_10)) OR (FIREABLE(TrainAcc_3_1_24_21_20_10) AND (FIREABLE(TrainAcc_3_2_35_32_31_10) OR NOT FIREABLE(TrainAcc_3_2_18_15_14_10))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 33 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 116 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(AtStation_2_37) OR NOT FIREABLE(TrainAcc_3_1_25_22_21_10) OR (NOT FIREABLE(TrainAcc_1_2_19_18_17_3) AND NOT FIREABLE(TrainStable_2_1_3_8_6_5_6))) AND FIREABLE(TrainAcc_3_2_21_18_17_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 (((NOT FIREABLE(AtStation_2_37) OR NOT FIREABLE(TrainAcc_3_1_25_22_21_10) OR (NOT FIREABLE(TrainAcc_1_2_19_18_17_3) AND NOT FIREABLE(TrainStable_2_1_3_8_6_5_6))) AND FIREABLE(TrainAcc_3_2_21_18_17_10))))
lola: processed formula length: 210
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: ((NOT FIREABLE(AtStation_2_37) OR NOT FIREABLE(TrainAcc_3_1_25_22_21_10) OR (NOT FIREABLE(TrainAcc_1_2_19_18_17_3) AND NOT FIREABLE(TrainStable_2_1_3_8_6_5_6))) AND FIREABLE(TrainAcc_3_2_21_18_17_10))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 145 literals and 25 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(AtStation_2_15) AND (FIREABLE(TrainAcc_2_1_17_15_14_6) OR FIREABLE(TrainDecc_3_1_6_7_4_3_10) OR FIREABLE(AtStation_1_26)) AND FIREABLE(TrainAcc_3_2_23_20_19_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(AtStation_2_15) AND (FIREABLE(TrainAcc_2_1_17_15_14_6) OR FIREABLE(TrainDecc_3_1_6_7_4_3_10) OR FIREABLE(AtStation_1_26)) AND FIREABLE(TrainAcc_3_2_23_20_19_10))))
lola: processed formula length: 181
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(AtStation_2_15) AND (FIREABLE(TrainAcc_2_1_17_15_14_6) OR FIREABLE(TrainDecc_3_1_6_7_4_3_10) OR FIREABLE(AtStation_1_26)) AND FIREABLE(TrainAcc_3_2_23_20_19_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 29 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 132 markings, 202 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainStable_1_1_1_34_33_32_3) OR (NOT FIREABLE(TrainAcc_2_2_13_11_10_6) AND NOT FIREABLE(TrainAcc_1_1_22_21_20_3)) OR NOT FIREABLE(TrainStable_3_2_6_10_7_6_10) OR NOT FIREABLE(TrainAcc_1_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_1_2_31_30_29_3) OR NOT FIREABLE(TrainAcc_3_1_24_21_20_10))))
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_1_1_1_34_33_32_3) OR (NOT FIREABLE(TrainAcc_2_2_13_11_10_6) AND NOT FIREABLE(TrainAcc_1_1_22_21_20_3)) OR NOT FIREABLE(TrainStable_3_2_6_10_7_6_10) OR NOT FIREABLE(TrainAcc_1_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_1_2_31_30_29_3) OR NOT FIREABLE(TrainAcc_3_1_24_21_20_10))))
lola: processed formula length: 311
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_1_1_1_34_33_32_3) AND (FIREABLE(TrainAcc_2_2_13_11_10_6) OR FIREABLE(TrainAcc_1_1_22_21_20_3)) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_1_1_22_21_20_3) AND FIREABLE(TrainAcc_1_2_31_30_29_3) AND FIREABLE(TrainAcc_3_1_24_21_20_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 52 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-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: 16640 markings, 25847 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(TrainStable_4_2_10_22_18_17_15) OR (NOT FIREABLE(TrainAcc_1_2_27_26_25_3) AND NOT FIREABLE(TrainStable_1_1_1_39_38_37_3)) OR ((NOT FIREABLE(AtStation_1_18) OR NOT FIREABLE(TrainAcc_2_2_31_29_28_6)) AND (NOT FIREABLE(AtStation_1_39) OR NOT FIREABLE(TrainStable_1_2_1_15_14_13_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 ((FIREABLE(TrainStable_4_2_10_22_18_17_15) OR (NOT FIREABLE(TrainAcc_1_2_27_26_25_3) AND NOT FIREABLE(TrainStable_1_1_1_39_38_37_3)) OR ((NOT FIREABLE(AtStation_1_18) OR NOT FIREABLE(TrainAcc_2_2_31_29_28_6)) AND (NOT FIREABLE(AtStation_1_39) OR NOT FIREABLE(TrainStable_1_2_1_15_14_13_3))))))
lola: processed formula length: 302
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(TrainStable_4_2_10_22_18_17_15) AND (FIREABLE(TrainAcc_1_2_27_26_25_3) OR FIREABLE(TrainStable_1_1_1_39_38_37_3)) AND ((FIREABLE(AtStation_1_18) AND FIREABLE(TrainAcc_2_2_31_29_28_6)) OR (FIREABLE(AtStation_1_39) AND FIREABLE(TrainStable_1_2_1_15_14_13_3))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 240 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-12-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: 17423 markings, 52590 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainAcc_3_2_23_20_19_10) AND FIREABLE(AtStation_1_18) AND FIREABLE(TrainStable_4_2_10_26_22_21_15) AND FIREABLE(AtStation_1_34) AND NOT FIREABLE(TrainAcc_3_1_19_16_15_10) AND NOT FIREABLE(TrainDecc_4_2_10_12_8_7_15) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainStable_1_1_1_9_8_7_3) AND (FIREABLE(AtStation_2_24) OR FIREABLE(TrainStable_1_1_1_28_27_26_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(TrainAcc_3_2_23_20_19_10) AND FIREABLE(AtStation_1_18) AND FIREABLE(TrainStable_4_2_10_26_22_21_15) AND FIREABLE(AtStation_1_34) AND NOT FIREABLE(TrainAcc_3_1_19_16_15_10) AND NOT FIREABLE(TrainDecc_4_2_10_12_8_7_15) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainStable_1_1_1_9_8_7_3) AND (FIREABLE(AtStation_2_24) OR FIREABLE(TrainStable_1_1_1_28_27_26_3)))))
lola: processed formula length: 389
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_2_23_20_19_10) AND FIREABLE(AtStation_1_18) AND FIREABLE(TrainStable_4_2_10_26_22_21_15) AND FIREABLE(AtStation_1_34) AND NOT FIREABLE(TrainAcc_3_1_19_16_15_10) AND NOT FIREABLE(TrainDecc_4_2_10_12_8_7_15) AND FIREABLE(TrainStable_1_1_1_3_2_1_3) AND FIREABLE(TrainStable_1_1_1_9_8_7_3) AND (FIREABLE(AtStation_2_24) OR FIREABLE(TrainStable_1_1_1_28_27_26_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 513 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-13-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: 16727 markings, 29517 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(TrainStable_1_2_1_35_34_33_3) AND FIREABLE(TrainAcc_1_2_22_21_20_3)) OR FIREABLE(AtStation_1_22)) AND (FIREABLE(TrainStable_3_2_6_11_8_7_10) OR FIREABLE(TrainAcc_2_1_15_13_12_6) OR (FIREABLE(TrainAcc_1_1_25_24_23_3) AND FIREABLE(AtStation_1_17))) AND (NOT FIREABLE(TrainDecc_3_1_6_8_5_4_10) OR NOT FIREABLE(TrainAcc_1_1_24_23_22_3) OR NOT FIREABLE(TrainStable_1_2_1_38_37_36_3)... (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(TrainStable_1_2_1_35_34_33_3) AND FIREABLE(TrainAcc_1_2_22_21_20_3)) OR FIREABLE(AtStation_1_22)) AND (FIREABLE(TrainStable_3_2_6_11_8_7_10) OR FIREABLE(TrainAcc_2_1_15_13_12_6) OR (FIREABLE(TrainAcc_1_1_25_24_23_3) AND FIREABLE(AtStation_1_17))) AND (NOT FIREABLE(TrainDecc_3_1_6_8_5_4_10) OR NOT FIREABLE(TrainAcc_1_1_24_23_22_3) OR NOT FIREABLE(TrainStable_1_2_1_38_37_36_3)... (shortened)
lola: processed formula length: 404
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_1_2_1_35_34_33_3) AND FIREABLE(TrainAcc_1_2_22_21_20_3)) OR FIREABLE(AtStation_1_22)) AND (FIREABLE(TrainStable_3_2_6_11_8_7_10) OR FIREABLE(TrainAcc_2_1_15_13_12_6) OR (FIREABLE(TrainAcc_1_1_25_24_23_3) AND FIREABLE(AtStation_1_17))) AND (NOT FIREABLE(TrainDecc_3_1_6_8_5_4_10) OR NOT FIREABLE(TrainAcc_1_1_24_23_22_3) OR NOT FIREABLE(TrainStable_1_2_1_38_37_36_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 746 literals and 67 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 185 markings, 198 edges
lola: state equation: write sara problem file to ReachabilityFireability-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TrainAcc_3_2_36_33_32_10) OR FIREABLE(TrainAcc_3_2_37_34_33_10)) AND FIREABLE(TrainStable_1_1_1_14_13_12_3) AND FIREABLE(TrainAcc_3_1_21_18_17_10) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_2_1_13_11_10_6) AND FIREABLE(TrainAcc_2_1_20_18_17_6) AND (NOT FIREABLE(AtStation_2_11) OR NOT FIREABLE(TrainAcc_2_2_26_24_23_6) OR (FIREABLE(AtStation_2_19) AND FIREABL... (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_3_2_36_33_32_10) OR FIREABLE(TrainAcc_3_2_37_34_33_10)) AND FIREABLE(TrainStable_1_1_1_14_13_12_3) AND FIREABLE(TrainAcc_3_1_21_18_17_10) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_2_1_13_11_10_6) AND FIREABLE(TrainAcc_2_1_20_18_17_6) AND (NOT FIREABLE(AtStation_2_11) OR NOT FIREABLE(TrainAcc_2_2_26_24_23_6) OR (FIREABLE(AtStation_2_19) AND FIREABL... (shortened)
lola: processed formula length: 476
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_2_36_33_32_10) OR FIREABLE(TrainAcc_3_2_37_34_33_10)) AND FIREABLE(TrainStable_1_1_1_14_13_12_3) AND FIREABLE(TrainAcc_3_1_21_18_17_10) AND FIREABLE(TrainStable_3_2_6_10_7_6_10) AND FIREABLE(TrainAcc_2_1_13_11_10_6) AND FIREABLE(TrainAcc_2_1_20_18_17_6) AND (NOT FIREABLE(AtStation_2_11) OR NOT FIREABLE(TrainAcc_2_2_26_24_23_6) OR (FIREABLE(AtStation_2_19) AND FIREABLE(TrainStable_1_2_1_7_6_5_3)) OR FIREABLE(TrainStable_1_1_1_40_39_38_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 398 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 132 markings, 202 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes no no yes no yes no yes
lola:
preliminary result: yes yes yes yes no yes yes yes yes no no yes no yes no yes
lola: memory consumption: 20180 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553467773548
--------------------
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-002"
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-002, 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-155344534600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 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 ;