Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852600066.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is MAPK-PT-02560, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852600066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K Mar 24 05:37 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-02560-00
FORMULA_NAME MAPK-PT-02560-01
FORMULA_NAME MAPK-PT-02560-02
FORMULA_NAME MAPK-PT-02560-03
FORMULA_NAME MAPK-PT-02560-04
FORMULA_NAME MAPK-PT-02560-05
FORMULA_NAME MAPK-PT-02560-06
FORMULA_NAME MAPK-PT-02560-07
FORMULA_NAME MAPK-PT-02560-08
FORMULA_NAME MAPK-PT-02560-09
FORMULA_NAME MAPK-PT-02560-10
FORMULA_NAME MAPK-PT-02560-11
FORMULA_NAME MAPK-PT-02560-12
FORMULA_NAME MAPK-PT-02560-13
FORMULA_NAME MAPK-PT-02560-14
FORMULA_NAME MAPK-PT-02560-15

=== Now, execution of the tool begins

BK_START 1591129704545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:26] [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]
[2020-06-02 20:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:26] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-02 20:28:26] [INFO ] Transformed 22 places.
[2020-06-02 20:28:26] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:26] [INFO ] Parsed PT model containing 22 places and 30 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100581 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=1571 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:26] [INFO ] Computed 7 place invariants in 4 ms
[2020-06-02 20:28:26] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned sat
[2020-06-02 20:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-02 20:28:27] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2020-06-02 20:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-02 20:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:27] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-02 20:28:27] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:27] [INFO ] Added : 26 causal constraints over 6 iterations in 50 ms. Result :sat
[2020-06-02 20:28:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:28:27] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:27] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:27] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-02 20:28:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:28:27] [INFO ] Flatten gal took : 30 ms
FORMULA MAPK-PT-02560-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:27] [INFO ] Flatten gal took : 8 ms
[2020-06-02 20:28:27] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-02 20:28:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPK-PT-02560 @ 3570 seconds

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

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

FORMULA MAPK-PT-02560-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA MAPK-PT-02560-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA MAPK-PT-02560-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2343
rslt: Output for LTLFireability @ MAPK-PT-02560

