About the Execution of LoLA for ResAllocation-PT-R003C100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4272.710 | 9990.00 | 12194.00 | 20.00 | TTTTTFTFTTTFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r148-ebro-155286403600081.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is ResAllocation-PT-R003C100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-ebro-155286403600081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 3.7K Feb 12 14:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 12 14:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 8 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 1 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 693K 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 ResAllocation-PT-R003C100-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552980866194
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R003C100 @ 3570 seconds
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for ReachabilityFireability @ ResAllocation-PT-R003C100
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Mar 19 07:34:26 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(t_72_2)))",
"processed_size": 24,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(t_6_3)))",
"processed_size": 27,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(t_54_3)))",
"processed_size": 24,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((FIREABLE(t_60_0) OR NOT FIREABLE(t_13_0))))",
"processed_size": 51,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(t_50_0) AND FIREABLE(t_80_1) AND FIREABLE(t_58_1))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"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": 8,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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": "A (G ((FIREABLE(t_76_2) OR FIREABLE(t_6_0) OR FIREABLE(t_54_2) OR FIREABLE(t_19_3))))",
"processed_size": 88,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"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": 144,
"problems": 36
},
"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": 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 (((NOT FIREABLE(t_70_0) OR NOT FIREABLE(t_29_0)) AND FIREABLE(t_15_1) AND FIREABLE(t_25_0))))",
"processed_size": 99,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 15,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(t_69_1) AND (FIREABLE(t_27_2) OR (FIREABLE(t_68_3) AND FIREABLE(t_42_2) AND NOT FIREABLE(t_26_2))))))",
"processed_size": 118,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t_25_3) AND FIREABLE(t_56_3) AND (NOT FIREABLE(t_37_1) OR NOT FIREABLE(t_59_0) OR (NOT FIREABLE(t_65_0) AND NOT FIREABLE(t_13_3))))))",
"processed_size": 151,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 26,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(t_30_2) AND FIREABLE(t_99_3) AND FIREABLE(t_13_1) AND FIREABLE(t_44_3) AND (FIREABLE(t_92_0) OR FIREABLE(t_9_1)))))",
"processed_size": 132,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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": 23,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((FIREABLE(t_51_0) AND FIREABLE(t_47_0) AND (FIREABLE(t_33_3) OR FIREABLE(t_48_0)) AND FIREABLE(t_45_3) AND (FIREABLE(t_45_2) OR (NOT FIREABLE(t_21_2) AND (FIREABLE(t_51_0) OR FIREABLE(t_91_1)))))))",
"processed_size": 206,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"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": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((NOT FIREABLE(t_50_0) AND NOT FIREABLE(t_42_0) AND NOT FIREABLE(t_28_2) AND (FIREABLE(t_29_3) OR NOT FIREABLE(t_62_1) OR FIREABLE(t_44_2) OR FIREABLE(t_43_1) OR (FIREABLE(t_62_1) AND FIREABLE(t_33_2))))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"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": 400,
"problems": 74
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F (((FIREABLE(t_3_1) OR FIREABLE(t_48_2)) AND (FIREABLE(t_20_1) OR FIREABLE(t_29_0)) AND (FIREABLE(t_56_1) OR FIREABLE(t_19_2) OR FIREABLE(t_69_2)) AND NOT FIREABLE(t_67_3) AND FIREABLE(t_20_2))))",
"processed_size": 203,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 288,
"problems": 24
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": 10,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G ((NOT FIREABLE(t_89_1) OR NOT FIREABLE(t_16_0) OR NOT FIREABLE(t_62_3) OR (FIREABLE(t_20_3) AND FIREABLE(t_55_2) AND NOT FIREABLE(t_80_0) AND (FIREABLE(t_38_0) OR FIREABLE(t_26_2)) AND (FIREABLE(t_39_0) OR FIREABLE(t_12_2))))))",
"processed_size": 237,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"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": 108,
"problems": 14
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "E (F ((FIREABLE(t_89_2) AND FIREABLE(t_38_0) AND NOT FIREABLE(t_33_0) AND FIREABLE(t_75_2) AND ((FIREABLE(t_54_3) AND FIREABLE(t_15_0)) OR FIREABLE(t_47_2) OR (FIREABLE(t_6_0) AND FIREABLE(t_44_1) AND NOT FIREABLE(t_18_0))))))",
"processed_size": 228,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 53,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 6,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((((FIREABLE(t_79_1) OR FIREABLE(t_82_3)) AND (FIREABLE(t_81_0) OR FIREABLE(t_73_1)) AND (NOT FIREABLE(t_96_3) OR NOT FIREABLE(t_9_3))) OR (FIREABLE(t_31_1) AND (FIREABLE(t_78_0) OR FIREABLE(t_73_3)) AND (FIREABLE(t_7_0) OR FIREABLE(t_47_2))))))",
"processed_size": 256,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 88,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 21504,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1794,
"conflict_clusters": 103,
"places": 600,
"places_significant": 300,
"singleton_clusters": 0,
"transitions": 400
},
"result":
{
"preliminary_value": "yes yes yes yes yes no yes no yes yes yes no yes no yes yes ",
"value": "yes yes yes yes yes no yes no yes yes yes no yes no 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: 1000/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 600
lola: finding significant places
lola: 600 places, 400 transitions, 300 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(t_51_0) AND FIREABLE(t_47_0) AND (FIREABLE(t_33_3) OR FIREABLE(t_48_0)) AND FIREABLE(t_45_3) AND (FIREABLE(t_45_2) OR (NOT FIREABLE(t_21_2) AND (FIREABLE(t_51_0) OR FIREABLE(t_91_1))))))) : E (F ((FIREABLE(t_30_2) AND FIREABLE(t_99_3) AND FIREABLE(t_13_1) AND FIREABLE(t_44_3) AND (FIREABLE(t_92_0) OR FIREABLE(t_9_1))))) : E (F ((FIREABLE(t_50_0) AND FIREABLE(t_80_1) AND FIREABLE(t_58_1)))) : E (F ((FIREABLE(t_25_3) AND FIREABLE(t_56_3) AND (NOT FIREABLE(t_37_1) OR NOT FIREABLE(t_59_0) OR (NOT FIREABLE(t_65_0) AND NOT FIREABLE(t_13_3)))))) : E (F ((((FIREABLE(t_79_1) OR FIREABLE(t_82_3)) AND (FIREABLE(t_81_0) OR FIREABLE(t_73_1)) AND (NOT FIREABLE(t_96_3) OR NOT FIREABLE(t_9_3))) OR (FIREABLE(t_31_1) AND (FIREABLE(t_78_0) OR FIREABLE(t_73_3)) AND (FIREABLE(t_7_0) OR FIREABLE(t_47_2)))))) : A (G ((NOT FIREABLE(t_89_1) OR NOT FIREABLE(t_16_0) OR NOT FIREABLE(t_62_3) OR (FIREABLE(t_20_3) AND FIREABLE(t_55_2) AND NOT FIREABLE(t_80_0) AND (FIREABLE(t_38_0) OR FIREABLE(t_26_2)) AND (FIREABLE(t_39_0) OR FIREABLE(t_12_2)))))) : E (F (FIREABLE(t_72_2))) : A (G (NOT FIREABLE(t_6_3))) : E (F (((NOT FIREABLE(t_70_0) OR NOT FIREABLE(t_29_0)) AND FIREABLE(t_15_1) AND FIREABLE(t_25_0)))) : E (F (((FIREABLE(t_3_1) OR FIREABLE(t_48_2)) AND (FIREABLE(t_20_1) OR FIREABLE(t_29_0)) AND (FIREABLE(t_56_1) OR FIREABLE(t_19_2) OR FIREABLE(t_69_2)) AND NOT FIREABLE(t_67_3) AND FIREABLE(t_20_2)))) : E (F ((FIREABLE(t_69_1) AND (FIREABLE(t_27_2) OR (FIREABLE(t_68_3) AND FIREABLE(t_42_2) AND NOT FIREABLE(t_26_2)))))) : A (G ((FIREABLE(t_60_0) OR NOT FIREABLE(t_13_0)))) : E (F ((NOT FIREABLE(t_50_0) AND NOT FIREABLE(t_42_0) AND NOT FIREABLE(t_28_2) AND (FIREABLE(t_29_3) OR NOT FIREABLE(t_62_1) OR FIREABLE(t_44_2) OR FIREABLE(t_43_1) OR (FIREABLE(t_62_1) AND FIREABLE(t_33_2)))))) : A (G ((FIREABLE(t_76_2) OR FIREABLE(t_6_0) OR FIREABLE(t_54_2) OR FIREABLE(t_19_3)))) : E (F (FIREABLE(t_54_3))) : E (F ((FIREABLE(t_89_2) AND FIREABLE(t_38_0) AND NOT FIREABLE(t_33_0) AND FIREABLE(t_75_2) AND ((FIREABLE(t_54_3) AND FIREABLE(t_15_0)) OR FIREABLE(t_47_2) OR (FIREABLE(t_6_0) AND FIREABLE(t_44_1) AND NOT FIREABLE(t_18_0))))))
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(t_72_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(t_72_2)))
lola: processed formula length: 24
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: 3 markings, 2 edges
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(t_72_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_6_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (NOT FIREABLE(t_6_3)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_6_3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_54_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(t_54_3)))
lola: processed formula length: 24
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(t_54_3)
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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t_60_0) OR NOT FIREABLE(t_13_0))))
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(t_60_0) OR NOT FIREABLE(t_13_0))))
lola: processed formula length: 51
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(t_60_0) AND FIREABLE(t_13_0))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_50_0) AND FIREABLE(t_80_1) AND FIREABLE(t_58_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(t_50_0) AND FIREABLE(t_80_1) AND FIREABLE(t_58_1))))
lola: processed formula length: 68
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(t_50_0) AND FIREABLE(t_80_1) AND FIREABLE(t_58_1))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t_76_2) OR FIREABLE(t_6_0) OR FIREABLE(t_54_2) OR FIREABLE(t_19_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(t_76_2) OR FIREABLE(t_6_0) OR FIREABLE(t_54_2) OR FIREABLE(t_19_3))))
lola: processed formula length: 88
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(t_76_2) AND NOT FIREABLE(t_6_0) AND NOT FIREABLE(t_54_2) AND NOT FIREABLE(t_19_3))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 144 literals and 36 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t_70_0) OR NOT FIREABLE(t_29_0)) AND FIREABLE(t_15_1) AND FIREABLE(t_25_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 (((NOT FIREABLE(t_70_0) OR NOT FIREABLE(t_29_0)) AND FIREABLE(t_15_1) AND FIREABLE(t_25_0))))
lola: processed formula length: 99
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(t_70_0) OR NOT FIREABLE(t_29_0)) AND FIREABLE(t_15_1) AND FIREABLE(t_25_0))
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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_69_1) AND (FIREABLE(t_27_2) OR (FIREABLE(t_68_3) AND FIREABLE(t_42_2) AND NOT FIREABLE(t_26_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(t_69_1) AND (FIREABLE(t_27_2) OR (FIREABLE(t_68_3) AND FIREABLE(t_42_2) AND NOT FIREABLE(t_26_2))))))
lola: processed formula length: 118
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: 4 markings, 3 edges
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(t_69_1) AND (FIREABLE(t_27_2) OR (FIREABLE(t_68_3) AND FIREABLE(t_42_2) AND NOT FIREABLE(t_26_2))))
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_25_3) AND FIREABLE(t_56_3) AND (NOT FIREABLE(t_37_1) OR NOT FIREABLE(t_59_0) OR (NOT FIREABLE(t_65_0) AND NOT FIREABLE(t_13_3))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(t_25_3) AND FIREABLE(t_56_3) AND (NOT FIREABLE(t_37_1) OR NOT FIREABLE(t_59_0) OR (NOT FIREABLE(t_65_0) AND NOT FIREABLE(t_13_3))))))
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(t_25_3) AND FIREABLE(t_56_3) AND (NOT FIREABLE(t_37_1) OR NOT FIREABLE(t_59_0) OR (NOT FIREABLE(t_65_0) AND NOT FIREABLE(t_13_3))))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 6 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_30_2) AND FIREABLE(t_99_3) AND FIREABLE(t_13_1) AND FIREABLE(t_44_3) AND (FIREABLE(t_92_0) OR FIREABLE(t_9_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(t_30_2) AND FIREABLE(t_99_3) AND FIREABLE(t_13_1) AND FIREABLE(t_44_3) AND (FIREABLE(t_92_0) OR FIREABLE(t_9_1)))))
lola: processed formula length: 132
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(t_30_2) AND FIREABLE(t_99_3) AND FIREABLE(t_13_1) AND FIREABLE(t_44_3) AND (FIREABLE(t_92_0) OR FIREABLE(t_9_1)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 23 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_51_0) AND FIREABLE(t_47_0) AND (FIREABLE(t_33_3) OR FIREABLE(t_48_0)) AND FIREABLE(t_45_3) AND (FIREABLE(t_45_2) OR (NOT FIREABLE(t_21_2) AND (FIREABLE(t_51_0) OR FIREABLE(t_91_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(t_51_0) AND FIREABLE(t_47_0) AND (FIREABLE(t_33_3) OR FIREABLE(t_48_0)) AND FIREABLE(t_45_3) AND (FIREABLE(t_45_2) OR (NOT FIREABLE(t_21_2) AND (FIREABLE(t_51_0) OR FIREABLE(t_91_1)))))))
lola: processed formula length: 206
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: 7 markings, 6 edges
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(t_51_0) AND FIREABLE(t_47_0) AND (FIREABLE(t_33_3) OR FIREABLE(t_48_0)) AND FIREABLE(t_45_3) AND (FIREABLE(t_45_2) OR (NOT FIREABLE(t_21_2) AND (FIREABLE(t_51_0) OR FIREABLE(t_91_1)))))
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_50_0) AND NOT FIREABLE(t_42_0) AND NOT FIREABLE(t_28_2) AND (FIREABLE(t_29_3) OR NOT FIREABLE(t_62_1) OR FIREABLE(t_44_2) OR FIREABLE(t_43_1) OR (FIREABLE(t_62_1) AND FIREABLE(t_33_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 ((NOT FIREABLE(t_50_0) AND NOT FIREABLE(t_42_0) AND NOT FIREABLE(t_28_2) AND (FIREABLE(t_29_3) OR NOT FIREABLE(t_62_1) OR FIREABLE(t_44_2) OR FIREABLE(t_43_1) OR (FIREABLE(t_62_1) AND FIREABLE(t_33_2))))))
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: (NOT FIREABLE(t_50_0) AND NOT FIREABLE(t_42_0) AND NOT FIREABLE(t_28_2) AND (FIREABLE(t_29_3) OR NOT FIREABLE(t_62_1) OR FIREABLE(t_44_2) OR FIREABLE(t_43_1) OR (FIREABLE(t_62_1) AND FIREABLE(t_33_2))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 400 literals and 74 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t_3_1) OR FIREABLE(t_48_2)) AND (FIREABLE(t_20_1) OR FIREABLE(t_29_0)) AND (FIREABLE(t_56_1) OR FIREABLE(t_19_2) OR FIREABLE(t_69_2)) AND NOT FIREABLE(t_67_3) AND FIREABLE(t_20_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(t_3_1) OR FIREABLE(t_48_2)) AND (FIREABLE(t_20_1) OR FIREABLE(t_29_0)) AND (FIREABLE(t_56_1) OR FIREABLE(t_19_2) OR FIREABLE(t_69_2)) AND NOT FIREABLE(t_67_3) AND FIREABLE(t_20_2))))
lola: processed formula length: 203
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(t_3_1) OR FIREABLE(t_48_2)) AND (FIREABLE(t_20_1) OR FIREABLE(t_29_0)) AND (FIREABLE(t_56_1) OR FIREABLE(t_19_2) OR FIREABLE(t_69_2)) AND NOT FIREABLE(t_67_3) AND FIREABLE(t_20_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 288 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-12-0.sara.
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: ========================================
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_89_1) OR NOT FIREABLE(t_16_0) OR NOT FIREABLE(t_62_3) OR (FIREABLE(t_20_3) AND FIREABLE(t_55_2) AND NOT FIREABLE(t_80_0) AND (FIREABLE(t_38_0) OR FIREABLE(t_26_2)) AND (FIREABLE(t_39_0) OR FIREABLE(t_12_2))))))
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(t_89_1) OR NOT FIREABLE(t_16_0) OR NOT FIREABLE(t_62_3) OR (FIREABLE(t_20_3) AND FIREABLE(t_55_2) AND NOT FIREABLE(t_80_0) AND (FIREABLE(t_38_0) OR FIREABLE(t_26_2)) AND (FIREABLE(t_39_0) OR FIREABLE(t_12_2))))))
lola: processed formula length: 237
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(t_89_1) AND FIREABLE(t_16_0) AND FIREABLE(t_62_3) AND (NOT FIREABLE(t_20_3) OR NOT FIREABLE(t_55_2) OR FIREABLE(t_80_0) OR (NOT FIREABLE(t_38_0) AND NOT FIREABLE(t_26_2)) OR (NOT FIREABLE(t_39_0) AND NOT FIREABLE(t_12_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 108 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_89_2) AND FIREABLE(t_38_0) AND NOT FIREABLE(t_33_0) AND FIREABLE(t_75_2) AND ((FIREABLE(t_54_3) AND FIREABLE(t_15_0)) OR FIREABLE(t_47_2) OR (FIREABLE(t_6_0) AND FIREABLE(t_44_1) AND NOT FIREABLE(t_18_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(t_89_2) AND FIREABLE(t_38_0) AND NOT FIREABLE(t_33_0) AND FIREABLE(t_75_2) AND ((FIREABLE(t_54_3) AND FIREABLE(t_15_0)) OR FIREABLE(t_47_2) OR (FIREABLE(t_6_0) AND FIREABLE(t_44_1) AND NOT FIREABLE(t_18_0))))))
lola: processed formula length: 228
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(t_89_2) AND FIREABLE(t_38_0) AND NOT FIREABLE(t_33_0) AND FIREABLE(t_75_2) AND ((FIREABLE(t_54_3) AND FIREABLE(t_15_0)) OR FIREABLE(t_47_2) OR (FIREABLE(t_6_0) AND FIREABLE(t_44_1) AND NOT FIREABLE(t_18_0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 53 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t_79_1) OR FIREABLE(t_82_3)) AND (FIREABLE(t_81_0) OR FIREABLE(t_73_1)) AND (NOT FIREABLE(t_96_3) OR NOT FIREABLE(t_9_3))) OR (FIREABLE(t_31_1) AND (FIREABLE(t_78_0) OR FIREABLE(t_73_3)) AND (FIREABLE(t_7_0) OR FIREABLE(t_47_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(t_79_1) OR FIREABLE(t_82_3)) AND (FIREABLE(t_81_0) OR FIREABLE(t_73_1)) AND (NOT FIREABLE(t_96_3) OR NOT FIREABLE(t_9_3))) OR (FIREABLE(t_31_1) AND (FIREABLE(t_78_0) OR FIREABLE(t_73_3)) AND (FIREABLE(t_7_0) OR FIREABLE(t_47_2))))))
lola: processed formula length: 256
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(t_79_1) OR FIREABLE(t_82_3)) AND (FIREABLE(t_81_0) OR FIREABLE(t_73_1)) AND (NOT FIREABLE(t_96_3) OR NOT FIREABLE(t_9_3))) OR (FIREABLE(t_31_1) AND (FIREABLE(t_78_0) OR FIREABLE(t_73_3)) AND (FIREABLE(t_7_0) OR FIREABLE(t_47_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 88 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no yes yes yes no yes no yes yes
lola:
preliminary result: yes yes yes yes yes no yes no yes yes yes no yes no yes yes
lola: memory consumption: 21504 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552980876184
--------------------
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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r148-ebro-155286403600081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ;