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-162106800300058.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-MT2048DC1024, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 4.5K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K 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-MT2048DC1024-00
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-01
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-02
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-03
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-04
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-05
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-06
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-07
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-08
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-09
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-10
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-11
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-12
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-13
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-14
FORMULA_NAME SmallOperatingSystem-PT-MT2048DC1024-15

=== Now, execution of the tool begins

BK_START 1621195781136

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:09:42] [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 20:09:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:09:42] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-16 20:09:42] [INFO ] Transformed 9 places.
[2021-05-16 20:09:42] [INFO ] Transformed 8 transitions.
[2021-05-16 20:09:42] [INFO ] Parsed PT model containing 9 places and 8 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100443 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=1969 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 20:09:42] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 20:09:42] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned unsat
[2021-05-16 20:09:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:09:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-16 20:09:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 20:09:43] [INFO ] Flatten gal took : 23 ms
FORMULA SmallOperatingSystem-PT-MT2048DC1024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT2048DC1024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:09:43] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:09:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 20:09:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SmallOperatingSystem-PT-MT2048DC1024 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT2048DC1024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT2048DC1024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT2048DC1024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT2048DC1024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT2048DC1024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA SmallOperatingSystem-PT-MT2048DC1024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT2048DC1024-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT2048DC1024-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2133
rslt: Output for LTLFireability @ SmallOperatingSystem-PT-MT2048DC1024