{
"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": "Tue Jun 2 20:28:27 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((1 <= p1)) AND (G ((p5 <= 0)) AND ((1 <= p8) AND (1 <= p10))))))",
"processed_size": 74,
"rewrites": 80
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 254
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 2,
"visible_transitions": 0
},
"processed": "((1 <= p10) AND (1 <= p16))",
"processed_size": 27,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"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": "(p17 <= 0)",
"processed_size": 10,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X ((X (G ((1 <= p12))) AND F (G ((1 <= p12)))))",
"processed_size": 47,
"rewrites": 80
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"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": 82
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p10) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p11))))",
"processed_size": 67,
"rewrites": 80
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((G ((1 <= p4)) AND (X (((1 <= p3) AND (1 <= p16) AND (1 <= p5))) OR F ((1 <= p4))))) U ((1 <= p0) AND (1 <= p4)))",
"processed_size": 117,
"rewrites": 80
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (((1 <= p7) AND (1 <= p8))) U ((1 <= p10) AND (1 <= p16)))",
"processed_size": 61,
"rewrites": 80
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"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": "(((p14 <= 0) AND (p13 <= 0)) AND (p12 <= 0))",
"processed_size": 44,
"rewrites": 85
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p4 <= 0)))",
"processed_size": 17,
"rewrites": 80
},
"result":
{
"edges": 101413,
"markings": 57734,
"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": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 602
},
"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": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p18) OR (p4 <= 0))))",
"processed_size": 33,
"rewrites": 80
},
"result":
{
"edges": 58951,
"markings": 34600,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 753
},
"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 (((1 <= p19) OR (p4 <= 0)))",
"processed_size": 30,
"rewrites": 80
},
"result":
{
"edges": 18480015,
"markings": 11089931,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 998
},
"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 (((p6 <= 0) OR (p7 <= 0)))",
"processed_size": 29,
"rewrites": 80
},
"result":
{
"edges": 72074169,
"markings": 35631327,
"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": 1464
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2929
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((p4 <= 0)) AND (p18 <= 0))))",
"processed_size": 38,
"rewrites": 80
},
"result":
{
"edges": 5129,
"markings": 5126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2929
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p17 <= 0))",
"processed_size": 14,
"rewrites": 80
},
"result":
{
"edges": 5122,
"markings": 5122,
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p10) AND (1 <= p16))",
"processed_size": 27,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p17 <= 0))",
"processed_size": 14,
"rewrites": 80
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15)))))",
"processed_size": 83,
"rewrites": 80
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 18,
"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": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3140,
"runtime": 1227.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((F(**) AND (G(**) AND (** AND **))))) AND **) : F(G(**)) : (G((F(**) AND (** OR **))) OR (G(*) AND F(G((F(**) AND (** OR **)))))) : G(F((** OR **))) : (X(X(G(*))) OR (F(*) AND (** AND **))) : (F(G((F(*) AND **))) OR (** OR **)) : (X((X(G(**)) AND F(G(**)))) AND **) : (X((F(**) OR **)) OR F(**)) : G(*) : F((** OR **)) : (X((G(**) AND (X(**) OR F(**)))) U **) : G((X(X(F(*))) AND F(*))) : F(G(*)) : (X(**) U **) : G(*)"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no unknown no no no no no no unknown no no no ",
"value": "no no no no unknown no no no no no no unknown no 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: (F (X ((((F ((1 <= p1)) AND G ((p5 <= 0))) AND (1 <= p8)) AND (1 <= p10)))) AND (p5 <= 0)) : G (NOT(G (NOT((((p5 <= 0) AND (p13 <= 0)) U G (((1 <= p8) AND (1 <= p10)))))))) : (NOT(F ((X ((1 <= p12)) U F ((1 <= p17))))) U G (((1 <= p12) U ((1 <= p7) AND (1 <= p15))))) : G (NOT(X ((NOT(F ((1 <= p18))) AND NOT(F ((p4 <= 0))))))) : (G (X (NOT(X (((1 <= p6) AND (1 <= p9) AND (p17 <= 0)))))) OR ((NOT(G (((1 <= p6) AND (1 <= p9)))) AND (1 <= p10)) AND (1 <= p16))) : ((F (G ((NOT(G ((1 <= p4))) AND (p18 <= 0)))) OR (1 <= p12)) OR (1 <= p18)) : (X ((G (X ((1 <= p12))) AND F (G ((1 <= p12))))) AND (p17 <= 0)) : ((X (F (((1 <= p10) AND (1 <= p16)))) OR X (((1 <= p9) AND (1 <= p11)))) OR F ((1 <= p14))) : G (NOT(F (((p19 <= 0) AND (1 <= p4))))) : ((1 <= p14) U (F (((1 <= p14) OR (1 <= p13))) OR F ((1 <= p12)))) : (X ((G ((1 <= p4)) AND (X (((1 <= p3) AND (1 <= p16) AND (1 <= p5))) OR F ((1 <= p4))))) U ((1 <= p0) AND (1 <= p4))) : G ((NOT(X (X (NOT(F (NOT(G (((1 <= p6) AND (1 <= p9))))))))) AND NOT(G (((1 <= p6) AND (1 <= p9)))))) : F (NOT(F (G ((F (((p3 <= 0) OR (p16 <= 0))) U NOT(F (NOT(F (X ((1 <= p4))))))))))) : (X (((1 <= p7) AND (1 <= p8))) U ((1 <= p10) AND (1 <= p16))) : NOT(F (((1 <= p6) AND (1 <= p7))))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((1 <= p1)) AND (G ((p5 <= 0)) AND ((1 <= p8) AND (1 <= p10)))))) AND (p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= 0)
lola: processed formula length: 9
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((1 <= p1)) AND (G ((p5 <= 0)) AND ((1 <= p8) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((1 <= p1)) AND (G ((p5 <= 0)) AND ((1 <= p8) AND (1 <= p10))))))
lola: processed formula length: 74
lola: 80 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 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17))))) OR (F (((p6 <= 0) OR (p9 <= 0))) AND ((1 <= p10) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p10) AND (1 <= p16))
lola: processed formula length: 27
lola: 81 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 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17)))))
lola: processed formula length: 52
lola: 80 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: 2416539 markings, 4352036 edges, 483308 markings/sec, 0 secs
lola: 4415216 markings, 7950712 edges, 399735 markings/sec, 5 secs
lola: 6273874 markings, 11296216 edges, 371732 markings/sec, 10 secs
lola: 8024458 markings, 14448305 edges, 350117 markings/sec, 15 secs
lola: 9566820 markings, 17224648 edges, 308472 markings/sec, 20 secs
lola: 11227403 markings, 20214065 edges, 332117 markings/sec, 25 secs
lola: 12795508 markings, 23037427 edges, 313621 markings/sec, 30 secs
lola: 14360154 markings, 25854105 edges, 312929 markings/sec, 35 secs
lola: 15884008 markings, 28596970 edges, 304771 markings/sec, 40 secs
lola: 17324776 markings, 31191247 edges, 288154 markings/sec, 45 secs
lola: 19021728 markings, 34580292 edges, 339390 markings/sec, 50 secs
lola: 22244592 markings, 42556533 edges, 644573 markings/sec, 55 secs
lola: 25086533 markings, 49617795 edges, 568388 markings/sec, 60 secs
lola: 27965874 markings, 56781868 edges, 575868 markings/sec, 65 secs
lola: 30790665 markings, 63812669 edges, 564958 markings/sec, 70 secs
lola: 33585519 markings, 70774484 edges, 558971 markings/sec, 75 secs
lola: 36368848 markings, 77707939 edges, 556666 markings/sec, 80 secs
lola: 39276713 markings, 84954195 edges, 581573 markings/sec, 85 secs
lola: 42066299 markings, 91908928 edges, 557917 markings/sec, 90 secs
lola: 44805660 markings, 98736331 edges, 547872 markings/sec, 95 secs
lola: 47601953 markings, 105708602 edges, 559259 markings/sec, 100 secs
lola: 50334948 markings, 112524343 edges, 546599 markings/sec, 105 secs
lola: 53255836 markings, 119807278 edges, 584178 markings/sec, 110 secs
lola: 56089079 markings, 126875317 edges, 566649 markings/sec, 115 secs
lola: 58902362 markings, 133890108 edges, 562657 markings/sec, 120 secs
lola: 61685557 markings, 140834895 edges, 556639 markings/sec, 125 secs
lola: 64471079 markings, 147782358 edges, 557104 markings/sec, 130 secs
lola: 67303441 markings, 154849579 edges, 566472 markings/sec, 135 secs
lola: 70227210 markings, 162141869 edges, 584754 markings/sec, 140 secs
lola: 73226843 markings, 169627032 edges, 599927 markings/sec, 145 secs
lola: 75993777 markings, 176528956 edges, 553387 markings/sec, 150 secs
lola: 78628748 markings, 183108536 edges, 526994 markings/sec, 155 secs
lola: 81111953 markings, 189303355 edges, 496641 markings/sec, 160 secs
lola: 82672379 markings, 193197961 edges, 312085 markings/sec, 165 secs
lola: 84636063 markings, 198096579 edges, 392737 markings/sec, 170 secs
lola: 86649566 markings, 203122310 edges, 402701 markings/sec, 175 secs
lola: 88927542 markings, 208806466 edges, 455595 markings/sec, 180 secs
lola: 90595875 markings, 212968477 edges, 333667 markings/sec, 185 secs
lola: 92420212 markings, 217520921 edges, 364867 markings/sec, 190 secs
lola: 94841755 markings, 223565647 edges, 484309 markings/sec, 195 secs
lola: 96526887 markings, 227769926 edges, 337026 markings/sec, 200 secs
lola: 96626089 markings, 228017653 edges, 19840 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: subprocess 2 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G ((1 <= p12))) AND F (G ((1 <= p12))))) AND (p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p17 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 <= 0)
lola: processed formula length: 10
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((1 <= p12))) AND F (G ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p12))) AND F (G ((1 <= p12)))))
lola: processed formula length: 47
lola: 80 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: 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: 5 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p10) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p11)))) OR F ((1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 279 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: 82 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: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 4 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p10) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p10) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p11))))
lola: processed formula length: 67
lola: 80 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((1 <= p4)) AND (X (((1 <= p3) AND (1 <= p16) AND (1 <= p5))) OR F ((1 <= p4))))) U ((1 <= p0) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G ((1 <= p4)) AND (X (((1 <= p3) AND (1 <= p16) AND (1 <= p5))) OR F ((1 <= p4))))) U ((1 <= p0) AND (1 <= p4)))
lola: processed formula length: 117
lola: 80 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F (((p6 <= 0) OR (p9 <= 0))))) AND F (((p6 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((p6 <= 0) OR (p9 <= 0))))) AND F (((p6 <= 0) OR (p9 <= 0)))))
lola: processed formula length: 77
lola: 80 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: 2401604 markings, 6044270 edges, 480321 markings/sec, 0 secs
lola: 4506596 markings, 11350752 edges, 420998 markings/sec, 5 secs
lola: 6412592 markings, 16152943 edges, 381199 markings/sec, 10 secs
lola: 8162554 markings, 20566355 edges, 349992 markings/sec, 15 secs
lola: 9891550 markings, 24925051 edges, 345799 markings/sec, 20 secs
lola: 11544475 markings, 29089167 edges, 330585 markings/sec, 25 secs
lola: 13132270 markings, 33093032 edges, 317559 markings/sec, 30 secs
lola: 14725678 markings, 37105020 edges, 318682 markings/sec, 35 secs
lola: 16333964 markings, 41164929 edges, 321657 markings/sec, 40 secs
lola: 17854755 markings, 44993127 edges, 304158 markings/sec, 45 secs
lola: 19338024 markings, 48737212 edges, 296654 markings/sec, 50 secs
lola: 20876734 markings, 52617574 edges, 307742 markings/sec, 55 secs
lola: 22385377 markings, 56419542 edges, 301729 markings/sec, 60 secs
lola: 23820805 markings, 60038563 edges, 287086 markings/sec, 65 secs
lola: 25199608 markings, 63516010 edges, 275761 markings/sec, 70 secs
lola: 26595893 markings, 67031556 edges, 279257 markings/sec, 75 secs
lola: 27978010 markings, 70519632 edges, 276423 markings/sec, 80 secs
lola: 29254919 markings, 73740684 edges, 255382 markings/sec, 85 secs
lola: 30516023 markings, 76919376 edges, 252221 markings/sec, 90 secs
lola: 31876596 markings, 80342350 edges, 272115 markings/sec, 95 secs
lola: 33295321 markings, 83918530 edges, 283745 markings/sec, 100 secs
lola: 34703678 markings, 87474228 edges, 281671 markings/sec, 105 secs
lola: 36070559 markings, 90915900 edges, 273376 markings/sec, 110 secs
lola: 37431318 markings, 94353983 edges, 272152 markings/sec, 115 secs
lola: 38766152 markings, 97711640 edges, 266967 markings/sec, 120 secs
lola: 40099187 markings, 101078395 edges, 266607 markings/sec, 125 secs
lola: 41434941 markings, 104440525 edges, 267151 markings/sec, 130 secs
lola: 42743109 markings, 107738711 edges, 261634 markings/sec, 135 secs
lola: 44031786 markings, 110994305 edges, 257735 markings/sec, 140 secs
lola: 45282467 markings, 114138769 edges, 250136 markings/sec, 145 secs
lola: 46556440 markings, 117362041 edges, 254795 markings/sec, 150 secs
lola: 47819163 markings, 120543844 edges, 252545 markings/sec, 155 secs
lola: 49061870 markings, 123675192 edges, 248541 markings/sec, 160 secs
lola: 50369152 markings, 126974285 edges, 261456 markings/sec, 165 secs
lola: 51663411 markings, 130238450 edges, 258852 markings/sec, 170 secs
lola: 52968239 markings, 133525273 edges, 260966 markings/sec, 175 secs
lola: 54271791 markings, 136801664 edges, 260710 markings/sec, 180 secs
lola: 55552361 markings, 140030834 edges, 256114 markings/sec, 185 secs
lola: 56784402 markings, 143139061 edges, 246408 markings/sec, 190 secs
lola: 58023892 markings, 146266287 edges, 247898 markings/sec, 195 secs
lola: 59253880 markings, 149364990 edges, 245998 markings/sec, 200 secs
lola: 60479434 markings, 152464508 edges, 245111 markings/sec, 205 secs
lola: 61669756 markings, 155462127 edges, 238064 markings/sec, 210 secs
lola: 62881345 markings, 158516751 edges, 242318 markings/sec, 215 secs
lola: 64073642 markings, 161516656 edges, 238459 markings/sec, 220 secs
lola: 65270085 markings, 164543385 edges, 239289 markings/sec, 225 secs
lola: 66450494 markings, 167522166 edges, 236082 markings/sec, 230 secs
lola: 67641944 markings, 170523109 edges, 238290 markings/sec, 235 secs
lola: 68845229 markings, 173544699 edges, 240657 markings/sec, 240 secs
lola: 70041761 markings, 176563775 edges, 239306 markings/sec, 245 secs
lola: 71221906 markings, 179550740 edges, 236029 markings/sec, 250 secs
lola: 72417695 markings, 182562182 edges, 239158 markings/sec, 255 secs
lola: 73609152 markings, 185566927 edges, 238291 markings/sec, 260 secs
lola: 74795521 markings, 188552382 edges, 237274 markings/sec, 265 secs
lola: 75981106 markings, 191548771 edges, 237117 markings/sec, 270 secs
lola: 77170451 markings, 194550104 edges, 237869 markings/sec, 275 secs
lola: 78341565 markings, 197501047 edges, 234223 markings/sec, 280 secs
lola: 79521736 markings, 200474072 edges, 236034 markings/sec, 285 secs
lola: 80698810 markings, 203432079 edges, 235415 markings/sec, 290 secs
lola: 81882286 markings, 206430947 edges, 236695 markings/sec, 295 secs
lola: 83092410 markings, 209480657 edges, 242025 markings/sec, 300 secs
lola: 84276911 markings, 212456804 edges, 236900 markings/sec, 305 secs
lola: 86159742 markings, 216805807 edges, 376566 markings/sec, 310 secs
lola: 89086626 markings, 223316793 edges, 585377 markings/sec, 315 secs
lola: 92052738 markings, 229984700 edges, 593222 markings/sec, 320 secs
lola: 94905031 markings, 236413749 edges, 570459 markings/sec, 325 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown no no unknown unknown no unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p7) AND (1 <= p8))) U ((1 <= p10) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p7) AND (1 <= p8))) U ((1 <= p10) AND (1 <= p16)))
lola: processed formula length: 61
lola: 80 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 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p14) OR (1 <= p13)) OR (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p14 <= 0) AND (p13 <= 0)) AND (p12 <= 0))
lola: processed formula length: 44
lola: 85 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: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 <= 0)))
lola: processed formula length: 17
lola: 80 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 26
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: 57734 markings, 101413 edges
lola: ========================================
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p8) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p8) AND (1 <= p10))))
lola: processed formula length: 34
lola: 80 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 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: 5124 markings, 5125 edges
lola: ========================================
lola: subprocess 10 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p18) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p18) OR (p4 <= 0))))
lola: processed formula length: 33
lola: 80 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: 34600 markings, 58951 edges
lola: ========================================
lola: subprocess 11 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p19) OR (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p19) OR (p4 <= 0)))
lola: processed formula length: 30
lola: 80 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: 3380000 markings, 6755388 edges, 676000 markings/sec, 0 secs
lola: 6381387 markings, 11416156 edges, 600277 markings/sec, 5 secs
lola: 9014435 markings, 15366367 edges, 526610 markings/sec, 10 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: 11089931 markings, 18480015 edges
lola: ========================================
lola: subprocess 12 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p6 <= 0) OR (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p6 <= 0) OR (p7 <= 0)))
lola: processed formula length: 29
lola: 80 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: 3222347 markings, 6438159 edges, 644469 markings/sec, 0 secs
lola: 6311632 markings, 12616553 edges, 617857 markings/sec, 5 secs
lola: 9722538 markings, 19472325 edges, 682181 markings/sec, 10 secs
lola: 12731989 markings, 25582744 edges, 601890 markings/sec, 15 secs
lola: 15512534 markings, 31228166 edges, 556109 markings/sec, 20 secs
lola: 18179826 markings, 36643593 edges, 533458 markings/sec, 25 secs
lola: 20890059 markings, 42146102 edges, 542047 markings/sec, 30 secs
lola: 23521578 markings, 47488790 edges, 526304 markings/sec, 35 secs
lola: 26140672 markings, 52806715 edges, 523819 markings/sec, 40 secs
lola: 28686606 markings, 57976797 edges, 509187 markings/sec, 45 secs
lola: 31216417 markings, 63113577 edges, 505962 markings/sec, 50 secs
lola: 33741345 markings, 68239929 edges, 504986 markings/sec, 55 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: 35631327 markings, 72074169 edges
lola: ========================================
lola: subprocess 13 will run for 1464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((p4 <= 0)) AND (p18 <= 0)))) OR ((1 <= p12) OR (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) OR (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p12) OR (1 <= p18))
lola: processed formula length: 26
lola: 81 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 14 will run for 2929 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p4 <= 0)) AND (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p4 <= 0)) AND (p18 <= 0))))
lola: processed formula length: 38
lola: 80 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: 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 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: 5126 markings, 5129 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 2929 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))) OR (G ((p17 <= 0)) AND F (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2929 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p17 <= 0))
lola: processed formula length: 14
lola: 80 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: 5122 markings, 5122 edges
lola: ========================================
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 (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17))))) OR (F (((p6 <= 0) OR (p9 <= 0))) AND ((1 <= p10) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p10) AND (1 <= p16))
lola: processed formula length: 27
lola: 81 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: ========================================
lola: ...considering subproblem: X (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p6 <= 0) OR (p9 <= 0) OR (1 <= p17)))))
lola: processed formula length: 52
lola: 80 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: 2906395 markings, 5234431 edges, 581279 markings/sec, 0 secs
lola: 5215544 markings, 9390836 edges, 461830 markings/sec, 5 secs
lola: 7073314 markings, 12736297 edges, 371554 markings/sec, 10 secs
lola: 8775224 markings, 15800134 edges, 340382 markings/sec, 15 secs
lola: 10426149 markings, 18771182 edges, 330185 markings/sec, 20 secs
lola: 12073843 markings, 21737446 edges, 329539 markings/sec, 25 secs
lola: 13651026 markings, 24576674 edges, 315437 markings/sec, 30 secs
lola: 15210349 markings, 27383449 edges, 311865 markings/sec, 35 secs
lola: 16804743 markings, 30253621 edges, 318879 markings/sec, 40 secs
lola: 18345546 markings, 33028011 edges, 308161 markings/sec, 45 secs
lola: 21286606 markings, 40179183 edges, 588212 markings/sec, 50 secs
lola: 24210415 markings, 47439428 edges, 584762 markings/sec, 55 secs
lola: 27330212 markings, 55200376 edges, 623959 markings/sec, 60 secs
lola: 30246654 markings, 62459542 edges, 583288 markings/sec, 65 secs
lola: 33137114 markings, 69658593 edges, 578092 markings/sec, 70 secs
lola: 35978622 markings, 76738229 edges, 568302 markings/sec, 75 secs
lola: 38908411 markings, 84036823 edges, 585958 markings/sec, 80 secs
lola: 42021953 markings, 91797886 edges, 622708 markings/sec, 85 secs
lola: 45021810 markings, 99275446 edges, 599971 markings/sec, 90 secs
lola: 47998761 markings, 106699925 edges, 595390 markings/sec, 95 secs
lola: 50915976 markings, 113974122 edges, 583443 markings/sec, 100 secs
lola: 54058085 markings, 121807961 edges, 628422 markings/sec, 105 secs
lola: 57095856 markings, 129385670 edges, 607554 markings/sec, 110 secs
lola: 60157212 markings, 137021757 edges, 612271 markings/sec, 115 secs
lola: 63119171 markings, 144411310 edges, 592392 markings/sec, 120 secs
lola: 66088134 markings, 151817726 edges, 593793 markings/sec, 125 secs
lola: 68923874 markings, 158889586 edges, 567148 markings/sec, 130 secs
lola: 71844609 markings, 166177619 edges, 584147 markings/sec, 135 secs
lola: 74691946 markings, 173280965 edges, 569467 markings/sec, 140 secs
lola: 77478686 markings, 180235651 edges, 557348 markings/sec, 145 secs
lola: 79937314 markings, 186372126 edges, 491726 markings/sec, 150 secs
lola: 82427875 markings, 192587399 edges, 498112 markings/sec, 155 secs
lola: 84319233 markings, 197305946 edges, 378272 markings/sec, 160 secs
lola: 86150569 markings, 201874661 edges, 366267 markings/sec, 165 secs
lola: 88374478 markings, 207424806 edges, 444782 markings/sec, 170 secs
lola: 90270406 markings, 212156696 edges, 379186 markings/sec, 175 secs
lola: 92288320 markings, 217190483 edges, 403583 markings/sec, 180 secs
lola: 94473077 markings, 222645337 edges, 436951 markings/sec, 185 secs
lola: 96416721 markings, 227496688 edges, 388729 markings/sec, 190 secs
lola: 96769407 markings, 228376372 edges, 70537 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: ========================================
lola: ...considering subproblem: G ((X (X (F (((p6 <= 0) OR (p9 <= 0))))) AND F (((p6 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((p6 <= 0) OR (p9 <= 0))))) AND F (((p6 <= 0) OR (p9 <= 0)))))
lola: processed formula length: 77
lola: 80 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: 2383873 markings, 6001566 edges, 476775 markings/sec, 0 secs
lola: 4483460 markings, 11292088 edges, 419917 markings/sec, 5 secs
lola: 6488401 markings, 16342380 edges, 400988 markings/sec, 10 secs
lola: 8352771 markings, 21045007 edges, 372874 markings/sec, 15 secs
lola: 10099308 markings, 25447351 edges, 349307 markings/sec, 20 secs
lola: 11686307 markings, 29449180 edges, 317400 markings/sec, 25 secs
lola: 13491571 markings, 33999204 edges, 361053 markings/sec, 30 secs
lola: 15252503 markings, 38435834 edges, 352186 markings/sec, 35 secs
lola: 16967685 markings, 42762040 edges, 343036 markings/sec, 40 secs
lola: 18662604 markings, 47036421 edges, 338984 markings/sec, 45 secs
lola: 20334590 markings, 51244734 edges, 334397 markings/sec, 50 secs
lola: 21990097 markings, 55425145 edges, 331101 markings/sec, 55 secs
lola: 23609111 markings, 59498939 edges, 323803 markings/sec, 60 secs
lola: 25182423 markings, 63471168 edges, 314662 markings/sec, 65 secs
lola: 26734262 markings, 67376729 edges, 310368 markings/sec, 70 secs
lola: 28290824 markings, 71302194 edges, 311312 markings/sec, 75 secs
lola: 29777064 markings, 75056819 edges, 297248 markings/sec, 80 secs
lola: 31271521 markings, 78818599 edges, 298891 markings/sec, 85 secs
lola: 32823624 markings, 82736158 edges, 310421 markings/sec, 90 secs
lola: 34384212 markings, 86670452 edges, 312118 markings/sec, 95 secs
lola: 35896401 markings, 90476271 edges, 302438 markings/sec, 100 secs
lola: 37342706 markings, 94123307 edges, 289261 markings/sec, 105 secs
lola: 38700046 markings, 97543945 edges, 271468 markings/sec, 110 secs
lola: 40044464 markings, 100939263 edges, 268884 markings/sec, 115 secs
lola: 41382871 markings, 104314721 edges, 267681 markings/sec, 120 secs
lola: 42760316 markings, 107786838 edges, 275489 markings/sec, 125 secs
lola: 44142243 markings, 111271618 edges, 276385 markings/sec, 130 secs
lola: 45498354 markings, 114689369 edges, 271222 markings/sec, 135 secs
lola: 46815700 markings, 118013606 edges, 263469 markings/sec, 140 secs
lola: 48140370 markings, 121355587 edges, 264934 markings/sec, 145 secs
lola: 49461720 markings, 124682254 edges, 264270 markings/sec, 150 secs
lola: 50763592 markings, 127966898 edges, 260374 markings/sec, 155 secs
lola: 52076400 markings, 131278641 edges, 262562 markings/sec, 160 secs
lola: 53366297 markings, 134521683 edges, 257979 markings/sec, 165 secs
lola: 54631187 markings, 137710416 edges, 252978 markings/sec, 170 secs
lola: 55911931 markings, 140938128 edges, 256149 markings/sec, 175 secs
lola: 57147128 markings, 144053375 edges, 247039 markings/sec, 180 secs
lola: 58373407 markings, 147142993 edges, 245256 markings/sec, 185 secs
lola: 59619450 markings, 150290647 edges, 249209 markings/sec, 190 secs
lola: 60855820 markings, 153412770 edges, 247274 markings/sec, 195 secs
lola: 62198476 markings, 156795085 edges, 268531 markings/sec, 200 secs
lola: 63575143 markings, 160269237 edges, 275333 markings/sec, 205 secs
lola: 64928908 markings, 163673111 edges, 270753 markings/sec, 210 secs
lola: 66270664 markings, 167062894 edges, 268351 markings/sec, 215 secs
lola: 67600776 markings, 170417815 edges, 266022 markings/sec, 220 secs
lola: 68943337 markings, 173799357 edges, 268512 markings/sec, 225 secs
lola: 70285503 markings, 177176030 edges, 268433 markings/sec, 230 secs
lola: 71607041 markings, 180517187 edges, 264308 markings/sec, 235 secs
lola: 72944502 markings, 183894094 edges, 267492 markings/sec, 240 secs
lola: 74288109 markings, 187271131 edges, 268721 markings/sec, 245 secs
lola: 75615205 markings, 190616424 edges, 265419 markings/sec, 250 secs
lola: 76909778 markings, 193890255 edges, 258915 markings/sec, 255 secs
lola: 78223266 markings, 197192328 edges, 262698 markings/sec, 260 secs
lola: 79530550 markings, 200496980 edges, 261457 markings/sec, 265 secs
lola: 80856448 markings, 203839982 edges, 265180 markings/sec, 270 secs
lola: 82178172 markings, 207165045 edges, 264345 markings/sec, 275 secs
lola: 83493397 markings, 210479595 edges, 263045 markings/sec, 280 secs
lola: 84758054 markings, 213677914 edges, 252931 markings/sec, 285 secs
lola: 87640158 markings, 220083793 edges, 576421 markings/sec, 290 secs
lola: 90793212 markings, 227149964 edges, 630611 markings/sec, 295 secs
lola: 93810692 markings, 233943313 edges, 603496 markings/sec, 300 secs
lola: 96824629 markings, 240746839 edges, 602787 markings/sec, 305 secs
lola: 99775396 markings, 247418730 edges, 590153 markings/sec, 310 secs
lola: 102788129 markings, 254241293 edges, 602547 markings/sec, 315 secs
lola: 105183221 markings, 259661463 edges, 479018 markings/sec, 320 secs
lola: 107722188 markings, 265414138 edges, 507793 markings/sec, 325 secs
lola: 110297505 markings, 271257415 edges, 515063 markings/sec, 330 secs
lola: 112484314 markings, 276212782 edges, 437362 markings/sec, 335 secs
lola: 114459758 markings, 280692901 edges, 395089 markings/sec, 340 secs
lola: 116631541 markings, 285618363 edges, 434357 markings/sec, 345 secs
lola: 118252243 markings, 289298645 edges, 324140 markings/sec, 350 secs
lola: 120269465 markings, 293879822 edges, 403444 markings/sec, 355 secs
lola: 122611673 markings, 299197245 edges, 468442 markings/sec, 360 secs
lola: 124991240 markings, 304598175 edges, 475913 markings/sec, 365 secs
lola: 127016647 markings, 309201755 edges, 405081 markings/sec, 370 secs
lola: 127937592 markings, 311290449 edges, 184189 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))) OR (G ((p17 <= 0)) AND F (G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p17 <= 0))
lola: processed formula length: 14
lola: 80 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: 5122 markings, 5122 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p7) AND (1 <= p15))) AND ((1 <= p12) OR ((1 <= p7) AND (1 <= p15)))))
lola: processed formula length: 83
lola: 80 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: 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: 5122 markings, 5122 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown no no no no no no unknown no no no
lola:
preliminary result: no no no no unknown no no no no no no unknown no no no
lola: memory consumption: 3140 KB
lola: time consumption: 1227 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-02560"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is MAPK-PT-02560, 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 r174-csrt-158987852600066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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