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.r011-tall-162038006100182.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 Angiogenesis-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K 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 Angiogenesis-PT-50-00
FORMULA_NAME Angiogenesis-PT-50-01
FORMULA_NAME Angiogenesis-PT-50-02
FORMULA_NAME Angiogenesis-PT-50-03
FORMULA_NAME Angiogenesis-PT-50-04
FORMULA_NAME Angiogenesis-PT-50-05
FORMULA_NAME Angiogenesis-PT-50-06
FORMULA_NAME Angiogenesis-PT-50-07
FORMULA_NAME Angiogenesis-PT-50-08
FORMULA_NAME Angiogenesis-PT-50-09
FORMULA_NAME Angiogenesis-PT-50-10
FORMULA_NAME Angiogenesis-PT-50-11
FORMULA_NAME Angiogenesis-PT-50-12
FORMULA_NAME Angiogenesis-PT-50-13
FORMULA_NAME Angiogenesis-PT-50-14
FORMULA_NAME Angiogenesis-PT-50-15

=== Now, execution of the tool begins

BK_START 1620431604080

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 23:53: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]
[2021-05-07 23:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 23:53:26] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2021-05-07 23:53:26] [INFO ] Transformed 39 places.
[2021-05-07 23:53:26] [INFO ] Transformed 64 transitions.
[2021-05-07 23:53:26] [INFO ] Parsed PT model containing 39 places and 64 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100004 steps, including 1 resets, run finished after 62 ms. (steps per millisecond=1612 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 64 rows 39 cols
[2021-05-07 23:53:26] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2021-05-07 23:53:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2021-05-07 23:53:26] [INFO ] Added : 58 causal constraints over 12 iterations in 98 ms. Result :sat
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2021-05-07 23:53:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:53:26] [INFO ] Added : 59 causal constraints over 12 iterations in 68 ms. Result :sat
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:53:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2021-05-07 23:53:26] [INFO ] Added : 59 causal constraints over 12 iterations in 71 ms. Result :sat
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:53:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-07 23:53:26] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2021-05-07 23:53:27] [INFO ] Added : 51 causal constraints over 11 iterations in 62 ms. Result :sat
[2021-05-07 23:53:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:27] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:53:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-07 23:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:53:27] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:53:27] [INFO ] Added : 59 causal constraints over 13 iterations in 78 ms. Result :sat
[2021-05-07 23:53:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:27] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-07 23:53:27] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:53:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:53:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:53:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-07 23:53:27] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:53:27] [INFO ] Added : 50 causal constraints over 10 iterations in 50 ms. Result :sat
[2021-05-07 23:53:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-07 23:53:27] [INFO ] Flatten gal took : 34 ms
FORMULA Angiogenesis-PT-50-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-50-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-50-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 23:53:27] [INFO ] Flatten gal took : 8 ms
[2021-05-07 23:53:27] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-07 23:53:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Angiogenesis-PT-50 @ 3570 seconds

FORMULA Angiogenesis-PT-50-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3077
rslt: Output for LTLFireability @ Angiogenesis-PT-50