{
"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 20:09:45 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p8 <= 0)))",
"processed_size": 17,
"rewrites": 63
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (F (((1 <= p1) AND (1 <= p2))))))",
"processed_size": 41,
"rewrites": 63
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((X (F ((p4 <= 0))) AND (1 <= p4)))",
"processed_size": 37,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 367
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 367
},
"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": 63
},
"result":
{
"edges": 13590235,
"markings": 6276196,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (X (G ((p7 <= 0))))",
"processed_size": 21,
"rewrites": 63
},
"result":
{
"edges": 12,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p3) AND (1 <= p8))) OR ((p2 <= 0) OR (p5 <= 0))))",
"processed_size": 63,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 63
},
"result":
{
"edges": 10,
"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": 951
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "F (G (((1 <= p1) AND (1 <= p2))))",
"processed_size": 33,
"rewrites": 63
},
"result":
{
"edges": 13614802,
"markings": 6286435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 1423
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"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": 1,
"visible_transitions": 0
},
"processed": "F ((G (F ((1 <= p3))) OR F ((1 <= p3))))",
"processed_size": 40,
"rewrites": 63
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2846
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((1 <= p4) OR (G ((((1 <= p4) AND (1 <= p6)) OR (F (((1 <= p4) AND (1 <= p6))) AND F (G (((1 <= p3) AND ((1 <= p4) AND (1 <= p6)))))))) AND F ((1 <= p4)))))",
"processed_size": 159,
"rewrites": 63
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"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": 63
},
"result":
{
"edges": 13590235,
"markings": 6276196,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 2884,
"runtime": 1437.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((G(F((X(**) OR **))) AND (F(**) AND (** AND **))))) : X(G(**)) : G((** OR (G((** OR (F(**) AND F(G((** AND **)))))) AND F(**)))) : X(X(X(F(**)))) : F((F(**) AND (X(F(**)) AND (** AND (** AND **))))) : F((X(F(*)) AND **)) : F(G(*)) : F((G(F(**)) OR F(**))) : F(G(**)) : (F(G((F(**) AND ((** U X(**)) OR **)))) OR G(**)) : (((** U G(*)) AND X(**)) U **) : X((G(**) AND (** U X(G(*))))) : X(X(G(*))) : X((G((** AND **)) OR (** OR **)))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "unknown no no yes no no no no no unknown no unknown no yes ",
"value": "unknown no no yes no no no no no unknown no unknown no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: X (G ((((G (F ((X ((1 <= p8)) OR (1 <= p7)))) AND F ((1 <= p4))) AND (1 <= p1)) AND (1 <= p2)))) : G (X ((p8 <= 0))) : G ((G ((X (F ((G ((1 <= p3)) AND G (((1 <= p4) AND (1 <= p6)))))) U ((1 <= p4) AND (1 <= p6)))) U (1 <= p4))) : X (F (X (X (((1 <= p1) AND (1 <= p2)))))) : F (((((F (((1 <= p2) AND (1 <= p5))) AND F (X (F ((((1 <= p2) AND (1 <= p5)) U (1 <= p3)))))) AND (1 <= p4)) AND (1 <= p6)) AND (p7 <= 0))) : F ((NOT(G (X ((1 <= p4)))) AND (1 <= p4))) : NOT(X ((((1 <= p5) AND (1 <= p6)) U X (F (G (F (((p1 <= 0) OR (p2 <= 0))))))))) : F ((G (F (G ((X (X (F ((1 <= p7)))) U F ((1 <= p3)))))) OR F ((1 <= p3)))) : F (X (NOT(X ((X (((1 <= p7) U (X ((1 <= p7)) AND (1 <= p4)))) U NOT(G ((1 <= p4)))))))) : (F (G ((((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) U ((1 <= p1) AND (1 <= p2))))) OR G (((1 <= p1) AND (1 <= p2)))) : (((((p2 <= 0) OR (p5 <= 0)) U NOT(F (((1 <= p1) AND (1 <= p2))))) AND X (((1 <= p2) AND (1 <= p5)))) U ((1 <= p5) AND (1 <= p6))) : (G (X (((1 <= p1) AND (1 <= p2)))) AND (X (((1 <= p2) AND (1 <= p5))) U G (NOT(X (X (((1 <= p2) AND (1 <= p5)))))))) : X (X (NOT((X (((1 <= p4) AND (1 <= p6))) U (((p4 <= 0) OR (p6 <= 0)) U F ((((1 <= p1) AND (1 <= p2)) U (1 <= p7)))))))) : X (((G ((G ((1 <= p3)) AND G ((1 <= p8)))) OR (p2 <= 0)) OR (p5 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((X ((1 <= p8)) OR (1 <= p7)))) AND (F ((1 <= p4)) AND ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((X ((1 <= p8)) OR (1 <= p7)))) AND (F ((1 <= p4)) AND ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 96
lola: 63 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: 4163375 markings, 8504712 edges, 832675 markings/sec, 0 secs
lola: 8232287 markings, 16584466 edges, 813782 markings/sec, 5 secs
lola: 12270632 markings, 24611441 edges, 807669 markings/sec, 10 secs
lola: 16221809 markings, 32471030 edges, 790235 markings/sec, 15 secs
lola: 20107679 markings, 40204184 edges, 777174 markings/sec, 20 secs
lola: 23926044 markings, 47806586 edges, 763673 markings/sec, 25 secs
lola: 27693760 markings, 55307357 edges, 753543 markings/sec, 30 secs
lola: 31419591 markings, 62728764 edges, 745166 markings/sec, 35 secs
lola: 35175977 markings, 70209451 edges, 751277 markings/sec, 40 secs
lola: 38835828 markings, 77500675 edges, 731970 markings/sec, 45 secs
lola: 42459129 markings, 84719665 edges, 724660 markings/sec, 50 secs
lola: 46013643 markings, 91802438 edges, 710903 markings/sec, 55 secs
lola: 49602192 markings, 98954851 edges, 717710 markings/sec, 60 secs
lola: 53159043 markings, 106043116 edges, 711370 markings/sec, 65 secs
lola: 56635636 markings, 112972723 edges, 695319 markings/sec, 70 secs
lola: 60095941 markings, 119869373 edges, 692061 markings/sec, 75 secs
lola: 63491185 markings, 126637932 edges, 679049 markings/sec, 80 secs
lola: 66869760 markings, 133372602 edges, 675715 markings/sec, 85 secs
lola: 70185781 markings, 139984104 edges, 663204 markings/sec, 90 secs
lola: 73836080 markings, 147261679 edges, 730060 markings/sec, 95 secs
lola: 77389755 markings, 154348098 edges, 710735 markings/sec, 100 secs
lola: 80893812 markings, 161334919 edges, 700811 markings/sec, 105 secs
lola: 84325588 markings, 168176641 edges, 686355 markings/sec, 110 secs
lola: 87766927 markings, 175037245 edges, 688268 markings/sec, 115 secs
lola: 91131423 markings, 181747121 edges, 672899 markings/sec, 120 secs
lola: 94482177 markings, 188431737 edges, 670151 markings/sec, 125 secs
lola: 97767684 markings, 194982541 edges, 657101 markings/sec, 130 secs
lola: 101144778 markings, 201716421 edges, 675419 markings/sec, 135 secs
lola: 104508800 markings, 208427471 edges, 672804 markings/sec, 140 secs
lola: 107802956 markings, 214998067 edges, 658831 markings/sec, 145 secs
lola: 111094568 markings, 221563498 edges, 658322 markings/sec, 150 secs
lola: 114344769 markings, 228045724 edges, 650040 markings/sec, 155 secs
lola: 117054737 markings, 233450946 edges, 541994 markings/sec, 160 secs
lola: 118711625 markings, 236755282 edges, 331378 markings/sec, 165 secs
lola: 120772156 markings, 240868579 edges, 412106 markings/sec, 170 secs
lola: 123048863 markings, 245408145 edges, 455341 markings/sec, 175 secs
lola: 123487835 markings, 246283109 edges, 87794 markings/sec, 180 secs
lola: 123561320 markings, 246429882 edges, 14697 markings/sec, 185 secs
lola: 125338631 markings, 249975306 edges, 355462 markings/sec, 190 secs
lola: 126082219 markings, 251455884 edges, 148718 markings/sec, 195 secs
lola: 127673957 markings, 254633385 edges, 318348 markings/sec, 200 secs
lola: 128111558 markings, 255505401 edges, 87520 markings/sec, 205 secs
lola: 129527473 markings, 258331004 edges, 283183 markings/sec, 210 secs
lola: 129527473 markings, 258331004 edges, 0 markings/sec, 215 secs
lola: 130748955 markings, 260767831 edges, 244296 markings/sec, 220 secs
lola: 131383943 markings, 262034539 edges, 126998 markings/sec, 225 secs
lola: 132294729 markings, 263849402 edges, 182157 markings/sec, 230 secs
lola: 133082638 markings, 265422381 edges, 157582 markings/sec, 235 secs
lola: 133160158 markings, 265577355 edges, 15504 markings/sec, 240 secs
lola: 133160158 markings, 265577355 edges, 0 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 <= 0)))
lola: processed formula length: 17
lola: 63 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: subprocess 2 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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 (F (((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 41
lola: 63 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p2) AND (1 <= p5))) AND (X (F ((1 <= p3))) AND ((1 <= p4) AND ((1 <= p6) AND (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p2) AND (1 <= p5))) AND (X (F ((1 <= p3))) AND ((1 <= p4) AND ((1 <= p6) AND (p7 <= 0))))))
lola: processed formula length: 105
lola: 63 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p4 <= 0))) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p4 <= 0))) AND (1 <= p4)))
lola: processed formula length: 37
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2)))))) OR G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 367 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: 63 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: 4201985 markings, 9100446 edges, 840397 markings/sec, 0 secs
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: 6276196 markings, 13590235 edges
lola: ========================================
lola: subprocess 6 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 118
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3425301 markings, 8515412 edges, 685060 markings/sec, 0 secs
lola: 6677342 markings, 16619088 edges, 650408 markings/sec, 5 secs
lola: 9909222 markings, 24676697 edges, 646376 markings/sec, 10 secs
lola: 13073548 markings, 32568017 edges, 632865 markings/sec, 15 secs
lola: 16189939 markings, 40341388 edges, 623278 markings/sec, 20 secs
lola: 19235840 markings, 47939346 edges, 609180 markings/sec, 25 secs
lola: 22373129 markings, 55766709 edges, 627458 markings/sec, 30 secs
lola: 25425783 markings, 63383202 edges, 610531 markings/sec, 35 secs
lola: 28455907 markings, 70944603 edges, 606025 markings/sec, 40 secs
lola: 31439907 markings, 78391095 edges, 596800 markings/sec, 45 secs
lola: 34454967 markings, 85915928 edges, 603012 markings/sec, 50 secs
lola: 37414737 markings, 93302813 edges, 591954 markings/sec, 55 secs
lola: 40375570 markings, 100693473 edges, 592167 markings/sec, 60 secs
lola: 43291033 markings, 107969788 edges, 583093 markings/sec, 65 secs
lola: 46177931 markings, 115175752 edges, 577380 markings/sec, 70 secs
lola: 49291358 markings, 122948212 edges, 622685 markings/sec, 75 secs
lola: 52346500 markings, 130573954 edges, 611028 markings/sec, 80 secs
lola: 55348130 markings, 138067245 edges, 600326 markings/sec, 85 secs
lola: 58369715 markings, 145609970 edges, 604317 markings/sec, 90 secs
lola: 61333314 markings, 153009103 edges, 592720 markings/sec, 95 secs
lola: 64265792 markings, 160329902 edges, 586496 markings/sec, 100 secs
lola: 67259659 markings, 167803839 edges, 598773 markings/sec, 105 secs
lola: 70208458 markings, 175167028 edges, 589760 markings/sec, 110 secs
lola: 73149941 markings, 182509193 edges, 588297 markings/sec, 115 secs
lola: 76036724 markings, 189716184 edges, 577357 markings/sec, 120 secs
lola: 78970636 markings, 197042882 edges, 586782 markings/sec, 125 secs
lola: 81864962 markings, 204268372 edges, 578865 markings/sec, 130 secs
lola: 84698029 markings, 211342240 edges, 566613 markings/sec, 135 secs
lola: 86337935 markings, 215438157 edges, 327981 markings/sec, 140 secs
lola: 88420836 markings, 220637977 edges, 416580 markings/sec, 145 secs
lola: 89948570 markings, 224451880 edges, 305547 markings/sec, 150 secs
lola: 91657470 markings, 228718874 edges, 341780 markings/sec, 155 secs
lola: 92806472 markings, 231589650 edges, 229800 markings/sec, 160 secs
lola: 94530365 markings, 235893122 edges, 344779 markings/sec, 165 secs
lola: 96743512 markings, 241418200 edges, 442629 markings/sec, 170 secs
lola: 97232103 markings, 242638191 edges, 97718 markings/sec, 175 secs
lola: 99509146 markings, 248324473 edges, 455409 markings/sec, 180 secs
lola: 101796110 markings, 254035139 edges, 457393 markings/sec, 185 secs
lola: 102946918 markings, 256910111 edges, 230162 markings/sec, 190 secs
lola: 103795712 markings, 259029049 edges, 169759 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 6 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p2 <= 0) OR (p5 <= 0)) U G (((p1 <= 0) OR (p2 <= 0)))) AND X (((1 <= p2) AND (1 <= p5)))) U ((1 <= p5) AND (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p2 <= 0) OR (p5 <= 0)) U G (((p1 <= 0) OR (p2 <= 0)))) AND X (((1 <= p2) AND (1 <= p5)))) U ((1 <= p5) AND (1 <= p6)))
lola: processed formula length: 125
lola: 63 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: 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: subprocess 7 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p1) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p5)) U 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 ((G (((1 <= p1) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p5)) U X (G (((p2 <= 0) OR (p5 <= 0)))))))
lola: processed formula length: 103
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 3553695 markings, 8835082 edges, 710739 markings/sec, 0 secs
lola: 10792912 markings, 26880252 edges, 1447843 markings/sec, 5 secs
lola: 14079156 markings, 35075628 edges, 657249 markings/sec, 10 secs
lola: 18826360 markings, 46918026 edges, 949441 markings/sec, 15 secs
lola: 22066079 markings, 55000663 edges, 647944 markings/sec, 20 secs
lola: 25249509 markings, 62943344 edges, 636686 markings/sec, 25 secs
lola: 28401885 markings, 70809593 edges, 630475 markings/sec, 30 secs
lola: 31510576 markings, 78567952 edges, 621738 markings/sec, 35 secs
lola: 34644493 markings, 86388711 edges, 626783 markings/sec, 40 secs
lola: 37711101 markings, 94042986 edges, 613322 markings/sec, 45 secs
lola: 40798937 markings, 101749790 edges, 617567 markings/sec, 50 secs
lola: 43820556 markings, 109291610 edges, 604324 markings/sec, 55 secs
lola: 46877663 markings, 116921846 edges, 611421 markings/sec, 60 secs
lola: 50082034 markings, 124921519 edges, 640874 markings/sec, 65 secs
lola: 53253476 markings, 132838287 edges, 634288 markings/sec, 70 secs
lola: 56388478 markings, 140663473 edges, 627000 markings/sec, 75 secs
lola: 59482440 markings, 148389314 edges, 618792 markings/sec, 80 secs
lola: 62553703 markings, 156055276 edges, 614253 markings/sec, 85 secs
lola: 65591479 markings, 163639295 edges, 607555 markings/sec, 90 secs
lola: 68717379 markings, 171443620 edges, 625180 markings/sec, 95 secs
lola: 71771307 markings, 179067449 edges, 610786 markings/sec, 100 secs
lola: 74795992 markings, 186619663 edges, 604937 markings/sec, 105 secs
lola: 77811206 markings, 194148084 edges, 603043 markings/sec, 110 secs
lola: 80821672 markings, 201664083 edges, 602093 markings/sec, 115 secs
lola: 83803530 markings, 209108414 edges, 596372 markings/sec, 120 secs
lola: 85931641 markings, 214422792 edges, 425622 markings/sec, 125 secs
lola: 88070732 markings, 219764541 edges, 427818 markings/sec, 130 secs
lola: 89504974 markings, 223344154 edges, 286848 markings/sec, 135 secs
lola: 91072691 markings, 227260131 edges, 313543 markings/sec, 140 secs
lola: 93185908 markings, 232536683 edges, 422643 markings/sec, 145 secs
lola: 94828248 markings, 236637116 edges, 328468 markings/sec, 150 secs
lola: 96856670 markings, 241701214 edges, 405684 markings/sec, 155 secs
lola: 98596456 markings, 246045164 edges, 347957 markings/sec, 160 secs
lola: 100373915 markings, 250483551 edges, 355492 markings/sec, 165 secs
lola: 102589579 markings, 256015981 edges, 443133 markings/sec, 170 secs
lola: 104213878 markings, 260072987 edges, 324860 markings/sec, 175 secs
lola: 104321100 markings, 260341412 edges, 21444 markings/sec, 180 secs
lola: 104321151 markings, 260341565 edges, 10 markings/sec, 185 secs
lola: 104322865 markings, 260345850 edges, 343 markings/sec, 190 secs
lola: 104323526 markings, 260347507 edges, 132 markings/sec, 195 secslola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p7 <= 0))))
lola: processed formula length: 21
lola: 63 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: 10 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p3) AND (1 <= p8))) OR ((p2 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p3) AND (1 <= p8))) OR ((p2 <= 0) OR (p5 <= 0))))
lola: processed formula length: 63
lola: 63 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: 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: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p4)))
lola: processed formula length: 17
lola: 63 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 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: 8 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p1) AND (1 <= p2))))
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 <= p1) AND (1 <= p2))))
lola: processed formula length: 33
lola: 63 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: 4200953 markings, 9097864 edges, 840191 markings/sec, 0 secs
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: 6286435 markings, 13614802 edges
lola: ========================================
lola: subprocess 12 will run for 1423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((1 <= p3))) OR F ((1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((1 <= p3))) OR F ((1 <= p3))))
lola: processed formula length: 40
lola: 63 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 13 will run for 2846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) OR (G ((((1 <= p4) AND (1 <= p6)) OR (F (((1 <= p4) AND (1 <= p6))) AND F (G (((1 <= p3) AND ((1 <= p4) AND (1 <= p6)))))))) AND F ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) OR (G ((((1 <= p4) AND (1 <= p6)) OR (F (((1 <= p4) AND (1 <= p6))) AND F (G (((1 <= p3) AND ((1 <= p4) AND (1 <= p6)))))))) AND F ((1 <= p4)))))
lola: processed formula length: 159
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((X ((1 <= p8)) OR (1 <= p7)))) AND (F ((1 <= p4)) AND ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((X ((1 <= p8)) OR (1 <= p7)))) AND (F ((1 <= p4)) AND ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 96
lola: 63 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: 4161236 markings, 8500497 edges, 832247 markings/sec, 0 secs
lola: 8217289 markings, 16554408 edges, 811211 markings/sec, 5 secs
lola: 12250187 markings, 24570445 edges, 806580 markings/sec, 10 secs
lola: 16195641 markings, 32420239 edges, 789091 markings/sec, 15 secs
lola: 20090318 markings, 40169282 edges, 778935 markings/sec, 20 secs
lola: 23913485 markings, 47781371 edges, 764633 markings/sec, 25 secs
lola: 27680176 markings, 55280143 edges, 753338 markings/sec, 30 secs
lola: 31414740 markings, 62718929 edges, 746913 markings/sec, 35 secs
lola: 35216332 markings, 70290449 edges, 760318 markings/sec, 40 secs
lola: 38914565 markings, 77658119 edges, 739647 markings/sec, 45 secs
lola: 42567614 markings, 84936580 edges, 730610 markings/sec, 50 secs
lola: 46140272 markings, 92055426 edges, 714532 markings/sec, 55 secs
lola: 49765241 markings, 99278572 edges, 724994 markings/sec, 60 secs
lola: 53330475 markings, 106386113 edges, 713047 markings/sec, 65 secs
lola: 59725369 markings, 119130518 edges, 1278979 markings/sec, 70 secs
lola: 63164240 markings, 125986331 edges, 687774 markings/sec, 75 secs
lola: 66566824 markings, 132769252 edges, 680517 markings/sec, 80 secs
lola: 69879991 markings, 139375342 edges, 662633 markings/sec, 85 secs
lola: 73594685 markings, 146781546 edges, 742939 markings/sec, 90 secs
lola: 77193804 markings, 153956204 edges, 719824 markings/sec, 95 secs
lola: 80765107 markings, 161077523 edges, 714261 markings/sec, 100 secs
lola: 84263056 markings, 168051725 edges, 699590 markings/sec, 105 secs
lola: 87752836 markings, 175012159 edges, 697956 markings/sec, 110 secs
lola: 91173781 markings, 181831837 edges, 684189 markings/sec, 115 secs
lola: 94568952 markings, 188602180 edges, 679034 markings/sec, 120 secs
lola: 97872383 markings, 195192276 edges, 660686 markings/sec, 125 secs
lola: 101305273 markings, 202037559 edges, 686578 markings/sec, 130 secs
lola: 104721734 markings, 208850330 edges, 683292 markings/sec, 135 secs
lola: 108064980 markings, 215519116 edges, 668649 markings/sec, 140 secs
lola: 111386819 markings, 222145012 edges, 664368 markings/sec, 145 secs
lola: 114680862 markings, 228714907 edges, 658809 markings/sec, 150 secs
lola: 117739729 markings, 234818200 edges, 611773 markings/sec, 155 secs
lola: 118803636 markings, 236939012 edges, 212781 markings/sec, 160 secs
lola: 120866585 markings, 241052700 edges, 412590 markings/sec, 165 secs
lola: 122031160 markings, 243375567 edges, 232915 markings/sec, 170 secs
lola: 124287602 markings, 247876199 edges, 451288 markings/sec, 175 secs
lola: 126244750 markings, 251781093 edges, 391430 markings/sec, 180 secs
lola: 128426432 markings, 256135321 edges, 436336 markings/sec, 185 secs
lola: 131031187 markings, 261328717 edges, 520951 markings/sec, 190 secs
lola: 132658280 markings, 264576975 edges, 325419 markings/sec, 195 secs
lola: 134857316 markings, 268961929 edges, 439807 markings/sec, 200 secs
lola: 136943761 markings, 273125516 edges, 417289 markings/sec, 205 secs
lola: 139151820 markings, 277528713 edges, 441612 markings/sec, 210 secs
lola: 141414103 markings, 282043538 edges, 452457 markings/sec, 215 secs
lola: 143060272 markings, 285326103 edges, 329234 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2)))))) OR G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
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: 63 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: 4253060 markings, 9211294 edges, 850612 markings/sec, 0 secs
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: 6276196 markings, 13590235 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p1) AND (1 <= p2))) AND (((1 <= p4) U X (((1 <= p1) AND (1 <= p2)))) OR ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 118
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3429400 markings, 8525690 edges, 685880 markings/sec, 0 secs
lola: 6681481 markings, 16629469 edges, 650416 markings/sec, 5 secs
lola: 9918506 markings, 24699986 edges, 647405 markings/sec, 10 secs
lola: 13084954 markings, 32596574 edges, 633290 markings/sec, 15 secs
lola: 16206868 markings, 40383952 edges, 624383 markings/sec, 20 secs
lola: 19257110 markings, 47992577 edges, 610048 markings/sec, 25 secs
lola: 22400493 markings, 55835077 edges, 628677 markings/sec, 30 secs
lola: 25460531 markings, 63470172 edges, 612008 markings/sec, 35 secs
lola: 28492587 markings, 71036386 edges, 606411 markings/sec, 40 secs
lola: 31487454 markings, 78510027 edges, 598973 markings/sec, 45 secs
lola: 34506800 markings, 86045604 edges, 603869 markings/sec, 50 secs
lola: 37474575 markings, 93452672 edges, 593555 markings/sec, 55 secs
lola: 40446081 markings, 100868388 edges, 594301 markings/sec, 60 secs
lola: 43367205 markings, 108160510 edges, 584225 markings/sec, 65 secs
lola: 46267342 markings, 115399660 edges, 580027 markings/sec, 70 secs
lola: 49387856 markings, 123187916 edges, 624103 markings/sec, 75 secs
lola: 52437855 markings, 130802680 edges, 610000 markings/sec, 80 secs
lola: 55453926 markings, 138332264 edges, 603214 markings/sec, 85 secs
lola: 58474101 markings, 145871280 edges, 604035 markings/sec, 90 secs
lola: 61448593 markings, 153295785 edges, 594898 markings/sec, 95 secs
lola: 64378779 markings, 160610793 edges, 586037 markings/sec, 100 secs
lola: 67378230 markings, 168100680 edges, 599890 markings/sec, 105 secs
lola: 70336138 markings, 175484299 edges, 591582 markings/sec, 110 secs
lola: 73273753 markings, 182818868 edges, 587523 markings/sec, 115 secs
lola: 76164547 markings, 190035890 edges, 578159 markings/sec, 120 secs
lola: 79102452 markings, 197370818 edges, 587581 markings/sec, 125 secs
lola: 81990300 markings, 204581990 edges, 577570 markings/sec, 130 secs
lola: 84388610 markings, 210573151 edges, 479662 markings/sec, 135 secs
lola: 86026000 markings, 214663853 edges, 327478 markings/sec, 140 secs
lola: 88655484 markings, 221225524 edges, 525897 markings/sec, 145 secs
lola: 90953131 markings, 226960942 edges, 459529 markings/sec, 150 secs
lola: 92208552 markings, 230095552 edges, 251084 markings/sec, 155 secs
lola: 93990941 markings, 234546505 edges, 356478 markings/sec, 160 secs
lola: 95690514 markings, 238789975 edges, 339915 markings/sec, 165 secs
lola: 97087978 markings, 242279967 edges, 279493 markings/sec, 170 secs
lola: 98220347 markings, 245106503 edges, 226474 markings/sec, 175 secs
lola: 99397633 markings, 248045449 edges, 235457 markings/sec, 180 secs
lola: 100335617 markings, 250387683 edges, 187597 markings/sec, 185 secs
lola: 102387200 markings, 255511724 edges, 410317 markings/sec, 190 secs
lola: 102387200 markings, 255511724 edges, 0 markings/sec, 195 secs
lola: 104247335 markings, 260156827 edges, 372027 markings/sec, 200 secs
lola: 104247397 markings, 260156950 edges, 12 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p1) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p5)) U 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 ((G (((1 <= p1) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p5)) U X (G (((p2 <= 0) OR (p5 <= 0)))))))
lola: processed formula length: 103
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 3543496 markings, 8810230 edges, 708699 markings/sec, 0 secs
lola: 8027592 markings, 19985243 edges, 896819 markings/sec, 5 secs
lola: 11331292 markings, 28223158 edges, 660740 markings/sec, 10 secs
lola: 14617564 markings, 36418950 edges, 657254 markings/sec, 15 secs
lola: 17830260 markings, 44433267 edges, 642539 markings/sec, 20 secs
lola: 21040316 markings, 52440984 edges, 642011 markings/sec, 25 secs
lola: 24244123 markings, 60435048 edges, 640761 markings/sec, 30 secs
lola: 27404054 markings, 68320581 edges, 631986 markings/sec, 35 secs
lola: 30507961 markings, 76066091 edges, 620781 markings/sec, 40 secs
lola: 33659226 markings, 83930407 edges, 630253 markings/sec, 45 secs
lola: 36754685 markings, 91655828 edges, 619092 markings/sec, 50 secs
lola: 39822385 markings, 99312393 edges, 613540 markings/sec, 55 secs
lola: 42863316 markings, 106902796 edges, 608186 markings/sec, 60 secs
lola: 45852023 markings, 114361885 edges, 597741 markings/sec, 65 secs
lola: 49069282 markings, 122392493 edges, 643452 markings/sec, 70 secs
lola: 52350887 markings, 130584952 edges, 656321 markings/sec, 75 secs
lola: 55477596 markings, 138389372 edges, 625342 markings/sec, 80 secs
lola: 58604511 markings, 146195699 edges, 625383 markings/sec, 85 secs
lola: 61677113 markings, 153867498 edges, 614520 markings/sec, 90 secs
lola: 64702648 markings, 161419170 edges, 605107 markings/sec, 95 secs
lola: 67824028 markings, 169212197 edges, 624276 markings/sec, 100 secs
lola: 70871676 markings, 176822345 edges, 609530 markings/sec, 105 secs
lola: 73920413 markings, 184432851 edges, 609747 markings/sec, 110 secs
lola: 76909987 markings, 191897048 edges, 597915 markings/sec, 115 secs
lola: 79950686 markings, 199488948 edges, 608140 markings/sec, 120 secs
lola: 82912747 markings, 206885906 edges, 592412 markings/sec, 125 secs
lola: 85520080 markings, 213395698 edges, 521467 markings/sec, 130 secs
lola: 87301815 markings, 217845426 edges, 356347 markings/sec, 135 secs
lola: 89542354 markings, 223438349 edges, 448108 markings/sec, 140 secs
lola: 90740260 markings, 226428382 edges, 239581 markings/sec, 145 secs
lola: 92771031 markings, 231500814 edges, 406154 markings/sec, 150 secs
lola: 93371496 markings, 232998895 edges, 120093 markings/sec, 155 secs
lola: 95165169 markings, 237477834 edges, 358735 markings/sec, 160 secs
lola: 96876254 markings, 241750243 edges, 342217 markings/sec, 165 secs
lola: 96995839 markings, 242049304 edges, 23917 markings/sec, 170 secs
lola: 99611354 markings, 248579960 edges, 523103 markings/sec, 175 secs
lola: 102156787 markings, 254935182 edges, 509087 markings/sec, 180 secs
lola: 102326396 markings, 255359694 edges, 33922 markings/sec, 185 secs
lola: 102326396 markings, 255359694 edges, 0 markings/sec, 190 secs
lola: 104196925 markings, 260030561 edges, 374106 markings/sec, 195 secs
lola: 104196957 markings, 260030660 edges, 6 markings/sec, 200 secs
lola: 104335286 markings, 260377017 edges, 27666 markings/sec, 205 secs
lola: 104344590 markings, 260400424 edges, 1861 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no yes no no no no no unknown no unknown no yes
lola:
preliminary result: unknown no no yes no no no no no unknown no unknown no yes
lola: memory consumption: 2884 KB
lola: time consumption: 1437 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-MT2048DC1024"
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-MT2048DC1024, 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-162106800300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT2048DC1024.tgz
mv SmallOperatingSystem-PT-MT2048DC1024 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 ;