About the Execution of LoLA for Diffusion2D-PT-D50N150
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4509.570 | 42488.00 | 77461.00 | 20.00 | TFTTTFTTFTTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654900261.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Diffusion2D-PT-D50N150, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654900261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 3.8K Feb 10 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 6 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 6 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 23:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 30 23:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 23:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552602560112
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D50N150 @ 3570 seconds
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3528
rslt: Output for ReachabilityFireability @ Diffusion2D-PT-D50N150
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 22:29:20 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(t1_35_24_36_24)))",
"processed_size": 32,
"rewrites": 1
},
"result":
{
"edges": 9,
"markings": 10,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(t1_28_43_28_44)))",
"processed_size": 36,
"rewrites": 2
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"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(t1_12_26_13_27)))",
"processed_size": 32,
"rewrites": 1
},
"result":
{
"edges": 14,
"markings": 15,
"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": 1,
"problems": 1
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(t1_41_47_40_47) AND FIREABLE(t1_13_16_12_15) AND NOT FIREABLE(t1_8_6_7_7))))",
"processed_size": 96,
"rewrites": 1
},
"result":
{
"edges": 13,
"markings": 14,
"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": 3,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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(t1_35_16_35_17) OR FIREABLE(t1_18_42_19_42)) AND FIREABLE(t1_26_18_26_17))))",
"processed_size": 94,
"rewrites": 1
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"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(t1_27_18_28_19) OR (FIREABLE(t1_32_17_31_17) AND FIREABLE(t1_32_38_31_37)))))",
"processed_size": 94,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"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": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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(t1_5_38_4_38) OR NOT FIREABLE(t1_13_33_14_32) OR NOT FIREABLE(t1_6_23_5_22) OR FIREABLE(t1_42_35_42_36))))",
"processed_size": 129,
"rewrites": 2
},
"result":
{
"edges": 51253,
"markings": 14664,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((FIREABLE(t1_16_43_16_42) AND FIREABLE(t1_10_36_9_35)) OR (FIREABLE(t1_15_31_15_30) AND FIREABLE(t1_36_49_36_48)))))",
"processed_size": 124,
"rewrites": 1
},
"result":
{
"edges": 4999,
"markings": 1423,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(t1_2_24_3_23) OR ((FIREABLE(t1_1_49_1_48) OR FIREABLE(t1_7_47_6_46)) AND FIREABLE(t1_19_48_19_47)))))",
"processed_size": 119,
"rewrites": 1
},
"result":
{
"edges": 774,
"markings": 252,
"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": 5,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"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(t1_22_23_22_24) AND FIREABLE(t1_26_21_25_21) AND (FIREABLE(t1_41_44_41_43) OR NOT FIREABLE(t1_28_13_27_12)))))",
"processed_size": 127,
"rewrites": 1
},
"result":
{
"edges": 10,
"markings": 10,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 589
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(t1_6_13_5_13) AND FIREABLE(t1_20_16_19_15) AND NOT FIREABLE(t1_28_19_27_20) AND FIREABLE(t1_44_45_43_44) AND NOT FIREABLE(t1_8_15_9_14))))",
"processed_size": 154,
"rewrites": 1
},
"result":
{
"edges": 675,
"markings": 218,
"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": 5,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G (((FIREABLE(t1_35_38_34_38) AND FIREABLE(t1_10_4_11_3)) OR ((NOT FIREABLE(t1_19_6_18_5) OR NOT FIREABLE(t1_35_22_34_23)) AND (NOT FIREABLE(t1_35_2_36_2) OR NOT FIREABLE(t1_6_23_6_22))))))",
"processed_size": 195,
"rewrites": 2
},
"result":
{
"edges": 29,
"markings": 30,
"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": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F (((FIREABLE(t1_35_43_34_44) OR FIREABLE(t1_26_19_25_18) OR (FIREABLE(t1_21_23_20_22) AND FIREABLE(t1_20_21_21_21))) AND FIREABLE(t1_5_16_6_16) AND FIREABLE(t1_40_18_41_18))))",
"processed_size": 181,
"rewrites": 1
},
"result":
{
"edges": 2589,
"markings": 803,
"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": 10,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"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": 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 ((FIREABLE(t1_43_36_44_35) OR FIREABLE(t1_18_25_19_25) OR FIREABLE(t1_43_3_42_3) OR FIREABLE(t1_27_28_27_27) OR (NOT FIREABLE(t1_43_42_42_42) AND NOT FIREABLE(t1_10_44_9_44) AND NOT FIREABLE(t1_45_8_46_7)))))",
"processed_size": 217,
"rewrites": 2
},
"result":
{
"edges": 17,
"markings": 18,
"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": 15,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((((FIREABLE(t1_7_48_8_47) AND FIREABLE(t1_5_46_5_47)) OR (FIREABLE(t1_37_26_38_26) AND FIREABLE(t1_23_16_23_17)) OR FIREABLE(t1_17_49_16_48)) AND ((NOT FIREABLE(t1_17_41_17_40) AND NOT FIREABLE(t1_5_10_6_11)) OR FIREABLE(t1_44_14_44_15)))))",
"processed_size": 249,
"rewrites": 1
},
"result":
{
"edges": 21,
"markings": 22,
"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": 19,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3532
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 13,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 13
},
"processed": "E (F (((FIREABLE(t1_20_30_19_31) OR FIREABLE(t1_47_13_48_13)) AND (FIREABLE(t1_33_37_33_36) OR FIREABLE(t1_33_30_33_29)) AND FIREABLE(t1_15_44_16_43) AND FIREABLE(t1_6_46_7_45) AND NOT FIREABLE(t1_36_8_35_7) AND (FIREABLE(t1_35_40_36_40) OR FIREABLE(t1_27_23_28_22) OR FIREABLE(t1_18_11_19_12) OR FIREABLE(t1_11_30_12_30) OR FIREABLE(t1_31_19_32_20) OR FIREABLE(t1_29_33_28_32)))))",
"processed_size": 388,
"rewrites": 1
},
"result":
{
"edges": 8297,
"markings": 2349,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 144,
"problems": 24
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 261380,
"runtime": 42.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 38808,
"conflict_clusters": 2500,
"places": 2500,
"places_significant": 2499,
"singleton_clusters": 0,
"transitions": 19404
},
"result":
{
"preliminary_value": "yes no yes yes yes no yes yes no yes yes yes no yes yes yes ",
"value": "yes no yes yes yes no yes yes no yes yes yes no 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: 21904/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (FIREABLE(t1_35_24_36_24))) : A (G ((FIREABLE(t1_43_36_44_35) OR FIREABLE(t1_18_25_19_25) OR FIREABLE(t1_43_3_42_3) OR FIREABLE(t1_27_28_27_27) OR (NOT FIREABLE(t1_43_42_42_42) AND NOT FIREABLE(t1_10_44_9_44) AND NOT FIREABLE(t1_45_8_46_7))))) : E (F (((FIREABLE(t1_20_30_19_31) OR FIREABLE(t1_47_13_48_13)) AND (FIREABLE(t1_33_37_33_36) OR FIREABLE(t1_33_30_33_29)) AND FIREABLE(t1_15_44_16_43) AND FIREABLE(t1_6_46_7_45) AND NOT FIREABLE(t1_36_8_35_7) AND (FIREABLE(t1_35_40_36_40) OR FIREABLE(t1_27_23_28_22) OR FIREABLE(t1_18_11_19_12) OR FIREABLE(t1_11_30_12_30) OR FIREABLE(t1_31_19_32_20) OR FIREABLE(t1_29_33_28_32))))) : E (F (((FIREABLE(t1_16_43_16_42) AND FIREABLE(t1_10_36_9_35)) OR (FIREABLE(t1_15_31_15_30) AND FIREABLE(t1_36_49_36_48))))) : E (F ((FIREABLE(t1_27_18_28_19) OR (FIREABLE(t1_32_17_31_17) AND FIREABLE(t1_32_38_31_37))))) : A (G (((FIREABLE(t1_35_38_34_38) AND FIREABLE(t1_10_4_11_3)) OR ((NOT FIREABLE(t1_19_6_18_5) OR NOT FIREABLE(t1_35_22_34_23)) AND (NOT FIREABLE(t1_35_2_36_2) OR NOT FIREABLE(t1_6_23_6_22)))))) : E (F ((FIREABLE(t1_2_24_3_23) OR ((FIREABLE(t1_1_49_1_48) OR FIREABLE(t1_7_47_6_46)) AND FIREABLE(t1_19_48_19_47))))) : E (F ((((FIREABLE(t1_7_48_8_47) AND FIREABLE(t1_5_46_5_47)) OR (FIREABLE(t1_37_26_38_26) AND FIREABLE(t1_23_16_23_17)) OR FIREABLE(t1_17_49_16_48)) AND ((NOT FIREABLE(t1_17_41_17_40) AND NOT FIREABLE(t1_5_10_6_11)) OR FIREABLE(t1_44_14_44_15))))) : A (G (NOT FIREABLE(t1_28_43_28_44))) : E (F ((FIREABLE(t1_6_13_5_13) AND FIREABLE(t1_20_16_19_15) AND NOT FIREABLE(t1_28_19_27_20) AND FIREABLE(t1_44_45_43_44) AND NOT FIREABLE(t1_8_15_9_14)))) : E (F ((NOT FIREABLE(t1_41_47_40_47) AND FIREABLE(t1_13_16_12_15) AND NOT FIREABLE(t1_8_6_7_7)))) : E (F (((FIREABLE(t1_35_43_34_44) OR FIREABLE(t1_26_19_25_18) OR (FIREABLE(t1_21_23_20_22) AND FIREABLE(t1_20_21_21_21))) AND FIREABLE(t1_5_16_6_16) AND FIREABLE(t1_40_18_41_18)))) : A (G ((NOT FIREABLE(t1_5_38_4_38) OR NOT FIREABLE(t1_13_33_14_32) OR NOT FIREABLE(t1_6_23_5_22) OR FIREABLE(t1_42_35_42_36)))) : E (F (((FIREABLE(t1_35_16_35_17) OR FIREABLE(t1_18_42_19_42)) AND FIREABLE(t1_26_18_26_17)))) : E (F (FIREABLE(t1_12_26_13_27))) : E (F ((FIREABLE(t1_22_23_22_24) AND FIREABLE(t1_26_21_25_21) AND (FIREABLE(t1_41_44_41_43) OR NOT FIREABLE(t1_28_13_27_12)))))
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(t1_35_24_36_24)))
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(t1_35_24_36_24)))
lola: processed formula length: 32
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(t1_35_24_36_24)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_28_43_28_44)))
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(t1_28_43_28_44)))
lola: processed formula length: 36
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(t1_28_43_28_44)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_12_26_13_27)))
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(t1_12_26_13_27)))
lola: processed formula length: 32
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(t1_12_26_13_27)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_41_47_40_47) AND FIREABLE(t1_13_16_12_15) AND NOT FIREABLE(t1_8_6_7_7))))
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(t1_41_47_40_47) AND FIREABLE(t1_13_16_12_15) AND NOT FIREABLE(t1_8_6_7_7))))
lola: processed formula length: 96
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(t1_41_47_40_47) AND FIREABLE(t1_13_16_12_15) AND NOT FIREABLE(t1_8_6_7_7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_35_16_35_17) OR FIREABLE(t1_18_42_19_42)) AND FIREABLE(t1_26_18_26_17))))
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(t1_35_16_35_17) OR FIREABLE(t1_18_42_19_42)) AND FIREABLE(t1_26_18_26_17))))
lola: processed formula length: 94
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(t1_35_16_35_17) OR FIREABLE(t1_18_42_19_42)) AND FIREABLE(t1_26_18_26_17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_27_18_28_19) OR (FIREABLE(t1_32_17_31_17) AND FIREABLE(t1_32_38_31_37)))))
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(t1_27_18_28_19) OR (FIREABLE(t1_32_17_31_17) AND FIREABLE(t1_32_38_31_37)))))
lola: processed formula length: 94
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(t1_27_18_28_19) OR (FIREABLE(t1_32_17_31_17) AND FIREABLE(t1_32_38_31_37)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_5_38_4_38) OR NOT FIREABLE(t1_13_33_14_32) OR NOT FIREABLE(t1_6_23_5_22) OR FIREABLE(t1_42_35_42_36))))
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(t1_5_38_4_38) OR NOT FIREABLE(t1_13_33_14_32) OR NOT FIREABLE(t1_6_23_5_22) OR FIREABLE(t1_42_35_42_36))))
lola: processed formula length: 129
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(t1_5_38_4_38) AND FIREABLE(t1_13_33_14_32) AND FIREABLE(t1_6_23_5_22) AND NOT FIREABLE(t1_42_35_42_36))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
lola: sara is running 0 secs || 2921 markings, 9866 edges, 584 markings/sec, 0 secs
lola: sara is running 5 secs || 5832 markings, 20126 edges, 582 markings/sec, 5 secs
lola: sara is running 10 secs || 8770 markings, 30180 edges, 588 markings/sec, 10 secs
lola: sara is running 15 secs || 11669 markings, 40764 edges, 580 markings/sec, 15 secs
lola: sara is running 20 secs || 14551 markings, 50962 edges, 576 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14664 markings, 51253 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_16_43_16_42) AND FIREABLE(t1_10_36_9_35)) OR (FIREABLE(t1_15_31_15_30) AND FIREABLE(t1_36_49_36_48)))))
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(t1_16_43_16_42) AND FIREABLE(t1_10_36_9_35)) OR (FIREABLE(t1_15_31_15_30) AND FIREABLE(t1_36_49_36_48)))))
lola: processed formula length: 124
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(t1_16_43_16_42) AND FIREABLE(t1_10_36_9_35)) OR (FIREABLE(t1_15_31_15_30) AND FIREABLE(t1_36_49_36_48)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1423 markings, 4999 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_24_3_23) OR ((FIREABLE(t1_1_49_1_48) OR FIREABLE(t1_7_47_6_46)) AND FIREABLE(t1_19_48_19_47)))))
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(t1_2_24_3_23) OR ((FIREABLE(t1_1_49_1_48) OR FIREABLE(t1_7_47_6_46)) AND FIREABLE(t1_19_48_19_47)))))
lola: processed formula length: 119
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(t1_2_24_3_23) OR ((FIREABLE(t1_1_49_1_48) OR FIREABLE(t1_7_47_6_46)) AND FIREABLE(t1_19_48_19_47)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 252 markings, 774 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_22_23_22_24) AND FIREABLE(t1_26_21_25_21) AND (FIREABLE(t1_41_44_41_43) OR NOT FIREABLE(t1_28_13_27_12)))))
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(t1_22_23_22_24) AND FIREABLE(t1_26_21_25_21) AND (FIREABLE(t1_41_44_41_43) OR NOT FIREABLE(t1_28_13_27_12)))))
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(t1_22_23_22_24) AND FIREABLE(t1_26_21_25_21) AND (FIREABLE(t1_41_44_41_43) OR NOT FIREABLE(t1_28_13_27_12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_6_13_5_13) AND FIREABLE(t1_20_16_19_15) AND NOT FIREABLE(t1_28_19_27_20) AND FIREABLE(t1_44_45_43_44) AND NOT FIREABLE(t1_8_15_9_14))))
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(t1_6_13_5_13) AND FIREABLE(t1_20_16_19_15) AND NOT FIREABLE(t1_28_19_27_20) AND FIREABLE(t1_44_45_43_44) AND NOT FIREABLE(t1_8_15_9_14))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t1_6_13_5_13) AND FIREABLE(t1_20_16_19_15) AND NOT FIREABLE(t1_28_19_27_20) AND FIREABLE(t1_44_45_43_44) AND NOT FIREABLE(t1_8_15_9_14))
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: 218 markings, 675 edges
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1_35_38_34_38) AND FIREABLE(t1_10_4_11_3)) OR ((NOT FIREABLE(t1_19_6_18_5) OR NOT FIREABLE(t1_35_22_34_23)) AND (NOT FIREABLE(t1_35_2_36_2) OR NOT FIREABLE(t1_6_23_6_22))))))
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(t1_35_38_34_38) AND FIREABLE(t1_10_4_11_3)) OR ((NOT FIREABLE(t1_19_6_18_5) OR NOT FIREABLE(t1_35_22_34_23)) AND (NOT FIREABLE(t1_35_2_36_2) OR NOT FIREABLE(t1_6_23_6_22))))))
lola: processed formula length: 195
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(t1_35_38_34_38) OR NOT FIREABLE(t1_10_4_11_3)) AND ((FIREABLE(t1_19_6_18_5) AND FIREABLE(t1_35_22_34_23)) OR (FIREABLE(t1_35_2_36_2) AND FIREABLE(t1_6_23_6_22))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_35_43_34_44) OR FIREABLE(t1_26_19_25_18) OR (FIREABLE(t1_21_23_20_22) AND FIREABLE(t1_20_21_21_21))) AND FIREABLE(t1_5_16_6_16) AND FIREABLE(t1_40_18_41_18))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(t1_35_43_34_44) OR FIREABLE(t1_26_19_25_18) OR (FIREABLE(t1_21_23_20_22) AND FIREABLE(t1_20_21_21_21))) AND FIREABLE(t1_5_16_6_16) AND FIREABLE(t1_40_18_41_18))))
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(t1_35_43_34_44) OR FIREABLE(t1_26_19_25_18) OR (FIREABLE(t1_21_23_20_22) AND FIREABLE(t1_20_21_21_21))) AND FIREABLE(t1_5_16_6_16) AND FIREABLE(t1_40_18_41_18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 803 markings, 2589 edges
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_43_36_44_35) OR FIREABLE(t1_18_25_19_25) OR FIREABLE(t1_43_3_42_3) OR FIREABLE(t1_27_28_27_27) OR (NOT FIREABLE(t1_43_42_42_42) AND NOT FIREABLE(t1_10_44_9_44) AND NOT FIREABLE(t1_45_8_46_7)))))
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(t1_43_36_44_35) OR FIREABLE(t1_18_25_19_25) OR FIREABLE(t1_43_3_42_3) OR FIREABLE(t1_27_28_27_27) OR (NOT FIREABLE(t1_43_42_42_42) AND NOT FIREABLE(t1_10_44_9_44) AND NOT FIREABLE(t1_45_8_46_7)))))
lola: processed formula length: 217
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(t1_43_36_44_35) AND NOT FIREABLE(t1_18_25_19_25) AND NOT FIREABLE(t1_43_3_42_3) AND NOT FIREABLE(t1_27_28_27_27) AND (FIREABLE(t1_43_42_42_42) OR FIREABLE(t1_10_44_9_44) OR FIREABLE(t1_45_8_46_7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1_7_48_8_47) AND FIREABLE(t1_5_46_5_47)) OR (FIREABLE(t1_37_26_38_26) AND FIREABLE(t1_23_16_23_17)) OR FIREABLE(t1_17_49_16_48)) AND ((NOT FIREABLE(t1_17_41_17_40) AND NOT FIREABLE(t1_5_10_6_11)) OR FIREABLE(t1_44_14_44_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(t1_7_48_8_47) AND FIREABLE(t1_5_46_5_47)) OR (FIREABLE(t1_37_26_38_26) AND FIREABLE(t1_23_16_23_17)) OR FIREABLE(t1_17_49_16_48)) AND ((NOT FIREABLE(t1_17_41_17_40) AND NOT FIREABLE(t1_5_10_6_11)) OR FIREABLE(t1_44_14_44_15)))))
lola: processed formula length: 249
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(t1_7_48_8_47) AND FIREABLE(t1_5_46_5_47)) OR (FIREABLE(t1_37_26_38_26) AND FIREABLE(t1_23_16_23_17)) OR FIREABLE(t1_17_49_16_48)) AND ((NOT FIREABLE(t1_17_41_17_40) AND NOT FIREABLE(t1_5_10_6_11)) OR FIREABLE(t1_44_14_44_15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 15 will run for 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_20_30_19_31) OR FIREABLE(t1_47_13_48_13)) AND (FIREABLE(t1_33_37_33_36) OR FIREABLE(t1_33_30_33_29)) AND FIREABLE(t1_15_44_16_43) AND FIREABLE(t1_6_46_7_45) AND NOT FIREABLE(t1_36_8_35_7) AND (FIREABLE(t1_35_40_36_40) OR FIREABLE(t1_27_23_28_22) OR FIREABLE(t1_18_11_19_12) OR FIREABLE(t1_11_30_12_30) OR FIREABLE(t1_31_19_32_20) OR FIREABLE(t1_29_33_28_32)))))
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(t1_20_30_19_31) OR FIREABLE(t1_47_13_48_13)) AND (FIREABLE(t1_33_37_33_36) OR FIREABLE(t1_33_30_33_29)) AND FIREABLE(t1_15_44_16_43) AND FIREABLE(t1_6_46_7_45) AND NOT FIREABLE(t1_36_8_35_7) AND (FIREABLE(t1_35_40_36_40) OR FIREABLE(t1_27_23_28_22) OR FIREABLE(t1_18_11_19_12) OR FIREABLE(t1_11_30_12_30) OR FIREABLE(t1_31_19_32_20) OR FIREABLE(t1_29_33_28_32)))))
lola: processed formula length: 388
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(t1_20_30_19_31) OR FIREABLE(t1_47_13_48_13)) AND (FIREABLE(t1_33_37_33_36) OR FIREABLE(t1_33_30_33_29)) AND FIREABLE(t1_15_44_16_43) AND FIREABLE(t1_6_46_7_45) AND NOT FIREABLE(t1_36_8_35_7) AND (FIREABLE(t1_35_40_36_40) OR FIREABLE(t1_27_23_28_22) OR FIREABLE(t1_18_11_19_12) OR FIREABLE(t1_11_30_12_30) OR FIREABLE(t1_31_19_32_20) OR FIREABLE(t1_29_33_28_32)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2349 markings, 8297 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes no yes yes yes no yes yes yes
lola:
preliminary result: yes no yes yes yes no yes yes no yes yes yes no yes yes yes
lola: memory consumption: 261380 KB
lola: time consumption: 42 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552602602600
--------------------
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="Diffusion2D-PT-D50N150"
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 Diffusion2D-PT-D50N150, 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 r060-ebro-155234654900261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N150.tgz
mv Diffusion2D-PT-D50N150 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 ;