fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r265-tall-162106800300046
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for SmallOperatingSystem-PT-MT1024DC0256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.336 3600000.00 883447.00 122013.00 ?TFTTFFFFTFFF?TF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800300046.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 SmallOperatingSystem-PT-MT1024DC0256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.1K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-15

=== Now, execution of the tool begins

BK_START 1621195149087

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

FORMULA SmallOperatingSystem-PT-MT1024DC0256-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2362
rslt: Output for LTLFireability @ SmallOperatingSystem-PT-MT1024DC0256

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 19:59:12 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (X (X (F (((1 <= p1) AND (1 <= p2))))))))",
"processed_size": 49,
"rewrites": 66
},
"result":
{
"edges": 34,
"markings": 24,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p4) AND (1 <= p6))))",
"processed_size": 33,
"rewrites": 66
},
"result":
{
"edges": 8,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p3)))",
"processed_size": 17,
"rewrites": 66
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((1 <= p7))",
"processed_size": 13,
"rewrites": 66
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p5 <= 0))",
"processed_size": 24,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p1) AND (1 <= p2)))",
"processed_size": 29,
"rewrites": 66
},
"result":
{
"edges": 841819,
"markings": 389476,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p5 <= 0))",
"processed_size": 25,
"rewrites": 68
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"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": 983
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 983
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p1 <= 0) OR (p2 <= 0)))",
"processed_size": 29,
"rewrites": 66
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p1) AND (1 <= p2)))",
"processed_size": 29,
"rewrites": 66
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((((p2 <= 0) OR (p5 <= 0)) AND (p3 <= 0) AND (p4 <= 0))))",
"processed_size": 63,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 2950
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p2 <= 0) OR (p5 <= 0))))",
"processed_size": 33,
"rewrites": 66
},
"result":
{
"edges": 27,
"markings": 17,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3400,
"runtime": 1208.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(((F(**) U **) OR **)))) : X(X(X(X(X(F(**)))))) : X((X((G(*) OR **)) U (X(**) OR F(**)))) : (F(G((X(*) OR (** OR **)))) AND F(G(**))) : G(F(*)) : (F(G(**)) OR X(**)) : (X(X(G(**))) AND (F(*) OR (** OR **))) : ((X(**) OR (G(**) AND X(F(**)))) AND F(**)) : ((G(**) OR G(**)) U G((X(*) AND **))) : (X(**) OR (G(*) AND X(**))) : X(G(*))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "unknown yes yes no no no no no unknown yes no ",
"value": "unknown yes yes no no no no no 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: NOT(F (NOT(X (X (((F ((1 <= p4)) U ((1 <= p1) AND (1 <= p2))) OR (1 <= p4))))))) : F (X (X (X (F (X (X (((1 <= p1) AND (1 <= p2))))))))) : X ((X ((NOT(F (((1 <= p4) AND (1 <= p6)))) OR (p7 <= 0))) U (X ((1 <= p7)) OR F (((1 <= p4) AND (1 <= p6)))))) : (X (X (F (G (((NOT(X (((1 <= p4) AND (1 <= p6)))) OR (p1 <= 0)) OR (p2 <= 0)))))) AND F (G (((1 <= p4) AND (1 <= p6))))) : NOT(F ((((1 <= p8) OR (1 <= p7)) U X (G (X (((1 <= p2) AND (1 <= p5)))))))) : (X (F (G ((1 <= p3)))) OR X ((1 <= p7))) : (NOT(F (NOT(X (X (((p2 <= 0) OR (p5 <= 0))))))) AND ((NOT(G ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p2))))) OR (p2 <= 0)) OR (p5 <= 0))) : ((G (((1 <= p1) AND (1 <= p2))) U X ((p7 <= 0))) AND F (((1 <= p2) AND (1 <= p5)))) : ((G (((1 <= p1) AND (1 <= p2))) OR G ((1 <= p7))) U G ((NOT(X (((1 <= p1) AND (1 <= p2)))) AND ((p1 <= 0) OR (p2 <= 0))))) : (X (((1 <= p1) AND (1 <= p2))) OR (NOT(F (((1 <= p1) AND (1 <= p2)))) AND X ((1 <= p7)))) : NOT(F (X ((((1 <= p2) AND (1 <= p5)) OR (1 <= p3) OR (1 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((F ((1 <= p4)) U ((1 <= p1) AND (1 <= p2))) OR (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((F ((1 <= p4)) U ((1 <= p1) AND (1 <= p2))) OR (1 <= p4)))))
lola: processed formula length: 70
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3291032 markings, 8295024 edges, 658206 markings/sec, 0 secs
lola: 5949818 markings, 15961723 edges, 531757 markings/sec, 5 secs
lola: 8570174 markings, 23505160 edges, 524071 markings/sec, 10 secs
lola: 11089677 markings, 30826750 edges, 503901 markings/sec, 15 secs
lola: 13620411 markings, 38182821 edges, 506147 markings/sec, 20 secs
lola: 16133241 markings, 45497797 edges, 502566 markings/sec, 25 secs
lola: 18632887 markings, 52770789 edges, 499929 markings/sec, 30 secs
lola: 21105880 markings, 60029688 edges, 494599 markings/sec, 35 secs
lola: 23576965 markings, 67214748 edges, 494217 markings/sec, 40 secs
lola: 25989232 markings, 74265127 edges, 482453 markings/sec, 45 secs
lola: 28399164 markings, 81314136 edges, 481986 markings/sec, 50 secs
lola: 30801996 markings, 88327523 edges, 480566 markings/sec, 55 secs
lola: 33153927 markings, 95226973 edges, 470386 markings/sec, 60 secs
lola: 35523690 markings, 102152912 edges, 473953 markings/sec, 65 secs
lola: 37940701 markings, 109204629 edges, 483402 markings/sec, 70 secs
lola: 40259147 markings, 116032876 edges, 463689 markings/sec, 75 secs
lola: 42626741 markings, 122972418 edges, 473519 markings/sec, 80 secs
lola: 45003530 markings, 129909983 edges, 475358 markings/sec, 85 secs
lola: 47340170 markings, 136753747 edges, 467328 markings/sec, 90 secs
lola: 49705541 markings, 143665246 edges, 473074 markings/sec, 95 secs
lola: 52024918 markings, 150490292 edges, 463875 markings/sec, 100 secs
lola: 54340589 markings, 157271867 edges, 463134 markings/sec, 105 secs
lola: 56618251 markings, 163967439 edges, 455532 markings/sec, 110 secs
lola: 58917397 markings, 170691027 edges, 459829 markings/sec, 115 secs
lola: 61187926 markings, 177359773 edges, 454106 markings/sec, 120 secs
lola: 63500606 markings, 184105052 edges, 462536 markings/sec, 125 secs
lola: 65750163 markings, 190742468 edges, 449911 markings/sec, 130 secs
lola: 68000344 markings, 197389123 edges, 450036 markings/sec, 135 secs
lola: 70289022 markings, 204104386 edges, 457736 markings/sec, 140 secs
lola: 72631586 markings, 210955369 edges, 468513 markings/sec, 145 secs
lola: 74943622 markings, 217733420 edges, 462407 markings/sec, 150 secs
lola: 77254152 markings, 224501212 edges, 462106 markings/sec, 155 secs
lola: 79479954 markings, 231041306 edges, 445160 markings/sec, 160 secs
lola: 81766042 markings, 237766330 edges, 457218 markings/sec, 165 secs
lola: 84053286 markings, 244466928 edges, 457449 markings/sec, 170 secs
lola: 86456457 markings, 251516874 edges, 480634 markings/sec, 175 secs
lola: 88429464 markings, 257313183 edges, 394601 markings/sec, 180 secs
lola: 90634967 markings, 263792688 edges, 441101 markings/sec, 185 secs
lola: 92704792 markings, 269863114 edges, 413965 markings/sec, 190 secs
lola: 92704792 markings, 269863114 edges, 0 markings/sec, 195 secs
lola: 94526902 markings, 275180876 edges, 364422 markings/sec, 200 secs
lola: 94862565 markings, 276141567 edges, 67133 markings/sec, 205 secs
lola: 94862565 markings, 276141567 edges, 0 markings/sec, 210 secs
lola: 95203077 markings, 277136684 edges, 68102 markings/sec, 215 secs
lola: 96147974 markings, 279934564 edges, 188979 markings/sec, 220 secs
lola: 96744782 markings, 281701149 edges, 119362 markings/sec, 225 secs
lola: 98515055 markings, 286938570 edges, 354055 markings/sec, 230 secs
lola: 99570388 markings, 290053896 edges, 211067 markings/sec, 235 secs
lola: 100407007 markings, 292503729 edges, 167324 markings/sec, 240 secs
lola: 102260305 markings, 297939720 edges, 370660 markings/sec, 245 secs
lola: 103468043 markings, 301481194 edges, 241548 markings/sec, 250 secs
lola: 105060272 markings, 306152516 edges, 318446 markings/sec, 255 secs
lola: 106790340 markings, 311230719 edges, 346014 markings/sec, 260 secs
lola: 107867119 markings, 314364532 edges, 215356 markings/sec, 265 secs
lola: 107870998 markings, 314375194 edges, 776 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (F (((1 <= p1) AND (1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (F (((1 <= p1) AND (1 <= p2))))))))
lola: processed formula length: 49
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 24 markings, 34 edges
lola: ========================================
lola: subprocess 2 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G (((p4 <= 0) OR (p6 <= 0))) OR (p7 <= 0))) U (X ((1 <= p7)) OR F (((1 <= p4) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G (((p4 <= 0) OR (p6 <= 0))) OR (p7 <= 0))) U (X ((1 <= p7)) OR F (((1 <= p4) AND (1 <= p6))))))
lola: processed formula length: 105
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 1024 markings, 1023 edges
lola: ========================================
lola: subprocess 3 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X (((p4 <= 0) OR (p6 <= 0))) OR ((p1 <= 0) OR (p2 <= 0))))) AND F (G (((1 <= p4) AND (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p4) AND (1 <= p6))))
lola: processed formula length: 33
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 5
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: 6 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p3))) OR X ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p3)))
lola: processed formula length: 17
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p7))
lola: processed formula length: 13
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((p2 <= 0) OR (p5 <= 0))))) AND (F ((((p5 <= 0) OR (p6 <= 0)) AND ((p1 <= 0) OR (p2 <= 0)))) OR ((p2 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= 0) OR (p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 24
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p2 <= 0) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p2 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 37
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p7 <= 0)) OR (G (((1 <= p1) AND (1 <= p2))) AND X (F ((p7 <= 0))))) AND F (((1 <= p2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1) AND (1 <= p2)))
lola: processed formula length: 29
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 389476 markings, 841819 edges
lola: ========================================
lola: subprocess 7 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p5)))
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: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 25
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p1) AND (1 <= p2))) OR G ((1 <= p7))) U G ((X (((p1 <= 0) OR (p2 <= 0))) AND ((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p1) AND (1 <= p2))) OR G ((1 <= p7))) U G ((X (((p1 <= 0) OR (p2 <= 0))) AND ((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 118
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3535920 markings, 8791206 edges, 707184 markings/sec, 0 secs
lola: 6930432 markings, 17250438 edges, 678902 markings/sec, 5 secs
lola: 10290423 markings, 25627172 edges, 671998 markings/sec, 10 secs
lola: 13600772 markings, 33882344 edges, 662070 markings/sec, 15 secs
lola: 16853908 markings, 41997557 edges, 650627 markings/sec, 20 secs
lola: 20077208 markings, 50039423 edges, 644660 markings/sec, 25 secs
lola: 23348326 markings, 58199555 edges, 654224 markings/sec, 30 secs
lola: 26562745 markings, 66220433 edges, 642884 markings/sec, 35 secs
lola: 29739999 markings, 74149859 edges, 635451 markings/sec, 40 secs
lola: 32942644 markings, 82141517 edges, 640529 markings/sec, 45 secs
lola: 36118808 markings, 90069108 edges, 635233 markings/sec, 50 secs
lola: 39268822 markings, 97930281 edges, 630003 markings/sec, 55 secs
lola: 42399378 markings, 105745168 edges, 626111 markings/sec, 60 secs
lola: 45486022 markings, 113449439 edges, 617329 markings/sec, 65 secs
lola: 48542342 markings, 121799726 edges, 611264 markings/sec, 70 secs
lola: 51290523 markings, 129713300 edges, 549636 markings/sec, 75 secs
lola: 53946058 markings, 137386750 edges, 531107 markings/sec, 80 secs
lola: 56560813 markings, 144949484 edges, 522951 markings/sec, 85 secs
lola: 59146264 markings, 152479056 edges, 517090 markings/sec, 90 secs
lola: 61693522 markings, 159917899 edges, 509452 markings/sec, 95 secs
lola: 64271732 markings, 167426525 edges, 515642 markings/sec, 100 secs
lola: 66798274 markings, 174802789 edges, 505308 markings/sec, 105 secs
lola: 69294796 markings, 182126798 edges, 499304 markings/sec, 110 secs
lola: 71760740 markings, 189351262 edges, 493189 markings/sec, 115 secs
lola: 74274192 markings, 196690600 edges, 502690 markings/sec, 120 secs
lola: 76723413 markings, 203877925 edges, 489844 markings/sec, 125 secs
lola: 79176994 markings, 211078690 edges, 490716 markings/sec, 130 secs
lola: 81621797 markings, 218241584 edges, 488961 markings/sec, 135 secs
lola: 84055613 markings, 225375779 edges, 486763 markings/sec, 140 secs
lola: 85776697 markings, 230372143 edges, 344217 markings/sec, 145 secs
lola: 87437583 markings, 235230476 edges, 332177 markings/sec, 150 secs
lola: 87552438 markings, 235558073 edges, 22971 markings/sec, 155 secs
lola: 87552438 markings, 235558073 edges, 0 markings/sec, 160 secs
lola: 89558598 markings, 241413956 edges, 401232 markings/sec, 165 secs
lola: 89779880 markings, 242070300 edges, 44256 markings/sec, 170 secs
lola: 89989086 markings, 242689091 edges, 41841 markings/sec, 175 secs
lola: 91900014 markings, 248295601 edges, 382186 markings/sec, 180 secs
lola: 92016061 markings, 248634130 edges, 23209 markings/sec, 185 secs
lola: 92016061 markings, 248634130 edges, 0 markings/sec, 190 secs
lola: 93453760 markings, 252824235 edges, 287540 markings/sec, 195 secs
lola: 94369389 markings, 255529820 edges, 183126 markings/sec, 200 secs
lola: 94369389 markings, 255529820 edges, 0 markings/sec, 205 secs
lola: 95468585 markings, 258783283 edges, 219839 markings/sec, 210 secs
lola: 96655801 markings, 262276597 edges, 237443 markings/sec, 215 secs
lola: 98890458 markings, 268815682 edges, 446931 markings/sec, 220 secs
lola: 98949961 markings, 268986351 edges, 11901 markings/sec, 225 secs
lola: 98949961 markings, 268986351 edges, 0 markings/sec, 230 secs
lola: 100029137 markings, 272133560 edges, 215835 markings/sec, 235 secs
lola: 101397102 markings, 276147745 edges, 273593 markings/sec, 240 secs
lola: 101397102 markings, 276147745 edges, 0 markings/sec, 245 secs
lola: 102244095 markings, 278656712 edges, 169399 markings/sec, 250 secs
lola: 103749553 markings, 283059586 edges, 301092 markings/sec, 255 secs
lola: 103752738 markings, 283070158 edges, 637 markings/sec, 260 secs
lola: 105894602 markings, 289384812 edges, 428373 markings/sec, 265 secs
lola: 106008331 markings, 289719386 edges, 22746 markings/sec, 270 secs
lola: 106170716 markings, 290194676 edges, 32477 markings/sec, 275 secs
lola: 106176394 markings, 290210464 edges, 1136 markings/sec, 280 secs
lola: 106177750 markings, 290214072 edges, 271 markings/sec, 285 secs
lola: 106177818 markings, 290214361 edges, 14 markings/sec, 290 secs
lola: 106177876 markings, 290214515 edges, 12 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 983 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p1) AND (1 <= p2))) OR (G (((p1 <= 0) OR (p2 <= 0))) AND X ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 983 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1 <= 0) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1 <= 0) OR (p2 <= 0)))
lola: processed formula length: 29
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 1475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p1) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p1) AND (1 <= p2)))
lola: processed formula length: 29
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p2 <= 0) OR (p5 <= 0)) AND (p3 <= 0) AND (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p2 <= 0) OR (p5 <= 0)) AND (p3 <= 0) AND (p4 <= 0))))
lola: processed formula length: 63
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 2950 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p2 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p2 <= 0) OR (p5 <= 0))))
lola: processed formula length: 33
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 27 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G (((F ((1 <= p4)) U ((1 <= p1) AND (1 <= p2))) OR (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((F ((1 <= p4)) U ((1 <= p1) AND (1 <= p2))) OR (1 <= p4)))))
lola: processed formula length: 70
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3256776 markings, 8195612 edges, 651355 markings/sec, 0 secs
lola: 5876664 markings, 15752224 edges, 523978 markings/sec, 5 secs
lola: 8470869 markings, 23223234 edges, 518841 markings/sec, 10 secs
lola: 10965555 markings, 30468116 edges, 498937 markings/sec, 15 secs
lola: 13481828 markings, 37783030 edges, 503255 markings/sec, 20 secs
lola: 15972307 markings, 45019136 edges, 498096 markings/sec, 25 secs
lola: 18464590 markings, 52269172 edges, 498457 markings/sec, 30 secs
lola: 20915129 markings, 59466983 edges, 490108 markings/sec, 35 secs
lola: 23373832 markings, 66623309 edges, 491741 markings/sec, 40 secs
lola: 25791503 markings, 73681892 edges, 483534 markings/sec, 45 secs
lola: 28196361 markings, 80723271 edges, 480972 markings/sec, 50 secs
lola: 30611673 markings, 87767407 edges, 483062 markings/sec, 55 secs
lola: 32991130 markings, 94744970 edges, 475891 markings/sec, 60 secs
lola: 35381015 markings, 101728647 edges, 477977 markings/sec, 65 secs
lola: 37792638 markings, 108774202 edges, 482325 markings/sec, 70 secs
lola: 40134137 markings, 115660561 edges, 468300 markings/sec, 75 secs
lola: 42514448 markings, 122644140 edges, 476062 markings/sec, 80 secs
lola: 44883802 markings, 129557464 edges, 473871 markings/sec, 85 secs
lola: 47134533 markings, 136165343 edges, 450146 markings/sec, 90 secs
lola: 49322314 markings, 142561317 edges, 437556 markings/sec, 95 secs
lola: 51646748 markings, 149387587 edges, 464887 markings/sec, 100 secs
lola: 53986175 markings, 156236549 edges, 467885 markings/sec, 105 secs
lola: 56298407 markings, 163016669 edges, 462446 markings/sec, 110 secs
lola: 58665880 markings, 169935959 edges, 473495 markings/sec, 115 secs
lola: 60949943 markings, 176653275 edges, 456813 markings/sec, 120 secs
lola: 63280429 markings, 183462993 edges, 466097 markings/sec, 125 secs
lola: 65559522 markings, 190184202 edges, 455819 markings/sec, 130 secs
lola: 67834830 markings, 196898172 edges, 455062 markings/sec, 135 secs
lola: 70139843 markings, 203650406 edges, 461003 markings/sec, 140 secs
lola: 72463784 markings, 210463893 edges, 464788 markings/sec, 145 secs
lola: 74811598 markings, 217340177 edges, 469563 markings/sec, 150 secs
lola: 77135301 markings, 224148702 edges, 464741 markings/sec, 155 secs
lola: 79350981 markings, 230658727 edges, 443136 markings/sec, 160 secs
lola: 81647545 markings, 237419756 edges, 459313 markings/sec, 165 secs
lola: 83940209 markings, 244140865 edges, 458533 markings/sec, 170 secs
lola: 86287251 markings, 251013288 edges, 469408 markings/sec, 175 secs
lola: 87592370 markings, 254855991 edges, 261024 markings/sec, 180 secs
lola: 88511887 markings, 257557196 edges, 183903 markings/sec, 185 secs
lola: 90290042 markings, 262759836 edges, 355631 markings/sec, 190 secs
lola: 91899571 markings, 267512366 edges, 321906 markings/sec, 195 secs
lola: 92868296 markings, 270330642 edges, 193745 markings/sec, 200 secs
lola: 94369148 markings, 274728674 edges, 300170 markings/sec, 205 secs
lola: 95711576 markings, 278645417 edges, 268486 markings/sec, 210 secs
lola: 96725297 markings, 281643650 edges, 202744 markings/sec, 215 secs
lola: 96864681 markings, 282050779 edges, 27877 markings/sec, 220 secs
lola: 98536714 markings, 287003955 edges, 334407 markings/sec, 225 secs
lola: 98581317 markings, 287129557 edges, 8921 markings/sec, 230 secs
lola: 100582194 markings, 293004251 edges, 400175 markings/sec, 235 secs
lola: 100620403 markings, 293119623 edges, 7642 markings/sec, 240 secs
lola: 100620403 markings, 293119623 edges, 0 markings/sec, 245 secs
lola: 102391140 markings, 298327750 edges, 354147 markings/sec, 250 secs
lola: 103693701 markings, 302144648 edges, 260512 markings/sec, 255 secs
lola: 104095014 markings, 303326029 edges, 80263 markings/sec, 260 secs
lola: 105690144 markings, 308004662 edges, 319026 markings/sec, 265 secs
lola: 106829164 markings, 311345910 edges, 227804 markings/sec, 270 secs
lola: 107891096 markings, 314436932 edges, 212386 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p1) AND (1 <= p2))) OR G ((1 <= p7))) U G ((X (((p1 <= 0) OR (p2 <= 0))) AND ((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p1) AND (1 <= p2))) OR G ((1 <= p7))) U G ((X (((p1 <= 0) OR (p2 <= 0))) AND ((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 118
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3504103 markings, 8711462 edges, 700821 markings/sec, 0 secs
lola: 6882750 markings, 17130853 edges, 675729 markings/sec, 5 secs
lola: 10217563 markings, 25445860 edges, 666963 markings/sec, 10 secs
lola: 13517380 markings, 33674745 edges, 659963 markings/sec, 15 secs
lola: 16749845 markings, 41737002 edges, 646493 markings/sec, 20 secs
lola: 19957663 markings, 49739833 edges, 641564 markings/sec, 25 secs
lola: 23207393 markings, 57848145 edges, 649946 markings/sec, 30 secs
lola: 26402768 markings, 65821489 edges, 639075 markings/sec, 35 secs
lola: 29560555 markings, 73702323 edges, 631557 markings/sec, 40 secs
lola: 32742024 markings, 81641026 edges, 636294 markings/sec, 45 secs
lola: 35903543 markings, 89531888 edges, 632304 markings/sec, 50 secs
lola: 39045848 markings, 97373852 edges, 628461 markings/sec, 55 secs
lola: 42160061 markings, 105148026 edges, 622843 markings/sec, 60 secs
lola: 45244835 markings, 112847655 edges, 616955 markings/sec, 65 secs
lola: 48319357 markings, 121153129 edges, 614904 markings/sec, 70 secs
lola: 51051827 markings, 129026080 edges, 546494 markings/sec, 75 secs
lola: 53686694 markings, 136645406 edges, 526973 markings/sec, 80 secs
lola: 56296372 markings, 144196442 edges, 521936 markings/sec, 85 secs
lola: 58886941 markings, 151725144 edges, 518114 markings/sec, 90 secs
lola: 61443466 markings, 159193172 edges, 511305 markings/sec, 95 secs
lola: 63998240 markings, 166634707 edges, 510955 markings/sec, 100 secs
lola: 66530170 markings, 174021840 edges, 506386 markings/sec, 105 secs
lola: 69013727 markings, 181316809 edges, 496711 markings/sec, 110 secs
lola: 71518278 markings, 188634598 edges, 500910 markings/sec, 115 secs
lola: 73998233 markings, 195894583 edges, 495991 markings/sec, 120 secs
lola: 76474802 markings, 203139958 edges, 495314 markings/sec, 125 secs
lola: 78927656 markings, 210329021 edges, 490571 markings/sec, 130 secs
lola: 81363057 markings, 217471894 edges, 487080 markings/sec, 135 secs
lola: 83790998 markings, 224603040 edges, 485588 markings/sec, 140 secs
lola: 86180714 markings, 231566356 edges, 477943 markings/sec, 145 secs
lola: 87221618 markings, 234610558 edges, 208181 markings/sec, 150 secs
lola: 88983725 markings, 239716751 edges, 352421 markings/sec, 155 secs
lola: 89974259 markings, 242643988 edges, 198107 markings/sec, 160 secs
lola: 90095592 markings, 242997304 edges, 24267 markings/sec, 165 secs
lola: 92248894 markings, 249306582 edges, 430660 markings/sec, 170 secs
lola: 92248894 markings, 249306582 edges, 0 markings/sec, 175 secs
lola: 92248894 markings, 249306582 edges, 0 markings/sec, 180 secs
lola: 93404910 markings, 252686624 edges, 231203 markings/sec, 185 secs
lola: 94110029 markings, 254766513 edges, 141024 markings/sec, 190 secs
lola: 94242544 markings, 255158273 edges, 26503 markings/sec, 195 secs
lola: 95997248 markings, 260353040 edges, 350941 markings/sec, 200 secs
lola: 95997248 markings, 260353040 edges, 0 markings/sec, 205 secs
lola: 95997248 markings, 260353040 edges, 0 markings/sec, 210 secs
lola: 97408677 markings, 264502421 edges, 282286 markings/sec, 215 secs
lola: 98311071 markings, 267127246 edges, 180479 markings/sec, 220 secs
lola: 98311071 markings, 267127246 edges, 0 markings/sec, 225 secs
lola: 99162247 markings, 269604322 edges, 170235 markings/sec, 230 secs
lola: 100644115 markings, 273923398 edges, 296374 markings/sec, 235 secs
lola: 100655726 markings, 273956818 edges, 2322 markings/sec, 240 secs
lola: 101039565 markings, 275094491 edges, 76768 markings/sec, 245 secs
lola: 102961758 markings, 280740659 edges, 384439 markings/sec, 250 secs
lola: 102961758 markings, 280740659 edges, 0 markings/sec, 255 secs
lola: 102961758 markings, 280740659 edges, 0 markings/sec, 260 secs
lola: 103979284 markings, 283731058 edges, 203505 markings/sec, 265 secs
lola: 105359027 markings, 287805294 edges, 275949 markings/sec, 270 secs
lola: 105359027 markings, 287805294 edges, 0 markings/sec, 275 secs
lola: 105383008 markings, 287872806 edges, 4796 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes yes no no no no no unknown yes no
lola:
preliminary result: unknown yes yes no no no no no unknown yes no
lola: memory consumption: 3400 KB
lola: time consumption: 1208 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT1024DC0256"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SmallOperatingSystem-PT-MT1024DC0256, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800300046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT1024DC0256.tgz
mv SmallOperatingSystem-PT-MT1024DC0256 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;