About the Execution of LoLA for Eratosthenes-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4269.320 | 5087.00 | 5378.00 | 40.00 | FFFFFFTFFTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r071-smll-155234737800297.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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-3957
Executing tool lola
Input is Eratosthenes-PT-200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-155234737800297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 3.0K Feb 10 23:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 10 23:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 6 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 6 20:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 3 08:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 08:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 31 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Jan 31 01:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 311K 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 Eratosthenes-PT-200-ReachabilityFireability-00
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-01
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-02
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-03
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-04
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-05
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-06
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-07
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-08
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-09
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-10
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-11
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-12
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-13
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-14
FORMULA_NAME Eratosthenes-PT-200-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552832049705
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Eratosthenes-PT-200 @ 3570 seconds
FORMULA Eratosthenes-PT-200-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Eratosthenes-PT-200-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityFireability @ Eratosthenes-PT-200
{
"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": "Sun Mar 17 14:14:09 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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((FIREABLE(t115.23) OR FIREABLE(t180.5))))",
"processed_size": 48,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"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": 8,
"problems": 4
},
"type": "invariance",
"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": 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": "A (G ((FIREABLE(t162.6) OR FIREABLE(t177.3) OR (FIREABLE(t144.4) AND FIREABLE(t18.9)))))",
"processed_size": 90,
"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": 48,
"problems": 16
},
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(t189.3) AND NOT FIREABLE(t58.29) AND FIREABLE(t196.4) AND NOT FIREABLE(t100.5))))",
"processed_size": 101,
"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": 40,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 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": "A (G ((FIREABLE(t84.6) OR (FIREABLE(t90.2) AND FIREABLE(t88.22)) OR FIREABLE(t91.7) OR FIREABLE(t135.27) OR FIREABLE(t52.13))))",
"processed_size": 131,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": 6,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F (((NOT FIREABLE(t32.4) AND NOT FIREABLE(t182.14) AND FIREABLE(t180.5)) OR (NOT FIREABLE(t60.6) AND NOT FIREABLE(t120.10) AND NOT FIREABLE(t78.2)))))",
"processed_size": 154,
"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": 40,
"problems": 12
},
"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": 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": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((FIREABLE(t26.2) OR FIREABLE(t24.6) OR (NOT FIREABLE(t70.2) AND NOT FIREABLE(t90.9) AND NOT FIREABLE(t160.20) AND NOT FIREABLE(t198.2)))))",
"processed_size": 146,
"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": 48,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": 6,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((FIREABLE(t144.12) OR FIREABLE(t105.5) OR (NOT FIREABLE(t112.8) AND NOT FIREABLE(t96.3)) OR (FIREABLE(t80.8) AND NOT FIREABLE(t70.14)))))",
"processed_size": 146,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 108,
"problems": 20
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t132.4) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t161.23)) AND NOT FIREABLE(t134.2) AND NOT FIREABLE(t10.2) AND FIREABLE(t180.5))))",
"processed_size": 148,
"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"
},
"stateequation":
{
"literals": 112,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((NOT FIREABLE(t27.9) OR (FIREABLE(t186.31) AND FIREABLE(t142.71)) OR NOT FIREABLE(t20.2) OR FIREABLE(t28.4) OR FIREABLE(t105.35))))",
"processed_size": 141,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 112,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((NOT FIREABLE(t152.19) AND NOT FIREABLE(t99.9) AND (NOT FIREABLE(t175.7) OR NOT FIREABLE(t46.23)) AND ((FIREABLE(t98.2) AND NOT FIREABLE(t198.6)) OR FIREABLE(t174.87)))))",
"processed_size": 178,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 272,
"problems": 48
},
"type": "reachability",
"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": 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": 8,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G ((NOT FIREABLE(t192.48) OR NOT FIREABLE(t120.15) OR NOT FIREABLE(t188.47) OR (FIREABLE(t144.24) AND FIREABLE(t189.27)) OR FIREABLE(t192.32) OR (NOT FIREABLE(t60.30) AND FIREABLE(t150.6)))))",
"processed_size": 199,
"rewrites": 2
},
"result":
{
"edges": 14,
"markings": 4,
"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": 112,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G ((FIREABLE(t135.15) OR FIREABLE(t68.2) OR FIREABLE(t192.16) OR FIREABLE(t108.9) OR (FIREABLE(t110.2) AND FIREABLE(t24.4)) OR (NOT FIREABLE(t172.43) AND FIREABLE(t192.24)))))",
"processed_size": 183,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((FIREABLE(t75.3) AND NOT FIREABLE(t33.3) AND (FIREABLE(t42.6) OR FIREABLE(t168.42) OR FIREABLE(t122.2)) AND (NOT FIREABLE(t105.3) OR NOT FIREABLE(t52.26) OR (NOT FIREABLE(t140.2) AND NOT FIREABLE(t135.5))))))",
"processed_size": 218,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"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": 124,
"problems": 19
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((NOT FIREABLE(t24.3) AND (FIREABLE(t180.15) OR FIREABLE(t96.16)) AND (NOT FIREABLE(t174.87) OR NOT FIREABLE(t86.43)) AND (NOT FIREABLE(t136.8) OR NOT FIREABLE(t112.28) OR (NOT FIREABLE(t108.27) AND NOT FIREABLE(t112.2))))))",
"processed_size": 233,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"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": 10,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G (((FIREABLE(t135.9) AND FIREABLE(t117.39) AND FIREABLE(t42.14) AND (NOT FIREABLE(t165.5) OR (FIREABLE(t144.36) AND FIREABLE(t144.6)))) OR (FIREABLE(t121.11) AND FIREABLE(t111.3) AND FIREABLE(t155.5) AND FIREABLE(t66.33)))))",
"processed_size": 230,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 208,
"problems": 76
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"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": 10,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G (((FIREABLE(t40.20) AND FIREABLE(t104.26) AND FIREABLE(t180.10)) OR FIREABLE(t80.20) OR (FIREABLE(t112.16) AND FIREABLE(t42.21)) OR NOT FIREABLE(t185.37) OR FIREABLE(t91.7) OR (FIREABLE(t126.2) AND FIREABLE(t24.3)))))",
"processed_size": 227,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22016,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 2097,
"conflict_clusters": 22,
"places": 199,
"places_significant": 153,
"singleton_clusters": 0,
"transitions": 699
},
"result":
{
"preliminary_value": "no no no no no no yes no no yes no yes yes yes no yes ",
"value": "no no no no no no yes no no yes no yes yes yes no 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: 898/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 199
lola: finding significant places
lola: 199 places, 699 transitions, 153 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 ((FIREABLE(t26.2) OR FIREABLE(t24.6) OR (NOT FIREABLE(t70.2) AND NOT FIREABLE(t90.9) AND NOT FIREABLE(t160.20) AND NOT FIREABLE(t198.2))))) : A (G ((FIREABLE(t84.6) OR (FIREABLE(t90.2) AND FIREABLE(t88.22)) OR FIREABLE(t91.7) OR FIREABLE(t135.27) OR FIREABLE(t52.13)))) : A (G ((FIREABLE(t162.6) OR FIREABLE(t177.3) OR (FIREABLE(t144.4) AND FIREABLE(t18.9))))) : A (G (((FIREABLE(t40.20) AND FIREABLE(t104.26) AND FIREABLE(t180.10)) OR FIREABLE(t80.20) OR (FIREABLE(t112.16) AND FIREABLE(t42.21)) OR NOT FIREABLE(t185.37) OR FIREABLE(t91.7) OR (FIREABLE(t126.2) AND FIREABLE(t24.3))))) : A (G ((FIREABLE(t115.23) OR FIREABLE(t180.5)))) : A (G ((FIREABLE(t135.15) OR FIREABLE(t68.2) OR FIREABLE(t192.16) OR FIREABLE(t108.9) OR (FIREABLE(t110.2) AND FIREABLE(t24.4)) OR (NOT FIREABLE(t172.43) AND FIREABLE(t192.24))))) : E (F (((NOT FIREABLE(t32.4) AND NOT FIREABLE(t182.14) AND FIREABLE(t180.5)) OR (NOT FIREABLE(t60.6) AND NOT FIREABLE(t120.10) AND NOT FIREABLE(t78.2))))) : A (G ((NOT FIREABLE(t192.48) OR NOT FIREABLE(t120.15) OR NOT FIREABLE(t188.47) OR (FIREABLE(t144.24) AND FIREABLE(t189.27)) OR FIREABLE(t192.32) OR (NOT FIREABLE(t60.30) AND FIREABLE(t150.6))))) : A (G (((FIREABLE(t135.9) AND FIREABLE(t117.39) AND FIREABLE(t42.14) AND (NOT FIREABLE(t165.5) OR (FIREABLE(t144.36) AND FIREABLE(t144.6)))) OR (FIREABLE(t121.11) AND FIREABLE(t111.3) AND FIREABLE(t155.5) AND FIREABLE(t66.33))))) : E (F ((NOT FIREABLE(t189.3) AND NOT FIREABLE(t58.29) AND FIREABLE(t196.4) AND NOT FIREABLE(t100.5)))) : A (G ((FIREABLE(t144.12) OR FIREABLE(t105.5) OR (NOT FIREABLE(t112.8) AND NOT FIREABLE(t96.3)) OR (FIREABLE(t80.8) AND NOT FIREABLE(t70.14))))) : E (F ((NOT FIREABLE(t152.19) AND NOT FIREABLE(t99.9) AND (NOT FIREABLE(t175.7) OR NOT FIREABLE(t46.23)) AND ((FIREABLE(t98.2) AND NOT FIREABLE(t198.6)) OR FIREABLE(t174.87))))) : E (F ((FIREABLE(t132.4) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t161.23)) AND NOT FIREABLE(t134.2) AND NOT FIREABLE(t10.2) AND FIREABLE(t180.5)))) : E (F ((FIREABLE(t75.3) AND NOT FIREABLE(t33.3) AND (FIREABLE(t42.6) OR FIREABLE(t168.42) OR FIREABLE(t122.2)) AND (NOT FIREABLE(t105.3) OR NOT FIREABLE(t52.26) OR (NOT FIREABLE(t140.2) AND NOT FIREABLE(t135.5)))))) : A (G ((NOT FIREABLE(t27.9) OR (FIREABLE(t186.31) AND FIREABLE(t142.71)) OR NOT FIREABLE(t20.2) OR FIREABLE(t28.4) OR FIREABLE(t105.35)))) : E (F ((NOT FIREABLE(t24.3) AND (FIREABLE(t180.15) OR FIREABLE(t96.16)) AND (NOT FIREABLE(t174.87) OR NOT FIREABLE(t86.43)) AND (NOT FIREABLE(t136.8) OR NOT FIREABLE(t112.28) OR (NOT FIREABLE(t108.27) AND NOT FIREABLE(t112.2))))))
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 ((FIREABLE(t115.23) OR FIREABLE(t180.5))))
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(t115.23) OR FIREABLE(t180.5))))
lola: processed formula length: 48
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(t115.23) AND NOT FIREABLE(t180.5))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t162.6) OR FIREABLE(t177.3) OR (FIREABLE(t144.4) AND FIREABLE(t18.9)))))
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(t162.6) OR FIREABLE(t177.3) OR (FIREABLE(t144.4) AND FIREABLE(t18.9)))))
lola: processed formula length: 90
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: ========================================
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(t162.6) AND NOT FIREABLE(t177.3) AND (NOT FIREABLE(t144.4) OR NOT FIREABLE(t18.9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 16 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 ((NOT FIREABLE(t189.3) AND NOT FIREABLE(t58.29) AND FIREABLE(t196.4) AND NOT FIREABLE(t100.5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(t189.3) AND NOT FIREABLE(t58.29) AND FIREABLE(t196.4) AND NOT FIREABLE(t100.5))))
lola: processed formula length: 101
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(t189.3) AND NOT FIREABLE(t58.29) AND FIREABLE(t196.4) AND NOT FIREABLE(t100.5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t84.6) OR (FIREABLE(t90.2) AND FIREABLE(t88.22)) OR FIREABLE(t91.7) OR FIREABLE(t135.27) OR FIREABLE(t52.13))))
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(t84.6) OR (FIREABLE(t90.2) AND FIREABLE(t88.22)) OR FIREABLE(t91.7) OR FIREABLE(t135.27) OR FIREABLE(t52.13))))
lola: processed formula length: 131
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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t32.4) AND NOT FIREABLE(t182.14) AND FIREABLE(t180.5)) OR (NOT FIREABLE(t60.6) AND NOT FIREABLE(t120.10) AND NOT FIREABLE(t78.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(t32.4) AND NOT FIREABLE(t182.14) AND FIREABLE(t180.5)) OR (NOT FIREABLE(t60.6) AND NOT FIREABLE(t120.10) AND NOT FIREABLE(t78.2)))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((NOT FIREABLE(t32.4) AND NOT FIREABLE(t182.14) AND FIREABLE(t180.5)) OR (NOT FIREABLE(t60.6) AND NOT FIREABLE(t120.10) AND NOT FIREABLE(t78.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 40 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t26.2) OR FIREABLE(t24.6) OR (NOT FIREABLE(t70.2) AND NOT FIREABLE(t90.9) AND NOT FIREABLE(t160.20) AND NOT FIREABLE(t198.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 ((FIREABLE(t26.2) OR FIREABLE(t24.6) OR (NOT FIREABLE(t70.2) AND NOT FIREABLE(t90.9) AND NOT FIREABLE(t160.20) AND NOT FIREABLE(t198.2)))))
lola: processed formula length: 146
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(t26.2) AND NOT FIREABLE(t24.6) AND (FIREABLE(t70.2) OR FIREABLE(t90.9) OR FIREABLE(t160.20) OR FIREABLE(t198.2)))
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 48 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t144.12) OR FIREABLE(t105.5) OR (NOT FIREABLE(t112.8) AND NOT FIREABLE(t96.3)) OR (FIREABLE(t80.8) AND NOT FIREABLE(t70.14)))))
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(t144.12) OR FIREABLE(t105.5) OR (NOT FIREABLE(t112.8) AND NOT FIREABLE(t96.3)) OR (FIREABLE(t80.8) AND NOT FIREABLE(t70.14)))))
lola: processed formula length: 146
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(t144.12) AND NOT FIREABLE(t105.5) AND (FIREABLE(t112.8) OR FIREABLE(t96.3)) AND (NOT FIREABLE(t80.8) OR FIREABLE(t70.14)))
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 108 literals and 20 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t132.4) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t161.23)) AND NOT FIREABLE(t134.2) AND NOT FIREABLE(t10.2) AND FIREABLE(t180.5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(t132.4) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t161.23)) AND NOT FIREABLE(t134.2) AND NOT FIREABLE(t10.2) AND FIREABLE(t180.5))))
lola: processed formula length: 148
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(t132.4) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t161.23)) AND NOT FIREABLE(t134.2) AND NOT FIREABLE(t10.2) AND FIREABLE(t180.5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 112 literals and 16 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t27.9) OR (FIREABLE(t186.31) AND FIREABLE(t142.71)) OR NOT FIREABLE(t20.2) OR FIREABLE(t28.4) OR FIREABLE(t105.35))))
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(t27.9) OR (FIREABLE(t186.31) AND FIREABLE(t142.71)) OR NOT FIREABLE(t20.2) OR FIREABLE(t28.4) OR FIREABLE(t105.35))))
lola: processed formula length: 141
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(t27.9) AND (NOT FIREABLE(t186.31) OR NOT FIREABLE(t142.71)) AND FIREABLE(t20.2) AND NOT FIREABLE(t28.4) AND NOT FIREABLE(t105.35))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 112 literals and 16 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 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t152.19) AND NOT FIREABLE(t99.9) AND (NOT FIREABLE(t175.7) OR NOT FIREABLE(t46.23)) AND ((FIREABLE(t98.2) AND NOT FIREABLE(t198.6)) OR FIREABLE(t174.87)))))
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(t152.19) AND NOT FIREABLE(t99.9) AND (NOT FIREABLE(t175.7) OR NOT FIREABLE(t46.23)) AND ((FIREABLE(t98.2) AND NOT FIREABLE(t198.6)) OR FIREABLE(t174.87)))))
lola: processed formula length: 178
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(t152.19) AND NOT FIREABLE(t99.9) AND (NOT FIREABLE(t175.7) OR NOT FIREABLE(t46.23)) AND ((FIREABLE(t98.2) AND NOT FIREABLE(t198.6)) OR FIREABLE(t174.87)))
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 unparse finished id 0
lola: state equation: Generated DNF with 272 literals and 48 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t192.48) OR NOT FIREABLE(t120.15) OR NOT FIREABLE(t188.47) OR (FIREABLE(t144.24) AND FIREABLE(t189.27)) OR FIREABLE(t192.32) OR (NOT FIREABLE(t60.30) AND FIREABLE(t150.6)))))
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(t192.48) OR NOT FIREABLE(t120.15) OR NOT FIREABLE(t188.47) OR (FIREABLE(t144.24) AND FIREABLE(t189.27)) OR FIREABLE(t192.32) OR (NOT FIREABLE(t60.30) AND FIREABLE(t150.6)))))
lola: processed formula length: 199
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(t192.48) AND FIREABLE(t120.15) AND FIREABLE(t188.47) AND (NOT FIREABLE(t144.24) OR NOT FIREABLE(t189.27)) AND NOT FIREABLE(t192.32) AND (FIREABLE(t60.30) OR NOT FIREABLE(t150.6)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 14 edges
lola: state equation: Generated DNF with 112 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t135.15) OR FIREABLE(t68.2) OR FIREABLE(t192.16) OR FIREABLE(t108.9) OR (FIREABLE(t110.2) AND FIREABLE(t24.4)) OR (NOT FIREABLE(t172.43) AND FIREABLE(t192.24)))))
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(t135.15) OR FIREABLE(t68.2) OR FIREABLE(t192.16) OR FIREABLE(t108.9) OR (FIREABLE(t110.2) AND FIREABLE(t24.4)) OR (NOT FIREABLE(t172.43) AND FIREABLE(t192.24)))))
lola: processed formula length: 183
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(t135.15) AND NOT FIREABLE(t68.2) AND NOT FIREABLE(t192.16) AND NOT FIREABLE(t108.9) AND (NOT FIREABLE(t110.2) OR NOT FIREABLE(t24.4)) AND (FIREABLE(t172.43) OR NOT FIREABLE(t192.24)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t75.3) AND NOT FIREABLE(t33.3) AND (FIREABLE(t42.6) OR FIREABLE(t168.42) OR FIREABLE(t122.2)) AND (NOT FIREABLE(t105.3) OR NOT FIREABLE(t52.26) OR (NOT FIREABLE(t140.2) AND NOT FIREABLE(t135.5))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(t75.3) AND NOT FIREABLE(t33.3) AND (FIREABLE(t42.6) OR FIREABLE(t168.42) OR FIREABLE(t122.2)) AND (NOT FIREABLE(t105.3) OR NOT FIREABLE(t52.26) OR (NOT FIREABLE(t140.2) AND NOT FIREABLE(t135.5))))))
lola: processed formula length: 218
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(t75.3) AND NOT FIREABLE(t33.3) AND (FIREABLE(t42.6) OR FIREABLE(t168.42) OR FIREABLE(t122.2)) AND (NOT FIREABLE(t105.3) OR NOT FIREABLE(t52.26) OR (NOT FIREABLE(t140.2) AND NOT FIREABLE(t135.5))))
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 124 literals and 19 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t24.3) AND (FIREABLE(t180.15) OR FIREABLE(t96.16)) AND (NOT FIREABLE(t174.87) OR NOT FIREABLE(t86.43)) AND (NOT FIREABLE(t136.8) OR NOT FIREABLE(t112.28) OR (NOT FIREABLE(t108.27) AND NOT FIREABLE(t112.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(t24.3) AND (FIREABLE(t180.15) OR FIREABLE(t96.16)) AND (NOT FIREABLE(t174.87) OR NOT FIREABLE(t86.43)) AND (NOT FIREABLE(t136.8) OR NOT FIREABLE(t112.28) OR (NOT FIREABLE(t108.27) AND NOT FIREABLE(t112.2))))))
lola: processed formula length: 233
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(t24.3) AND (FIREABLE(t180.15) OR FIREABLE(t96.16)) AND (NOT FIREABLE(t174.87) OR NOT FIREABLE(t86.43)) AND (NOT FIREABLE(t136.8) OR NOT FIREABLE(t112.28) OR (NOT FIREABLE(t108.27) AND NOT FIREABLE(t112.2))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t135.9) AND FIREABLE(t117.39) AND FIREABLE(t42.14) AND (NOT FIREABLE(t165.5) OR (FIREABLE(t144.36) AND FIREABLE(t144.6)))) OR (FIREABLE(t121.11) AND FIREABLE(t111.3) AND FIREABLE(t155.5) AND FIREABLE(t66.33)))))
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(t135.9) AND FIREABLE(t117.39) AND FIREABLE(t42.14) AND (NOT FIREABLE(t165.5) OR (FIREABLE(t144.36) AND FIREABLE(t144.6)))) OR (FIREABLE(t121.11) AND FIREABLE(t111.3) AND FIREABLE(t155.5) AND FIREABLE(t66.33)))))
lola: processed formula length: 230
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(t135.9) OR NOT FIREABLE(t117.39) OR NOT FIREABLE(t42.14) OR (FIREABLE(t165.5) AND (NOT FIREABLE(t144.36) OR NOT FIREABLE(t144.6)))) AND (NOT FIREABLE(t121.11) OR NOT FIREABLE(t111.3) OR NOT FIREABLE(t155.5) OR NOT FIREABLE(t66.33)))
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 208 literals and 76 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t40.20) AND FIREABLE(t104.26) AND FIREABLE(t180.10)) OR FIREABLE(t80.20) OR (FIREABLE(t112.16) AND FIREABLE(t42.21)) OR NOT FIREABLE(t185.37) OR FIREABLE(t91.7) OR (FIREABLE(t126.2) AND FIREABLE(t24.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(t40.20) AND FIREABLE(t104.26) AND FIREABLE(t180.10)) OR FIREABLE(t80.20) OR (FIREABLE(t112.16) AND FIREABLE(t42.21)) OR NOT FIREABLE(t185.37) OR FIREABLE(t91.7) OR (FIREABLE(t126.2) AND FIREABLE(t24.3)))))
lola: processed formula length: 227
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(t40.20) OR NOT FIREABLE(t104.26) OR NOT FIREABLE(t180.10)) AND NOT FIREABLE(t80.20) AND (NOT FIREABLE(t112.16) OR NOT FIREABLE(t42.21)) AND FIREABLE(t185.37) AND NOT FIREABLE(t91.7) AND (NOT FIREABLE(t126.2) OR NOT FIREABLE(t24.3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes no yes yes yes no yes
lola:
preliminary result: no no no no no no yes no no yes no yes yes yes no yes
lola: memory consumption: 22016 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 1552832054792
--------------------
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="Eratosthenes-PT-200"
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-3957"
echo " Executing tool lola"
echo " Input is Eratosthenes-PT-200, 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 r071-smll-155234737800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 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 ;