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.r132-tall-162075428600378.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 MAPK-PT-01280, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620936494271

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:08:15] [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-13 20:08:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:08:15] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 20:08:15] [INFO ] Transformed 22 places.
[2021-05-13 20:08:15] [INFO ] Transformed 30 transitions.
[2021-05-13 20:08:15] [INFO ] Parsed PT model containing 22 places and 30 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 97169 steps, including 0 resets, run visited all 22 properties in 84 ms. (steps per millisecond=1156 )
[2021-05-13 20:08:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 20:08:16] [INFO ] Flatten gal took : 32 ms
FORMULA MAPK-PT-01280-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:08:16] [INFO ] Flatten gal took : 5 ms
[2021-05-13 20:08:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 20:08:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPK-PT-01280 @ 3570 seconds

FORMULA MAPK-PT-01280-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2807
rslt: Output for LTLFireability @ MAPK-PT-01280

{
"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": "Thu May 13 20:08:19 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p20) AND (1 <= p21)) U X (F ((X (G (((1 <= p20) AND (1 <= p21)))) OR (p19 <= 0)))))",
"processed_size": 91,
"rewrites": 99
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X ((X (((p2 <= 0) OR (p16 <= 0))) R ((p2 <= 0) OR (p16 <= 0)))) AND (X (G (((p2 <= 0) OR (p16 <= 0)))) OR G (F (((p9 <= 0) OR (p11 <= 0))))))))",
"processed_size": 154,
"rewrites": 99
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 421
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p13 <= 0)))",
"processed_size": 18,
"rewrites": 99
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X ((1 <= p14)) U ((1 <= p6) AND (1 <= p9)))",
"processed_size": 44,
"rewrites": 99
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p3) AND (1 <= p16))",
"processed_size": 26,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 843
},
"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 (((p8 <= 0) OR (p10 <= 0)))",
"processed_size": 30,
"rewrites": 99
},
"result":
{
"edges": 7685,
"markings": 5764,
"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": 1125
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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 (((1 <= p8) AND (1 <= p10))))",
"processed_size": 34,
"rewrites": 99
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "G ((F ((1 <= p18)) OR (1 <= p18)))",
"processed_size": 34,
"rewrites": 99
},
"result":
{
"edges": 2562,
"markings": 2562,
"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": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p12)))",
"processed_size": 18,
"rewrites": 99
},
"result":
{
"edges": 2564,
"markings": 2563,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((F (G ((1 <= p12))) OR (1 <= p13)))",
"processed_size": 38,
"rewrites": 99
},
"result":
{
"edges": 2564,
"markings": 2563,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3280,
"runtime": 763.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(((G(*) R *) R X(F((X(*) AND *))))) OR **) : (** U X(F((X(G(**)) OR **)))) : X(G((X((X(*) R *)) AND (X(G(*)) OR G(F(*)))))) : X(X(G(*))) : (F(G(**)) OR (** OR (G(F(**)) AND F((F(G(**)) OR **))))) : X(F(*)) : (X(**) U **) : (F(**) OR (G(*) OR (X(X(**)) OR **))) : (X(G((** AND G(**)))) U **) : X(X(F((G(*) AND F(**))))) : (X((G(*) AND (** AND **))) OR (** OR (G((F(**) OR **)) AND F((X((G(*) AND (** AND **))) OR **))))) : (F(G((F(*) AND X(**)))) OR **)"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no yes no unknown no yes no no no unknown no no ",
"value": "no yes no unknown no yes no no no unknown no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: (G (NOT(((F ((1 <= p19)) U (1 <= p19)) U X (G ((X ((1 <= p18)) OR (1 <= p1))))))) OR (1 <= p19)) : (((1 <= p20) AND (1 <= p21)) U F (X (((1 <= p19) U (X (G (((1 <= p20) AND (1 <= p21)))) OR (p19 <= 0)))))) : G (NOT(X ((F (G (X (X (X (((1 <= p9) AND (1 <= p11))))))) U X ((X (((1 <= p2) AND (1 <= p16))) U ((1 <= p2) AND (1 <= p16)))))))) : X (G (NOT(X (((1 <= p7) AND (1 <= p8)))))) : ((NOT(G (((1 <= p7) AND (1 <= p15)))) U G (F ((p12 <= 0)))) U (G (F (G ((1 <= p12)))) OR (1 <= p13))) : X (NOT(G ((1 <= p13)))) : (X ((1 <= p14)) U ((1 <= p6) AND (1 <= p9))) : (((F ((X (((1 <= p8) AND (1 <= p10))) U (1 <= p14))) OR NOT(F (((1 <= p8) AND (1 <= p10))))) OR X (X (((1 <= p8) AND (1 <= p10))))) OR ((1 <= p3) AND (1 <= p16))) : (G (X (((p1 <= 0) AND G ((1 <= p1))))) U (1 <= p1)) : F (NOT(X (G (X ((NOT(G (NOT(F ((1 <= p1))))) OR NOT(F ((p14 <= 0))))))))) : (G ((F ((1 <= p18)) OR (1 <= p18))) U (X (((NOT(F ((1 <= p18))) AND (1 <= p7)) AND (1 <= p15))) OR (1 <= p18))) : (F (NOT(G (X (F ((NOT(F (NOT(G ((1 <= p19))))) OR NOT(X (((1 <= p9) AND (1 <= p11)))))))))) OR (1 <= p13))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((G ((p19 <= 0)) R (p19 <= 0)) R X (F ((X ((p18 <= 0)) AND (p1 <= 0)))))) OR (1 <= p19))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p19)
lola: processed formula length: 10
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p19 <= 0)) R (p19 <= 0)) R X (F ((X ((p18 <= 0)) AND (p1 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p19 <= 0)) R (p19 <= 0)) R X (F ((X ((p18 <= 0)) AND (p1 <= 0))))))
lola: processed formula length: 76
lola: 99 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: 15 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p20) AND (1 <= p21)) U X (F ((X (G (((1 <= p20) AND (1 <= p21)))) OR (p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p20) AND (1 <= p21)) U X (F ((X (G (((1 <= p20) AND (1 <= p21)))) OR (p19 <= 0)))))
lola: processed formula length: 91
lola: 99 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: 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((X (((p2 <= 0) OR (p16 <= 0))) R ((p2 <= 0) OR (p16 <= 0)))) AND (X (G (((p2 <= 0) OR (p16 <= 0)))) OR G (F (((p9 <= 0) OR (p11 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((X (((p2 <= 0) OR (p16 <= 0))) R ((p2 <= 0) OR (p16 <= 0)))) AND (X (G (((p2 <= 0) OR (p16 <= 0)))) OR G (F (((p9 <= 0) OR (p11 <= 0))))))))
lola: processed formula length: 154
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p7 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p7 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 37
lola: 99 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: 3079907 markings, 5546533 edges, 615981 markings/sec, 0 secs
lola: 6141797 markings, 12058303 edges, 612378 markings/sec, 5 secs
lola: 9469775 markings, 20330471 edges, 665596 markings/sec, 10 secs
lola: 12752453 markings, 28503477 edges, 656536 markings/sec, 15 secs
lola: 16014411 markings, 36630445 edges, 652392 markings/sec, 20 secs
lola: 19222003 markings, 44625034 edges, 641518 markings/sec, 25 secs
lola: 22426494 markings, 52613849 edges, 640898 markings/sec, 30 secs
lola: 25623451 markings, 60586790 edges, 639391 markings/sec, 35 secs
lola: 28770345 markings, 68436150 edges, 629379 markings/sec, 40 secs
lola: 31922205 markings, 76296527 edges, 630372 markings/sec, 45 secs
lola: 35016155 markings, 84015668 edges, 618790 markings/sec, 50 secs
lola: 38117400 markings, 91752375 edges, 620249 markings/sec, 55 secs
lola: 41184302 markings, 99403756 edges, 613380 markings/sec, 60 secs
lola: 44354776 markings, 107315839 edges, 634095 markings/sec, 65 secs
lola: 47469512 markings, 115087435 edges, 622947 markings/sec, 70 secs
lola: 50559185 markings, 122797764 edges, 617935 markings/sec, 75 secs
lola: 53573450 markings, 130320253 edges, 602853 markings/sec, 80 secs
lola: 56698220 markings, 138119044 edges, 624954 markings/sec, 85 secs
lola: 59785997 markings, 145824826 edges, 617555 markings/sec, 90 secs
lola: 62873229 markings, 153530461 edges, 617446 markings/sec, 95 secs
lola: 65945573 markings, 161198737 edges, 614469 markings/sec, 100 secs
lola: 69006718 markings, 168840111 edges, 612229 markings/sec, 105 secs
lola: 72205906 markings, 176825105 edges, 639838 markings/sec, 110 secs
lola: 75364805 markings, 184710683 edges, 631780 markings/sec, 115 secs
lola: 78046986 markings, 191406484 edges, 536436 markings/sec, 120 secs
lola: 79420144 markings, 194834377 edges, 274632 markings/sec, 125 secs
lola: 80656376 markings, 197923972 edges, 247246 markings/sec, 130 secs
lola: 82445408 markings, 202385040 edges, 357806 markings/sec, 135 secs
lola: 83674476 markings, 205453849 edges, 245814 markings/sec, 140 secs
lola: 85865178 markings, 210922490 edges, 438140 markings/sec, 145 secs
lola: 87622227 markings, 215309108 edges, 351410 markings/sec, 150 secs
lola: 89193033 markings, 219229922 edges, 314161 markings/sec, 155 secs
lola: 91302701 markings, 224497103 edges, 421934 markings/sec, 160 secs
lola: 93460043 markings, 229881771 edges, 431468 markings/sec, 165 secs
lola: 95092225 markings, 233957593 edges, 326436 markings/sec, 170 secs
lola: 95397351 markings, 234719473 edges, 61025 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p13 <= 0)))
lola: processed formula length: 18
lola: 99 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: 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 5 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p14)) U ((1 <= p6) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((1 <= p14)) U ((1 <= p6) AND (1 <= p9)))
lola: processed formula length: 44
lola: 99 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 6 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p14)) OR (G (((p8 <= 0) OR (p10 <= 0))) OR (X (X (((1 <= p8) AND (1 <= p10)))) OR ((1 <= p3) AND (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p16))
lola: processed formula length: 26
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p14))
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: (p14 <= 0)
lola: processed formula length: 10
lola: 101 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: 2562 markings, 2562 edges
lola: ========================================
lola: subprocess 8 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p8 <= 0) OR (p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p8 <= 0) OR (p10 <= 0)))
lola: processed formula length: 30
lola: 99 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: 5764 markings, 7685 edges
lola: ========================================
lola: subprocess 9 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p8) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p8) AND (1 <= p10))))
lola: processed formula length: 34
lola: 99 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p1 <= 0) AND G ((1 <= p1))))) U (1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p1 <= 0) AND G ((1 <= p1))))) U (1 <= p1))
lola: processed formula length: 51
lola: 99 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((p1 <= 0)) AND F ((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((p1 <= 0)) AND F ((p14 <= 0))))))
lola: processed formula length: 46
lola: 99 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: 3155168 markings, 5682085 edges, 631034 markings/sec, 0 secs
lola: 6267689 markings, 12370940 edges, 622504 markings/sec, 5 secs
lola: 9702210 markings, 20908124 edges, 686904 markings/sec, 10 secs
lola: 13023533 markings, 29179035 edges, 664265 markings/sec, 15 secs
lola: 16307496 markings, 37360557 edges, 656793 markings/sec, 20 secs
lola: 19562287 markings, 45473220 edges, 650958 markings/sec, 25 secs
lola: 22855513 markings, 53684209 edges, 658645 markings/sec, 30 secs
lola: 26147521 markings, 61893427 edges, 658402 markings/sec, 35 secs
lola: 29368364 markings, 69927628 edges, 644169 markings/sec, 40 secs
lola: 32630974 markings, 78065174 edges, 652522 markings/sec, 45 secs
lola: 35857640 markings, 86114895 edges, 645333 markings/sec, 50 secs
lola: 39048658 markings, 94076089 edges, 638204 markings/sec, 55 secs
lola: 42262221 markings, 102094661 edges, 642713 markings/sec, 60 secs
lola: 45498872 markings, 110170352 edges, 647330 markings/sec, 65 secs
lola: 48700259 markings, 118158840 edges, 640277 markings/sec, 70 secs
lola: 51865289 markings, 126057529 edges, 633006 markings/sec, 75 secs
lola: 55040969 markings, 133982089 edges, 635136 markings/sec, 80 secs
lola: 58216515 markings, 141907828 edges, 635109 markings/sec, 85 secs
lola: 61367785 markings, 149774032 edges, 630254 markings/sec, 90 secs
lola: 64528019 markings, 157660802 edges, 632047 markings/sec, 95 secs
lola: 67635877 markings, 165417486 edges, 621572 markings/sec, 100 secs
lola: 70897490 markings, 173559052 edges, 652323 markings/sec, 105 secs
lola: 74144968 markings, 181666151 edges, 649496 markings/sec, 110 secs
lola: 77259922 markings, 189445352 edges, 622991 markings/sec, 115 secs
lola: 79100542 markings, 194036250 edges, 368124 markings/sec, 120 secs
lola: 80540724 markings, 197630080 edges, 288036 markings/sec, 125 secs
lola: 81953746 markings, 201157982 edges, 282604 markings/sec, 130 secs
lola: 82120384 markings, 201574834 edges, 33328 markings/sec, 135 secs
lola: 84849051 markings, 208386364 edges, 545733 markings/sec, 140 secs
lola: 85630299 markings, 210336543 edges, 156250 markings/sec, 145 secs
lola: 88016682 markings, 216292979 edges, 477277 markings/sec, 150 secs
lola: 88628501 markings, 217820642 edges, 122364 markings/sec, 155 secs
lola: 90587749 markings, 222711417 edges, 391850 markings/sec, 160 secs
lola: 92367062 markings, 227153735 edges, 355863 markings/sec, 165 secs
lola: 93860531 markings, 230882452 edges, 298694 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((p18 <= 0)) AND ((1 <= p7) AND (1 <= p15)))) OR ((1 <= p18) OR (G ((F ((1 <= p18)) OR (1 <= p18))) AND F ((X ((G ((p18 <= 0)) AND ((1 <= p7) AND (1 <= p15)))) OR (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p18)
lola: processed formula length: 10
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p18)) OR (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p18)) OR (1 <= p18)))
lola: processed formula length: 34
lola: 99 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: 2562 markings, 2562 edges
lola: ========================================
lola: subprocess 11 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p18 <= 0)) AND ((1 <= p7) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p18 <= 0)) AND ((1 <= p7) AND (1 <= p15))))
lola: processed formula length: 51
lola: 99 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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((p19 <= 0)) AND X (((1 <= p9) AND (1 <= p11)))))) OR (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p19 <= 0)) AND X (((1 <= p9) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p19 <= 0)) AND X (((1 <= p9) AND (1 <= p11))))))
lola: processed formula length: 59
lola: 99 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: add low 29
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, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p12))) OR ((1 <= p13) OR (G (F ((p12 <= 0))) AND F ((F (G ((1 <= p12))) OR (1 <= p13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p12)))
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 <= p12)))
lola: processed formula length: 18
lola: 99 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 12
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: 2563 markings, 2564 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((1 <= p12))) OR (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((1 <= p12))) OR (1 <= p13)))
lola: processed formula length: 38
lola: 99 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 12
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: 2563 markings, 2564 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G (((p7 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p7 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 37
lola: 99 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: 3133180 markings, 5642950 edges, 626636 markings/sec, 0 secs
lola: 6111686 markings, 11983894 edges, 595701 markings/sec, 5 secs
lola: 9416658 markings, 20197311 edges, 660994 markings/sec, 10 secs
lola: 12676386 markings, 28312896 edges, 651946 markings/sec, 15 secs
lola: 15906765 markings, 36362168 edges, 646076 markings/sec, 20 secs
lola: 19087000 markings, 44288279 edges, 636047 markings/sec, 25 secs
lola: 22286079 markings, 52263856 edges, 639816 markings/sec, 30 secs
lola: 25487666 markings, 60248322 edges, 640317 markings/sec, 35 secs
lola: 28637091 markings, 68102184 edges, 629885 markings/sec, 40 secs
lola: 31806499 markings, 76008248 edges, 633882 markings/sec, 45 secs
lola: 34935008 markings, 83812532 edges, 625702 markings/sec, 50 secs
lola: 38065682 markings, 91622932 edges, 626135 markings/sec, 55 secs
lola: 41165216 markings, 99357653 edges, 619907 markings/sec, 60 secs
lola: 44345816 markings, 107293430 edges, 636120 markings/sec, 65 secs
lola: 47468750 markings, 115085555 edges, 624587 markings/sec, 70 secs
lola: 50584125 markings, 122860124 edges, 623075 markings/sec, 75 secs
lola: 53634621 markings, 130473300 edges, 610099 markings/sec, 80 secs
lola: 56785880 markings, 138338362 edges, 630252 markings/sec, 85 secs
lola: 59869680 markings, 146034224 edges, 616760 markings/sec, 90 secs
lola: 62965792 markings, 153762266 edges, 619222 markings/sec, 95 secs
lola: 66023046 markings, 161392502 edges, 611451 markings/sec, 100 secs
lola: 69072091 markings, 169003650 edges, 609809 markings/sec, 105 secs
lola: 72272249 markings, 176991125 edges, 640032 markings/sec, 110 secs
lola: 75423703 markings, 184858162 edges, 630291 markings/sec, 115 secs
lola: 77900647 markings, 191040848 edges, 495389 markings/sec, 120 secs
lola: 79831041 markings, 195867542 edges, 386079 markings/sec, 125 secs
lola: 81275003 markings, 199464512 edges, 288792 markings/sec, 130 secs
lola: 82752320 markings, 203151170 edges, 295463 markings/sec, 135 secs
lola: 84276962 markings, 206958114 edges, 304928 markings/sec, 140 secs
lola: 85909994 markings, 211034685 edges, 326606 markings/sec, 145 secs
lola: 87511315 markings, 215031685 edges, 320264 markings/sec, 150 secs
lola: 89213510 markings, 219281064 edges, 340439 markings/sec, 155 secs
lola: 91365377 markings, 224653987 edges, 430373 markings/sec, 160 secs
lola: 93213288 markings, 229266159 edges, 369582 markings/sec, 165 secs
lola: 94999963 markings, 233726712 edges, 357335 markings/sec, 170 secs
lola: 95191083 markings, 234204880 edges, 38224 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((p1 <= 0)) AND F ((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((p1 <= 0)) AND F ((p14 <= 0))))))
lola: processed formula length: 46
lola: 99 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: 3002970 markings, 5407628 edges, 600594 markings/sec, 0 secs
lola: 5695681 markings, 10953084 edges, 538542 markings/sec, 5 secs
lola: 8989111 markings, 19134392 edges, 658686 markings/sec, 10 secs
lola: 12264745 markings, 27287918 edges, 655127 markings/sec, 15 secs
lola: 15507817 markings, 35368321 edges, 648614 markings/sec, 20 secs
lola: 18714616 markings, 43359681 edges, 641360 markings/sec, 25 secs
lola: 21901534 markings, 51304892 edges, 637384 markings/sec, 30 secs
lola: 25102009 markings, 59286888 edges, 640095 markings/sec, 35 secs
lola: 28284199 markings, 67223157 edges, 636438 markings/sec, 40 secs
lola: 31439881 markings, 75093285 edges, 631136 markings/sec, 45 secs
lola: 34561926 markings, 82883202 edges, 624409 markings/sec, 50 secs
lola: 37659111 markings, 90609745 edges, 619437 markings/sec, 55 secs
lola: 40723698 markings, 98255546 edges, 612917 markings/sec, 60 secs
lola: 43910299 markings, 106206218 edges, 637320 markings/sec, 65 secs
lola: 47038670 markings, 114012136 edges, 625674 markings/sec, 70 secs
lola: 50162456 markings, 121807880 edges, 624757 markings/sec, 75 secs
lola: 53227607 markings, 129457827 edges, 613030 markings/sec, 80 secs
lola: 56360893 markings, 137276174 edges, 626657 markings/sec, 85 secs
lola: 59451170 markings, 144990036 edges, 618055 markings/sec, 90 secs
lola: 62550576 markings, 152724778 edges, 619881 markings/sec, 95 secs
lola: 65615904 markings, 160376812 edges, 613066 markings/sec, 100 secs
lola: 68648764 markings, 167945906 edges, 606572 markings/sec, 105 secs
lola: 71876184 markings, 176001664 edges, 645484 markings/sec, 110 secs
lola: 75028992 markings, 183872037 edges, 630562 markings/sec, 115 secs
lola: 78039591 markings, 191389135 edges, 602120 markings/sec, 120 secs
lola: 79064093 markings, 193948180 edges, 204900 markings/sec, 125 secs
lola: 80805815 markings, 198292846 edges, 348344 markings/sec, 130 secs
lola: 81913186 markings, 201058097 edges, 221474 markings/sec, 135 secs
lola: 84639190 markings, 207882956 edges, 545201 markings/sec, 140 secs
lola: 87519322 markings, 215051791 edges, 576026 markings/sec, 145 secs
lola: 88357170 markings, 217143285 edges, 167570 markings/sec, 150 secs
lola: 90732029 markings, 223072577 edges, 474972 markings/sec, 155 secs
lola: 91732984 markings, 225570324 edges, 200191 markings/sec, 160 secs
lola: 93891045 markings, 230958732 edges, 431612 markings/sec, 165 secs
lola: 94916112 markings, 233517033 edges, 205013 markings/sec, 170 secs
lola: 95434125 markings, 234811494 edges, 103603 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no yes no no no unknown no no
lola:
preliminary result: no yes no unknown no yes no no no unknown no no
lola: memory consumption: 3280 KB
lola: time consumption: 763 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="MAPK-PT-01280"
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 MAPK-PT-01280, 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 r132-tall-162075428600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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