Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151000045.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is NeighborGrid-PT-d3n3m1t11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151000045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 07:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 46K May 5 16:51 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 NeighborGrid-PT-d3n3m1t11-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-15

=== Now, execution of the tool begins

BK_START 1620984317099

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 09:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 09:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:25:18] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-14 09:25:18] [INFO ] Transformed 27 places.
[2021-05-14 09:25:18] [INFO ] Transformed 162 transitions.
[2021-05-14 09:25:18] [INFO ] Parsed PT model containing 27 places and 162 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100023 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=1613 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 162 rows 27 cols
[2021-05-14 09:25:18] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned unsat
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 09:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-14 09:25:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-14 09:25:19] [INFO ] Flatten gal took : 37 ms
FORMULA NeighborGrid-PT-d3n3m1t11-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:25:19] [INFO ] Flatten gal took : 11 ms
[2021-05-14 09:25:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-14 09:25:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NeighborGrid-PT-d3n3m1t11 @ 3570 seconds

FORMULA NeighborGrid-PT-d3n3m1t11-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2818
rslt: Output for LTLCardinality @ NeighborGrid-PT-d3n3m1t11

{
"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=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": "Fri May 14 09:25:19 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 <= p14) U (p15 <= p21))",
"processed_size": 27,
"rewrites": 92
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((p18 <= p2))) AND (p8 + 1 <= p7))))",
"processed_size": 48,
"rewrites": 92
},
"result":
{
"edges": 226,
"markings": 221,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p15 + 1 <= p13))",
"processed_size": 20,
"rewrites": 92
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p9 <= 1)))",
"processed_size": 17,
"rewrites": 92
},
"result":
{
"edges": 171,
"markings": 171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "G ((p13 + 1 <= p26))",
"processed_size": 20,
"rewrites": 92
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((F ((p5 <= p18)) OR (p21 <= p18))) OR (p3 <= p2)))",
"processed_size": 57,
"rewrites": 92
},
"result":
{
"edges": 153,
"markings": 152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((G ((p3 + 1 <= p22)) AND (p3 + 1 <= p22)))",
"processed_size": 45,
"rewrites": 92
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p19) OR (2 <= p16))) U X (G ((F ((p19 <= 0)) AND X ((p16 <= 1)))))))",
"processed_size": 82,
"rewrites": 92
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1 <= 2)",
"processed_size": 9,
"rewrites": 94
},
"result":
{
"edges": 50,
"markings": 50,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 639
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((X ((G ((p20 <= 2)) OR (p6 <= p2))) OR (p0 <= 0)))))",
"processed_size": 61,
"rewrites": 92
},
"result":
{
"edges": 2855751,
"markings": 1637647,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 799
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((p16 <= p24)) OR (((p23 <= p15) OR (1 <= p9)) OR (G (F ((p15 + 1 <= p23))) AND F (((p23 <= p15) OR (1 <= p9)))))))",
"processed_size": 123,
"rewrites": 92
},
"result":
{
"edges": 324,
"markings": 325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1065
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1065
},
"formula":
{
"count":
{
"A": 0,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p14 <= 0)))",
"processed_size": 18,
"rewrites": 92
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1598
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "F (G ((p16 + 1 <= p10)))",
"processed_size": 24,
"rewrites": 92
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3196
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "G ((F (G ((p25 <= p7))) AND G (F ((p8 <= 2)))))",
"processed_size": 47,
"rewrites": 92
},
"result":
{
"edges": 446,
"markings": 257,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3524,
"runtime": 752.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U **) AND G(F((X(F(**)) AND **)))) : (X(F(*)) OR (G(*) AND X(F(**)))) : (G(**) OR X((X((F(**) OR **)) OR **))) : X((G(*) AND *)) : (X(X(**)) U ((* R *) OR (G(**) AND F((* R *))))) : X((F((** OR **)) U X(G((F(*) AND X(*)))))) : (X((* AND *)) AND F(**)) : F(G(*)) : X(X(F((X((G(*) OR *)) OR *)))) : X((X(**) OR (** OR (G(F(*)) AND F(**))))) : (F(G(*)) AND G((** OR X(X(G(*)))))) : G((F(G(**)) AND G(F(*))))"
},
"net":
{
"arcs": 324,
"conflict_clusters": 27,
"places": 27,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 162
},
"result":
{
"preliminary_value": "no no no no unknown no no no no yes no no ",
"value": "no no no no unknown no no no no yes no 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: 189/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 162 transitions, 26 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: (((1 <= p14) U (p15 <= p21)) AND G (F ((NOT(X (NOT(F ((p18 <= p2))))) AND (p8 + 1 <= p7))))) : (NOT(X (G ((2 <= p9)))) OR (NOT(F ((p13 <= p15))) AND F (X ((3 <= p4))))) : ((G ((p13 + 1 <= p26)) OR X (X ((F ((p5 <= p18)) OR (p21 <= p18))))) OR X ((p3 <= p2))) : (NOT(((0 <= 0) U (((1 <= 0) U (p4 <= p7)) U X ((p22 <= p3))))) AND NOT(X ((p22 <= p3)))) : (X (X ((2 <= p14))) U (G ((p2 <= p0)) U NOT(((p14 <= 1) U (p2 <= p0))))) : X (((F ((1 <= p19)) OR F ((2 <= p16))) U NOT(F (X ((G ((1 <= p19)) OR X ((2 <= p16)))))))) : ((NOT(X ((p3 <= p21))) AND NOT(X ((3 <= p7)))) AND F (((1 <= p6) U (3 <= p1)))) : F (G (F (NOT((((1 <= p15) AND (p20 <= p8)) U X (G (F ((p10 <= p16))))))))) : X (F (NOT(X ((X ((F ((3 <= p20)) AND (p2 + 1 <= p6))) AND (1 <= p0)))))) : X ((X ((p16 <= p24)) OR (X (F (NOT(F (G ((p23 <= p15)))))) U ((p23 <= p15) OR (1 <= p9))))) : G (((1 <= p14) U G (X (NOT(F (X (((1 <= 0) U (1 <= p14))))))))) : G ((NOT(G (NOT(G ((p25 <= p7))))) AND NOT(F (X (F (G ((3 <= p8))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p14) U (p15 <= p21)) AND G (F ((X (F ((p18 <= p2))) AND (p8 + 1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) U (p15 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p14) U (p15 <= p21))
lola: processed formula length: 27
lola: 92 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: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((p18 <= p2))) AND (p8 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((p18 <= p2))) AND (p8 + 1 <= p7))))
lola: processed formula length: 48
lola: 92 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 221 markings, 226 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p9 <= 1))) OR (G ((p15 + 1 <= p13)) AND X (F ((3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p15 + 1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p15 + 1 <= p13))
lola: processed formula length: 20
lola: 92 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: 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p9 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p9 <= 1)))
lola: processed formula length: 17
lola: 92 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 171 markings, 171 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p13 + 1 <= p26)) OR X ((X ((F ((p5 <= p18)) OR (p21 <= p18))) OR (p3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p13 + 1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p13 + 1 <= p26))
lola: processed formula length: 20
lola: 92 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: 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((F ((p5 <= p18)) OR (p21 <= p18))) OR (p3 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((F ((p5 <= p18)) OR (p21 <= p18))) OR (p3 <= p2)))
lola: processed formula length: 57
lola: 92 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 152 markings, 153 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p3 + 1 <= p22)) AND (p3 + 1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p3 + 1 <= p22)) AND (p3 + 1 <= p22)))
lola: processed formula length: 45
lola: 92 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 56 markings, 56 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((2 <= p14))) U (((2 <= p14) R (p0 + 1 <= p2)) OR (G ((p2 <= p0)) AND F (((2 <= p14) R (p0 + 1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((2 <= p14))) U (((2 <= p14) R (p0 + 1 <= p2)) OR (G ((p2 <= p0)) AND F (((2 <= p14) R (p0 + 1 <= p2))))))
lola: processed formula length: 112
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 51 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: 1305793 markings, 7974750 edges, 261159 markings/sec, 0 secs
lola: 2422759 markings, 15768794 edges, 223393 markings/sec, 5 secs
lola: 3466588 markings, 23448532 edges, 208766 markings/sec, 10 secs
lola: 4578960 markings, 31224910 edges, 222474 markings/sec, 15 secs
lola: 5579366 markings, 38838663 edges, 200081 markings/sec, 20 secs
lola: 6674588 markings, 46532848 edges, 219044 markings/sec, 25 secs
lola: 7712987 markings, 54236746 edges, 207680 markings/sec, 30 secs
lola: 8717188 markings, 61978215 edges, 200840 markings/sec, 35 secs
lola: 9745942 markings, 69733172 edges, 205751 markings/sec, 40 secs
lola: 10754562 markings, 77469428 edges, 201724 markings/sec, 45 secs
lola: 11786096 markings, 85166352 edges, 206307 markings/sec, 50 secs
lola: 12723002 markings, 92695614 edges, 187381 markings/sec, 55 secs
lola: 13649330 markings, 100221848 edges, 185266 markings/sec, 60 secs
lola: 14569521 markings, 107650229 edges, 184038 markings/sec, 65 secs
lola: 15524632 markings, 115165235 edges, 191022 markings/sec, 70 secs
lola: 16424632 markings, 122585895 edges, 180000 markings/sec, 75 secs
lola: 17334410 markings, 130031933 edges, 181956 markings/sec, 80 secs
lola: 18288860 markings, 137603270 edges, 190890 markings/sec, 85 secs
lola: 19369065 markings, 145241301 edges, 216041 markings/sec, 90 secs
lola: 20306934 markings, 152694353 edges, 187574 markings/sec, 95 secs
lola: 21210393 markings, 160147031 edges, 180692 markings/sec, 100 secs
lola: 22134493 markings, 167524699 edges, 184820 markings/sec, 105 secs
lola: 23023104 markings, 174925965 edges, 177722 markings/sec, 110 secs
lola: 23897377 markings, 182259059 edges, 174855 markings/sec, 115 secs
lola: 24742560 markings, 189534729 edges, 169037 markings/sec, 120 secs
lola: 25650243 markings, 196916294 edges, 181537 markings/sec, 125 secs
lola: 26605304 markings, 204384650 edges, 191012 markings/sec, 130 secs
lola: 27494778 markings, 211760304 edges, 177895 markings/sec, 135 secs
lola: 28356073 markings, 219064639 edges, 172259 markings/sec, 140 secs
lola: 29236553 markings, 226429655 edges, 176096 markings/sec, 145 secs
lola: 30101816 markings, 233711287 edges, 173053 markings/sec, 150 secs
lola: 30954967 markings, 241044033 edges, 170630 markings/sec, 155 secs
lola: 31883194 markings, 248465215 edges, 185645 markings/sec, 160 secs
lola: 32764214 markings, 255816936 edges, 176204 markings/sec, 165 secs
lola: 33596036 markings, 263052870 edges, 166364 markings/sec, 170 secs
lola: 34423631 markings, 270287918 edges, 165519 markings/sec, 175 secs
lola: 35252316 markings, 277480478 edges, 165737 markings/sec, 180 secs
lola: 36095759 markings, 284753604 edges, 168689 markings/sec, 185 secs
lola: 36956109 markings, 292047539 edges, 172070 markings/sec, 190 secs
lola: 37815965 markings, 299356662 edges, 171971 markings/sec, 195 secs
lola: 38819642 markings, 306879918 edges, 200735 markings/sec, 200 secs
lola: 39802695 markings, 314353824 edges, 196611 markings/sec, 205 secs
lola: 40662306 markings, 321604263 edges, 171922 markings/sec, 210 secs
lola: 41467479 markings, 328722381 edges, 161035 markings/sec, 215 secs
lola: 42367745 markings, 335998103 edges, 180053 markings/sec, 220 secs
lola: 43228792 markings, 343324828 edges, 172209 markings/sec, 225 secs
lola: 44045751 markings, 350535166 edges, 163392 markings/sec, 230 secs
lola: 44883274 markings, 357736724 edges, 167505 markings/sec, 235 secs
lola: 45706292 markings, 364918025 edges, 164604 markings/sec, 240 secs
lola: 46551105 markings, 372146997 edges, 168963 markings/sec, 245 secs
lola: 47357566 markings, 379350009 edges, 161292 markings/sec, 250 secs
lola: 48178680 markings, 386556150 edges, 164223 markings/sec, 255 secs
lola: 48845035 markings, 392094621 edges, 133271 markings/sec, 260 secs
lola: 49451072 markings, 397441237 edges, 121207 markings/sec, 265 secs
lola: 50238741 markings, 403821765 edges, 157534 markings/sec, 270 secs
lola: 50878669 markings, 409496365 edges, 127986 markings/sec, 275 secs
lola: 51485568 markings, 414680916 edges, 121380 markings/sec, 280 secs
lola: 52093541 markings, 420038670 edges, 121595 markings/sec, 285 secs
lola: 52565721 markings, 424023115 edges, 94436 markings/sec, 290 secs
lola: 53241518 markings, 429837452 edges, 135159 markings/sec, 295 secs
lola: 53890860 markings, 435763836 edges, 129868 markings/sec, 300 secs
lola: 54356747 markings, 439922786 edges, 93177 markings/sec, 305 secs
lola: 55097036 markings, 446001304 edges, 148058 markings/sec, 310 secs
lola: 55785370 markings, 452219624 edges, 137667 markings/sec, 315 secs
lola: 56202251 markings, 455849758 edges, 83376 markings/sec, 320 secs
lola: 56878057 markings, 461862850 edges, 135161 markings/sec, 325 secs
lola: 57310729 markings, 465599501 edges, 86534 markings/sec, 330 secs
lola: 57894410 markings, 470840260 edges, 116736 markings/sec, 335 secs
lola: 58514350 markings, 476465282 edges, 123988 markings/sec, 340 secs
lola: 59190797 markings, 482486788 edges, 135289 markings/sec, 345 secs
lola: 59719596 markings, 487072041 edges, 105760 markings/sec, 350 secs
lola: 60199519 markings, 491114315 edges, 95985 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p19) OR (2 <= p16))) U X (G ((F ((p19 <= 0)) AND X ((p16 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p19) OR (2 <= p16))) U X (G ((F ((p19 <= 0)) AND X ((p16 <= 1)))))))
lola: processed formula length: 82
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 121 markings, 121 edges
lola: ========================================
lola: subprocess 6 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p21 + 1 <= p3) AND (p7 <= 2))) AND F ((3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1 <= 2)
lola: processed formula length: 9
lola: 94 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 50 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X ((G ((p20 <= 2)) OR (p6 <= p2))) OR (p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X ((G ((p20 <= 2)) OR (p6 <= p2))) OR (p0 <= 0)))))
lola: processed formula length: 61
lola: 92 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: add low 152
lola: add low 80
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: 1637647 markings, 2855751 edges
lola: ========================================
lola: subprocess 8 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p16 <= p24)) OR (((p23 <= p15) OR (1 <= p9)) OR (G (F ((p15 + 1 <= p23))) AND F (((p23 <= p15) OR (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p16 <= p24)) OR (((p23 <= p15) OR (1 <= p9)) OR (G (F ((p15 + 1 <= p23))) AND F (((p23 <= p15) OR (1 <= p9)))))))
lola: processed formula length: 123
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 325 markings, 324 edges
lola: ========================================
lola: subprocess 9 will run for 1065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p14 <= 0))) AND G (((1 <= p14) OR X (X (G ((p14 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p14 <= 0)))
lola: processed formula length: 18
lola: 92 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 6
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p16 + 1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p16 + 1 <= p10)))
lola: processed formula length: 24
lola: 92 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 96
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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 3196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((p25 <= p7))) AND G (F ((p8 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((p25 <= p7))) AND G (F ((p8 <= 2)))))
lola: processed formula length: 47
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 257 markings, 446 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (X ((2 <= p14))) U (((2 <= p14) R (p0 + 1 <= p2)) OR (G ((p2 <= p0)) AND F (((2 <= p14) R (p0 + 1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((2 <= p14))) U (((2 <= p14) R (p0 + 1 <= p2)) OR (G ((p2 <= p0)) AND F (((2 <= p14) R (p0 + 1 <= p2))))))
lola: processed formula length: 112
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 51 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: 1321162 markings, 8066423 edges, 264232 markings/sec, 0 secs
lola: 2452866 markings, 15987699 edges, 226341 markings/sec, 5 secs
lola: 3513020 markings, 23806471 edges, 212031 markings/sec, 10 secs
lola: 4643055 markings, 31694332 edges, 226007 markings/sec, 15 secs
lola: 5654044 markings, 39450169 edges, 202198 markings/sec, 20 secs
lola: 6766282 markings, 47236425 edges, 222448 markings/sec, 25 secs
lola: 7800668 markings, 54927326 edges, 206877 markings/sec, 30 secs
lola: 8799967 markings, 62637421 edges, 199860 markings/sec, 35 secs
lola: 9814934 markings, 70306892 edges, 202993 markings/sec, 40 secs
lola: 10817054 markings, 77964000 edges, 200424 markings/sec, 45 secs
lola: 11843880 markings, 85612954 edges, 205365 markings/sec, 50 secs
lola: 12771000 markings, 93089290 edges, 185424 markings/sec, 55 secs
lola: 13697700 markings, 100592786 edges, 185340 markings/sec, 60 secs
lola: 14620672 markings, 108056348 edges, 184594 markings/sec, 65 secs
lola: 15579717 markings, 115598424 edges, 191809 markings/sec, 70 secs
lola: 16477102 markings, 123029313 edges, 179477 markings/sec, 75 secs
lola: 17403774 markings, 130526303 edges, 185334 markings/sec, 80 secs
lola: 18348031 markings, 138086273 edges, 188851 markings/sec, 85 secs
lola: 19452087 markings, 145778013 edges, 220811 markings/sec, 90 secs
lola: 20375263 markings, 153209274 edges, 184635 markings/sec, 95 secs
lola: 21267779 markings, 160620290 edges, 178503 markings/sec, 100 secs
lola: 22187752 markings, 167988662 edges, 183995 markings/sec, 105 secs
lola: 23071547 markings, 175366734 edges, 176759 markings/sec, 110 secs
lola: 23945954 markings, 182697435 edges, 174881 markings/sec, 115 secs
lola: 24795376 markings, 189985155 edges, 169884 markings/sec, 120 secs
lola: 25709588 markings, 197368475 edges, 182842 markings/sec, 125 secs
lola: 26668373 markings, 204838270 edges, 191757 markings/sec, 130 secs
lola: 27539643 markings, 212155541 edges, 174254 markings/sec, 135 secs
lola: 28403963 markings, 219485898 edges, 172864 markings/sec, 140 secs
lola: 29282569 markings, 226819124 edges, 175721 markings/sec, 145 secs
lola: 30145878 markings, 234092992 edges, 172662 markings/sec, 150 secs
lola: 30996881 markings, 241405706 edges, 170201 markings/sec, 155 secs
lola: 31932302 markings, 248857271 edges, 187084 markings/sec, 160 secs
lola: 32802705 markings, 256178174 edges, 174081 markings/sec, 165 secs
lola: 33634860 markings, 263401851 edges, 166431 markings/sec, 170 secs
lola: 34462969 markings, 270631275 edges, 165622 markings/sec, 175 secs
lola: 35293394 markings, 277849608 edges, 166085 markings/sec, 180 secs
lola: 36132557 markings, 285085001 edges, 167833 markings/sec, 185 secs
lola: 36994108 markings, 292388301 edges, 172310 markings/sec, 190 secs
lola: 37853565 markings, 299696526 edges, 171891 markings/sec, 195 secs
lola: 38877824 markings, 307295578 edges, 204852 markings/sec, 200 secs
lola: 39845719 markings, 314745253 edges, 193579 markings/sec, 205 secs
lola: 40704055 markings, 321977917 edges, 171667 markings/sec, 210 secs
lola: 41507824 markings, 329101958 edges, 160754 markings/sec, 215 secs
lola: 42411426 markings, 336373975 edges, 180720 markings/sec, 220 secs
lola: 43273250 markings, 343686474 edges, 172365 markings/sec, 225 secs
lola: 44084972 markings, 350868671 edges, 162344 markings/sec, 230 secs
lola: 44919131 markings, 358050272 edges, 166832 markings/sec, 235 secs
lola: 45751632 markings, 365265397 edges, 166500 markings/sec, 240 secs
lola: 46586744 markings, 372456674 edges, 167022 markings/sec, 245 secs
lola: 47396831 markings, 379655108 edges, 162017 markings/sec, 250 secs
lola: 48213293 markings, 386860931 edges, 163292 markings/sec, 255 secs
lola: 49010323 markings, 393562130 edges, 159406 markings/sec, 260 secs
lola: 49485012 markings, 397752387 edges, 94938 markings/sec, 265 secs
lola: 50186528 markings, 403350261 edges, 140303 markings/sec, 270 secs
lola: 50637682 markings, 407352575 edges, 90231 markings/sec, 275 secs
lola: 51261559 markings, 412804563 edges, 124775 markings/sec, 280 secs
lola: 51826748 markings, 417693347 edges, 113038 markings/sec, 285 secs
lola: 52374824 markings, 422515376 edges, 109615 markings/sec, 290 secs
lola: 53047372 markings, 428197691 edges, 134510 markings/sec, 295 secs
lola: 53622915 markings, 433300275 edges, 115109 markings/sec, 300 secs
lola: 54336764 markings, 439749307 edges, 142770 markings/sec, 305 secs
lola: 54934439 markings, 444648200 edges, 119535 markings/sec, 310 secs
lola: 55659443 markings, 451112686 edges, 145001 markings/sec, 315 secs
lola: 55918367 markings, 453371996 edges, 51785 markings/sec, 320 secs
lola: 56186187 markings, 455683885 edges, 53564 markings/sec, 325 secs
lola: 56715105 markings, 460440694 edges, 105784 markings/sec, 330 secs
lola: 57256335 markings, 465170047 edges, 108246 markings/sec, 335 secs
lola: 57680957 markings, 468893413 edges, 84924 markings/sec, 340 secs
lola: 58133795 markings, 472993262 edges, 90568 markings/sec, 345 secs
lola: 58568597 markings, 476964154 edges, 86960 markings/sec, 350 secs
lola: 59196966 markings, 482538927 edges, 125674 markings/sec, 355 secs
lola: 59639726 markings, 486410172 edges, 88552 markings/sec, 360 secs
lola: 60221901 markings, 491285400 edges, 116435 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no unknown no no no no yes no no
lola:
preliminary result: no no no no unknown no no no no yes no no
lola: memory consumption: 3524 KB
lola: time consumption: 752 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="NeighborGrid-PT-d3n3m1t11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is NeighborGrid-PT-d3n3m1t11, 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 r151-tall-162089151000045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;