About the Execution of 2020-gold for SwimmingPool-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16255.403 | 3600000.00 | 878147.00 | 29236.90 | TFTTFFFFFF?FFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700374.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SwimmingPool-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700374
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-05-00
FORMULA_NAME SwimmingPool-PT-05-01
FORMULA_NAME SwimmingPool-PT-05-02
FORMULA_NAME SwimmingPool-PT-05-03
FORMULA_NAME SwimmingPool-PT-05-04
FORMULA_NAME SwimmingPool-PT-05-05
FORMULA_NAME SwimmingPool-PT-05-06
FORMULA_NAME SwimmingPool-PT-05-07
FORMULA_NAME SwimmingPool-PT-05-08
FORMULA_NAME SwimmingPool-PT-05-09
FORMULA_NAME SwimmingPool-PT-05-10
FORMULA_NAME SwimmingPool-PT-05-11
FORMULA_NAME SwimmingPool-PT-05-12
FORMULA_NAME SwimmingPool-PT-05-13
FORMULA_NAME SwimmingPool-PT-05-14
FORMULA_NAME SwimmingPool-PT-05-15
=== Now, execution of the tool begins
BK_START 1621226091124
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 04:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:34:53] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-17 04:34:53] [INFO ] Transformed 9 places.
[2021-05-17 04:34:53] [INFO ] Transformed 7 transitions.
[2021-05-17 04:34:53] [INFO ] Parsed PT model containing 9 places and 7 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 409 steps, including 0 resets, run visited all 17 properties in 3 ms. (steps per millisecond=136 )
[2021-05-17 04:34:53] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-17 04:34:53] [INFO ] Flatten gal took : 20 ms
FORMULA SwimmingPool-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:34:53] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:34:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-17 04:34:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SwimmingPool-PT-05 @ 3570 seconds
FORMULA SwimmingPool-PT-05-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-05-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2674
rslt: Output for LTLFireability @ SwimmingPool-PT-05
{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 04:34:54 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p3 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 51
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 49
},
"result":
{
"edges": 112,
"markings": 111,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X ((p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))))",
"processed_size": 53,
"rewrites": 49
},
"result":
{
"edges": 107,
"markings": 107,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((1 <= p6) AND ((p1 <= 0) OR (p8 <= 0))))) OR ((1 <= p0) AND (1 <= p7) AND ((p1 <= 0) OR (p8 <= 0))))))",
"processed_size": 118,
"rewrites": 49
},
"result":
{
"edges": 121,
"markings": 118,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((p3 <= 0) OR (p7 <= 0))) R X (F (((p0 <= 0) OR (p7 <= 0))))))",
"processed_size": 71,
"rewrites": 49
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (G ((F (((1 <= p0) AND (1 <= p7))) AND (((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p7)))))) U G ((F (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8))) AND (((1 <= p4) OR (1 <= p6)) OR X (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8)))))))",
"processed_size": 261,
"rewrites": 49
},
"result":
{
"edges": 1709,
"markings": 1019,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 625
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p8))))",
"processed_size": 61,
"rewrites": 49
},
"result":
{
"edges": 356,
"markings": 356,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p1) AND (1 <= p8))))",
"processed_size": 33,
"rewrites": 49
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1042
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p8))",
"processed_size": 25,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p1 <= 0) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 51
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((1 <= p4))))",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1042
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p4 <= 0)",
"processed_size": 9,
"rewrites": 51
},
"result":
{
"edges": 350,
"markings": 351,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p3) AND (1 <= p7))))",
"processed_size": 64,
"rewrites": 49
},
"result":
{
"edges": 15997,
"markings": 11676,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3128
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3128
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G ((1 <= p5)) OR (p2 <= 0)))",
"processed_size": 32,
"rewrites": 49
},
"result":
{
"edges": 356,
"markings": 356,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 895.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(**)) OR (G((G(**) AND **)) OR F(**))) : F(**) : (F((F(*) OR *)) AND G((G(*) OR *))) : (F(G(**)) AND G((F(**) OR (X(X(X(**))) U G(**))))) : X(G((X(*) AND *))) : F(G((X(F(*)) OR **))) : X((** OR (G(F(**)) AND F(**)))) : X((G(*) R X(F(*)))) : (X(G((F(**) AND (** OR **)))) U G((F(**) AND (** OR X(**))))) : F((G(**) OR **)) : (G(**) OR (X(F(**)) AND (F(**) OR **))) : X(X(G(**)))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "yes yes no no no no unknown no no yes yes no ",
"value": "yes yes no no no no unknown no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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 LTLFireability.xml
lola: ((X (F (((1 <= p3) AND (1 <= p7)))) OR G ((G (((1 <= p3) AND (1 <= p7))) AND (1 <= p4)))) OR F (((1 <= p3) AND (1 <= p7)))) : F ((1 <= p4)) : (NOT(G ((G (((1 <= p3) AND (1 <= p7))) AND (1 <= p4)))) AND NOT(F ((F ((p5 <= 0)) AND (1 <= p2))))) : G ((F (((1 <= p3) AND (1 <= p7))) U (X (X (X (((1 <= p3) AND (1 <= p7))))) U G ((1 <= p4))))) : G (NOT(F (X ((X ((1 <= p4)) OR ((1 <= p0) AND (1 <= p7))))))) : F (G ((NOT(G (X (((p6 <= 0) OR ((1 <= p1) AND (1 <= p8)))))) OR ((1 <= p0) AND (1 <= p7) AND ((p1 <= 0) OR (p8 <= 0)))))) : X ((G (F (((1 <= p3) AND (1 <= p7)))) U ((1 <= p3) AND (1 <= p7)))) : X (NOT((F (((1 <= p3) AND (1 <= p7))) U G (X (((1 <= p0) AND (1 <= p7))))))) : (G (X ((((1 <= p1) AND (1 <= p8)) U ((1 <= p0) AND (1 <= p7))))) U G ((((1 <= p4) OR (1 <= p6)) U X (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8)))))) : (F (G (((1 <= p0) AND (1 <= p7)))) OR F (((1 <= p3) AND (1 <= p7)))) : (G ((((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p8)))) OR (X (F (((1 <= p1) AND (1 <= p8)))) AND (F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8))))) : G (X (G (X (G ((1 <= p4))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p3) AND (1 <= p7)))) OR (G ((G (((1 <= p3) AND (1 <= p7))) AND (1 <= p4))) OR F (((1 <= p3) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 201 markings, 200 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p4))) AND G ((F (((1 <= p3) AND (1 <= p7))) OR (X (X (X (((1 <= p3) AND (1 <= p7))))) U G ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p4)))
lola: processed formula length: 17
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 111 markings, 112 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 53
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 107 markings, 107 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p6) AND ((p1 <= 0) OR (p8 <= 0))))) OR ((1 <= p0) AND (1 <= p7) AND ((p1 <= 0) OR (p8 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p6) AND ((p1 <= 0) OR (p8 <= 0))))) OR ((1 <= p0) AND (1 <= p7) AND ((p1 <= 0) OR (p8 <= 0))))))
lola: processed formula length: 118
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 118 markings, 121 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p3) AND (1 <= p7)) OR (G (F (((1 <= p3) AND (1 <= p7)))) AND F (((1 <= p3) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p3) AND (1 <= p7)) OR (G (F (((1 <= p3) AND (1 <= p7)))) AND F (((1 <= p3) AND (1 <= p7))))))
lola: processed formula length: 104
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3176887 markings, 8344804 edges, 635377 markings/sec, 0 secs
lola: 6016933 markings, 16107433 edges, 568009 markings/sec, 5 secs
lola: 8589277 markings, 23584379 edges, 514469 markings/sec, 10 secs
lola: 10967834 markings, 30582851 edges, 475711 markings/sec, 15 secs
lola: 13163783 markings, 37137996 edges, 439190 markings/sec, 20 secs
lola: 15258864 markings, 43469091 edges, 419016 markings/sec, 25 secs
lola: 17345308 markings, 49842250 edges, 417289 markings/sec, 30 secs
lola: 19547075 markings, 56538297 edges, 440353 markings/sec, 35 secs
lola: 21576113 markings, 62856005 edges, 405808 markings/sec, 40 secs
lola: 23542264 markings, 69125691 edges, 393230 markings/sec, 45 secs
lola: 25499414 markings, 75456144 edges, 391430 markings/sec, 50 secs
lola: 27376642 markings, 81673407 edges, 375446 markings/sec, 55 secs
lola: 29144335 markings, 87756603 edges, 353539 markings/sec, 60 secs
lola: 30892801 markings, 93869568 edges, 349693 markings/sec, 65 secs
lola: 32627697 markings, 99953368 edges, 346979 markings/sec, 70 secs
lola: 34293085 markings, 105995722 edges, 333078 markings/sec, 75 secs
lola: 35955021 markings, 111956663 edges, 332387 markings/sec, 80 secs
lola: 37520817 markings, 117842928 edges, 313159 markings/sec, 85 secs
lola: 39076981 markings, 123657928 edges, 311233 markings/sec, 90 secs
lola: 40577217 markings, 129411856 edges, 300047 markings/sec, 95 secs
lola: 42202728 markings, 135307975 edges, 325102 markings/sec, 100 secs
lola: 43640474 markings, 140922812 edges, 287549 markings/sec, 105 secs
lola: 45048944 markings, 146389822 edges, 281694 markings/sec, 110 secs
lola: 46539873 markings, 152035660 edges, 298186 markings/sec, 115 secs
lola: 47983652 markings, 157553295 edges, 288756 markings/sec, 120 secs
lola: 49391171 markings, 162995439 edges, 281504 markings/sec, 125 secs
lola: 50764261 markings, 168387956 edges, 274618 markings/sec, 130 secs
lola: 52141339 markings, 173787732 edges, 275416 markings/sec, 135 secs
lola: 53550241 markings, 179219355 edges, 281780 markings/sec, 140 secs
lola: 54980427 markings, 184656500 edges, 286037 markings/sec, 145 secs
lola: 56280299 markings, 189895272 edges, 259974 markings/sec, 150 secs
lola: 57592669 markings, 195139808 edges, 262474 markings/sec, 155 secs
lola: 58912552 markings, 200403724 edges, 263977 markings/sec, 160 secs
lola: 60220195 markings, 205631986 edges, 261529 markings/sec, 165 secs
lola: 61570377 markings, 210916041 edges, 270036 markings/sec, 170 secs
lola: 62893911 markings, 216149462 edges, 264707 markings/sec, 175 secs
lola: 64244654 markings, 221416605 edges, 270149 markings/sec, 180 secs
lola: 65526984 markings, 226580749 edges, 256466 markings/sec, 185 secs
lola: 66823103 markings, 231769918 edges, 259224 markings/sec, 190 secs
lola: 68074855 markings, 236845399 edges, 250350 markings/sec, 195 secs
lola: 69376282 markings, 242014658 edges, 260285 markings/sec, 200 secs
lola: 70644912 markings, 247101700 edges, 253726 markings/sec, 205 secs
lola: 71947401 markings, 252262189 edges, 260498 markings/sec, 210 secs
lola: 73229631 markings, 257365246 edges, 256446 markings/sec, 215 secs
lola: 74506637 markings, 262456791 edges, 255401 markings/sec, 220 secs
lola: 75767032 markings, 267528050 edges, 252079 markings/sec, 225 secs
lola: 77056017 markings, 272639092 edges, 257797 markings/sec, 230 secs
lola: 78324170 markings, 277710306 edges, 253631 markings/sec, 235 secs
lola: 79567549 markings, 282699978 edges, 248676 markings/sec, 240 secs
lola: 80819068 markings, 287712830 edges, 250304 markings/sec, 245 secs
lola: 82061236 markings, 292701629 edges, 248434 markings/sec, 250 secs
lola: 83287599 markings, 297649320 edges, 245273 markings/sec, 255 secs
lola: 84563668 markings, 302702777 edges, 255214 markings/sec, 260 secs
lola: 85798581 markings, 307648311 edges, 246983 markings/sec, 265 secs
lola: 87032728 markings, 312614474 edges, 246829 markings/sec, 270 secs
lola: 88292102 markings, 317630256 edges, 251875 markings/sec, 275 secs
lola: 89524337 markings, 322587360 edges, 246447 markings/sec, 280 secs
lola: 90762483 markings, 327556831 edges, 247629 markings/sec, 285 secs
lola: 91993190 markings, 332507068 edges, 246141 markings/sec, 290 secs
lola: 93213110 markings, 337417070 edges, 243984 markings/sec, 295 secs
lola: 94457826 markings, 342384008 edges, 248943 markings/sec, 300 secs
lola: 95673755 markings, 347276507 edges, 243186 markings/sec, 305 secs
lola: 96914566 markings, 352217893 edges, 248162 markings/sec, 310 secs
lola: 98130781 markings, 357090388 edges, 243243 markings/sec, 315 secs
lola: 99332104 markings, 361876992 edges, 240265 markings/sec, 320 secs
lola: 100289823 markings, 365712871 edges, 191544 markings/sec, 325 secs
lola: 101246169 markings, 369532513 edges, 191269 markings/sec, 330 secs
lola: 102413494 markings, 374192515 edges, 233465 markings/sec, 335 secs
lola: 103350399 markings, 377947992 edges, 187381 markings/sec, 340 secs
lola: 104308498 markings, 381772254 edges, 191620 markings/sec, 345 secs
lola: 105314280 markings, 385787566 edges, 201156 markings/sec, 350 secs
lola: 106323815 markings, 389822955 edges, 201907 markings/sec, 355 secs
lola: 107268981 markings, 393584283 edges, 189033 markings/sec, 360 secs
lola: 108275894 markings, 397627907 edges, 201383 markings/sec, 365 secs
lola: 109256420 markings, 401549771 edges, 196105 markings/sec, 370 secs
lola: 110233431 markings, 405443817 edges, 195402 markings/sec, 375 secs
lola: 111208306 markings, 409324154 edges, 194975 markings/sec, 380 secs
lola: 112386433 markings, 414034366 edges, 235625 markings/sec, 385 secs
lola: 113386863 markings, 418028238 edges, 200086 markings/sec, 390 secs
lola: 114390205 markings, 422045953 edges, 200668 markings/sec, 395 secs
lola: 115454364 markings, 426301739 edges, 212832 markings/sec, 400 secs
lola: 116408027 markings, 430072838 edges, 190733 markings/sec, 405 secs
lola: 117454074 markings, 434253850 edges, 209209 markings/sec, 410 secs
lola: 118403022 markings, 438024998 edges, 189790 markings/sec, 415 secs
lola: 119526841 markings, 442500891 edges, 224764 markings/sec, 420 secs
lola: 120492797 markings, 446352146 edges, 193191 markings/sec, 425 secs
lola: 121063526 markings, 448620189 edges, 114146 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p3 <= 0) OR (p7 <= 0))) R X (F (((p0 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p3 <= 0) OR (p7 <= 0))) R X (F (((p0 <= 0) OR (p7 <= 0))))))
lola: processed formula length: 71
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 106 edges
lola: ========================================
lola: subprocess 6 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F (((1 <= p0) AND (1 <= p7))) AND (((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p7)))))) U G ((F (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8))) AND (((1 <= p4) OR (1 <= p6)) OR X (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((F (((1 <= p0) AND (1 <= p7))) AND (((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p7)))))) U G ((F (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8))) AND (((1 <= p4) OR (1 <= p6)) OR X (((1 <= p0) AND (1 <= p7) AND (1 <= p1) AND (1 <= p8)))))))
lola: processed formula length: 261
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1019 markings, 1709 edges
lola: ========================================
lola: subprocess 7 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p8)))) OR (X (F (((1 <= p1) AND (1 <= p8)))) AND (F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p1) AND (1 <= p8)) OR ((1 <= p1) AND (1 <= p8))))
lola: processed formula length: 61
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 356 markings, 356 edges
lola: ========================================
lola: subprocess 8 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p1) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p1) AND (1 <= p8))))
lola: processed formula length: 33
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 201 markings, 200 edges
lola: ========================================
lola: subprocess 9 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p8))
lola: processed formula length: 25
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1) AND (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p8 <= 0))
lola: processed formula length: 25
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 101 markings, 100 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((1 <= p4))))
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 106 edges
lola: ========================================
lola: subprocess 9 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 351 markings, 350 edges
lola: ========================================
lola: subprocess 10 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p3) AND (1 <= p7))))
lola: processed formula length: 64
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11676 markings, 15997 edges
lola: ========================================
lola: subprocess 11 will run for 3128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((p3 <= 0) OR (p7 <= 0))) OR (p4 <= 0))) AND G ((G ((1 <= p5)) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((1 <= p5)) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p5)) OR (p2 <= 0)))
lola: processed formula length: 32
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 356 markings, 356 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p3) AND (1 <= p7)) OR (G (F (((1 <= p3) AND (1 <= p7)))) AND F (((1 <= p3) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p3) AND (1 <= p7)) OR (G (F (((1 <= p3) AND (1 <= p7)))) AND F (((1 <= p3) AND (1 <= p7))))))
lola: processed formula length: 104
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3150681 markings, 8272645 edges, 630136 markings/sec, 0 secs
lola: 5975962 markings, 15984195 edges, 565056 markings/sec, 5 secs
lola: 8546327 markings, 23454528 edges, 514073 markings/sec, 10 secs
lola: 10914292 markings, 30421616 edges, 473593 markings/sec, 15 secs
lola: 13082840 markings, 36893347 edges, 433710 markings/sec, 20 secs
lola: 15173023 markings, 43197511 edges, 418037 markings/sec, 25 secs
lola: 17254336 markings, 49573542 edges, 416263 markings/sec, 30 secs
lola: 19411136 markings, 56160908 edges, 431360 markings/sec, 35 secs
lola: 21472109 markings, 62506920 edges, 412195 markings/sec, 40 secs
lola: 23430494 markings, 68760201 edges, 391677 markings/sec, 45 secs
lola: 25379609 markings, 75043344 edges, 389823 markings/sec, 50 secs
lola: 27236313 markings, 81242862 edges, 371341 markings/sec, 55 secs
lola: 29058318 markings, 87443377 edges, 364401 markings/sec, 60 secs
lola: 30798955 markings, 93521522 edges, 348127 markings/sec, 65 secs
lola: 32514842 markings, 99555597 edges, 343177 markings/sec, 70 secs
lola: 34185218 markings, 105599051 edges, 334075 markings/sec, 75 secs
lola: 35832573 markings, 111524228 edges, 329471 markings/sec, 80 secs
lola: 37402590 markings, 117374154 edges, 314003 markings/sec, 85 secs
lola: 38942509 markings, 123163074 edges, 307984 markings/sec, 90 secs
lola: 40437122 markings, 128871554 edges, 298923 markings/sec, 95 secs
lola: 42002189 markings, 134595689 edges, 313013 markings/sec, 100 secs
lola: 43176044 markings, 139157787 edges, 234771 markings/sec, 105 secs
lola: 44361106 markings, 143707767 edges, 237012 markings/sec, 110 secs
lola: 45522579 markings, 148217750 edges, 232295 markings/sec, 115 secs
lola: 46780856 markings, 152909216 edges, 251655 markings/sec, 120 secs
lola: 47948851 markings, 157409670 edges, 233599 markings/sec, 125 secs
lola: 49065680 markings, 161800124 edges, 223366 markings/sec, 130 secs
lola: 50228615 markings, 166255805 edges, 232587 markings/sec, 135 secs
lola: 51329712 markings, 170606765 edges, 220219 markings/sec, 140 secs
lola: 52448762 markings, 174969810 edges, 223810 markings/sec, 145 secs
lola: 53592793 markings, 179390138 edges, 228806 markings/sec, 150 secs
lola: 54945790 markings, 184513710 edges, 270599 markings/sec, 155 secs
lola: 56256304 markings, 189795001 edges, 262103 markings/sec, 160 secs
lola: 57581064 markings, 195092927 edges, 264952 markings/sec, 165 secs
lola: 58912140 markings, 200402123 edges, 266215 markings/sec, 170 secs
lola: 60226679 markings, 205658050 edges, 262908 markings/sec, 175 secs
lola: 61585188 markings, 210975488 edges, 271702 markings/sec, 180 secs
lola: 62933680 markings, 216269231 edges, 269698 markings/sec, 185 secs
lola: 64274055 markings, 221533920 edges, 268075 markings/sec, 190 secs
lola: 65563811 markings, 226729523 edges, 257951 markings/sec, 195 secs
lola: 66864948 markings, 231939120 edges, 260227 markings/sec, 200 secs
lola: 68135562 markings, 237056686 edges, 254123 markings/sec, 205 secs
lola: 69424245 markings, 242210131 edges, 257737 markings/sec, 210 secs
lola: 70698144 markings, 247321004 edges, 254780 markings/sec, 215 secs
lola: 72004998 markings, 252491356 edges, 261371 markings/sec, 220 secs
lola: 73307611 markings, 257651221 edges, 260523 markings/sec, 225 secs
lola: 74581141 markings, 262754283 edges, 254706 markings/sec, 230 secs
lola: 75843220 markings, 267835225 edges, 252416 markings/sec, 235 secs
lola: 77141291 markings, 272988185 edges, 259614 markings/sec, 240 secs
lola: 78415336 markings, 278076574 edges, 254809 markings/sec, 245 secs
lola: 79671073 markings, 283122764 edges, 251147 markings/sec, 250 secs
lola: 80936430 markings, 288188677 edges, 253071 markings/sec, 255 secs
lola: 82199341 markings, 293246618 edges, 252582 markings/sec, 260 secs
lola: 83431735 markings, 298219616 edges, 246479 markings/sec, 265 secs
lola: 84711530 markings, 303304057 edges, 255959 markings/sec, 270 secs
lola: 85966949 markings, 308314017 edges, 251084 markings/sec, 275 secs
lola: 87201705 markings, 313295647 edges, 246951 markings/sec, 280 secs
lola: 88454739 markings, 318289811 edges, 250607 markings/sec, 285 secs
lola: 89696444 markings, 323267150 edges, 248341 markings/sec, 290 secs
lola: 90927343 markings, 328222022 edges, 246180 markings/sec, 295 secs
lola: 92160952 markings, 333180759 edges, 246722 markings/sec, 300 secs
lola: 93383008 markings, 338094474 edges, 244411 markings/sec, 305 secs
lola: 94624139 markings, 343054060 edges, 248226 markings/sec, 310 secs
lola: 95851738 markings, 347966729 edges, 245520 markings/sec, 315 secs
lola: 97079598 markings, 352882166 edges, 245572 markings/sec, 320 secs
lola: 98286290 markings, 357719215 edges, 241338 markings/sec, 325 secs
lola: 99121155 markings, 361043541 edges, 166973 markings/sec, 330 secs
lola: 100022968 markings, 364648748 edges, 180363 markings/sec, 335 secs
lola: 100896956 markings, 368152435 edges, 174798 markings/sec, 340 secs
lola: 101800115 markings, 371733547 edges, 180632 markings/sec, 345 secs
lola: 102785759 markings, 375689081 edges, 197129 markings/sec, 350 secs
lola: 103761244 markings, 379596188 edges, 195097 markings/sec, 355 secs
lola: 104809089 markings, 383782571 edges, 209569 markings/sec, 360 secs
lola: 105675482 markings, 387222428 edges, 173279 markings/sec, 365 secs
lola: 106699222 markings, 391299233 edges, 204748 markings/sec, 370 secs
lola: 107601159 markings, 394921861 edges, 180387 markings/sec, 375 secs
lola: 108750246 markings, 399529377 edges, 229817 markings/sec, 380 secs
lola: 109668370 markings, 403195963 edges, 183625 markings/sec, 385 secs
lola: 110631876 markings, 407038630 edges, 192701 markings/sec, 390 secs
lola: 111796995 markings, 411676642 edges, 233024 markings/sec, 395 secs
lola: 112659348 markings, 415129768 edges, 172471 markings/sec, 400 secs
lola: 113624506 markings, 418979066 edges, 193032 markings/sec, 405 secs
lola: 114527528 markings, 422595999 edges, 180604 markings/sec, 410 secs
lola: 115674860 markings, 427175824 edges, 229466 markings/sec, 415 secs
lola: 116621855 markings, 430917346 edges, 189399 markings/sec, 420 secs
lola: 117610228 markings, 434876936 edges, 197675 markings/sec, 425 secs
lola: 118418234 markings, 438086690 edges, 161601 markings/sec, 430 secs
lola: 119434630 markings, 442132834 edges, 203279 markings/sec, 435 secs
lola: 120301415 markings, 445580500 edges, 173357 markings/sec, 440 secs
lola: 120645034 markings, 446962224 edges, 68724 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no no no no unknown no no yes yes no
lola:
preliminary result: yes yes no no no no unknown no no yes yes no
lola: memory consumption: 3328 KB
lola: time consumption: 895 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
--------------------
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="SwimmingPool-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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-4028"
echo " Executing tool gold2020"
echo " Input is SwimmingPool-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-05.tgz
mv SwimmingPool-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;