{
"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": "Fri May 7 23:53:28 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 <= p28)",
"processed_size": 10,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X (G (((p32 <= 0) OR (p36 <= 0) OR (p9 <= 0) OR (p11 <= 0)))) AND (1 <= p28))))",
"processed_size": 89,
"rewrites": 121
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"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": "(X ((p37 <= 0)) U (p22 <= 0))",
"processed_size": 29,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((p0 <= 0) OR (p32 <= 0))) OR (p22 <= 0)))",
"processed_size": 50,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p36)))",
"processed_size": 18,
"rewrites": 121
},
"result":
{
"edges": 5,
"markings": 5,
"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": 419
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"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 ((F ((1 <= p16)) U ((1 <= p37) OR ((1 <= p6) AND (1 <= p11)))))",
"processed_size": 66,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 479
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p15) AND (1 <= p34)))",
"processed_size": 31,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 671
},
"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": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X ((p16 <= 0)) OR ((p32 <= 0) OR (p36 <= 0))))",
"processed_size": 50,
"rewrites": 121
},
"result":
{
"edges": 376681,
"markings": 189308,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p3) AND (1 <= p5))) AND (F ((X (X ((1 <= p38))) OR (p25 <= 0))) OR G (((1 <= p3) AND (1 <= p5)))))))",
"processed_size": 117,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 671
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33)))))) AND G (((1 <= p37) OR G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33))))))))))",
"processed_size": 207,
"rewrites": 121
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 32
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 839
},
"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": "G (F ((1 <= p22)))",
"processed_size": 18,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1119
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G (F ((1 <= p17))) OR G ((F ((1 <= p28)) AND F ((1 <= p17))))))",
"processed_size": 67,
"rewrites": 121
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1678
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(G (((p28 <= 0) AND (p4 <= 0))) R ((p4 <= 0) R ((p20 <= 0) OR (p31 <= 0))))",
"processed_size": 76,
"rewrites": 121
},
"result":
{
"edges": 47299019,
"markings": 19708801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 3290
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 2,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0)))) AND (((1 <= p6) AND (1 <= p32)) OR (F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0))))))",
"processed_size": 181,
"rewrites": 121
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3312,
"runtime": 493.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G((X(G(*)) AND **))) OR **) : (G(*) R (* R *)) : ((* R X(G(*))) OR G(**)) : G(F(**)) : (X((F(*) OR **)) AND (X(*) U **)) : (X(G(**)) OR G(**)) : X(X((F(*) U G(*)))) : X((F(**) U **)) : G((F((F(G(**)) AND (** U **))) AND (** OR (F(G(**)) AND (** U **))))) : (G((X(*) OR (** OR **))) OR ((G(**) AND F(G((X(*) OR (** OR **))))) OR F(**))) : X(F((G(**) AND (F((X(X(**)) OR *)) OR G(**))))) : X(F((F(G((F(**) AND (** OR **)))) AND G((** OR G((F(**) AND (** OR **)))))))) : F((G(F(**)) OR G((F(**) AND F(**)))))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no yes no unknown yes no no no no no ",
"value": "no no no no yes no unknown yes no no 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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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 (G ((NOT(F (X (((1 <= p32) AND (1 <= p36) AND (1 <= p9) AND (1 <= p11))))) AND (1 <= p28))))) OR (1 <= p28)) : NOT((F (((1 <= p28) OR (1 <= p4))) U ((1 <= p4) U ((1 <= p20) AND (1 <= p31))))) : (NOT((((p27 <= 0) OR (1 <= p21)) U X (F (((1 <= p14) AND (1 <= p34)))))) OR G ((1 <= p22))) : G (X (F (X ((1 <= p22))))) : (X ((NOT(G (((1 <= p0) AND (1 <= p32)))) OR (p22 <= 0))) AND (NOT(X ((1 <= p37))) U (p22 <= 0))) : (X (G ((1 <= p36))) OR G ((1 <= p23))) : (F (X (NOT(X ((p27 <= 0))))) U G (X (NOT(F (X ((1 <= p17))))))) : (F (X ((F ((p10 <= 0)) U (1 <= p16)))) U X (((1 <= p37) OR ((1 <= p6) AND (1 <= p11))))) : G ((((1 <= p6) AND (1 <= p32)) U (F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0))))) : ((G (((1 <= p15) AND (1 <= p34))) U G (((NOT(X ((1 <= p16))) OR (p32 <= 0)) OR (p36 <= 0)))) OR F (((1 <= p15) AND (1 <= p34)))) : F (NOT((X (G ((X (NOT(X ((1 <= p38)))) AND (1 <= p25)))) U X (NOT(G (((1 <= p3) AND (1 <= p5)))))))) : X (F (NOT(F (NOT(((1 <= p37) U G (((1 <= p1) U ((1 <= p14) AND (1 <= p33)))))))))) : NOT(G (NOT((X (G (F ((1 <= p28)))) U G (F (X ((1 <= p17))))))))
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X (G (((p32 <= 0) OR (p36 <= 0) OR (p9 <= 0) OR (p11 <= 0)))) AND (1 <= p28)))) OR (1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p28)
lola: processed formula length: 10
lola: 121 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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G (((p32 <= 0) OR (p36 <= 0) OR (p9 <= 0) OR (p11 <= 0)))) AND (1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G (((p32 <= 0) OR (p36 <= 0) OR (p9 <= 0) OR (p11 <= 0)))) AND (1 <= p28))))
lola: processed formula length: 89
lola: 121 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: add low 52
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p27) AND (p21 <= 0)) R X (G (((p14 <= 0) OR (p34 <= 0))))) OR G ((1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p22))
lola: processed formula length: 14
lola: 121 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p27) AND (p21 <= 0)) R X (G (((p14 <= 0) OR (p34 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p27) AND (p21 <= 0)) R X (G (((p14 <= 0) OR (p34 <= 0)))))
lola: processed formula length: 67
lola: 121 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: 8120 markings, 16911 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((p0 <= 0) OR (p32 <= 0))) OR (p22 <= 0))) AND (X ((p37 <= 0)) U (p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p37 <= 0)) U (p22 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p37 <= 0)) U (p22 <= 0))
lola: processed formula length: 29
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p0 <= 0) OR (p32 <= 0))) OR (p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p0 <= 0) OR (p32 <= 0))) OR (p22 <= 0)))
lola: processed formula length: 50
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p36))) OR G ((1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p23))
lola: processed formula length: 14
lola: 121 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p36)))
lola: processed formula length: 18
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((1 <= p27)) U G ((p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((1 <= p27)) U G ((p17 <= 0)))))
lola: processed formula length: 41
lola: 121 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: 2885711 markings, 5881731 edges, 577142 markings/sec, 0 secs
lola: 5731062 markings, 11701979 edges, 569070 markings/sec, 5 secs
lola: 8575708 markings, 17547188 edges, 568929 markings/sec, 10 secs
lola: 11340114 markings, 23244323 edges, 552881 markings/sec, 15 secs
lola: 14170718 markings, 29208752 edges, 566121 markings/sec, 20 secs
lola: 17075691 markings, 35313045 edges, 580995 markings/sec, 25 secs
lola: 19953378 markings, 41333868 edges, 575537 markings/sec, 30 secs
lola: 22810833 markings, 47359182 edges, 571491 markings/sec, 35 secs
lola: 25677106 markings, 53382718 edges, 573255 markings/sec, 40 secs
lola: 28547829 markings, 59424031 edges, 574145 markings/sec, 45 secs
lola: 31449770 markings, 65526385 edges, 580388 markings/sec, 50 secs
lola: 34216400 markings, 71336175 edges, 553326 markings/sec, 55 secs
lola: 36946941 markings, 77094370 edges, 546108 markings/sec, 60 secs
lola: 39666619 markings, 82783697 edges, 543936 markings/sec, 65 secs
lola: 42363373 markings, 88471597 edges, 539351 markings/sec, 70 secs
lola: 45097049 markings, 94207940 edges, 546735 markings/sec, 75 secs
lola: 47919292 markings, 100162572 edges, 564449 markings/sec, 80 secs
lola: 50589145 markings, 105765169 edges, 533971 markings/sec, 85 secs
lola: 53382725 markings, 111655624 edges, 558716 markings/sec, 90 secs
lola: 56031524 markings, 117197718 edges, 529760 markings/sec, 95 secs
lola: 58870513 markings, 123178011 edges, 567798 markings/sec, 100 secs
lola: 61510976 markings, 128713748 edges, 528093 markings/sec, 105 secs
lola: 64263257 markings, 134512469 edges, 550456 markings/sec, 110 secs
lola: 66933583 markings, 140117822 edges, 534065 markings/sec, 115 secs
lola: 69630549 markings, 145797273 edges, 539393 markings/sec, 120 secs
lola: 72307637 markings, 151416798 edges, 535418 markings/sec, 125 secs
lola: 75086265 markings, 157247122 edges, 555726 markings/sec, 130 secs
lola: 77828688 markings, 163030389 edges, 548485 markings/sec, 135 secs
lola: 79830924 markings, 167239957 edges, 400447 markings/sec, 140 secs
lola: 81473984 markings, 170682972 edges, 328612 markings/sec, 145 secs
lola: 83306503 markings, 174542484 edges, 366504 markings/sec, 150 secs
lola: 84714713 markings, 177504196 edges, 281642 markings/sec, 155 secs
lola: 86589153 markings, 181434348 edges, 374888 markings/sec, 160 secs
lola: 88460419 markings, 185376060 edges, 374253 markings/sec, 165 secs
lola: 90918611 markings, 190526951 edges, 491638 markings/sec, 170 secs
lola: 93511306 markings, 195993263 edges, 518539 markings/sec, 175 secs
lola: 94738552 markings, 198576633 edges, 245449 markings/sec, 180 secs
lola: 96541197 markings, 202384436 edges, 360529 markings/sec, 185 secs
lola: 97694117 markings, 204798413 edges, 230584 markings/sec, 190 secs
lola: 97820948 markings, 205079114 edges, 25366 markings/sec, 195 secs
lola: 97821239 markings, 205079659 edges, 58 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p16)) U ((1 <= p37) OR ((1 <= p6) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p16)) U ((1 <= p37) OR ((1 <= p6) AND (1 <= p11)))))
lola: processed formula length: 66
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X ((p16 <= 0)) OR ((p32 <= 0) OR (p36 <= 0)))) OR ((G (((1 <= p15) AND (1 <= p34))) AND F (G ((X ((p16 <= 0)) OR ((p32 <= 0) OR (p36 <= 0)))))) OR F (((1 <= p15) AND (1 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p15) AND (1 <= p34)))
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: ((p15 <= 0) OR (p34 <= 0))
lola: processed formula length: 27
lola: 123 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p15) AND (1 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p15) AND (1 <= p34)))
lola: processed formula length: 31
lola: 121 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p16 <= 0)) OR ((p32 <= 0) OR (p36 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p16 <= 0)) OR ((p32 <= 0) OR (p36 <= 0))))
lola: processed formula length: 50
lola: 121 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: 189308 markings, 376681 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p3) AND (1 <= p5))) AND (F ((X (X ((1 <= p38))) OR (p25 <= 0))) OR G (((1 <= p3) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p3) AND (1 <= p5))) AND (F ((X (X ((1 <= p38))) OR (p25 <= 0))) OR G (((1 <= p3) AND (1 <= p5)))))))
lola: processed formula length: 117
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33)))))) AND G (((1 <= p37) OR G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33)))))) AND G (((1 <= p37) OR G ((F (((1 <= p14) AND (1 <= p33))) AND ((1 <= p1) OR ((1 <= p14) AND (1 <= p33))))))))))
lola: processed formula length: 207
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 32 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 9 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p22)))
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 <= p22)))
lola: processed formula length: 18
lola: 121 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 1119 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((1 <= p17))) OR G ((F ((1 <= p28)) AND F ((1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((1 <= p17))) OR G ((F ((1 <= p28)) AND F ((1 <= p17))))))
lola: processed formula length: 67
lola: 121 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 1678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p28 <= 0) AND (p4 <= 0))) R ((p4 <= 0) R ((p20 <= 0) OR (p31 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G (((p28 <= 0) AND (p4 <= 0))) R ((p4 <= 0) R ((p20 <= 0) OR (p31 <= 0))))
lola: processed formula length: 76
lola: 121 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: 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: 2254044 markings, 5452662 edges, 450809 markings/sec, 0 secs
lola: 4451767 markings, 10724195 edges, 439545 markings/sec, 5 secs
lola: 5990703 markings, 14314516 edges, 307787 markings/sec, 10 secs
lola: 7590089 markings, 18091202 edges, 319877 markings/sec, 15 secs
lola: 9068671 markings, 21679286 edges, 295716 markings/sec, 20 secs
lola: 10486977 markings, 25037113 edges, 283661 markings/sec, 25 secs
lola: 11815088 markings, 28260187 edges, 265622 markings/sec, 30 secs
lola: 13077937 markings, 31293720 edges, 252570 markings/sec, 35 secs
lola: 14357132 markings, 34397617 edges, 255839 markings/sec, 40 secs
lola: 15684912 markings, 37579705 edges, 265556 markings/sec, 45 secs
lola: 16984121 markings, 40731609 edges, 259842 markings/sec, 50 secs
lola: 18292166 markings, 43867705 edges, 261609 markings/sec, 55 secs
lola: 19593724 markings, 47025978 edges, 260312 markings/sec, 60 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: 19708801 markings, 47299019 edges
lola: ========================================
lola: subprocess 12 will run for 3290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0)))) AND (((1 <= p6) AND (1 <= p32)) OR (F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0)))) AND (((1 <= p6) AND (1 <= p32)) OR (F (G (((1 <= p14) AND (1 <= p32)))) AND ((1 <= p12) U (p23 <= 0))))))
lola: processed formula length: 181
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((F ((1 <= p27)) U G ((p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((1 <= p27)) U G ((p17 <= 0)))))
lola: processed formula length: 41
lola: 121 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: 2882558 markings, 5875212 edges, 576512 markings/sec, 0 secs
lola: 5713423 markings, 11664218 edges, 566173 markings/sec, 5 secs
lola: 8542158 markings, 17477226 edges, 565747 markings/sec, 10 secs
lola: 11282511 markings, 23125912 edges, 548071 markings/sec, 15 secs
lola: 14096007 markings, 29049996 edges, 562699 markings/sec, 20 secs
lola: 16981333 markings, 35117147 edges, 577065 markings/sec, 25 secs
lola: 19847967 markings, 41115442 edges, 573327 markings/sec, 30 secs
lola: 22710816 markings, 47148111 edges, 572570 markings/sec, 35 secs
lola: 25593503 markings, 53209067 edges, 576537 markings/sec, 40 secs
lola: 28477159 markings, 59274996 edges, 576731 markings/sec, 45 secs
lola: 31392202 markings, 65405007 edges, 583009 markings/sec, 50 secs
lola: 34176203 markings, 71253016 edges, 556800 markings/sec, 55 secs
lola: 36916681 markings, 77031576 edges, 548096 markings/sec, 60 secs
lola: 39647022 markings, 82742617 edges, 546068 markings/sec, 65 secs
lola: 42346974 markings, 88436932 edges, 539990 markings/sec, 70 secs
lola: 45094141 markings, 94201606 edges, 549433 markings/sec, 75 secs
lola: 47929162 markings, 100183239 edges, 567004 markings/sec, 80 secs
lola: 50609144 markings, 105808229 edges, 535996 markings/sec, 85 secs
lola: 53422186 markings, 111735398 edges, 562608 markings/sec, 90 secs
lola: 56076458 markings, 117290619 edges, 530854 markings/sec, 95 secs
lola: 58933558 markings, 123309200 edges, 571420 markings/sec, 100 secs
lola: 61602574 markings, 128909351 edges, 533803 markings/sec, 105 secs
lola: 64371990 markings, 134741898 edges, 553883 markings/sec, 110 secs
lola: 67082081 markings, 140431283 edges, 542018 markings/sec, 115 secs
lola: 69785586 markings, 146122072 edges, 540701 markings/sec, 120 secs
lola: 72493590 markings, 151821881 edges, 541601 markings/sec, 125 secs
lola: 75277271 markings, 157643566 edges, 556736 markings/sec, 130 secs
lola: 78073061 markings, 163536928 edges, 559158 markings/sec, 135 secs
lola: 79888696 markings, 167362134 edges, 363127 markings/sec, 140 secs
lola: 81780526 markings, 171324164 edges, 378366 markings/sec, 145 secs
lola: 83552526 markings, 175066055 edges, 354400 markings/sec, 150 secs
lola: 84985409 markings, 178074777 edges, 286577 markings/sec, 155 secs
lola: 86584614 markings, 181424667 edges, 319841 markings/sec, 160 secs
lola: 88328795 markings, 185096458 edges, 348836 markings/sec, 165 secs
lola: 90117597 markings, 188863566 edges, 357760 markings/sec, 170 secs
lola: 91675430 markings, 192126442 edges, 311567 markings/sec, 175 secs
lola: 93434620 markings, 195828863 edges, 351838 markings/sec, 180 secs
lola: 95091204 markings, 199330951 edges, 331317 markings/sec, 185 secs
lola: 96692389 markings, 202681888 edges, 320237 markings/sec, 190 secs
lola: 97614239 markings, 204630017 edges, 184370 markings/sec, 195 secs
lola: 97728177 markings, 204869940 edges, 22788 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes no unknown yes no no no no no
lola:
preliminary result: no no no no yes no unknown yes no no no no no
lola: memory consumption: 3312 KB
lola: time consumption: 493 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="Angiogenesis-PT-50"
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 Angiogenesis-PT-50, 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 r011-tall-162038006100182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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