About the Execution of LoLA for FamilyReunion-PT-L00010M0001C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4278.900 | 5538.00 | 5850.00 | 15.00 | TTTFTFTTTTFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r181-csrt-155344534900189.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 FamilyReunion-PT-L00010M0001C001P001G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534900189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.7K Mar 24 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 24 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 24 06:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 24 06:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 06:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 24 06:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 3.7K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131 Mar 24 06:28 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 369 Mar 24 06:28 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K Mar 24 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 24 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 6 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 24 00:18 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 FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553472290605
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ FamilyReunion-PT-L00010M0001C001P001G001 @ 3570 seconds
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ FamilyReunion-PT-L00010M0001C001P001G001
{
"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": "Mon Mar 25 00:04:50 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(ExplainHowToObtainMissingDocs_0_7)))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 14,
"markings": 15,
"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": 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(ReceiveNeedChoice_0_9) AND FIREABLE(ReceiveNeedReq_1_10))))",
"processed_size": 75,
"rewrites": 1
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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(CheckSanityReq_1_6) AND FIREABLE(BringReqtoCINFORMI_10))))",
"processed_size": 74,
"rewrites": 1
},
"result":
{
"edges": 98,
"markings": 99,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(ReceiveAccessReq_1_4) AND FIREABLE(ProvidePersonalnfo_0))))",
"processed_size": 75,
"rewrites": 1
},
"result":
{
"edges": 53,
"markings": 54,
"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": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(ReceiveQuestion_1_5) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_1_9))))",
"processed_size": 91,
"rewrites": 1
},
"result":
{
"edges": 25,
"markings": 26,
"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": 3,
"problems": 1
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(SetUpAppoint_1_0) AND NOT FIREABLE(ReceiveNeedChoice_1_3) AND FIREABLE(ExplainHowToObtainMissingDocs_0_0))))",
"processed_size": 124,
"rewrites": 1
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(SendLangChoice_0_2) AND FIREABLE(DisplayNeedChoice_0_3) AND NOT FIREABLE(AccessMicTerminal_2))))",
"processed_size": 112,
"rewrites": 1
},
"result":
{
"edges": 10,
"markings": 11,
"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": 3,
"problems": 1
},
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F (((FIREABLE(GiveAppoint_1_0) OR FIREABLE(AskCINFORMI_6)) AND NOT FIREABLE(GoToAppoint_5))))",
"processed_size": 97,
"rewrites": 1
},
"result":
{
"edges": 35,
"markings": 36,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(CommunicateResp_9_0_Y) AND FIREABLE(ReceiveAppoint_0_0) AND (NOT FIREABLE(CheckHousingSuitReq_0_0) OR NOT FIREABLE(Gate1XORJoin_1)))))",
"processed_size": 151,
"rewrites": 1
},
"result":
{
"edges": 82,
"markings": 83,
"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": 15,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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(EvaluateReq_2_0) OR FIREABLE(ReceiveReqDocsReq_1_10)) AND (FIREABLE(Gate1XORSplit_3) OR FIREABLE(DisplayNeedChoice_1_2)))))",
"processed_size": 142,
"rewrites": 1
},
"result":
{
"edges": 17,
"markings": 18,
"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": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(ReceiveAccessReq_0_5) AND FIREABLE(Gate3XORSplit_0_N) AND (FIREABLE(GiveAppoint_0_0) OR FIREABLE(CheckSanityReq_1_5)))))",
"processed_size": 137,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(ReserveAppoint_1_10) AND NOT FIREABLE(EvaluateReq_4_0) AND NOT FIREABLE(CheckHousingSuitReq_0_0) AND NOT FIREABLE(ObtainFamRelCertif_5) AND FIREABLE(GiveAppoint_1_1))))",
"processed_size": 188,
"rewrites": 1
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 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(TickDocsObtained_1_0) AND FIREABLE(SendLangChoice_0_5)) OR FIREABLE(Gate2ANDSplit_5) OR FIREABLE(Gate3XORSplit_6_N) OR FIREABLE(CheckHousingSuitReq_1_8) OR FIREABLE(ReceiveRegsitration_1_10))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 16,
"markings": 17,
"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": 7,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F (((FIREABLE(ObtainRelativeFinStatement_6) OR FIREABLE(GiveAppoint_0_7)) AND ((NOT FIREABLE(ChoseFamilyReunion_0_6) AND NOT FIREABLE(ReserveAppCINFORMI_5)) OR (NOT FIREABLE(Gate2XORSplit_0_8) AND NOT FIREABLE(SendLangChoice_0_10))))))",
"processed_size": 240,
"rewrites": 1
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G (((NOT FIREABLE(PrepFamReuClearReq_1_7) OR NOT FIREABLE(RegisterRelative_0_10) OR NOT FIREABLE(AccessMicTerminal_8)) AND (NOT FIREABLE(TickDocsObtained_1_9) OR NOT FIREABLE(ReceiveNeedReq_0_7) OR (NOT FIREABLE(ChoseFamilyReunion_0_10) AND NOT FIREABLE(AppointReceived_0_1))))))",
"processed_size": 286,
"rewrites": 2
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"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": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F (((NOT FIREABLE(ObtainRelativeFinStatement_10) AND NOT FIREABLE(ExplainProcedure_0_10) AND (FIREABLE(ClearanceReqReceived_0_1) OR FIREABLE(Gate1ANDSplit_1_0)) AND (FIREABLE(RespReceived_3_N) OR FIREABLE(ObtainRelHealtCondStatement_10))) OR (FIREABLE(GotoOSSAndProdDoc_4) AND (NOT FIREABLE(ReceiveLangChoice_0_6) OR NOT FIREABLE(ReserveAppoint_1_9))))))",
"processed_size": 361,
"rewrites": 1
},
"result":
{
"edges": 105,
"markings": 106,
"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": 26,
"problems": 7
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28796,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 3799,
"conflict_clusters": 948,
"places": 1475,
"places_significant": 1133,
"singleton_clusters": 0,
"transitions": 1234
},
"result":
{
"preliminary_value": "yes yes yes no yes no yes yes yes yes no yes yes yes yes yes ",
"value": "yes yes yes no yes no yes yes yes yes no yes yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2709/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 47200
lola: finding significant places
lola: 1475 places, 1234 transitions, 1133 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(CheckSanityReq_1_6) AND FIREABLE(BringReqtoCINFORMI_10)))) : E (F (((FIREABLE(TickDocsObtained_1_0) AND FIREABLE(SendLangChoice_0_5)) OR FIREABLE(Gate2ANDSplit_5) OR FIREABLE(Gate3XORSplit_6_N) OR FIREABLE(CheckHousingSuitReq_1_8) OR FIREABLE(ReceiveRegsitration_1_10)))) : E (F (((FIREABLE(EvaluateReq_2_0) OR FIREABLE(ReceiveReqDocsReq_1_10)) AND (FIREABLE(Gate1XORSplit_3) OR FIREABLE(DisplayNeedChoice_1_2))))) : E (F ((FIREABLE(SetUpAppoint_1_0) AND NOT FIREABLE(ReceiveNeedChoice_1_3) AND FIREABLE(ExplainHowToObtainMissingDocs_0_0)))) : E (F ((FIREABLE(ReceiveNeedChoice_0_9) AND FIREABLE(ReceiveNeedReq_1_10)))) : E (F ((FIREABLE(ReceiveAccessReq_0_5) AND FIREABLE(Gate3XORSplit_0_N) AND (FIREABLE(GiveAppoint_0_0) OR FIREABLE(CheckSanityReq_1_5))))) : E (F ((FIREABLE(CommunicateResp_9_0_Y) AND FIREABLE(ReceiveAppoint_0_0) AND (NOT FIREABLE(CheckHousingSuitReq_0_0) OR NOT FIREABLE(Gate1XORJoin_1))))) : E (F ((FIREABLE(SendLangChoice_0_2) AND FIREABLE(DisplayNeedChoice_0_3) AND NOT FIREABLE(AccessMicTerminal_2)))) : E (F (((FIREABLE(GiveAppoint_1_0) OR FIREABLE(AskCINFORMI_6)) AND NOT FIREABLE(GoToAppoint_5)))) : E (F (FIREABLE(ExplainHowToObtainMissingDocs_0_7))) : A (G (((NOT FIREABLE(PrepFamReuClearReq_1_7) OR NOT FIREABLE(RegisterRelative_0_10) OR NOT FIREABLE(AccessMicTerminal_8)) AND (NOT FIREABLE(TickDocsObtained_1_9) OR NOT FIREABLE(ReceiveNeedReq_0_7) OR (NOT FIREABLE(ChoseFamilyReunion_0_10) AND NOT FIREABLE(AppointReceived_0_1)))))) : E (F ((FIREABLE(ReceiveAccessReq_1_4) AND FIREABLE(ProvidePersonalnfo_0)))) : E (F ((FIREABLE(ReceiveQuestion_1_5) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_1_9)))) : E (F ((NOT FIREABLE(ReserveAppoint_1_10) AND NOT FIREABLE(EvaluateReq_4_0) AND NOT FIREABLE(CheckHousingSuitReq_0_0) AND NOT FIREABLE(ObtainFamRelCertif_5) AND FIREABLE(GiveAppoint_1_1)))) : E (F (((FIREABLE(ObtainRelativeFinStatement_6) OR FIREABLE(GiveAppoint_0_7)) AND ((NOT FIREABLE(ChoseFamilyReunion_0_6) AND NOT FIREABLE(ReserveAppCINFORMI_5)) OR (NOT FIREABLE(Gate2XORSplit_0_8) AND NOT FIREABLE(SendLangChoice_0_10)))))) : E (F (((NOT FIREABLE(ObtainRelativeFinStatement_10) AND NOT FIREABLE(ExplainProcedure_0_10) AND (FIREABLE(ClearanceReqReceived_0_1) OR FIREABLE(Gate1ANDSplit_1_0)) AND (FIREABLE(RespReceived_3_N) OR FIREABLE(ObtainRelHealtCondStatement_10))) OR (FIREABLE(GotoOSSAndProdDoc_4) AND (NOT FIREABLE(ReceiveLangChoice_0_6) OR NOT FIREABLE(ReserveAppoint_1_9))))))
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(ExplainHowToObtainMissingDocs_0_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 (FIREABLE(ExplainHowToObtainMissingDocs_0_7)))
lola: processed formula length: 51
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(ExplainHowToObtainMissingDocs_0_7)
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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ReceiveNeedChoice_0_9) AND FIREABLE(ReceiveNeedReq_1_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(ReceiveNeedChoice_0_9) AND FIREABLE(ReceiveNeedReq_1_10))))
lola: processed formula length: 75
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(ReceiveNeedChoice_0_9) AND FIREABLE(ReceiveNeedReq_1_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CheckSanityReq_1_6) AND FIREABLE(BringReqtoCINFORMI_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(CheckSanityReq_1_6) AND FIREABLE(BringReqtoCINFORMI_10))))
lola: processed formula length: 74
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(CheckSanityReq_1_6) AND FIREABLE(BringReqtoCINFORMI_10))
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: 99 markings, 98 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ReceiveAccessReq_1_4) AND FIREABLE(ProvidePersonalnfo_0))))
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(ReceiveAccessReq_1_4) AND FIREABLE(ProvidePersonalnfo_0))))
lola: processed formula length: 75
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(ReceiveAccessReq_1_4) AND FIREABLE(ProvidePersonalnfo_0))
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: 54 markings, 53 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ReceiveQuestion_1_5) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_1_9))))
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(ReceiveQuestion_1_5) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_1_9))))
lola: processed formula length: 91
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(ReceiveQuestion_1_5) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_1_9))
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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SetUpAppoint_1_0) AND NOT FIREABLE(ReceiveNeedChoice_1_3) AND FIREABLE(ExplainHowToObtainMissingDocs_0_0))))
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(SetUpAppoint_1_0) AND NOT FIREABLE(ReceiveNeedChoice_1_3) AND FIREABLE(ExplainHowToObtainMissingDocs_0_0))))
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(SetUpAppoint_1_0) AND NOT FIREABLE(ReceiveNeedChoice_1_3) AND FIREABLE(ExplainHowToObtainMissingDocs_0_0))
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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SendLangChoice_0_2) AND FIREABLE(DisplayNeedChoice_0_3) AND NOT FIREABLE(AccessMicTerminal_2))))
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(SendLangChoice_0_2) AND FIREABLE(DisplayNeedChoice_0_3) AND NOT FIREABLE(AccessMicTerminal_2))))
lola: processed formula length: 112
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(SendLangChoice_0_2) AND FIREABLE(DisplayNeedChoice_0_3) AND NOT FIREABLE(AccessMicTerminal_2))
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(GiveAppoint_1_0) OR FIREABLE(AskCINFORMI_6)) AND NOT FIREABLE(GoToAppoint_5))))
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(GiveAppoint_1_0) OR FIREABLE(AskCINFORMI_6)) AND NOT FIREABLE(GoToAppoint_5))))
lola: processed formula length: 97
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(GiveAppoint_1_0) OR FIREABLE(AskCINFORMI_6)) AND NOT FIREABLE(GoToAppoint_5))
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: 36 markings, 35 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CommunicateResp_9_0_Y) AND FIREABLE(ReceiveAppoint_0_0) AND (NOT FIREABLE(CheckHousingSuitReq_0_0) OR NOT FIREABLE(Gate1XORJoin_1)))))
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(CommunicateResp_9_0_Y) AND FIREABLE(ReceiveAppoint_0_0) AND (NOT FIREABLE(CheckHousingSuitReq_0_0) OR NOT FIREABLE(Gate1XORJoin_1)))))
lola: processed formula length: 151
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(CommunicateResp_9_0_Y) AND FIREABLE(ReceiveAppoint_0_0) AND (NOT FIREABLE(CheckHousingSuitReq_0_0) OR NOT FIREABLE(Gate1XORJoin_1)))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(EvaluateReq_2_0) OR FIREABLE(ReceiveReqDocsReq_1_10)) AND (FIREABLE(Gate1XORSplit_3) OR FIREABLE(DisplayNeedChoice_1_2)))))
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(EvaluateReq_2_0) OR FIREABLE(ReceiveReqDocsReq_1_10)) AND (FIREABLE(Gate1XORSplit_3) OR FIREABLE(DisplayNeedChoice_1_2)))))
lola: processed formula length: 142
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(EvaluateReq_2_0) OR FIREABLE(ReceiveReqDocsReq_1_10)) AND (FIREABLE(Gate1XORSplit_3) OR FIREABLE(DisplayNeedChoice_1_2)))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ReceiveAccessReq_0_5) AND FIREABLE(Gate3XORSplit_0_N) AND (FIREABLE(GiveAppoint_0_0) OR FIREABLE(CheckSanityReq_1_5)))))
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(ReceiveAccessReq_0_5) AND FIREABLE(Gate3XORSplit_0_N) AND (FIREABLE(GiveAppoint_0_0) OR FIREABLE(CheckSanityReq_1_5)))))
lola: processed formula length: 137
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(ReceiveAccessReq_0_5) AND FIREABLE(Gate3XORSplit_0_N) AND (FIREABLE(GiveAppoint_0_0) OR FIREABLE(CheckSanityReq_1_5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 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.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ReserveAppoint_1_10) AND NOT FIREABLE(EvaluateReq_4_0) AND NOT FIREABLE(CheckHousingSuitReq_0_0) AND NOT FIREABLE(ObtainFamRelCertif_5) AND FIREABLE(GiveAppoint_1_1))))
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(ReserveAppoint_1_10) AND NOT FIREABLE(EvaluateReq_4_0) AND NOT FIREABLE(CheckHousingSuitReq_0_0) AND NOT FIREABLE(ObtainFamRelCertif_5) AND FIREABLE(GiveAppoint_1_1))))
lola: processed formula length: 188
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(ReserveAppoint_1_10) AND NOT FIREABLE(EvaluateReq_4_0) AND NOT FIREABLE(CheckHousingSuitReq_0_0) AND NOT FIREABLE(ObtainFamRelCertif_5) AND FIREABLE(GiveAppoint_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(TickDocsObtained_1_0) AND FIREABLE(SendLangChoice_0_5)) OR FIREABLE(Gate2ANDSplit_5) OR FIREABLE(Gate3XORSplit_6_N) OR FIREABLE(CheckHousingSuitReq_1_8) OR FIREABLE(ReceiveRegsitration_1_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(TickDocsObtained_1_0) AND FIREABLE(SendLangChoice_0_5)) OR FIREABLE(Gate2ANDSplit_5) OR FIREABLE(Gate3XORSplit_6_N) OR FIREABLE(CheckHousingSuitReq_1_8) OR FIREABLE(ReceiveRegsitration_1_10))))
lola: processed formula length: 214
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(TickDocsObtained_1_0) AND FIREABLE(SendLangChoice_0_5)) OR FIREABLE(Gate2ANDSplit_5) OR FIREABLE(Gate3XORSplit_6_N) OR FIREABLE(CheckHousingSuitReq_1_8) OR FIREABLE(ReceiveRegsitration_1_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(ObtainRelativeFinStatement_6) OR FIREABLE(GiveAppoint_0_7)) AND ((NOT FIREABLE(ChoseFamilyReunion_0_6) AND NOT FIREABLE(ReserveAppCINFORMI_5)) OR (NOT FIREABLE(Gate2XORSplit_0_8) AND NOT FIREABLE(SendLangChoice_0_10))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(ObtainRelativeFinStatement_6) OR FIREABLE(GiveAppoint_0_7)) AND ((NOT FIREABLE(ChoseFamilyReunion_0_6) AND NOT FIREABLE(ReserveAppCINFORMI_5)) OR (NOT FIREABLE(Gate2XORSplit_0_8) AND NOT FIREABLE(SendLangChoice_0_10))))))
lola: processed formula length: 240
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(ObtainRelativeFinStatement_6) OR FIREABLE(GiveAppoint_0_7)) AND ((NOT FIREABLE(ChoseFamilyReunion_0_6) AND NOT FIREABLE(ReserveAppCINFORMI_5)) OR (NOT FIREABLE(Gate2XORSplit_0_8) AND NOT FIREABLE(SendLangChoice_0_10))))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(PrepFamReuClearReq_1_7) OR NOT FIREABLE(RegisterRelative_0_10) OR NOT FIREABLE(AccessMicTerminal_8)) AND (NOT FIREABLE(TickDocsObtained_1_9) OR NOT FIREABLE(ReceiveNeedReq_0_7) OR (NOT FIREABLE(ChoseFamilyReunion_0_10) AND NOT FIREABLE(AppointReceived_0_1))))))
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(PrepFamReuClearReq_1_7) OR NOT FIREABLE(RegisterRelative_0_10) OR NOT FIREABLE(AccessMicTerminal_8)) AND (NOT FIREABLE(TickDocsObtained_1_9) OR NOT FIREABLE(ReceiveNeedReq_0_7) OR (NOT FIREABLE(ChoseFamilyReunion_0_10) AND NOT FIREABLE(AppointReceived_0_1))))))
lola: processed formula length: 286
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(PrepFamReuClearReq_1_7) AND FIREABLE(RegisterRelative_0_10) AND FIREABLE(AccessMicTerminal_8)) OR (FIREABLE(TickDocsObtained_1_9) AND FIREABLE(ReceiveNeedReq_0_7) AND (FIREABLE(ChoseFamilyReunion_0_10) OR FIREABLE(AppointReceived_0_1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(ObtainRelativeFinStatement_10) AND NOT FIREABLE(ExplainProcedure_0_10) AND (FIREABLE(ClearanceReqReceived_0_1) OR FIREABLE(Gate1ANDSplit_1_0)) AND (FIREABLE(RespReceived_3_N) OR FIREABLE(ObtainRelHealtCondStatement_10))) OR (FIREABLE(GotoOSSAndProdDoc_4) AND (NOT FIREABLE(ReceiveLangChoice_0_6) OR NOT FIREABLE(ReserveAppoint_1_9))))))
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(ObtainRelativeFinStatement_10) AND NOT FIREABLE(ExplainProcedure_0_10) AND (FIREABLE(ClearanceReqReceived_0_1) OR FIREABLE(Gate1ANDSplit_1_0)) AND (FIREABLE(RespReceived_3_N) OR FIREABLE(ObtainRelHealtCondStatement_10))) OR (FIREABLE(GotoOSSAndProdDoc_4) AND (NOT FIREABLE(ReceiveLangChoice_0_6) OR NOT FIREABLE(ReserveAppoint_1_9))))))
lola: processed formula length: 361
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(ObtainRelativeFinStatement_10) AND NOT FIREABLE(ExplainProcedure_0_10) AND (FIREABLE(ClearanceReqReceived_0_1) OR FIREABLE(Gate1ANDSplit_1_0)) AND (FIREABLE(RespReceived_3_N) OR FIREABLE(ObtainRelHealtCondStatement_10))) OR (FIREABLE(GotoOSSAndProdDoc_4) AND (NOT FIREABLE(ReceiveLangChoice_0_6) OR NOT FIREABLE(ReserveAppoint_1_9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 106 markings, 105 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes yes yes no yes yes yes yes yes
lola:
preliminary result: yes yes yes no yes no yes yes yes yes no yes yes yes yes yes
lola: memory consumption: 28796 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553472296143
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory
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="FamilyReunion-PT-L00010M0001C001P001G001"
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 FamilyReunion-PT-L00010M0001C001P001G001, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181-csrt-155344534900189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 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 ;