About the Execution of 2019-Gold for Planning-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.590 | 973145.00 | 979782.00 | 1914.50 | TFTTF?FF??T?T?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r135-tajo-158961408900065.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 win2019
Input is Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408900065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.0K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:37 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 unfinite
--------------------
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 Planning-PT-none-00
FORMULA_NAME Planning-PT-none-01
FORMULA_NAME Planning-PT-none-02
FORMULA_NAME Planning-PT-none-03
FORMULA_NAME Planning-PT-none-04
FORMULA_NAME Planning-PT-none-05
FORMULA_NAME Planning-PT-none-06
FORMULA_NAME Planning-PT-none-07
FORMULA_NAME Planning-PT-none-08
FORMULA_NAME Planning-PT-none-09
FORMULA_NAME Planning-PT-none-10
FORMULA_NAME Planning-PT-none-11
FORMULA_NAME Planning-PT-none-12
FORMULA_NAME Planning-PT-none-13
FORMULA_NAME Planning-PT-none-14
FORMULA_NAME Planning-PT-none-15
=== Now, execution of the tool begins
BK_START 1590264336372
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Planning-PT-none @ 3570 seconds
FORMULA Planning-PT-none-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Planning-PT-none-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2597
rslt: Output for LTLCardinality @ Planning-PT-none
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 20:05:36 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 148
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 564
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 148
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 677
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((((p6 <= p98) AND X ((p6 <= p98))) OR (X ((1 <= p33)) U (3 <= p114)))))",
"processed_size": 77,
"rewrites": 148
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "A (F (G ((p18 + 1 <= p120))))",
"processed_size": 29,
"rewrites": 148
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1612
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 148
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 24856,
"runtime": 973.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : FALSE : A(X(TRUE)) : A(X(TRUE)) : (A(X(**)) AND A(F(G(*)))) : A(X((** OR X(X(F(**)))))) : FALSE : FALSE : A(X((X((* OR G(*))) OR G(**)))) : A(X(X(X(F(**))))) : (A(F(((** AND X(**)) OR (X(**) U **)))) AND A(X(TRUE))) : A(X((** OR X(X(G(*)))))) : TRUE : A(G(F(**))) : TRUE : FALSE"
},
"net":
{
"arcs": 652,
"conflict_clusters": 65,
"places": 126,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "yes no yes yes no unknown no no unknown unknown yes unknown yes unknown yes no ",
"value": "yes no yes yes no unknown no no unknown unknown yes unknown yes unknown 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: 254/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4032
lola: finding significant places
lola: 126 places, 128 transitions, 82 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p43 <= p121)
lola: atomic prop true by contained trap!
lola: LP says that atomic proposition is always false: (3 <= p74)
lola: LP says that atomic proposition is always true: (p10 <= p116)
lola: LP says that atomic proposition is always false: (3 <= p74)
lola: LP says that atomic proposition is always false: (2 <= p2)
lola: LP says that atomic proposition is always true: (p8 <= p121)
lola: LP says that atomic proposition is always false: (3 <= p80)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always true: (p62 <= p26)
lola: LP says that atomic proposition is always false: (2 <= p45)
lola: LP says that atomic proposition is always true: (p52 <= p83)
lola: LP says that atomic proposition is always true: (p31 <= p123)
lola: A (((0 <= p35) OR (G ((0 <= p77)) AND X (F ((p78 + 1 <= p74)))))) : A ((G (X (NOT(F ((p2 <= p100))))) AND (G ((p43 <= p121)) U X (NOT(X (())))))) : A (X ((F (G ((NOT(F (((1 <= p11) OR (p10 <= p49)))) U ()))) OR F ((3 <= p74))))) : A (G (F ((X (F (())) AND ((2 <= p2) U (0 <= p16)))))) : A (X (((p88 <= p9) AND F (NOT(G ((X (X (F (G (X (X ((p8 <= p121))))))) U (p120 <= p18)))))))) : A ((F (X (G ((p61 + 1 <= 0)))) U X (((p118 <= p104) OR X (F (X ((p118 <= p104)))))))) : A (F (((G ((3 <= p80)) AND G ((2 <= p4))) OR G (X ((p26 + 1 <= p62)))))) : A ((NOT(F (((0 <= p45) AND NOT(G ((2 <= p45)))))) AND G (X (G ((p61 <= p25)))))) : A (NOT(X ((X (((p55 + 1 <= p77) AND F ((p77 <= p55)))) AND F (((p117 <= p31) U NOT(G ((p117 <= p31))))))))) : A (X (X (X (F ((p85 <= p34)))))) : A ((F ((((p6 <= p98) AND X ((p6 <= p98))) OR (X ((1 <= p33)) U (3 <= p114)))) AND X ((0 <= p120)))) : A (X (((p11 + 1 <= p122) OR NOT(F (X (X ((p122 <= p11)))))))) : A (F (G ((G ((1 <= p17)) OR G (((X ((p96 + 1 <= 0)) U (0 <= p96)) U (0 <= p96))))))) : A (X (NOT(F (X (NOT(X (((p1 <= p68) U F ((p72 + 1 <= p120)))))))))) : A ((G ((p52 <= p83)) OR F ((p76 <= p118)))) : A (NOT(G ((p31 <= p123))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (((p77 <= p55) OR G ((p55 + 1 <= p77)))) OR G ((p117 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (((p77 <= p55) OR G ((p55 + 1 <= p77)))) OR G ((p117 <= p31)))))
lola: processed formula length: 73
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 3168233 markings, 3168325 edges, 633647 markings/sec, 0 secs
lola: 6485577 markings, 6485668 edges, 663469 markings/sec, 5 secs
lola: 10047912 markings, 10048004 edges, 712467 markings/sec, 10 secs
lola: 13565071 markings, 13565163 edges, 703432 markings/sec, 15 secs
lola: 16989184 markings, 16989276 edges, 684823 markings/sec, 20 secs
lola: 20382883 markings, 20382975 edges, 678740 markings/sec, 25 secs
lola: 23759048 markings, 23759140 edges, 675233 markings/sec, 30 secs
lola: 26886895 markings, 26886987 edges, 625569 markings/sec, 35 secs
lola: 29793463 markings, 29793555 edges, 581314 markings/sec, 40 secs
lola: 32566990 markings, 32567090 edges, 554705 markings/sec, 45 secs
lola: 35782161 markings, 35782253 edges, 643034 markings/sec, 50 secs
lola: 39012031 markings, 39012123 edges, 645974 markings/sec, 55 secs
lola: 42264572 markings, 42264663 edges, 650508 markings/sec, 60 secs
lola: 45501667 markings, 45501760 edges, 647419 markings/sec, 65 secs
lola: 48685137 markings, 48685229 edges, 636694 markings/sec, 70 secs
lola: 51881075 markings, 51881167 edges, 639188 markings/sec, 75 secs
lola: 55156097 markings, 55156189 edges, 655004 markings/sec, 80 secs
lola: 56414879 markings, 56415025 edges, 251756 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((p85 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((p85 <= p34))))))
lola: processed formula length: 32
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3373929 markings, 3373929 edges, 674786 markings/sec, 0 secs
lola: 6807363 markings, 6807362 edges, 686687 markings/sec, 5 secs
lola: 10221594 markings, 10221593 edges, 682846 markings/sec, 10 secs
lola: 13587969 markings, 13587968 edges, 673275 markings/sec, 15 secs
lola: 16929368 markings, 16929368 edges, 668280 markings/sec, 20 secs
lola: 20290378 markings, 20290378 edges, 672202 markings/sec, 25 secs
lola: 23579898 markings, 23579898 edges, 657904 markings/sec, 30 secs
lola: 26868662 markings, 26868662 edges, 657753 markings/sec, 35 secs
lola: 30140991 markings, 30140991 edges, 654466 markings/sec, 40 secs
lola: 33393780 markings, 33393780 edges, 650558 markings/sec, 45 secs
lola: 36678761 markings, 36678760 edges, 656996 markings/sec, 50 secs
lola: 39955553 markings, 39955553 edges, 655358 markings/sec, 55 secs
lola: 43145692 markings, 43145691 edges, 638028 markings/sec, 60 secs
lola: 46050732 markings, 46050732 edges, 581008 markings/sec, 65 secs
lola: 49177675 markings, 49177674 edges, 625389 markings/sec, 70 secs
lola: 52440327 markings, 52440327 edges, 652530 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p6 <= p98) AND X ((p6 <= p98))) OR (X ((1 <= p33)) U (3 <= p114))))) AND A (X (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p6 <= p98) AND X ((p6 <= p98))) OR (X ((1 <= p33)) U (3 <= p114)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((p6 <= p98) AND X ((p6 <= p98))) OR (X ((1 <= p33)) U (3 <= p114)))))
lola: processed formula length: 77
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 63 markings, 62 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p11 + 1 <= p122) OR X (X (G ((p11 + 1 <= p122)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p11 + 1 <= p122) OR X (X (G ((p11 + 1 <= p122)))))))
lola: processed formula length: 60
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3470473 markings, 3470472 edges, 694095 markings/sec, 0 secs
lola: 6667019 markings, 6667018 edges, 639309 markings/sec, 5 secs
lola: 9609244 markings, 9609243 edges, 588445 markings/sec, 10 secs
lola: 12549253 markings, 12549253 edges, 588002 markings/sec, 15 secs
lola: 15829343 markings, 15829343 edges, 656018 markings/sec, 20 secs
lola: 18986004 markings, 18986004 edges, 631332 markings/sec, 25 secs
lola: 22298439 markings, 22298439 edges, 662487 markings/sec, 30 secs
lola: 25601737 markings, 25601737 edges, 660660 markings/sec, 35 secs
lola: 28906972 markings, 28906972 edges, 661047 markings/sec, 40 secs
lola: 32192001 markings, 32192001 edges, 657006 markings/sec, 45 secs
lola: 35483840 markings, 35483840 edges, 658368 markings/sec, 50 secs
lola: 38761663 markings, 38761663 edges, 655565 markings/sec, 55 secs
lola: 42023473 markings, 42023473 edges, 652362 markings/sec, 60 secs
lola: 45289046 markings, 45289046 edges, 653115 markings/sec, 65 secs
lola: 48527579 markings, 48527579 edges, 647707 markings/sec, 70 secs
lola: 51773064 markings, 51773064 edges, 649097 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p88 <= p9))) AND A (F (G ((p18 + 1 <= p120)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p18 + 1 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p18 + 1 <= p120))))
lola: processed formula length: 29
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: add low 126
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: 13 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p118 <= p104) OR X (X (F ((p118 <= p104)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p118 <= p104) OR X (X (F ((p118 <= p104)))))))
lola: processed formula length: 54
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3217701 markings, 3217701 edges, 643540 markings/sec, 0 secs
lola: 6616406 markings, 6616406 edges, 679741 markings/sec, 5 secs
lola: 9988315 markings, 9988314 edges, 674382 markings/sec, 10 secs
lola: 13322502 markings, 13322502 edges, 666837 markings/sec, 15 secs
lola: 16641827 markings, 16641827 edges, 663865 markings/sec, 20 secs
lola: 19976891 markings, 19976890 edges, 667013 markings/sec, 25 secs
lola: 23290486 markings, 23290486 edges, 662719 markings/sec, 30 secs
lola: 26599237 markings, 26599237 edges, 661750 markings/sec, 35 secs
lola: 29899084 markings, 29899084 edges, 659969 markings/sec, 40 secs
lola: 33187425 markings, 33187424 edges, 657668 markings/sec, 45 secs
lola: 36500313 markings, 36500312 edges, 662578 markings/sec, 50 secs
lola: 39788092 markings, 39788092 edges, 657556 markings/sec, 55 secs
lola: 43058844 markings, 43058844 edges, 654150 markings/sec, 60 secs
lola: 46307425 markings, 46307425 edges, 649716 markings/sec, 65 secs
lola: 49544460 markings, 49544460 edges, 647407 markings/sec, 70 secs
lola: 52819367 markings, 52819366 edges, 654981 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 15 will run for 3224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p72 + 1 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p72 + 1 <= p120))))
lola: processed formula length: 29
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 2770017 markings, 3878020 edges, 554003 markings/sec, 0 secs
lola: 5358618 markings, 7502062 edges, 517720 markings/sec, 5 secs
lola: 7830364 markings, 10962504 edges, 494349 markings/sec, 10 secs
lola: 10273715 markings, 14383197 edges, 488670 markings/sec, 15 secs
lola: 13096482 markings, 18335071 edges, 564553 markings/sec, 20 secs
lola: 15890754 markings, 22247051 edges, 558854 markings/sec, 25 secs
lola: 18692149 markings, 26169003 edges, 560279 markings/sec, 30 secs
lola: 21471614 markings, 30060256 edges, 555893 markings/sec, 35 secs
lola: 24262809 markings, 33967929 edges, 558239 markings/sec, 40 secs
lola: 27033542 markings, 37846954 edges, 554147 markings/sec, 45 secs
lola: 29773696 markings, 41683170 edges, 548031 markings/sec, 50 secs
lola: 32517495 markings, 45524489 edges, 548760 markings/sec, 55 secs
lola: 35267712 markings, 49374792 edges, 550043 markings/sec, 60 secs
lola: 38001238 markings, 53201729 edges, 546705 markings/sec, 65 secs
lola: 40725004 markings, 57015002 edges, 544753 markings/sec, 70 secs
lola: 43465100 markings, 60851136 edges, 548019 markings/sec, 75 secs
lola: 46214100 markings, 64699736 edges, 549800 markings/sec, 80 secs
lola: 48981724 markings, 68574409 edges, 553525 markings/sec, 85 secs
lola: 51722146 markings, 72411000 edges, 548084 markings/sec, 90 secs
lola: 54447838 markings, 76226969 edges, 545138 markings/sec, 95 secs
lola: 57157728 markings, 80020815 edges, 541978 markings/sec, 100 secs
lola: 59861401 markings, 83805957 edges, 540735 markings/sec, 105 secs
lola: 62547146 markings, 87566000 edges, 537149 markings/sec, 110 secs
lola: 65273693 markings, 91383166 edges, 545309 markings/sec, 115 secs
lola: 67978763 markings, 95170264 edges, 541014 markings/sec, 120 secs
lola: 70686543 markings, 98961156 edges, 541556 markings/sec, 125 secs
lola: 73376239 markings, 102726731 edges, 537939 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((X (((p77 <= p55) OR G ((p55 + 1 <= p77)))) OR G ((p117 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (((p77 <= p55) OR G ((p55 + 1 <= p77)))) OR G ((p117 <= p31)))))
lola: processed formula length: 73
lola: 148 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 3488617 markings, 3488709 edges, 697723 markings/sec, 0 secs
lola: 6952154 markings, 6952246 edges, 692707 markings/sec, 5 secs
lola: 10363263 markings, 10363355 edges, 682222 markings/sec, 10 secs
lola: 13763740 markings, 13763832 edges, 680095 markings/sec, 15 secs
lola: 17134088 markings, 17134180 edges, 674070 markings/sec, 20 secs
lola: 20475039 markings, 20475131 edges, 668190 markings/sec, 25 secs
lola: 23794024 markings, 23794116 edges, 663797 markings/sec, 30 secs
lola: 27093180 markings, 27093272 edges, 659831 markings/sec, 35 secs
lola: 30048756 markings, 30048848 edges, 591115 markings/sec, 40 secs
lola: 33079187 markings, 33079280 edges, 606086 markings/sec, 45 secs
lola: 36197953 markings, 36198045 edges, 623753 markings/sec, 50 secs
lola: 39442881 markings, 39442973 edges, 648986 markings/sec, 55 secs
lola: 42345074 markings, 42345166 edges, 580439 markings/sec, 60 secs
lola: 45251970 markings, 45252062 edges, 581379 markings/sec, 65 secs
lola: 48144155 markings, 48144247 edges, 578437 markings/sec, 70 secs
lola: 50974715 markings, 50974807 edges, 566112 markings/sec, 75 secs
lola: 53887985 markings, 53888077 edges, 582654 markings/sec, 80 secs
lola: 56254004 markings, 56254096 edges, 473204 markings/sec, 85 secs
lola: 56432704 markings, 56432796 edges, 35740 markings/sec, 90 secs
lola: 56433641 markings, 56433733 edges, 187 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((p85 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((p85 <= p34))))))
lola: processed formula length: 32
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3228058 markings, 3228058 edges, 645612 markings/sec, 0 secs
lola: 6590193 markings, 6590193 edges, 672427 markings/sec, 5 secs
lola: 9945896 markings, 9945896 edges, 671141 markings/sec, 10 secs
lola: 13266470 markings, 13266470 edges, 664115 markings/sec, 15 secs
lola: 16552780 markings, 16552779 edges, 657262 markings/sec, 20 secs
lola: 19863436 markings, 19863435 edges, 662131 markings/sec, 25 secs
lola: 23127488 markings, 23127488 edges, 652810 markings/sec, 30 secs
lola: 26420662 markings, 26420661 edges, 658635 markings/sec, 35 secs
lola: 29697079 markings, 29697079 edges, 655283 markings/sec, 40 secs
lola: 32951904 markings, 32951904 edges, 650965 markings/sec, 45 secs
lola: 36245503 markings, 36245503 edges, 658720 markings/sec, 50 secs
lola: 39527983 markings, 39527983 edges, 656496 markings/sec, 55 secs
lola: 42784594 markings, 42784594 edges, 651322 markings/sec, 60 secs
lola: 46009564 markings, 46009563 edges, 644994 markings/sec, 65 secs
lola: 49215926 markings, 49215925 edges, 641272 markings/sec, 70 secs
lola: 52440947 markings, 52440946 edges, 645004 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (((p11 + 1 <= p122) OR X (X (G ((p11 + 1 <= p122)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p11 + 1 <= p122) OR X (X (G ((p11 + 1 <= p122)))))))
lola: processed formula length: 60
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3052912 markings, 3052912 edges, 610582 markings/sec, 0 secs
lola: 6261079 markings, 6261078 edges, 641633 markings/sec, 5 secs
lola: 9589212 markings, 9589212 edges, 665627 markings/sec, 10 secs
lola: 13038497 markings, 13038496 edges, 689857 markings/sec, 15 secs
lola: 16439789 markings, 16439789 edges, 680258 markings/sec, 20 secs
lola: 19835939 markings, 19835939 edges, 679230 markings/sec, 25 secs
lola: 23205280 markings, 23205280 edges, 673868 markings/sec, 30 secs
lola: 26578582 markings, 26578582 edges, 674660 markings/sec, 35 secs
lola: 29935750 markings, 29935750 edges, 671434 markings/sec, 40 secs
lola: 33290081 markings, 33290081 edges, 670866 markings/sec, 45 secs
lola: 36657984 markings, 36657985 edges, 673581 markings/sec, 50 secs
lola: 40006951 markings, 40006951 edges, 669793 markings/sec, 55 secs
lola: 43364380 markings, 43364379 edges, 671486 markings/sec, 60 secs
lola: 46699044 markings, 46699044 edges, 666933 markings/sec, 65 secs
lola: 50028571 markings, 50028570 edges, 665905 markings/sec, 70 secs
lola: 53400317 markings, 53400317 edges, 674349 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (((p118 <= p104) OR X (X (F ((p118 <= p104)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p118 <= p104) OR X (X (F ((p118 <= p104)))))))
lola: processed formula length: 54
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 3516460 markings, 3516459 edges, 703292 markings/sec, 0 secs
lola: 6987622 markings, 6987622 edges, 694232 markings/sec, 5 secs
lola: 10437182 markings, 10437182 edges, 689912 markings/sec, 10 secs
lola: 13872170 markings, 13872169 edges, 686998 markings/sec, 15 secs
lola: 17276165 markings, 17276165 edges, 680799 markings/sec, 20 secs
lola: 20663399 markings, 20663399 edges, 677447 markings/sec, 25 secs
lola: 24021891 markings, 24021891 edges, 671698 markings/sec, 30 secs
lola: 27386930 markings, 27386930 edges, 673008 markings/sec, 35 secs
lola: 30749030 markings, 30749030 edges, 672420 markings/sec, 40 secs
lola: 34095424 markings, 34095424 edges, 669279 markings/sec, 45 secs
lola: 37465404 markings, 37465403 edges, 673996 markings/sec, 50 secs
lola: 40829003 markings, 40829003 edges, 672720 markings/sec, 55 secs
lola: 44182436 markings, 44182436 edges, 670687 markings/sec, 60 secs
lola: 47539214 markings, 47539214 edges, 671356 markings/sec, 65 secs
lola: 50883615 markings, 50883616 edges, 668880 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((p72 + 1 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p72 + 1 <= p120))))
lola: processed formula length: 29
lola: 148 rewrites
lola: closed formula file LTLCardinality.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: 2937418 markings, 4112381 edges, 587484 markings/sec, 0 secs
lola: 5836196 markings, 8170670 edges, 579756 markings/sec, 5 secs
lola: 8706709 markings, 12189389 edges, 574103 markings/sec, 10 secs
lola: 11563671 markings, 16189134 edges, 571392 markings/sec, 15 secs
lola: 14405894 markings, 20168247 edges, 568445 markings/sec, 20 secs
lola: 17229468 markings, 24121251 edges, 564715 markings/sec, 25 secs
lola: 20047980 markings, 28067168 edges, 563702 markings/sec, 30 secs
lola: 22876680 markings, 32027348 edges, 565740 markings/sec, 35 secs
lola: 25688444 markings, 35963818 edges, 562353 markings/sec, 40 secs
lola: 28475248 markings, 39865343 edges, 557361 markings/sec, 45 secs
lola: 31234395 markings, 43728149 edges, 551829 markings/sec, 50 secs
lola: 34017694 markings, 47624766 edges, 556660 markings/sec, 55 secs
lola: 36783548 markings, 51496963 edges, 553171 markings/sec, 60 secs
lola: 39545924 markings, 55364289 edges, 552475 markings/sec, 65 secs
lola: 42293824 markings, 59211350 edges, 549580 markings/sec, 70 secs
lola: 45094244 markings, 63131938 edges, 560084 markings/sec, 75 secs
lola: 47871010 markings, 67019410 edges, 555353 markings/sec, 80 secs
lola: 50638657 markings, 70894116 edges, 553529 markings/sec, 85 secs
lola: 53396581 markings, 74755209 edges, 551585 markings/sec, 90 secs
lola: 56148723 markings, 78608207 edges, 550428 markings/sec, 95 secs
lola: 58899063 markings, 82458684 edges, 550068 markings/sec, 100 secs
lola: 61631529 markings, 86284137 edges, 546493 markings/sec, 105 secs
lola: 64395280 markings, 90153388 edges, 552750 markings/sec, 110 secs
lola: 67168020 markings, 94035224 edges, 554548 markings/sec, 115 secs
lola: 69595500 markings, 97433696 edges, 485496 markings/sec, 120 secs
lola: 71971257 markings, 100759755 edges, 475151 markings/sec, 125 secs
lola: 74433069 markings, 104206292 edges, 492362 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes yes no unknown no no unknown unknown yes unknown yes unknown yes no
lola:
preliminary result: yes no yes yes no unknown no no unknown unknown yes unknown yes unknown yes no
lola: memory consumption: 24856 KB
lola: time consumption: 973 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590265309517
--------------------
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="Planning-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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 win2019"
echo " Input is Planning-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tajo-158961408900065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Planning-PT-none.tgz
mv Planning-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;