About the Execution of LoLA for BART-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5736.080 | 12851.00 | 15936.00 | 10.10 | FTFTTTTFFFFTTTTT | 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-155344534700063.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-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534700063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 4.4K Mar 10 19:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 10 19:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 10 19:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 10 19:14 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.6K 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 8.1K Mar 10 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 10 17:46 NewModel
-rw-r--r-- 1 mcc users 4.1K Mar 10 19:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 10 19:06 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 3.6K Mar 10 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 10 19:02 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 12M 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-050-ReachabilityFireability-00
FORMULA_NAME BART-PT-050-ReachabilityFireability-01
FORMULA_NAME BART-PT-050-ReachabilityFireability-02
FORMULA_NAME BART-PT-050-ReachabilityFireability-03
FORMULA_NAME BART-PT-050-ReachabilityFireability-04
FORMULA_NAME BART-PT-050-ReachabilityFireability-05
FORMULA_NAME BART-PT-050-ReachabilityFireability-06
FORMULA_NAME BART-PT-050-ReachabilityFireability-07
FORMULA_NAME BART-PT-050-ReachabilityFireability-08
FORMULA_NAME BART-PT-050-ReachabilityFireability-09
FORMULA_NAME BART-PT-050-ReachabilityFireability-10
FORMULA_NAME BART-PT-050-ReachabilityFireability-11
FORMULA_NAME BART-PT-050-ReachabilityFireability-12
FORMULA_NAME BART-PT-050-ReachabilityFireability-13
FORMULA_NAME BART-PT-050-ReachabilityFireability-14
FORMULA_NAME BART-PT-050-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553467867215
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BART-PT-050 @ 3570 seconds
FORMULA BART-PT-050-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BART-PT-050-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for ReachabilityFireability @ BART-PT-050
{
"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:51:07 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(TrainAcc_2_8_11_9_8_6)))",
"processed_size": 39,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"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": 4,
"problems": 4
},
"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(TrainStable_4_45_10_20_16_15_15)))",
"processed_size": 49,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 5,
"problems": 5
},
"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_46_10_25_21_20_15)))",
"processed_size": 49,
"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": 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(TrainDecc_4_6_10_14_10_9_15) AND FIREABLE(TrainStable_1_47_1_3_2_1_3))))",
"processed_size": 88,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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": 10,
"problems": 10
},
"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_2_30_3_8_6_5_6) OR NOT FIREABLE(TrainStable_1_13_1_26_25_24_3))))",
"processed_size": 98,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"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": 10,
"problems": 10
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F (((FIREABLE(TrainStable_4_9_10_19_15_14_15) OR FIREABLE(AtStation_37_6)) AND FIREABLE(TrainStable_4_38_10_25_21_20_15))))",
"processed_size": 127,
"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": 17,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(TrainAcc_3_41_30_27_26_10) OR (FIREABLE(TrainAcc_1_32_23_22_21_3) AND FIREABLE(TrainAcc_2_27_14_12_11_6)))))",
"processed_size": 125,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 12,
"problems": 2
},
"type": "reachability",
"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": 0,
"adisj": 1,
"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": "A (G ((FIREABLE(TrainAcc_2_42_25_23_22_6) OR FIREABLE(TrainStable_1_29_1_19_18_17_3) OR NOT FIREABLE(TrainAcc_3_8_32_29_28_10))))",
"processed_size": 131,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"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": 120,
"problems": 20
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"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 ((FIREABLE(TrainAcc_3_28_16_13_12_10) AND (NOT FIREABLE(TrainStable_1_5_1_23_22_21_3) OR NOT FIREABLE(TrainStable_1_35_1_16_15_14_3) OR NOT FIREABLE(TrainStable_1_46_1_35_34_33_3)))))",
"processed_size": 190,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 75,
"problems": 15
},
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(TrainStable_4_29_10_30_26_25_15) AND FIREABLE(TrainStable_1_32_1_2_1_0_3) AND (NOT FIREABLE(TrainStable_1_10_1_19_18_17_3) OR FIREABLE(TrainAcc_1_50_40_39_38_3)))))",
"processed_size": 181,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"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": 47,
"problems": 4
},
"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": 1,
"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": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(TrainStable_1_43_1_24_23_22_3) AND NOT FIREABLE(TrainAcc_1_6_34_33_32_3) AND FIREABLE(TrainStop_29) AND NOT FIREABLE(TrainAcc_1_10_23_22_21_3))))",
"processed_size": 165,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 320,
"problems": 80
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"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": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(AtStation_42_38) OR NOT FIREABLE(TrainAcc_1_45_20_19_18_3) OR NOT FIREABLE(AtStation_15_37) OR NOT FIREABLE(TrainAcc_2_37_16_14_13_6) OR NOT FIREABLE(TrainAcc_3_27_21_18_17_10))))",
"processed_size": 203,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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": 16,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G (((NOT FIREABLE(TrainAcc_2_10_31_29_28_6) OR NOT FIREABLE(TrainStable_2_10_3_8_6_5_6)) AND (NOT FIREABLE(TrainAcc_1_44_10_9_8_3) OR NOT FIREABLE(TrainStable_4_23_10_17_13_12_15)) AND NOT FIREABLE(TrainAcc_3_40_20_17_16_10))))",
"processed_size": 232,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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": 22,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G (((FIREABLE(TrainStable_1_3_1_17_16_15_3) AND FIREABLE(TrainStable_4_32_10_25_21_20_15)) OR ((NOT FIREABLE(TrainAcc_3_27_37_34_33_10) OR NOT FIREABLE(TrainAcc_3_33_26_23_22_10)) AND NOT FIREABLE(TrainAcc_2_38_17_15_14_6)))))",
"processed_size": 231,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"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": 126,
"problems": 18
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"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": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(TrainStable_1_1_1_3_2_1_3) AND (NOT FIREABLE(TrainStable_1_22_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_2_24_19_17_16_6) OR (FIREABLE(TrainAcc_3_39_20_17_16_10) AND FIREABLE(TrainStable_4_41_10_33_29_28_15) AND (FIREABLE(TrainAcc_3_30_27_24_23_10) OR FIREABLE(TrainStable_1_50_1_20_19_18_3)))))))",
"processed_size": 312,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 79,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(TrainStable_4_43_10_15_11_10_15) OR NOT FIREABLE(TrainAcc_1_13_33_32_31_3) OR NOT FIREABLE(TrainAcc_1_7_35_34_33_3) OR ((FIREABLE(TrainStable_1_19_1_38_37_36_3) OR FIREABLE(TrainAcc_1_41_19_18_17_3)) AND FIREABLE(TrainAcc_1_9_31_30_29_3) AND FIREABLE(TrainStable_1_28_1_28_27_26_3)))))",
"processed_size": 309,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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": 278,
"problems": 19
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 1484048,
"runtime": 12.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 81000,
"conflict_clusters": 52,
"places": 6810,
"places_significant": 6550,
"singleton_clusters": 0,
"transitions": 10100
},
"result":
{
"preliminary_value": "no yes no yes yes yes yes no no no no yes yes yes yes yes ",
"value": "no yes no yes yes yes yes no no no no yes yes yes yes 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: 16910/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6810
lola: finding significant places
lola: 6810 places, 10100 transitions, 6550 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: A (G ((NOT FIREABLE(TrainStable_2_30_3_8_6_5_6) OR NOT FIREABLE(TrainStable_1_13_1_26_25_24_3)))) : E (F (FIREABLE(TrainAcc_2_8_11_9_8_6))) : A (G ((NOT FIREABLE(AtStation_42_38) OR NOT FIREABLE(TrainAcc_1_45_20_19_18_3) OR NOT FIREABLE(AtStation_15_37) OR NOT FIREABLE(TrainAcc_2_37_16_14_13_6) OR NOT FIREABLE(TrainAcc_3_27_21_18_17_10)))) : E (F ((NOT FIREABLE(TrainStable_1_43_1_24_23_22_3) AND NOT FIREABLE(TrainAcc_1_6_34_33_32_3) AND FIREABLE(TrainStop_29) AND NOT FIREABLE(TrainAcc_1_10_23_22_21_3)))) : E (F ((FIREABLE(TrainAcc_3_41_30_27_26_10) OR (FIREABLE(TrainAcc_1_32_23_22_21_3) AND FIREABLE(TrainAcc_2_27_14_12_11_6))))) : E (F ((FIREABLE(TrainStable_4_29_10_30_26_25_15) AND FIREABLE(TrainStable_1_32_1_2_1_0_3) AND (NOT FIREABLE(TrainStable_1_10_1_19_18_17_3) OR FIREABLE(TrainAcc_1_50_40_39_38_3))))) : E (F (FIREABLE(TrainStable_4_45_10_20_16_15_15))) : A (G (((FIREABLE(TrainStable_1_3_1_17_16_15_3) AND FIREABLE(TrainStable_4_32_10_25_21_20_15)) OR ((NOT FIREABLE(TrainAcc_3_27_37_34_33_10) OR NOT FIREABLE(TrainAcc_3_33_26_23_22_10)) AND NOT FIREABLE(TrainAcc_2_38_17_15_14_6))))) : A (G ((FIREABLE(TrainAcc_2_42_25_23_22_6) OR FIREABLE(TrainStable_1_29_1_19_18_17_3) OR NOT FIREABLE(TrainAcc_3_8_32_29_28_10)))) : A (G ((NOT FIREABLE(TrainStable_4_43_10_15_11_10_15) OR NOT FIREABLE(TrainAcc_1_13_33_32_31_3) OR NOT FIREABLE(TrainAcc_1_7_35_34_33_3) OR ((FIREABLE(TrainStable_1_19_1_38_37_36_3) OR FIREABLE(TrainAcc_1_41_19_18_17_3)) AND FIREABLE(TrainAcc_1_9_31_30_29_3) AND FIREABLE(TrainStable_1_28_1_28_27_26_3))))) : A (G (((NOT FIREABLE(TrainAcc_2_10_31_29_28_6) OR NOT FIREABLE(TrainStable_2_10_3_8_6_5_6)) AND (NOT FIREABLE(TrainAcc_1_44_10_9_8_3) OR NOT FIREABLE(TrainStable_4_23_10_17_13_12_15)) AND NOT FIREABLE(TrainAcc_3_40_20_17_16_10)))) : E (F (((FIREABLE(TrainStable_4_9_10_19_15_14_15) OR FIREABLE(AtStation_37_6)) AND FIREABLE(TrainStable_4_38_10_25_21_20_15)))) : E (F ((FIREABLE(TrainStable_1_1_1_3_2_1_3) AND (NOT FIREABLE(TrainStable_1_22_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_2_24_19_17_16_6) OR (FIREABLE(TrainAcc_3_39_20_17_16_10) AND FIREABLE(TrainStable_4_41_10_33_29_28_15) AND (FIREABLE(TrainAcc_3_30_27_24_23_10) OR FIREABLE(TrainStable_1_50_1_20_19_18_3))))))) : E (F ((FIREABLE(TrainAcc_3_28_16_13_12_10) AND (NOT FIREABLE(TrainStable_1_5_1_23_22_21_3) OR NOT FIREABLE(TrainStable_1_35_1_16_15_14_3) OR NOT FIREABLE(TrainStable_1_46_1_35_34_33_3))))) : E (F ((FIREABLE(TrainDecc_4_6_10_14_10_9_15) AND FIREABLE(TrainStable_1_47_1_3_2_1_3)))) : E (F (FIREABLE(TrainStable_4_46_10_25_21_20_15)))
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(TrainAcc_2_8_11_9_8_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(TrainAcc_2_8_11_9_8_6)))
lola: processed formula length: 39
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_2_8_11_9_8_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: yes
lola: produced by: state space
lola: The predicate is reachable.
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(TrainStable_4_45_10_20_16_15_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_45_10_20_16_15_15)))
lola: processed formula length: 49
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_45_10_20_16_15_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: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(TrainStable_4_46_10_25_21_20_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_46_10_25_21_20_15)))
lola: processed formula length: 49
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_46_10_25_21_20_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: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainDecc_4_6_10_14_10_9_15) AND FIREABLE(TrainStable_1_47_1_3_2_1_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_6_10_14_10_9_15) AND FIREABLE(TrainStable_1_47_1_3_2_1_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(TrainDecc_4_6_10_14_10_9_15) AND FIREABLE(TrainStable_1_47_1_3_2_1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 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 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainStable_2_30_3_8_6_5_6) OR NOT FIREABLE(TrainStable_1_13_1_26_25_24_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_2_30_3_8_6_5_6) OR NOT FIREABLE(TrainStable_1_13_1_26_25_24_3))))
lola: processed formula length: 98
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_2_30_3_8_6_5_6) AND FIREABLE(TrainStable_1_13_1_26_25_24_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TrainStable_4_9_10_19_15_14_15) OR FIREABLE(AtStation_37_6)) AND FIREABLE(TrainStable_4_38_10_25_21_20_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_9_10_19_15_14_15) OR FIREABLE(AtStation_37_6)) AND FIREABLE(TrainStable_4_38_10_25_21_20_15))))
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: ((FIREABLE(TrainStable_4_9_10_19_15_14_15) OR FIREABLE(AtStation_37_6)) AND FIREABLE(TrainStable_4_38_10_25_21_20_15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 17 literals and 2 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 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainAcc_3_41_30_27_26_10) OR (FIREABLE(TrainAcc_1_32_23_22_21_3) AND FIREABLE(TrainAcc_2_27_14_12_11_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(TrainAcc_3_41_30_27_26_10) OR (FIREABLE(TrainAcc_1_32_23_22_21_3) AND FIREABLE(TrainAcc_2_27_14_12_11_6)))))
lola: processed formula length: 125
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_41_30_27_26_10) OR (FIREABLE(TrainAcc_1_32_23_22_21_3) AND FIREABLE(TrainAcc_2_27_14_12_11_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 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 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(TrainAcc_2_42_25_23_22_6) OR FIREABLE(TrainStable_1_29_1_19_18_17_3) OR NOT FIREABLE(TrainAcc_3_8_32_29_28_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 ((FIREABLE(TrainAcc_2_42_25_23_22_6) OR FIREABLE(TrainStable_1_29_1_19_18_17_3) OR NOT FIREABLE(TrainAcc_3_8_32_29_28_10))))
lola: processed formula length: 131
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(TrainAcc_2_42_25_23_22_6) AND NOT FIREABLE(TrainStable_1_29_1_19_18_17_3) AND FIREABLE(TrainAcc_3_8_32_29_28_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 120 literals and 20 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 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainAcc_3_28_16_13_12_10) AND (NOT FIREABLE(TrainStable_1_5_1_23_22_21_3) OR NOT FIREABLE(TrainStable_1_35_1_16_15_14_3) OR NOT FIREABLE(TrainStable_1_46_1_35_34_33_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_28_16_13_12_10) AND (NOT FIREABLE(TrainStable_1_5_1_23_22_21_3) OR NOT FIREABLE(TrainStable_1_35_1_16_15_14_3) OR NOT FIREABLE(TrainStable_1_46_1_35_34_33_3)))))
lola: processed formula length: 190
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_28_16_13_12_10) AND (NOT FIREABLE(TrainStable_1_5_1_23_22_21_3) OR NOT FIREABLE(TrainStable_1_35_1_16_15_14_3) OR NOT FIREABLE(TrainStable_1_46_1_35_34_33_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 75 literals and 15 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 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainStable_4_29_10_30_26_25_15) AND FIREABLE(TrainStable_1_32_1_2_1_0_3) AND (NOT FIREABLE(TrainStable_1_10_1_19_18_17_3) OR FIREABLE(TrainAcc_1_50_40_39_38_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_4_29_10_30_26_25_15) AND FIREABLE(TrainStable_1_32_1_2_1_0_3) AND (NOT FIREABLE(TrainStable_1_10_1_19_18_17_3) OR FIREABLE(TrainAcc_1_50_40_39_38_3)))))
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(TrainStable_4_29_10_30_26_25_15) AND FIREABLE(TrainStable_1_32_1_2_1_0_3) AND (NOT FIREABLE(TrainStable_1_10_1_19_18_17_3) OR FIREABLE(TrainAcc_1_50_40_39_38_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 47 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(TrainStable_1_43_1_24_23_22_3) AND NOT FIREABLE(TrainAcc_1_6_34_33_32_3) AND FIREABLE(TrainStop_29) AND NOT FIREABLE(TrainAcc_1_10_23_22_21_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(TrainStable_1_43_1_24_23_22_3) AND NOT FIREABLE(TrainAcc_1_6_34_33_32_3) AND FIREABLE(TrainStop_29) AND NOT FIREABLE(TrainAcc_1_10_23_22_21_3))))
lola: processed formula length: 165
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(TrainStable_1_43_1_24_23_22_3) AND NOT FIREABLE(TrainAcc_1_6_34_33_32_3) AND FIREABLE(TrainStop_29) AND NOT FIREABLE(TrainAcc_1_10_23_22_21_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 320 literals and 80 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 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AtStation_42_38) OR NOT FIREABLE(TrainAcc_1_45_20_19_18_3) OR NOT FIREABLE(AtStation_15_37) OR NOT FIREABLE(TrainAcc_2_37_16_14_13_6) OR NOT FIREABLE(TrainAcc_3_27_21_18_17_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(AtStation_42_38) OR NOT FIREABLE(TrainAcc_1_45_20_19_18_3) OR NOT FIREABLE(AtStation_15_37) OR NOT FIREABLE(TrainAcc_2_37_16_14_13_6) OR NOT FIREABLE(TrainAcc_3_27_21_18_17_10))))
lola: processed formula length: 203
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_42_38) AND FIREABLE(TrainAcc_1_45_20_19_18_3) AND FIREABLE(AtStation_15_37) AND FIREABLE(TrainAcc_2_37_16_14_13_6) AND FIREABLE(TrainAcc_3_27_21_18_17_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 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 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(TrainAcc_2_10_31_29_28_6) OR NOT FIREABLE(TrainStable_2_10_3_8_6_5_6)) AND (NOT FIREABLE(TrainAcc_1_44_10_9_8_3) OR NOT FIREABLE(TrainStable_4_23_10_17_13_12_15)) AND NOT FIREABLE(TrainAcc_3_40_20_17_16_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(TrainAcc_2_10_31_29_28_6) OR NOT FIREABLE(TrainStable_2_10_3_8_6_5_6)) AND (NOT FIREABLE(TrainAcc_1_44_10_9_8_3) OR NOT FIREABLE(TrainStable_4_23_10_17_13_12_15)) AND NOT FIREABLE(TrainAcc_3_40_20_17_16_10))))
lola: processed formula length: 232
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_2_10_31_29_28_6) AND FIREABLE(TrainStable_2_10_3_8_6_5_6)) OR (FIREABLE(TrainAcc_1_44_10_9_8_3) AND FIREABLE(TrainStable_4_23_10_17_13_12_15)) OR FIREABLE(TrainAcc_3_40_20_17_16_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 3 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 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(TrainStable_1_3_1_17_16_15_3) AND FIREABLE(TrainStable_4_32_10_25_21_20_15)) OR ((NOT FIREABLE(TrainAcc_3_27_37_34_33_10) OR NOT FIREABLE(TrainAcc_3_33_26_23_22_10)) AND NOT FIREABLE(TrainAcc_2_38_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 (((FIREABLE(TrainStable_1_3_1_17_16_15_3) AND FIREABLE(TrainStable_4_32_10_25_21_20_15)) OR ((NOT FIREABLE(TrainAcc_3_27_37_34_33_10) OR NOT FIREABLE(TrainAcc_3_33_26_23_22_10)) AND NOT FIREABLE(TrainAcc_2_38_17_15_14_6)))))
lola: processed formula length: 231
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_1_3_1_17_16_15_3) OR NOT FIREABLE(TrainStable_4_32_10_25_21_20_15)) AND ((FIREABLE(TrainAcc_3_27_37_34_33_10) AND FIREABLE(TrainAcc_3_33_26_23_22_10)) OR FIREABLE(TrainAcc_2_38_17_15_14_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 126 literals and 18 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 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(TrainStable_1_1_1_3_2_1_3) AND (NOT FIREABLE(TrainStable_1_22_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_2_24_19_17_16_6) OR (FIREABLE(TrainAcc_3_39_20_17_16_10) AND FIREABLE(TrainStable_4_41_10_33_29_28_15) AND (FIREABLE(TrainAcc_3_30_27_24_23_10) OR FIREABLE(TrainStable_1_50_1_20_19_18_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_1_1_1_3_2_1_3) AND (NOT FIREABLE(TrainStable_1_22_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_2_24_19_17_16_6) OR (FIREABLE(TrainAcc_3_39_20_17_16_10) AND FIREABLE(TrainStable_4_41_10_33_29_28_15) AND (FIREABLE(TrainAcc_3_30_27_24_23_10) OR FIREABLE(TrainStable_1_50_1_20_19_18_3)))))))
lola: processed formula length: 312
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_3_2_1_3) AND (NOT FIREABLE(TrainStable_1_22_1_22_21_20_3) OR NOT FIREABLE(TrainAcc_2_24_19_17_16_6) OR (FIREABLE(TrainAcc_3_39_20_17_16_10) AND FIREABLE(TrainStable_4_41_10_33_29_28_15) AND (FIREABLE(TrainAcc_3_30_27_24_23_10) OR FIREABLE(TrainStable_1_50_1_20_19_18_3)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 79 literals and 9 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 15 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(TrainStable_4_43_10_15_11_10_15) OR NOT FIREABLE(TrainAcc_1_13_33_32_31_3) OR NOT FIREABLE(TrainAcc_1_7_35_34_33_3) OR ((FIREABLE(TrainStable_1_19_1_38_37_36_3) OR FIREABLE(TrainAcc_1_41_19_18_17_3)) AND FIREABLE(TrainAcc_1_9_31_30_29_3) AND FIREABLE(TrainStable_1_28_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(TrainStable_4_43_10_15_11_10_15) OR NOT FIREABLE(TrainAcc_1_13_33_32_31_3) OR NOT FIREABLE(TrainAcc_1_7_35_34_33_3) OR ((FIREABLE(TrainStable_1_19_1_38_37_36_3) OR FIREABLE(TrainAcc_1_41_19_18_17_3)) AND FIREABLE(TrainAcc_1_9_31_30_29_3) AND FIREABLE(TrainStable_1_28_1_28_27_26_3)))))
lola: processed formula length: 309
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_4_43_10_15_11_10_15) AND FIREABLE(TrainAcc_1_13_33_32_31_3) AND FIREABLE(TrainAcc_1_7_35_34_33_3) AND ((NOT FIREABLE(TrainStable_1_19_1_38_37_36_3) AND NOT FIREABLE(TrainAcc_1_41_19_18_17_3)) OR NOT FIREABLE(TrainAcc_1_9_31_30_29_3) OR NOT FIREABLE(TrainStable_1_28_1_28_27_26_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 278 literals and 19 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: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no no no no yes yes yes yes yes
lola:
preliminary result: no yes no yes yes yes yes no no no no yes yes yes yes yes
lola: memory consumption: 1484048 KB
lola: time consumption: 12 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553467880066
--------------------
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-050"
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-050, 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-155344534700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-050.tgz
mv BART-PT-050 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 ;