About the Execution of ITS-LoLa for HexagonalGrid-PT-126
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15719.400 | 3600000.00 | 131682.00 | 84.60 | FTFTTTFTTTFTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r184-oct2-158987928000084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is HexagonalGrid-PT-126, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928000084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 29K Apr 27 14:36 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 HexagonalGrid-PT-126-CTLFireability-00
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-01
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-02
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-03
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-04
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-05
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-06
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-07
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-08
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-09
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-10
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-11
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-12
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-13
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-14
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591188227597
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:43:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 12:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:43:49] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-03 12:43:49] [INFO ] Transformed 31 places.
[2020-06-03 12:43:49] [INFO ] Transformed 42 transitions.
[2020-06-03 12:43:49] [INFO ] Parsed PT model containing 31 places and 42 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 169 ms. (steps per millisecond=591 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 42 rows 31 cols
[2020-06-03 12:43:49] [INFO ] Computed 14 place invariants in 3 ms
[2020-06-03 12:43:49] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
[2020-06-03 12:43:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 12:43:49] [INFO ] Flatten gal took : 25 ms
[2020-06-03 12:43:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 12:43:49] [INFO ] Flatten gal took : 8 ms
FORMULA HexagonalGrid-PT-126-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-126-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-126-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 12:43:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 12:43:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ HexagonalGrid-PT-126 @ 3570 seconds
FORMULA HexagonalGrid-PT-126-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HexagonalGrid-PT-126-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3445
rslt: Output for CTLFireability @ HexagonalGrid-PT-126
{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 12:43:49 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((p0 <= 0) OR (p25 <= 0)) AND ((p10 <= 0)) AND (1 <= p11)) OR (((p11 <= 0)) AND ((p7 <= 0))))",
"processed_size": 97,
"rewrites": 18
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 5
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "AX((((1 <= p7)) OR ((1 <= p11)) OR ((1 <= p11) AND (1 <= p10))))",
"processed_size": 66,
"rewrites": 16
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(EG(((p11 <= 0))) U (EX(((1 <= p11))) AND AF(((1 <= p18) AND (1 <= p24)))))",
"processed_size": 76,
"rewrites": 19
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 74,
"markings": 69,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(AX((((1 <= p9)) OR ((1 <= p11) AND (1 <= p8)))))",
"processed_size": 52,
"rewrites": 17
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 59925,
"markings": 29466,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((AX(((1 <= p12) AND (1 <= p0) AND (1 <= p25))) AND ((1 <= p16) AND (1 <= p22))))",
"processed_size": 83,
"rewrites": 17
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 39907584,
"markings": 2664192,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p18) AND (1 <= p24) AND ((p9 <= 0)))",
"processed_size": 43,
"rewrites": 17
},
"result":
{
"edges": 34,
"markings": 32,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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": "AG(EX(((p12 <= 0))))",
"processed_size": 20,
"rewrites": 17
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10222006,
"markings": 1975472,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p7 <= 0))",
"processed_size": 11,
"rewrites": 18
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p7))",
"processed_size": 11,
"rewrites": 18
},
"result":
{
"edges": 23893216,
"markings": 2662144,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p8 <= 0) OR ((1 <= p12) AND (1 <= p11)))))",
"processed_size": 51,
"rewrites": 16
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 866
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p26) AND (1 <= p7) AND (1 <= p11))",
"processed_size": 55,
"rewrites": 18
},
"result":
{
"edges": 16630429,
"markings": 2523099,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1148
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "G ((F (((p5 <= 0) OR (p30 <= 0) OR (p7 <= 0))) OR (p8 <= 0)))",
"processed_size": 63,
"rewrites": 25
},
"result":
{
"edges": 1515,
"markings": 944,
"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": "existential single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1722
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1722
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p13) AND (1 <= p19)) OR ((1 <= p7)) OR ((1 <= p12) AND (p11 <= 0)) OR (((p10 <= 0)) AND ((p7 <= 0))))",
"processed_size": 112,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p12 <= 0))",
"processed_size": 12,
"rewrites": 18
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(1 <= p8)",
"processed_size": 9,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(1 <= p8)",
"processed_size": 9,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": "EF((AF(((1 <= p12))) AND EG(((1 <= p1) AND (1 <= p26)))))",
"processed_size": 57,
"rewrites": 18
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 3847,
"markings": 1423,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 31336,
"runtime": 125.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) OR A(X(**))) : E((E(G(*)) U (E(X(**)) AND A(F(**))))) : A(F(**)) : A(G(E(F(**)))) : A(G(E(F(**)))) : E(F(A(X(**)))) : E(F((A(X(**)) AND (** AND **)))) : E(X(E(G(**)))) : E(F((E(G(**)) AND **))) : A(G(E(X(*)))) : (E(F((A(F(**)) AND E(G(**))))) OR (** AND E(G(**)))) : E(G(**)) : (E(G(E(F(*)))) AND **)"
},
"net":
{
"arcs": 168,
"conflict_clusters": 13,
"places": 31,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 42
},
"result":
{
"preliminary_value": "no yes no yes yes yes no yes yes no yes yes yes ",
"value": "no yes no yes yes yes no yes yes no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 73/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 992
lola: finding significant places
lola: 31 places, 42 transitions, 17 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: (A (F (((((1 <= p0) AND (1 <= p25)) OR ((1 <= p10)) OR (p11 <= 0)) AND (((1 <= p11)) OR ((1 <= p7)))))) OR A (X ((((1 <= p7)) OR ((1 <= p11)) OR ((1 <= p11) AND (1 <= p10)))))) : E ((NOT(A (F (((1 <= p11))))) U (E (X (((1 <= p11)))) AND A (F (((1 <= p18) AND (1 <= p24))))))) : A (F (((1 <= p7)))) : A (G (E (F (((1 <= p1) AND (1 <= p26) AND (1 <= p7) AND (1 <= p11)))))) : A (G (A (G (E (F (((1 <= p7)))))))) : E (F (A (X ((((1 <= p9)) OR ((1 <= p11) AND (1 <= p8))))))) : E (F (((A (X (((1 <= p12) AND (1 <= p0) AND (1 <= p25)))) AND (1 <= p16)) AND (1 <= p22)))) : E (X (E (G (((1 <= p18) AND (1 <= p24) AND ((p9 <= 0))))))) : E (F ((E (G (((1 <= p5) AND (1 <= p30) AND (1 <= p7)))) AND (1 <= p8)))) : NOT(E (F (A (X (((1 <= p12))))))) : (E (F ((A (F (((1 <= p12)))) AND E (G (((1 <= p1) AND (1 <= p26))))))) OR ((1 <= p8) AND E (G ((((p17 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p25 <= 0))))))) : E (G (((p8 <= 0) OR ((1 <= p12) AND (1 <= p11))))) : (NOT(A (F (A (G (((1 <= p12))))))) AND (((1 <= p13) AND (1 <= p19)) OR ((1 <= p7)) OR ((1 <= p12) AND (p11 <= 0)) OR (((p10 <= 0)) AND ((p7 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((((1 <= p0) AND (1 <= p25)) OR ((1 <= p10)) OR (p11 <= 0)) AND (((1 <= p11)) OR ((1 <= p7)))))) OR A (X ((((1 <= p7)) OR ((1 <= p11)) OR ((1 <= p11) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p0) AND (1 <= p25)) OR ((1 <= p10)) OR (p11 <= 0)) AND (((1 <= p11)) OR ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((p0 <= 0) OR (p25 <= 0)) AND ((p10 <= 0)) AND (1 <= p11)) OR (((p11 <= 0)) AND ((p7 <= 0))))
lola: processed formula length: 97
lola: 18 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p0) AND (1 <= p25)) OR ((1 <= p10)) OR (p11 <= 0)) AND (((1 <= p11)) OR ((1 <= p7))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 36 markings, 36 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 5 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p7)) OR ((1 <= p11)) OR ((1 <= p11) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p7)) OR ((1 <= p11)) OR ((1 <= p11) AND (1 <= p10))))
lola: processed formula length: 66
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p11 <= 0)))) U (E (X (((1 <= p11)))) AND A (F (((1 <= p18) AND (1 <= p24)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG(((p11 <= 0))) U (EX(((1 <= p11))) AND AF(((1 <= p18) AND (1 <= p24)))))
lola: processed formula length: 76
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 69 markings, 74 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p9)) OR ((1 <= p11) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p9)) OR ((1 <= p11) AND (1 <= p8)))))
lola: processed formula length: 52
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 29466 markings, 59925 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((1 <= p12) AND (1 <= p0) AND (1 <= p25)))) AND ((1 <= p16) AND (1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((1 <= p12) AND (1 <= p0) AND (1 <= p25))) AND ((1 <= p16) AND (1 <= p22))))
lola: processed formula length: 83
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1089284 markings, 4562830 edges, 217857 markings/sec, 0 secs
lola: 1642435 markings, 7869354 edges, 110630 markings/sec, 5 secs
lola: 2040771 markings, 10727311 edges, 79667 markings/sec, 10 secs
lola: 2352741 markings, 13505985 edges, 62394 markings/sec, 15 secs
lola: 2595080 markings, 16572967 edges, 48468 markings/sec, 20 secs
lola: 2663058 markings, 20173634 edges, 13596 markings/sec, 25 secs
lola: 2663817 markings, 23101909 edges, 152 markings/sec, 30 secs
lola: 2664047 markings, 25755861 edges, 46 markings/sec, 35 secs
lola: 2664134 markings, 28644000 edges, 17 markings/sec, 40 secs
lola: 2664179 markings, 31747943 edges, 9 markings/sec, 45 secs
lola: 2664190 markings, 34992374 edges, 2 markings/sec, 50 secs
lola: 2664192 markings, 38722127 edges, 0 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2664192 markings, 39907584 edges
lola: ========================================
lola: subprocess 4 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((1 <= p18) AND (1 <= p24) AND ((p9 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((1 <= p18) AND (1 <= p24) AND ((p9 <= 0)))
lola: processed formula length: 43
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p18) AND (1 <= p24) AND ((p9 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 32 markings, 34 edges
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p12 <= 0))))
lola: processed formula length: 20
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1040220 markings, 4298210 edges, 208044 markings/sec, 0 secs
lola: 1583308 markings, 7484755 edges, 108618 markings/sec, 5 secs
lola: 1975472 markings, 10222006 edges, 78433 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1975472 markings, 10222006 edges
lola: ========================================
lola: subprocess 6 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 <= 0))
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p7))
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p7))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
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: ((p7 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1234519 markings, 4628961 edges, 246904 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2005633 markings, 8850579 edges, 154223 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2522216 markings, 13777204 edges, 103317 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2614140 markings, 18129203 edges, 18385 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2659215 markings, 22656807 edges, 9015 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 2662144 markings, 23893216 edges
lola: ========================================
lola: subprocess 8 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p8 <= 0) OR ((1 <= p12) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p8 <= 0) OR ((1 <= p12) AND (1 <= p11)))))
lola: processed formula length: 51
lola: 16 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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: ((1 <= p8) AND ((p12 <= 0) OR (p11 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 48 markings, 48 edges
lola: ========================================
lola: subprocess 9 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p1) AND (1 <= p26) AND (1 <= p7) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p1) AND (1 <= p26) AND (1 <= p7) AND (1 <= p11))
lola: processed formula length: 55
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: ((p1 <= 0) OR (p26 <= 0) OR (p7 <= 0) OR (p11 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p1) AND (1 <= p26) AND (1 <= p7) AND (1 <= p11))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1524530 markings, 4749602 edges, 304906 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2360480 markings, 9604982 edges, 167190 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2515486 markings, 13424116 edges, 31001 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 2523099 markings, 16630429 edges
lola: ========================================
lola: subprocess 10 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((1 <= p5) AND (1 <= p30) AND (1 <= p7)))) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p5 <= 0) OR (p30 <= 0) OR (p7 <= 0))) OR (p8 <= 0)))
lola: processed formula length: 63
lola: 25 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 944 markings, 1515 edges
lola: ========================================
lola: subprocess 11 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((p12 <= 0)))))) AND (((1 <= p13) AND (1 <= p19)) OR ((1 <= p7)) OR ((1 <= p12) AND (p11 <= 0)) OR (((p10 <= 0)) AND ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p13) AND (1 <= p19)) OR ((1 <= p7)) OR ((1 <= p12) AND (p11 <= 0)) OR (((p10 <= 0)) AND ((p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p13) AND (1 <= p19)) OR ((1 <= p7)) OR ((1 <= p12) AND (p11 <= 0)) OR (((p10 <= 0)) AND ((p7 <= 0))))
lola: processed formula length: 112
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p12 <= 0))
lola: processed formula length: 12
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((1 <= p12))
lola: Reachability of the predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p12 <= 0))
lola: state equation task get result unparse finished id 1
lola: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 3445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (F (((1 <= p12)))) AND E (G (((1 <= p1) AND (1 <= p26))))))) OR ((1 <= p8) AND E (G ((((p17 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p25 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((A (F (((1 <= p12)))) AND E (G (((1 <= p1) AND (1 <= p26))))))) OR ((1 <= p8) AND E (G ((((p17 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p25 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: E (F ((A (F (((1 <= p12)))) AND E (G (((1 <= p1) AND (1 <= p26)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF(((1 <= p12))) AND EG(((1 <= p1) AND (1 <= p26)))))
lola: processed formula length: 57
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1423 markings, 3847 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes no yes yes no yes yes yes
lola:
preliminary result: no yes no yes yes yes no yes yes no yes yes yes
lola: ========================================
lola: memory consumption: 31336 KB
lola: time consumption: 125 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="HexagonalGrid-PT-126"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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-4028"
echo " Executing tool itslola"
echo " Input is HexagonalGrid-PT-126, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928000084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-126.tgz
mv HexagonalGrid-PT-126 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;