About the Execution of LoLA for AutoFlight-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4975.380 | 250199.00 | 507332.00 | 47.50 | FTTTFTTTFTTFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r016-csrt-155225065100189.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 AutoFlight-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225065100189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 3.2K Feb 9 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 9 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 5 03:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 104 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 342 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 00:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 00:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 29 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 29 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 266K 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 AutoFlight-PT-12b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552505616522
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-12b @ 3570 seconds
FORMULA AutoFlight-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3320
rslt: Output for ReachabilityFireability @ AutoFlight-PT-12b
{
"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": "Wed Mar 13 19:33:36 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(t812)))",
"processed_size": 22,
"rewrites": 1
},
"result":
{
"edges": 54,
"markings": 55,
"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(t1116)))",
"processed_size": 27,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"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(t111)))",
"processed_size": 22,
"rewrites": 1
},
"result":
{
"edges": 61,
"markings": 62,
"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": 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(t648)))",
"processed_size": 22,
"rewrites": 1
},
"result":
{
"edges": 40,
"markings": 41,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(t554) OR FIREABLE(t877))))",
"processed_size": 43,
"rewrites": 1
},
"result":
{
"edges": 59,
"markings": 60,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((NOT FIREABLE(t875) AND FIREABLE(t94))))",
"processed_size": 46,
"rewrites": 1
},
"result":
{
"edges": 64,
"markings": 65,
"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": 2,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(t861) AND NOT FIREABLE(t1109))))",
"processed_size": 48,
"rewrites": 1
},
"result":
{
"edges": 129,
"markings": 129,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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(t1044) AND FIREABLE(t443))))",
"processed_size": 44,
"rewrites": 1
},
"result":
{
"edges": 2725,
"markings": 2429,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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(t25) OR NOT FIREABLE(t990))))",
"processed_size": 50,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "A (G ((FIREABLE(t152) OR (NOT FIREABLE(t384) AND NOT FIREABLE(t989)) OR NOT FIREABLE(t1064))))",
"processed_size": 96,
"rewrites": 2
},
"result":
{
"edges": 21904784,
"markings": 15193937,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 553
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((FIREABLE(t321) OR (NOT FIREABLE(t746) AND NOT FIREABLE(t251))) AND FIREABLE(t105))))",
"processed_size": 93,
"rewrites": 1
},
"result":
{
"edges": 61,
"markings": 62,
"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": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 664
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t613) AND FIREABLE(t655) AND (FIREABLE(t653) OR FIREABLE(t651)) AND NOT FIREABLE(t847) AND FIREABLE(t723))))",
"processed_size": 125,
"rewrites": 1
},
"result":
{
"edges": 113,
"markings": 104,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 830
},
"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(t254) OR FIREABLE(t66) OR (FIREABLE(t99) AND FIREABLE(t499)) OR FIREABLE(t494)) AND FIREABLE(t601))))",
"processed_size": 121,
"rewrites": 1
},
"result":
{
"edges": 49,
"markings": 50,
"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": 9,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1106
},
"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 ((((NOT FIREABLE(t147) OR NOT FIREABLE(t1020)) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t458))) OR (FIREABLE(t873) AND FIREABLE(t756)))))",
"processed_size": 144,
"rewrites": 2
},
"result":
{
"edges": 59,
"markings": 60,
"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": 14,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1660
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((FIREABLE(t295) OR FIREABLE(t873) OR ((FIREABLE(t507) OR FIREABLE(t654)) AND FIREABLE(t1121) AND ((FIREABLE(t681) AND FIREABLE(t945)) OR (FIREABLE(t736) AND FIREABLE(t511)))))))",
"processed_size": 187,
"rewrites": 1
},
"result":
{
"edges": 17,
"markings": 18,
"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": 24,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"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": 11,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F (((NOT FIREABLE(t60) OR NOT FIREABLE(t349)) AND (NOT FIREABLE(t181) OR NOT FIREABLE(t273)) AND NOT FIREABLE(t852) AND (FIREABLE(t741) OR FIREABLE(t1037)) AND (FIREABLE(t445) OR FIREABLE(t404) OR (FIREABLE(t313) AND FIREABLE(t44))))))",
"processed_size": 243,
"rewrites": 1
},
"result":
{
"edges": 121,
"markings": 121,
"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": 140,
"problems": 24
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25752,
"runtime": 250.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 2618,
"conflict_clusters": 978,
"places": 1126,
"places_significant": 1050,
"singleton_clusters": 0,
"transitions": 1124
},
"result":
{
"preliminary_value": "no yes yes yes no yes yes yes no yes yes no yes yes yes no ",
"value": "no yes yes yes no yes yes yes no yes yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2250/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1126
lola: finding significant places
lola: 1126 places, 1124 transitions, 1050 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(t25) OR NOT FIREABLE(t990)))) : E (F ((NOT FIREABLE(t875) AND FIREABLE(t94)))) : E (F ((FIREABLE(t1044) AND FIREABLE(t443)))) : E (F (FIREABLE(t812))) : A (G ((FIREABLE(t152) OR (NOT FIREABLE(t384) AND NOT FIREABLE(t989)) OR NOT FIREABLE(t1064)))) : E (F ((FIREABLE(t554) OR FIREABLE(t877)))) : E (F ((FIREABLE(t295) OR FIREABLE(t873) OR ((FIREABLE(t507) OR FIREABLE(t654)) AND FIREABLE(t1121) AND ((FIREABLE(t681) AND FIREABLE(t945)) OR (FIREABLE(t736) AND FIREABLE(t511))))))) : E (F (((FIREABLE(t321) OR (NOT FIREABLE(t746) AND NOT FIREABLE(t251))) AND FIREABLE(t105)))) : A (G (NOT FIREABLE(t1116))) : E (F ((FIREABLE(t861) AND NOT FIREABLE(t1109)))) : E (F (FIREABLE(t111))) : E (F ((FIREABLE(t613) AND FIREABLE(t655) AND (FIREABLE(t653) OR FIREABLE(t651)) AND NOT FIREABLE(t847) AND FIREABLE(t723)))) : E (F (FIREABLE(t648))) : E (F (((FIREABLE(t254) OR FIREABLE(t66) OR (FIREABLE(t99) AND FIREABLE(t499)) OR FIREABLE(t494)) AND FIREABLE(t601)))) : E (F (((NOT FIREABLE(t60) OR NOT FIREABLE(t349)) AND (NOT FIREABLE(t181) OR NOT FIREABLE(t273)) AND NOT FIREABLE(t852) AND (FIREABLE(t741) OR FIREABLE(t1037)) AND (FIREABLE(t445) OR FIREABLE(t404) OR (FIREABLE(t313) AND FIREABLE(t44)))))) : A (G ((((NOT FIREABLE(t147) OR NOT FIREABLE(t1020)) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t458))) OR (FIREABLE(t873) AND FIREABLE(t756)))))
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(t812)))
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(t812)))
lola: processed formula length: 22
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: SUBRESULT
lola: result: yes
lola: produced by: state space
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(t812)
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1116)))
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(t1116)))
lola: processed formula length: 27
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(t1116)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t111)))
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(t111)))
lola: processed formula length: 22
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(t111)
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: 62 markings, 61 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t648)))
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(t648)))
lola: processed formula length: 22
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(t648)
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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t554) OR FIREABLE(t877))))
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(t554) OR FIREABLE(t877))))
lola: processed formula length: 43
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(t554) OR FIREABLE(t877))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t875) AND FIREABLE(t94))))
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(t875) AND FIREABLE(t94))))
lola: processed formula length: 46
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(t875) AND FIREABLE(t94))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t861) AND NOT FIREABLE(t1109))))
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(t861) AND NOT FIREABLE(t1109))))
lola: processed formula length: 48
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t861) AND NOT FIREABLE(t1109))
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: 129 markings, 129 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1044) AND FIREABLE(t443))))
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(t1044) AND FIREABLE(t443))))
lola: processed formula length: 44
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(t1044) AND FIREABLE(t443))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 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: 2429 markings, 2725 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t25) OR NOT FIREABLE(t990))))
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(t25) OR NOT FIREABLE(t990))))
lola: processed formula length: 50
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(t25) AND FIREABLE(t990))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 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.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t152) OR (NOT FIREABLE(t384) AND NOT FIREABLE(t989)) OR NOT FIREABLE(t1064))))
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(t152) OR (NOT FIREABLE(t384) AND NOT FIREABLE(t989)) OR NOT FIREABLE(t1064))))
lola: processed formula length: 96
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(t152) AND (FIREABLE(t384) OR FIREABLE(t989)) AND FIREABLE(t1064))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 313702 markings, 442241 edges, 62740 markings/sec, 0 secs
lola: sara is running 5 secs || 636058 markings, 896561 edges, 64471 markings/sec, 5 secs
lola: sara is running 10 secs || 943485 markings, 1338495 edges, 61485 markings/sec, 10 secs
lola: sara is running 15 secs || 1250403 markings, 1776964 edges, 61384 markings/sec, 15 secs
lola: sara is running 20 secs || 1551527 markings, 2213525 edges, 60225 markings/sec, 20 secs
lola: sara is running 25 secs || 1871905 markings, 2653926 edges, 64076 markings/sec, 25 secs
lola: sara is running 30 secs || 2176763 markings, 3096650 edges, 60972 markings/sec, 30 secs
lola: sara is running 35 secs || 2486331 markings, 3522035 edges, 61914 markings/sec, 35 secs
lola: sara is running 40 secs || 2781717 markings, 3957927 edges, 59077 markings/sec, 40 secs
lola: sara is running 45 secs || 3086000 markings, 4402120 edges, 60857 markings/sec, 45 secs
lola: sara is running 50 secs || 3379196 markings, 4816643 edges, 58639 markings/sec, 50 secs
lola: sara is running 55 secs || 3680513 markings, 5249947 edges, 60263 markings/sec, 55 secs
lola: sara is running 60 secs || 3975438 markings, 5688016 edges, 58985 markings/sec, 60 secs
lola: sara is running 65 secs || 4273368 markings, 6114608 edges, 59586 markings/sec, 65 secs
lola: sara is running 70 secs || 4575299 markings, 6558180 edges, 60386 markings/sec, 70 secs
lola: sara is running 75 secs || 4860283 markings, 6973930 edges, 56997 markings/sec, 75 secs
lola: sara is running 80 secs || 5167366 markings, 7413203 edges, 61417 markings/sec, 80 secs
lola: sara is running 85 secs || 5480683 markings, 7843375 edges, 62663 markings/sec, 85 secs
lola: sara is running 90 secs || 5787618 markings, 8294794 edges, 61387 markings/sec, 90 secs
lola: sara is running 95 secs || 6093121 markings, 8748854 edges, 61101 markings/sec, 95 secs
lola: sara is running 100 secs || 6404912 markings, 9205648 edges, 62358 markings/sec, 100 secs
lola: sara is running 105 secs || 6729206 markings, 9665081 edges, 64859 markings/sec, 105 secs
lola: sara is running 110 secs || 7056129 markings, 10122968 edges, 65385 markings/sec, 110 secs
lola: sara is running 115 secs || 7371174 markings, 10585968 edges, 63009 markings/sec, 115 secs
lola: sara is running 120 secs || 7684009 markings, 11051367 edges, 62567 markings/sec, 120 secs
lola: sara is running 125 secs || 7998542 markings, 11505659 edges, 62907 markings/sec, 125 secs
lola: sara is running 130 secs || 8306521 markings, 11959251 edges, 61596 markings/sec, 130 secs
lola: sara is running 135 secs || 8624279 markings, 12407274 edges, 63552 markings/sec, 135 secs
lola: sara is running 140 secs || 8936957 markings, 12855588 edges, 62536 markings/sec, 140 secs
lola: sara is running 145 secs || 9248351 markings, 13307269 edges, 62279 markings/sec, 145 secs
lola: sara is running 150 secs || 9559649 markings, 13754477 edges, 62260 markings/sec, 150 secs
lola: sara is running 155 secs || 9868196 markings, 14212628 edges, 61709 markings/sec, 155 secs
lola: sara is running 160 secs || 10183618 markings, 14663026 edges, 63084 markings/sec, 160 secs
lola: sara is running 165 secs || 10498593 markings, 15120967 edges, 62995 markings/sec, 165 secs
lola: sara is running 170 secs || 10808006 markings, 15572405 edges, 61883 markings/sec, 170 secs
lola: sara is running 175 secs || 11145328 markings, 16029532 edges, 67464 markings/sec, 175 secs
lola: sara is running 180 secs || 11450974 markings, 16482117 edges, 61129 markings/sec, 180 secs
lola: sara is running 185 secs || 11760873 markings, 16933127 edges, 61980 markings/sec, 185 secs
lola: sara is running 190 secs || 12057849 markings, 17376539 edges, 59395 markings/sec, 190 secs
lola: sara is running 195 secs || 12379430 markings, 17817748 edges, 64316 markings/sec, 195 secs
lola: sara is running 200 secs || 12695340 markings, 18279885 edges, 63182 markings/sec, 200 secs
lola: sara is running 205 secs || 13013323 markings, 18747830 edges, 63597 markings/sec, 205 secs
lola: sara is running 210 secs || 13336366 markings, 19215012 edges, 64609 markings/sec, 210 secs
lola: sara is running 215 secs || 13661075 markings, 19678492 edges, 64942 markings/sec, 215 secs
lola: sara is running 220 secs || 13984263 markings, 20140506 edges, 64638 markings/sec, 220 secs
lola: sara is running 225 secs || 14301572 markings, 20605720 edges, 63462 markings/sec, 225 secs
lola: sara is running 230 secs || 14621756 markings, 21070347 edges, 64037 markings/sec, 230 secs
lola: sara is running 235 secs || 14945740 markings, 21532256 edges, 64797 markings/sec, 235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15193937 markings, 21904784 edges
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t321) OR (NOT FIREABLE(t746) AND NOT FIREABLE(t251))) AND FIREABLE(t105))))
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(t321) OR (NOT FIREABLE(t746) AND NOT FIREABLE(t251))) AND FIREABLE(t105))))
lola: processed formula length: 93
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(t321) OR (NOT FIREABLE(t746) AND NOT FIREABLE(t251))) AND FIREABLE(t105))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t613) AND FIREABLE(t655) AND (FIREABLE(t653) OR FIREABLE(t651)) AND NOT FIREABLE(t847) AND FIREABLE(t723))))
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(t613) AND FIREABLE(t655) AND (FIREABLE(t653) OR FIREABLE(t651)) AND NOT FIREABLE(t847) AND FIREABLE(t723))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 104 markings, 113 edges
lola: ========================================
lola: subprocess 12 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t254) OR FIREABLE(t66) OR (FIREABLE(t99) AND FIREABLE(t499)) OR FIREABLE(t494)) AND FIREABLE(t601))))
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(t254) OR FIREABLE(t66) OR (FIREABLE(t99) AND FIREABLE(t499)) OR FIREABLE(t494)) AND FIREABLE(t601))))
lola: processed formula length: 121
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(t254) OR FIREABLE(t66) OR (FIREABLE(t99) AND FIREABLE(t499)) OR FIREABLE(t494)) AND FIREABLE(t601))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 4 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: 50 markings, 49 edges
lola: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t147) OR NOT FIREABLE(t1020)) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t458))) OR (FIREABLE(t873) AND FIREABLE(t756)))))
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(t147) OR NOT FIREABLE(t1020)) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t458))) OR (FIREABLE(t873) AND FIREABLE(t756)))))
lola: processed formula length: 144
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(t147) AND FIREABLE(t1020)) OR (FIREABLE(t524) AND FIREABLE(t458))) AND (NOT FIREABLE(t873) OR NOT FIREABLE(t756)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 14 will run for 1660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t295) OR FIREABLE(t873) OR ((FIREABLE(t507) OR FIREABLE(t654)) AND FIREABLE(t1121) AND ((FIREABLE(t681) AND FIREABLE(t945)) OR (FIREABLE(t736) AND FIREABLE(t511)))))))
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(t295) OR FIREABLE(t873) OR ((FIREABLE(t507) OR FIREABLE(t654)) AND FIREABLE(t1121) AND ((FIREABLE(t681) AND FIREABLE(t945)) OR (FIREABLE(t736) AND FIREABLE(t511)))))))
lola: processed formula length: 187
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(t295) OR FIREABLE(t873) OR ((FIREABLE(t507) OR FIREABLE(t654)) AND FIREABLE(t1121) AND ((FIREABLE(t681) AND FIREABLE(t945)) OR (FIREABLE(t736) AND FIREABLE(t511)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t60) OR NOT FIREABLE(t349)) AND (NOT FIREABLE(t181) OR NOT FIREABLE(t273)) AND NOT FIREABLE(t852) AND (FIREABLE(t741) OR FIREABLE(t1037)) AND (FIREABLE(t445) OR FIREABLE(t404) OR (FIREABLE(t313) AND FIREABLE(t44))))))
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(t60) OR NOT FIREABLE(t349)) AND (NOT FIREABLE(t181) OR NOT FIREABLE(t273)) AND NOT FIREABLE(t852) AND (FIREABLE(t741) OR FIREABLE(t1037)) AND (FIREABLE(t445) OR FIREABLE(t404) OR (FIREABLE(t313) AND FIREABLE(t44))))))
lola: processed formula length: 243
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(t60) OR NOT FIREABLE(t349)) AND (NOT FIREABLE(t181) OR NOT FIREABLE(t273)) AND NOT FIREABLE(t852) AND (FIREABLE(t741) OR FIREABLE(t1037)) AND (FIREABLE(t445) OR FIREABLE(t404) OR (FIREABLE(t313) AND FIREABLE(t44))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 140 literals and 24 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 121 markings, 121 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes yes no yes yes no yes yes yes no
lola:
preliminary result: no yes yes yes no yes yes yes no yes yes no yes yes yes no
lola: memory consumption: 25752 KB
lola: time consumption: 250 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552505866721
--------------------
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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-csrt-155225065100189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;