About the Execution of LoLA for IBMB2S565S3960-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4266.490 | 5787.00 | 7167.00 | 22.20 | FFTTTTFFTTTTTTTF | 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.r082-csrt-155246550100855.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 IBMB2S565S3960-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550100855
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 5.6K Feb 11 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 7 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 7 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.7K Feb 5 00:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jan 31 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 31 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 127K 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 IBMB2S565S3960-PT-none-ReachabilityFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552683968123
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ IBMB2S565S3960-PT-none @ 3570 seconds
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityFireability @ IBMB2S565S3960-PT-none
{
"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": "Fri Mar 15 21:06:08 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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(callToTask.s00003975.inputCriterion.s00001053)))",
"processed_size": 67,
"rewrites": 2
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(fork.s00002501.fire.s00001075)))",
"processed_size": 47,
"rewrites": 1
},
"result":
{
"edges": 136,
"markings": 137,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(decision.s00003020.fire.s00001075)))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 40,
"markings": 41,
"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
},
"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(merge.s00001061.fire.s00001069)))",
"processed_size": 48,
"rewrites": 1
},
"result":
{
"edges": 12,
"markings": 13,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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(join.s00002243.fire.s00001069)))",
"processed_size": 47,
"rewrites": 1
},
"result":
{
"edges": 30,
"markings": 31,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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(merge.s00002240.activate.s00001065)))",
"processed_size": 56,
"rewrites": 2
},
"result":
{
"edges": 41,
"markings": 42,
"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"
},
"type": "invariance",
"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": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(callToTask.s00003981.inputCriterion.s00001053) AND FIREABLE(callToTask.s00003974.inputCriterion.s00001053))))",
"processed_size": 125,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToProcess.s00003859.inputCriterion.s00001053) AND (FIREABLE(fork.s00002500.fire.s00001073) OR FIREABLE(decision.s00001126.fire.s00001075)))))",
"processed_size": 223,
"rewrites": 1
},
"result":
{
"edges": 85,
"markings": 86,
"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"
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((NOT FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00002055.fire.s00001073)) AND NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055))))",
"processed_size": 237,
"rewrites": 1
},
"result":
{
"edges": 32,
"markings": 33,
"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": 9,
"problems": 3
},
"type": "reachability",
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G (((FIREABLE(join.s00001164.activate.s00001064) AND FIREABLE(fork.s00002501.fire.s00001073) AND FIREABLE(merge.s00002238.activate.s00001065)) OR FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00001123.fire.s00001075))))",
"processed_size": 248,
"rewrites": 2
},
"result":
{
"edges": 54,
"markings": 55,
"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": 30,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(merge.s00002240.activate.s00001062) OR (FIREABLE(decision.s00001841.activate.s00001072) AND FIREABLE(merge.s00002241.activate.s00001064) AND NOT FIREABLE(decision.s00001841.fire.s00001075)) OR NOT FIREABLE(decision.s00002055.activate.s00001072))))",
"processed_size": 265,
"rewrites": 2
},
"result":
{
"edges": 127,
"markings": 128,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(merge.s00001162.fire.s00001069) AND NOT FIREABLE(decision.s00002056.fire.s00001075) AND (NOT FIREABLE(decision.s00001159.fire.s00001073) OR (FIREABLE(decision.s00001840.fire.s00001073) AND FIREABLE(callToTask.s00003981.outputCriterion.s00001055))) AND FIREABLE(decision.s00001157.fire.s00001075))))",
"processed_size": 315,
"rewrites": 1
},
"result":
{
"edges": 57,
"markings": 58,
"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": 9,
"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": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F (((NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055) AND (FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003962.outputCriterion.s00001055) OR (FIREABLE(decision.s00002948.fire.s00001075) AND FIREABLE(callToTask.s00003908.outputCriterion.s00001055)))) OR FIREABLE(fork.s00001298.fire.s00001073))))",
"processed_size": 415,
"rewrites": 1
},
"result":
{
"edges": 22,
"markings": 23,
"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": 11,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR ((FIREABLE(merge.s00001162.activate.s00001062) OR FIREABLE(decision.s00001158.activate.s00001072)) AND (FIREABLE(decision.s00002762.activate.s00001072) OR FIREABLE(callToTask.s00003969.outputCriterion.s00001055)) AND (NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003913.inputCriterion.s00001053))))))",
"processed_size": 420,
"rewrites": 2
},
"result":
{
"edges": 127,
"markings": 128,
"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": 29,
"problems": 7
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((FIREABLE(callToTask.s00003913.outputCriterion.s00001055) AND (FIREABLE(merge.s00002241.activate.s00001062) OR FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR FIREABLE(fork.s00002500.activate.s00001072) OR FIREABLE(merge.s00001160.activate.s00001065)) AND (NOT FIREABLE(decision.s00001840.activate.s00001072) OR NOT FIREABLE(callToTask.s00003963.inputCriterion.s00001053)) AND FIREABLE(decision.s00002761.fire.s00001073))))",
"processed_size": 448,
"rewrites": 1
},
"result":
{
"edges": 59,
"markings": 60,
"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": 72,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((NOT FIREABLE(join.s00002243.activate.s00001064) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(callToProcess.s00003872.inputCriterion.s00001053)) AND (FIREABLE(decision.s00002056.activate.s00001072) OR FIREABLE(callToTask.s00003981.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(decision.s00003021.activate.s00001072)) AND FIREABLE(callToTask.s00003973.inputCriterion.s00001053))))",
"processed_size": 461,
"rewrites": 1
},
"result":
{
"edges": 97,
"markings": 98,
"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": 124,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 15624,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 572,
"conflict_clusters": 171,
"places": 273,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 179
},
"result":
{
"preliminary_value": "no no yes yes yes yes no no yes yes yes yes yes yes yes no ",
"value": "no no yes yes yes yes no no yes yes yes yes 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: 452/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8736
lola: finding significant places
lola: 273 places, 179 transitions, 172 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(callToTask.s00003975.inputCriterion.s00001053))) : A (G (((FIREABLE(join.s00001164.activate.s00001064) AND FIREABLE(fork.s00002501.fire.s00001073) AND FIREABLE(merge.s00002238.activate.s00001065)) OR FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00001123.fire.s00001075)))) : E (F (FIREABLE(fork.s00002501.fire.s00001075))) : E (F ((FIREABLE(callToTask.s00003913.outputCriterion.s00001055) AND (FIREABLE(merge.s00002241.activate.s00001062) OR FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR FIREABLE(fork.s00002500.activate.s00001072) OR FIREABLE(merge.s00001160.activate.s00001065)) AND (NOT FIREABLE(decision.s00001840.activate.s00001072) OR NOT FIREABLE(callToTask.s00003963.inputCriterion.s00001053)) AND FIREABLE(decision.s00002761.fire.s00001073)))) : E (F ((FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToProcess.s00003859.inputCriterion.s00001053) AND (FIREABLE(fork.s00002500.fire.s00001073) OR FIREABLE(decision.s00001126.fire.s00001075))))) : E (F ((NOT FIREABLE(join.s00002243.activate.s00001064) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(callToProcess.s00003872.inputCriterion.s00001053)) AND (FIREABLE(decision.s00002056.activate.s00001072) OR FIREABLE(callToTask.s00003981.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(decision.s00003021.activate.s00001072)) AND FIREABLE(callToTask.s00003973.inputCriterion.s00001053)))) : A (G ((FIREABLE(merge.s00002240.activate.s00001062) OR (FIREABLE(decision.s00001841.activate.s00001072) AND FIREABLE(merge.s00002241.activate.s00001064) AND NOT FIREABLE(decision.s00001841.fire.s00001075)) OR NOT FIREABLE(decision.s00002055.activate.s00001072)))) : A (G ((NOT FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR ((FIREABLE(merge.s00001162.activate.s00001062) OR FIREABLE(decision.s00001158.activate.s00001072)) AND (FIREABLE(decision.s00002762.activate.s00001072) OR FIREABLE(callToTask.s00003969.outputCriterion.s00001055)) AND (NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003913.inputCriterion.s00001053)))))) : E (F (FIREABLE(decision.s00003020.fire.s00001075))) : E (F (((NOT FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00002055.fire.s00001073)) AND NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055)))) : E (F (((NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055) AND (FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003962.outputCriterion.s00001055) OR (FIREABLE(decision.s00002948.fire.s00001075) AND FIREABLE(callToTask.s00003908.outputCriterion.s00001055)))) OR FIREABLE(fork.s00001298.fire.s00001073)))) : E (F ((FIREABLE(merge.s00001162.fire.s00001069) AND NOT FIREABLE(decision.s00002056.fire.s00001075) AND (NOT FIREABLE(decision.s00001159.fire.s00001073) OR (FIREABLE(decision.s00001840.fire.s00001073) AND FIREABLE(callToTask.s00003981.outputCriterion.s00001055))) AND FIREABLE(decision.s00001157.fire.s00001075)))) : E (F (FIREABLE(merge.s00001061.fire.s00001069))) : E (F ((FIREABLE(callToTask.s00003981.inputCriterion.s00001053) AND FIREABLE(callToTask.s00003974.inputCriterion.s00001053)))) : E (F (FIREABLE(join.s00002243.fire.s00001069))) : A (G (NOT FIREABLE(merge.s00002240.activate.s00001065)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(callToTask.s00003975.inputCriterion.s00001053)))
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(callToTask.s00003975.inputCriterion.s00001053)))
lola: processed formula length: 67
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(callToTask.s00003975.inputCriterion.s00001053)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(fork.s00002501.fire.s00001075)))
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(fork.s00002501.fire.s00001075)))
lola: processed formula length: 47
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(fork.s00002501.fire.s00001075)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 137 markings, 136 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(decision.s00003020.fire.s00001075)))
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(decision.s00003020.fire.s00001075)))
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(decision.s00003020.fire.s00001075)
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: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(merge.s00001061.fire.s00001069)))
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(merge.s00001061.fire.s00001069)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(join.s00002243.fire.s00001069)))
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(join.s00002243.fire.s00001069)))
lola: processed formula length: 47
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: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(merge.s00002240.activate.s00001065)))
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(merge.s00002240.activate.s00001065)))
lola: processed formula length: 56
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask.s00003981.inputCriterion.s00001053) AND FIREABLE(callToTask.s00003974.inputCriterion.s00001053))))
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(callToTask.s00003981.inputCriterion.s00001053) AND FIREABLE(callToTask.s00003974.inputCriterion.s00001053))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(callToTask.s00003981.inputCriterion.s00001053) AND FIREABLE(callToTask.s00003974.inputCriterion.s00001053))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToProcess.s00003859.inputCriterion.s00001053) AND (FIREABLE(fork.s00002500.fire.s00001073) OR FIREABLE(decision.s00001126.fire.s00001075)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToProcess.s00003859.inputCriterion.s00001053) AND (FIREABLE(fork.s00002500.fire.s00001073) OR FIREABLE(decision.s00001126.fire.s00001075)))))
lola: processed formula length: 223
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: The predicate is reachable.
lola: 86 markings, 85 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00002055.fire.s00001073)) AND NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055))))
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(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00002055.fire.s00001073)) AND NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055))))
lola: processed formula length: 237
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(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00002055.fire.s00001073)) AND NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(join.s00001164.activate.s00001064) AND FIREABLE(fork.s00002501.fire.s00001073) AND FIREABLE(merge.s00002238.activate.s00001065)) OR FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00001123.fire.s00001075))))
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(join.s00001164.activate.s00001064) AND FIREABLE(fork.s00002501.fire.s00001073) AND FIREABLE(merge.s00002238.activate.s00001065)) OR FIREABLE(join.s00001163.activate.s00001065) OR NOT FIREABLE(decision.s00001123.fire.s00001075))))
lola: processed formula length: 248
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(join.s00001164.activate.s00001064) OR NOT FIREABLE(fork.s00002501.fire.s00001073) OR NOT FIREABLE(merge.s00002238.activate.s00001065)) AND NOT FIREABLE(join.s00001163.activate.s00001065) AND FIREABLE(decision.s00001123.fire.s00001075))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(merge.s00002240.activate.s00001062) OR (FIREABLE(decision.s00001841.activate.s00001072) AND FIREABLE(merge.s00002241.activate.s00001064) AND NOT FIREABLE(decision.s00001841.fire.s00001075)) OR NOT FIREABLE(decision.s00002055.activate.s00001072))))
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(merge.s00002240.activate.s00001062) OR (FIREABLE(decision.s00001841.activate.s00001072) AND FIREABLE(merge.s00002241.activate.s00001064) AND NOT FIREABLE(decision.s00001841.fire.s00001075)) OR NOT FIREABLE(decision.s00002055.activate.s00001072))))
lola: processed formula length: 265
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: lola: ========================================
formula 0: (NOT FIREABLE(merge.s00002240.activate.s00001062) AND (NOT FIREABLE(decision.s00001841.activate.s00001072) OR NOT FIREABLE(merge.s00002241.activate.s00001064) OR FIREABLE(decision.s00001841.fire.s00001075)) AND FIREABLE(decision.s00002055.activate.s00001072))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 128 markings, 127 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge.s00001162.fire.s00001069) AND NOT FIREABLE(decision.s00002056.fire.s00001075) AND (NOT FIREABLE(decision.s00001159.fire.s00001073) OR (FIREABLE(decision.s00001840.fire.s00001073) AND FIREABLE(callToTask.s00003981.outputCriterion.s00001055))) AND FIREABLE(decision.s00001157.fire.s00001075))))
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(merge.s00001162.fire.s00001069) AND NOT FIREABLE(decision.s00002056.fire.s00001075) AND (NOT FIREABLE(decision.s00001159.fire.s00001073) OR (FIREABLE(decision.s00001840.fire.s00001073) AND FIREABLE(callToTask.s00003981.outputCriterion.s00001055))) AND FIREABLE(decision.s00001157.fire.s00001075))))
lola: processed formula length: 315
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(merge.s00001162.fire.s00001069) AND NOT FIREABLE(decision.s00002056.fire.s00001075) AND (NOT FIREABLE(decision.s00001159.fire.s00001073) OR (FIREABLE(decision.s00001840.fire.s00001073) AND FIREABLE(callToTask.s00003981.outputCriterion.s00001055))) AND FIREABLE(decision.s00001157.fire.s00001075))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 58 markings, 57 edges
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055) AND (FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003962.outputCriterion.s00001055) OR (FIREABLE(decision.s00002948.fire.s00001075) AND FIREABLE(callToTask.s00003908.outputCriterion.s00001055)))) OR FIREABLE(fork.s00001298.fir... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055) AND (FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003962.outputCriterion.s00001055) OR (FIREABLE(decision.s00002948.fire.s00001075) AND FIREABLE(callToTask.s00003908.outputCriterion.s00001055)))) OR FIREABLE(fork.s00001298.fir... (shortened)
lola: processed formula length: 415
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: ========================================
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(callToTask.s00003978.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003980.outputCriterion.s00001055) AND (FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003962.outputCriterion.s00001055) OR (FIREABLE(decision.s00002948.fire.s00001075) AND FIREABLE(callToTask.s00003908.outputCriterion.s00001055)))) OR FIREABLE(fork.s00001298.fire.s00001073))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
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: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR ((FIREABLE(merge.s00001162.activate.s00001062) OR FIREABLE(decision.s00001158.activate.s00001072)) AND (FIREABLE(decision.s00002762.activate.s00001072) OR FIREABLE(callToTask.s00003969.outputCriterion.s00001055)) AND (NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003913.inputCrite... (shortened)
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(callToTask.s00003964.inputCriterion.s00001053) OR ((FIREABLE(merge.s00001162.activate.s00001062) OR FIREABLE(decision.s00001158.activate.s00001072)) AND (FIREABLE(decision.s00002762.activate.s00001072) OR FIREABLE(callToTask.s00003969.outputCriterion.s00001055)) AND (NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003913.inputCrite... (shortened)
lola: processed formula length: 420
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(callToTask.s00003964.inputCriterion.s00001053) AND ((NOT FIREABLE(merge.s00001162.activate.s00001062) AND NOT FIREABLE(decision.s00001158.activate.s00001072)) OR (NOT FIREABLE(decision.s00002762.activate.s00001072) AND NOT FIREABLE(callToTask.s00003969.outputCriterion.s00001055)) OR (FIREABLE(callToTask.s00003961.outputCriterion.s00001055) AND FIREABLE(callToTask.s00003913.inputCriterion.s00001053))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 29 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 128 markings, 127 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask.s00003913.outputCriterion.s00001055) AND (FIREABLE(merge.s00002241.activate.s00001062) OR FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR FIREABLE(fork.s00002500.activate.s00001072) OR FIREABLE(merge.s00001160.activate.s00001065)) AND (NOT FIREABLE(decision.s00001840.activate.s00001072) OR NOT FIREABLE(callToTask.s00003963.inputCriterion.s00001053)) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(callToTask.s00003913.outputCriterion.s00001055) AND (FIREABLE(merge.s00002241.activate.s00001062) OR FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR FIREABLE(fork.s00002500.activate.s00001072) OR FIREABLE(merge.s00001160.activate.s00001065)) AND (NOT FIREABLE(decision.s00001840.activate.s00001072) OR NOT FIREABLE(callToTask.s00003963.inputCriterion.s00001053)) AN... (shortened)
lola: processed formula length: 448
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
sara: place or transition ordering is non-deterministic
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(callToTask.s00003913.outputCriterion.s00001055) AND (FIREABLE(merge.s00002241.activate.s00001062) OR FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR FIREABLE(fork.s00002500.activate.s00001072) OR FIREABLE(merge.s00001160.activate.s00001065)) AND (NOT FIREABLE(decision.s00001840.activate.s00001072) OR NOT FIREABLE(callToTask.s00003963.inputCriterion.s00001053)) AND FIREABLE(decision.s00002761.fire.s00001073))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(join.s00002243.activate.s00001064) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(callToProcess.s00003872.inputCriterion.s00001053)) AND (FIREABLE(decision.s00002056.activate.s00001072) OR FIREABLE(callToTask.s00003981.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(decision.s00003021.activate.s00001072)) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(join.s00002243.activate.s00001064) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(callToProcess.s00003872.inputCriterion.s00001053)) AND (FIREABLE(decision.s00002056.activate.s00001072) OR FIREABLE(callToTask.s00003981.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(decision.s00003021.activate.s00001072)) A... (shortened)
lola: processed formula length: 461
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(join.s00002243.activate.s00001064) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(callToProcess.s00003872.inputCriterion.s00001053)) AND (FIREABLE(decision.s00002056.activate.s00001072) OR FIREABLE(callToTask.s00003981.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(decision.s00003021.activate.s00001072)) AND FIREABLE(callToTask.s00003973.inputCriterion.s00001053))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 124 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 98 markings, 97 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no no yes yes yes yes yes yes yes no
lola:
preliminary result: no no yes yes yes yes no no yes yes yes yes yes yes yes no
lola: memory consumption: 15624 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552683973910
--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r082-csrt-155246550100855"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 ;