fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432700182
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Raft-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16253.827 3600000.00 1699867.00 17221.80 FF?FFFFFFTFFTF?F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432700182.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Raft-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432700182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 08:15 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 62K 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 Raft-PT-05-00
FORMULA_NAME Raft-PT-05-01
FORMULA_NAME Raft-PT-05-02
FORMULA_NAME Raft-PT-05-03
FORMULA_NAME Raft-PT-05-04
FORMULA_NAME Raft-PT-05-05
FORMULA_NAME Raft-PT-05-06
FORMULA_NAME Raft-PT-05-07
FORMULA_NAME Raft-PT-05-08
FORMULA_NAME Raft-PT-05-09
FORMULA_NAME Raft-PT-05-10
FORMULA_NAME Raft-PT-05-11
FORMULA_NAME Raft-PT-05-12
FORMULA_NAME Raft-PT-05-13
FORMULA_NAME Raft-PT-05-14
FORMULA_NAME Raft-PT-05-15

=== Now, execution of the tool begins

BK_START 1621423521457

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 11:25:23] [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-19 11:25:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:25:23] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-19 11:25:23] [INFO ] Transformed 133 places.
[2021-05-19 11:25:23] [INFO ] Transformed 238 transitions.
[2021-05-19 11:25:23] [INFO ] Found NUPN structural information;
[2021-05-19 11:25:23] [INFO ] Parsed PT model containing 133 places and 238 transitions in 113 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 268 ms. (steps per millisecond=373 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-19 11:25:24] [INFO ] Flow matrix only has 195 transitions (discarded 21 similar events)
// Phase 1: matrix 195 rows 133 cols
[2021-05-19 11:25:24] [INFO ] Computed 25 place invariants in 6 ms
[2021-05-19 11:25:24] [INFO ] [Real]Absence check using 25 positive place invariants in 28 ms returned sat
[2021-05-19 11:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:25:24] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-19 11:25:24] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-19 11:25:24] [INFO ] [Real]Added 104 Read/Feed constraints in 28 ms returned sat
[2021-05-19 11:25:24] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 32 ms.
[2021-05-19 11:25:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:25:24] [INFO ] [Nat]Absence check using 25 positive place invariants in 32 ms returned sat
[2021-05-19 11:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:25:24] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-19 11:25:24] [INFO ] [Nat]Added 104 Read/Feed constraints in 11 ms returned sat
[2021-05-19 11:25:25] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 14 ms.
[2021-05-19 11:25:26] [INFO ] Added : 186 causal constraints over 38 iterations in 1201 ms. Result :sat
[2021-05-19 11:25:26] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 11:25:26] [INFO ] Flatten gal took : 58 ms
FORMULA Raft-PT-05-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-05-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 11:25:26] [INFO ] Applying decomposition
[2021-05-19 11:25:26] [INFO ] Flatten gal took : 17 ms
[2021-05-19 11:25:26] [INFO ] Decomposing Gal with order
[2021-05-19 11:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 11:25:26] [INFO ] Removed a total of 168 redundant transitions.
[2021-05-19 11:25:26] [INFO ] Flatten gal took : 64 ms
[2021-05-19 11:25:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 24 ms.
[2021-05-19 11:25:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 11:25:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Raft-PT-05 @ 3570 seconds

FORMULA Raft-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Raft-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1990
rslt: Output for LTLFireability @ Raft-PT-05

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 11:25:26 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 8,
"adisj": 0,
"aneg": 4,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((((1 <= p0)) AND (G ((F ((((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))) AND ((((1 <= p95) AND (1 <= p125)) U ((1 <= p116) AND (1 <= p132))) OR (((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))))) OR F (((1 <= p117))))))",
"processed_size": 250,
"rewrites": 65
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 0,
"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": 324
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"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": "((p65 <= 0) OR (p120 <= 0))",
"processed_size": 28,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p65) AND (1 <= p120))) OR (G ((F (((1 <= p107))) AND (X (((1 <= p107))) OR ((1 <= p107))))) OR G (((1 <= p107))))))",
"processed_size": 129,
"rewrites": 65
},
"result":
{
"edges": 228,
"markings": 198,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"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": "((p62 <= 0) OR (p105 <= 0))",
"processed_size": 28,
"rewrites": 67
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 41
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p29) AND (1 <= p115))))",
"processed_size": 36,
"rewrites": 65
},
"result":
{
"edges": 6,
"markings": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((G ((G (((1 <= p45) AND (1 <= p115))) AND ((p45 <= 0) OR (p115 <= 0)))) OR (G (((1 <= p45) AND (1 <= p115))) OR ((1 <= p45) AND (1 <= p115))))))",
"processed_size": 151,
"rewrites": 65
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((p65 <= 0) OR (p120 <= 0))))",
"processed_size": 36,
"rewrites": 65
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 810
},
"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": "((p105 <= 0) OR (p126 <= 0))",
"processed_size": 29,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"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": "G (F (((1 <= p18) AND (1 <= p125))))",
"processed_size": 36,
"rewrites": 65
},
"result":
{
"edges": 9,
"markings": 9,
"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": 2785
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2785
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110))",
"processed_size": 59,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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 (F (((1 <= p40) AND (1 <= p110))))",
"processed_size": 36,
"rewrites": 65
},
"result":
{
"edges": 86,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p116 <= 0))",
"processed_size": 13,
"rewrites": 67
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3208,
"runtime": 1580.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** AND (G((F((* R *)) AND ((** U **) OR (* R *)))) OR F(**)))) : (X(G((G(**) OR (** OR (** OR **))))) OR F(**)) : G(F(**)) : (** OR (G((X(**) OR (G((F(**) AND (X(**) OR **))) OR G(**)))) AND F(**))) : X(F((G((F(**) OR **)) OR G(**)))) : (X(G(**)) OR ((G(**) AND F(G(**))) OR F(**))) : X(G(**)) : X(F((G((G(**) AND **)) OR (G(**) OR **)))) : X(F(*)) : F(**) : F(G(*)) : (** OR (G(F(**)) AND F(**)))"
},
"net":
{
"arcs": 820,
"conflict_clusters": 15,
"places": 133,
"places_significant": 108,
"singleton_clusters": 0,
"transitions": 216
},
"result":
{
"preliminary_value": "no unknown no no no no no yes no yes unknown no ",
"value": "no unknown no no no no no yes no yes unknown 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: 349/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 133
lola: finding significant places
lola: 133 places, 216 transitions, 108 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: X ((((1 <= p0)) AND (G (((((1 <= p95) AND (1 <= p125)) U ((1 <= p116) AND (1 <= p132))) U NOT((((1 <= p95) AND (1 <= p125)) U ((1 <= p70) AND (1 <= p120)))))) OR F (((1 <= p117)))))) : (G (X ((((G (((1 <= p125) AND (1 <= p126))) OR ((p87 <= 0))) OR ((p110 <= 0))) OR ((1 <= p116))))) OR F (((1 <= p116)))) : (NOT(G (((F (((1 <= p117))) AND ((p118 <= 0))) U ((1 <= p7) AND (1 <= p115))))) U G (F (((1 <= p18) AND (1 <= p125))))) : (G (((X (((1 <= p65) AND (1 <= p120))) OR G ((X (((1 <= p107))) U ((1 <= p107))))) OR G (((1 <= p107))))) U ((1 <= p65) AND (1 <= p120))) : X ((F (X (G ((F (((1 <= p0))) OR ((1 <= p96) AND (1 <= p120)))))) OR F (NOT(X (NOT(G (((1 <= p131))))))))) : ((G (((1 <= p75) AND (1 <= p120) AND (1 <= p120))) U G (X (G (((1 <= p29) AND (1 <= p115)))))) OR F (((1 <= p62) AND (1 <= p105)))) : G (X (G (((1 <= p93) AND (1 <= p115) AND (1 <= p120))))) : F (X (((G ((G (((1 <= p45) AND (1 <= p115))) AND ((p45 <= 0) OR (p115 <= 0)))) OR G (((1 <= p45) AND (1 <= p115)))) OR ((1 <= p45) AND (1 <= p115))))) : F (X ((((1 <= p116) AND (1 <= p132)) U NOT(G (((1 <= p65) AND (1 <= p120))))))) : (X ((X (F (G (X (G (((1 <= p50) AND (1 <= p115))))))) U ((1 <= p115) AND (1 <= p126)))) U F (((1 <= p105) AND (1 <= p126)))) : X (X (G (NOT(G (F (((1 <= p78) AND (1 <= p125)))))))) : (G (F (((1 <= p40) AND (1 <= p110)))) U ((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110)))
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0)) AND (G ((F ((((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))) AND ((((1 <= p95) AND (1 <= p125)) U ((1 <= p116) AND (1 <= p132))) OR (((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))))) OR F (((1 <= p117))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0)) AND (G ((F ((((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))) AND ((((1 <= p95) AND (1 <= p125)) U ((1 <= p116) AND (1 <= p132))) OR (((p95 <= 0) OR (p125 <= 0)) R ((p70 <= 0) OR (p120 <= 0)))))) OR F (((1 <= p117))))))
lola: processed formula length: 250
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116))))))) OR F (((1 <= p116))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p116)))
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: ((p116 <= 0))
lola: processed formula length: 13
lola: 67 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116)))))))
lola: processed formula length: 97
lola: 65 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: 2017957 markings, 2836802 edges, 403591 markings/sec, 0 secs
lola: 3892580 markings, 5502673 edges, 374925 markings/sec, 5 secs
lola: 5629794 markings, 7973626 edges, 347443 markings/sec, 10 secs
lola: 7334301 markings, 10403333 edges, 340901 markings/sec, 15 secs
lola: 9111585 markings, 12939857 edges, 355457 markings/sec, 20 secs
lola: 10694488 markings, 15225793 edges, 316581 markings/sec, 25 secs
lola: 12270482 markings, 17498362 edges, 315199 markings/sec, 30 secs
lola: 13846678 markings, 19781744 edges, 315239 markings/sec, 35 secs
lola: 15593343 markings, 22293962 edges, 349333 markings/sec, 40 secs
lola: 17412793 markings, 24912734 edges, 363890 markings/sec, 45 secs
lola: 19169194 markings, 27452449 edges, 351280 markings/sec, 50 secs
lola: 20971229 markings, 30062558 edges, 360407 markings/sec, 55 secs
lola: 22651341 markings, 32503307 edges, 336022 markings/sec, 60 secs
lola: 24469009 markings, 35119515 edges, 363534 markings/sec, 65 secs
lola: 26283386 markings, 37735213 edges, 362875 markings/sec, 70 secs
lola: 28040271 markings, 40264396 edges, 351377 markings/sec, 75 secs
lola: 29714972 markings, 42700358 edges, 334940 markings/sec, 80 secs
lola: 31531461 markings, 45305526 edges, 363298 markings/sec, 85 secs
lola: 33253876 markings, 47806092 edges, 344483 markings/sec, 90 secs
lola: 34947899 markings, 50270023 edges, 338805 markings/sec, 95 secs
lola: 36716085 markings, 52833144 edges, 353637 markings/sec, 100 secs
lola: 38449800 markings, 55354832 edges, 346743 markings/sec, 105 secs
lola: 40182203 markings, 57879377 edges, 346481 markings/sec, 110 secs
lola: 41789166 markings, 60214031 edges, 321393 markings/sec, 115 secs
lola: 43310006 markings, 62441421 edges, 304168 markings/sec, 120 secs
lola: 44841153 markings, 64686669 edges, 306229 markings/sec, 125 secs
lola: 46457975 markings, 67060447 edges, 323364 markings/sec, 130 secs
lola: 48082331 markings, 69380112 edges, 324871 markings/sec, 135 secs
lola: 49654951 markings, 71668279 edges, 314524 markings/sec, 140 secs
lola: 51193520 markings, 73887328 edges, 307714 markings/sec, 145 secs
lola: 52720688 markings, 76118458 edges, 305434 markings/sec, 150 secs
lola: 54231417 markings, 78341918 edges, 302146 markings/sec, 155 secs
lola: 55771879 markings, 80609466 edges, 308092 markings/sec, 160 secs
lola: 57422275 markings, 83006641 edges, 330079 markings/sec, 165 secs
lola: 59013393 markings, 85353090 edges, 318224 markings/sec, 170 secs
lola: 60709381 markings, 87799849 edges, 339198 markings/sec, 175 secs
lola: 62370958 markings, 90233873 edges, 332315 markings/sec, 180 secs
lola: 64046157 markings, 92673913 edges, 335040 markings/sec, 185 secs
lola: 65703124 markings, 95067066 edges, 331393 markings/sec, 190 secs
lola: 67330403 markings, 97432821 edges, 325456 markings/sec, 195 secs
lola: 68981271 markings, 99840690 edges, 330174 markings/sec, 200 secs
lola: 70609401 markings, 102220536 edges, 325626 markings/sec, 205 secs
lola: 72252880 markings, 104622719 edges, 328696 markings/sec, 210 secs
lola: 73862743 markings, 106977327 edges, 321973 markings/sec, 215 secs
lola: 75438333 markings, 109279137 edges, 315118 markings/sec, 220 secs
lola: 76952361 markings, 111442619 edges, 302806 markings/sec, 225 secs
lola: 78342467 markings, 113500200 edges, 278021 markings/sec, 230 secs
lola: 79728348 markings, 115555647 edges, 277176 markings/sec, 235 secs
lola: 81212321 markings, 117710306 edges, 296795 markings/sec, 240 secs
lola: 82641218 markings, 119811062 edges, 285779 markings/sec, 245 secs
lola: 83831565 markings, 121578387 edges, 238069 markings/sec, 250 secs
lola: 85024221 markings, 123330668 edges, 238531 markings/sec, 255 secs
lola: 86115388 markings, 124944764 edges, 218233 markings/sec, 260 secs
lola: 87211160 markings, 126542732 edges, 219154 markings/sec, 265 secs
lola: 88276349 markings, 128106310 edges, 213038 markings/sec, 270 secs
lola: 89449878 markings, 129836956 edges, 234706 markings/sec, 275 secs
lola: 90658509 markings, 131608711 edges, 241726 markings/sec, 280 secs
lola: 91922787 markings, 133464284 edges, 252856 markings/sec, 285 secs
lola: 93039733 markings, 135097387 edges, 223389 markings/sec, 290 secs
lola: 94453224 markings, 137162711 edges, 282698 markings/sec, 295 secs
lola: 95662091 markings, 138943560 edges, 241773 markings/sec, 300 secs
lola: 96736507 markings, 140530087 edges, 214883 markings/sec, 305 secs
lola: 97735147 markings, 141984532 edges, 199728 markings/sec, 310 secs
lola: 98875079 markings, 143667241 edges, 227986 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1088 KB
lola: time consumption: 328 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p65) AND (1 <= p120)) OR (G ((X (((1 <= p65) AND (1 <= p120))) OR (G ((F (((1 <= p107))) AND (X (((1 <= p107))) OR ((1 <= p107))))) OR G (((1 <= p107)))))) AND F (((1 <= p65) AND (1 <= p120)))))
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: ((1 <= p65) AND (1 <= p120))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65) AND (1 <= p120))
lola: processed formula length: 28
lola: 65 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 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p65) AND (1 <= p120)))
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: ((p65 <= 0) OR (p120 <= 0))
lola: processed formula length: 28
lola: 67 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p65) AND (1 <= p120))) OR (G ((F (((1 <= p107))) AND (X (((1 <= p107))) OR ((1 <= p107))))) OR G (((1 <= p107))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p65) AND (1 <= p120))) OR (G ((F (((1 <= p107))) AND (X (((1 <= p107))) OR ((1 <= p107))))) OR G (((1 <= p107))))))
lola: processed formula length: 129
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 198 markings, 228 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F (((1 <= p0))) OR ((1 <= p96) AND (1 <= p120)))) OR G (((1 <= p131))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F (((1 <= p0))) OR ((1 <= p96) AND (1 <= p120)))) OR G (((1 <= p131))))))
lola: processed formula length: 84
lola: 65 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p29) AND (1 <= p115)))) OR ((G (((1 <= p75) AND (1 <= p120) AND (1 <= p120))) AND F (G (((1 <= p29) AND (1 <= p115))))) OR F (((1 <= p62) AND (1 <= p105)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p62) AND (1 <= p105)))
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: ((p62 <= 0) OR (p105 <= 0))
lola: processed formula length: 28
lola: 67 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p75) AND (1 <= p120) AND (1 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p75) AND (1 <= p120) AND (1 <= p120)))
lola: processed formula length: 48
lola: 65 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p29) AND (1 <= p115))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p29) AND (1 <= p115))))
lola: processed formula length: 36
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p93) AND (1 <= p115) AND (1 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p93) AND (1 <= p115) AND (1 <= p120))))
lola: processed formula length: 52
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((G (((1 <= p45) AND (1 <= p115))) AND ((p45 <= 0) OR (p115 <= 0)))) OR (G (((1 <= p45) AND (1 <= p115))) OR ((1 <= p45) AND (1 <= p115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((G (((1 <= p45) AND (1 <= p115))) AND ((p45 <= 0) OR (p115 <= 0)))) OR (G (((1 <= p45) AND (1 <= p115))) OR ((1 <= p45) AND (1 <= p115))))))
lola: processed formula length: 151
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p65 <= 0) OR (p120 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p65 <= 0) OR (p120 <= 0))))
lola: processed formula length: 36
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p105) AND (1 <= p126)))
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: ((p105 <= 0) OR (p126 <= 0))
lola: processed formula length: 29
lola: 67 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p18) AND (1 <= p125))))
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) AND (1 <= p125))))
lola: processed formula length: 36
lola: 65 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p78 <= 0) OR (p125 <= 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 (((p78 <= 0) OR (p125 <= 0))))
lola: processed formula length: 36
lola: 65 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: 1305342 markings, 2412766 edges, 261068 markings/sec, 0 secs
lola: 2731075 markings, 5031314 edges, 285147 markings/sec, 5 secs
lola: 4032153 markings, 7475460 edges, 260216 markings/sec, 10 secs
lola: 5323938 markings, 9928221 edges, 258357 markings/sec, 15 secs
lola: 6690434 markings, 12450877 edges, 273299 markings/sec, 20 secs
lola: 8112478 markings, 15076383 edges, 284409 markings/sec, 25 secs
lola: 9495999 markings, 17631639 edges, 276704 markings/sec, 30 secs
lola: 10874492 markings, 20187822 edges, 275699 markings/sec, 35 secs
lola: 12190830 markings, 22666557 edges, 263268 markings/sec, 40 secs
lola: 13445684 markings, 25061604 edges, 250971 markings/sec, 45 secs
lola: 14726114 markings, 27511720 edges, 256086 markings/sec, 50 secs
lola: 15965409 markings, 29901902 edges, 247859 markings/sec, 55 secs
lola: 17240228 markings, 32339270 edges, 254964 markings/sec, 60 secs
lola: 18466575 markings, 34704577 edges, 245269 markings/sec, 65 secs
lola: 19716235 markings, 37102214 edges, 249932 markings/sec, 70 secs
lola: 20905022 markings, 39437062 edges, 237757 markings/sec, 75 secs
lola: 22132646 markings, 41809064 edges, 245525 markings/sec, 80 secs
lola: 23486143 markings, 44356500 edges, 270699 markings/sec, 85 secs
lola: 24871417 markings, 46905617 edges, 277055 markings/sec, 90 secs
lola: 26177422 markings, 49356664 edges, 261201 markings/sec, 95 secs
lola: 27515472 markings, 51842544 edges, 267610 markings/sec, 100 secs
lola: 28734052 markings, 54187887 edges, 243716 markings/sec, 105 secs
lola: 29944892 markings, 56512300 edges, 242168 markings/sec, 110 secs
lola: 31301185 markings, 59039339 edges, 271259 markings/sec, 115 secs
lola: 32556103 markings, 61467384 edges, 250984 markings/sec, 120 secs
lola: 33732875 markings, 63752545 edges, 235354 markings/sec, 125 secs
lola: 35087964 markings, 66265758 edges, 271018 markings/sec, 130 secs
lola: 36317046 markings, 68604457 edges, 245816 markings/sec, 135 secs
lola: 37542343 markings, 70961997 edges, 245059 markings/sec, 140 secs
lola: 38757489 markings, 73315762 edges, 243029 markings/sec, 145 secs
lola: 39918876 markings, 75574175 edges, 232277 markings/sec, 150 secs
lola: 41086899 markings, 77844381 edges, 233605 markings/sec, 155 secs
lola: 42426579 markings, 80366513 edges, 267936 markings/sec, 160 secs
lola: 43798273 markings, 82931765 edges, 274339 markings/sec, 165 secs
lola: 45036045 markings, 85285404 edges, 247554 markings/sec, 170 secs
lola: 46143447 markings, 87479413 edges, 221480 markings/sec, 175 secs
lola: 47505888 markings, 89993716 edges, 272488 markings/sec, 180 secs
lola: 48749741 markings, 92379325 edges, 248771 markings/sec, 185 secs
lola: 50017466 markings, 94789846 edges, 253545 markings/sec, 190 secs
lola: 51319843 markings, 97222292 edges, 260475 markings/sec, 195 secs
lola: 52427373 markings, 99334679 edges, 221506 markings/sec, 200 secs
lola: 53450168 markings, 101331262 edges, 204559 markings/sec, 205 secs
lola: 54572737 markings, 103443419 edges, 224514 markings/sec, 210 secs
lola: 55787577 markings, 105744410 edges, 242968 markings/sec, 215 secs
lola: 57010892 markings, 108043470 edges, 244663 markings/sec, 220 secs
lola: 58135587 markings, 110202512 edges, 224939 markings/sec, 225 secs
lola: 59310437 markings, 112410085 edges, 234970 markings/sec, 230 secs
lola: 60442192 markings, 114554389 edges, 226351 markings/sec, 235 secs
lola: 61598161 markings, 116756302 edges, 231194 markings/sec, 240 secs
lola: 62862034 markings, 119080329 edges, 252775 markings/sec, 245 secs
lola: 64024693 markings, 121283964 edges, 232532 markings/sec, 250 secs
lola: 65227821 markings, 123564375 edges, 240626 markings/sec, 255 secs
lola: 66514527 markings, 125940636 edges, 257341 markings/sec, 260 secs
lola: 67808799 markings, 128321461 edges, 258854 markings/sec, 265 secs
lola: 69135498 markings, 130778102 edges, 265340 markings/sec, 270 secs
lola: 70437388 markings, 133204160 edges, 260378 markings/sec, 275 secs
lola: 71643761 markings, 135446365 edges, 241275 markings/sec, 280 secs
lola: 72818247 markings, 137674585 edges, 234897 markings/sec, 285 secs
lola: 73824480 markings, 139590842 edges, 201247 markings/sec, 290 secs
lola: 75043198 markings, 141939158 edges, 243744 markings/sec, 295 secs
lola: 76306133 markings, 144353529 edges, 252587 markings/sec, 300 secs
lola: 77573743 markings, 146730272 edges, 253522 markings/sec, 305 secs
lola: 78691484 markings, 148909555 edges, 223548 markings/sec, 310 secs
lola: 79860038 markings, 151099435 edges, 233711 markings/sec, 315 secs
lola: 81057099 markings, 153371959 edges, 239412 markings/sec, 320 secs
lola: 82207606 markings, 155636460 edges, 230101 markings/sec, 325 secs
lola: 83422634 markings, 157985870 edges, 243006 markings/sec, 330 secs
lola: 84572295 markings, 160218934 edges, 229932 markings/sec, 335 secs
lola: 85698005 markings, 162377644 edges, 225142 markings/sec, 340 secs
lola: 86761681 markings, 164461261 edges, 212735 markings/sec, 345 secs
lola: 87945626 markings, 166699149 edges, 236789 markings/sec, 350 secs
lola: 89027646 markings, 168727692 edges, 216404 markings/sec, 355 secs
lola: 90131335 markings, 170851422 edges, 220738 markings/sec, 360 secs
lola: 91286264 markings, 172984591 edges, 230986 markings/sec, 365 secs
lola: 92176724 markings, 174709818 edges, 178092 markings/sec, 370 secs
lola: 93309495 markings, 176909706 edges, 226554 markings/sec, 375 secs
lola: 94462859 markings, 179049524 edges, 230673 markings/sec, 380 secs
lola: 95729607 markings, 181381065 edges, 253350 markings/sec, 385 secs
lola: 96862470 markings, 183473273 edges, 226573 markings/sec, 390 secs
lola: 97894941 markings, 185402975 edges, 206494 markings/sec, 395 secs
lola: 98862638 markings, 187283849 edges, 193539 markings/sec, 400 secs
lola: 99910470 markings, 189294420 edges, 209566 markings/sec, 405 secs
lola: 101139224 markings, 191605228 edges, 245751 markings/sec, 410 secs
lola: 102264985 markings, 193804645 edges, 225152 markings/sec, 415 secs
lola: 103479277 markings, 196099238 edges, 242858 markings/sec, 420 secs
lola: 104600688 markings, 198182160 edges, 224282 markings/sec, 425 secs
lola: 105775147 markings, 200344237 edges, 234892 markings/sec, 430 secs
lola: 106863433 markings, 202352917 edges, 217657 markings/sec, 435 secs
lola: 107991486 markings, 204436344 edges, 225611 markings/sec, 440 secs
lola: 109294966 markings, 206847444 edges, 260696 markings/sec, 445 secs
lola: 109806590 markings, 207816330 edges, 102325 markings/sec, 450 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 2785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110)) OR (G (F (((1 <= p40) AND (1 <= p110)))) AND F (((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p84) AND (1 <= p105) AND (1 <= p35) AND (1 <= p110))
lola: processed formula length: 59
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p40) AND (1 <= p110))))
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 <= p40) AND (1 <= p110))))
lola: processed formula length: 36
lola: 65 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: 68 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116))))))) OR F (((1 <= p116))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p116)))
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: ((p116 <= 0))
lola: processed formula length: 13
lola: 67 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: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p125) AND (1 <= p126))) OR (((p87 <= 0)) OR (((p110 <= 0)) OR ((1 <= p116)))))))
lola: processed formula length: 97
lola: 65 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: 2180171 markings, 3067416 edges, 436034 markings/sec, 0 secs
lola: 4295325 markings, 6074132 edges, 423031 markings/sec, 5 secs
lola: 6375977 markings, 9046777 edges, 416130 markings/sec, 10 secs
lola: 8463983 markings, 12019061 edges, 417601 markings/sec, 15 secs
lola: 10415103 markings, 14825099 edges, 390224 markings/sec, 20 secs
lola: 12377411 markings, 17652211 edges, 392462 markings/sec, 25 secs
lola: 14155418 markings, 20221156 edges, 355601 markings/sec, 30 secs
lola: 15843052 markings, 22649647 edges, 337527 markings/sec, 35 secs
lola: 17567801 markings, 25135906 edges, 344950 markings/sec, 40 secs
lola: 19250263 markings, 27567808 edges, 336492 markings/sec, 45 secs
lola: 20938833 markings, 30016344 edges, 337714 markings/sec, 50 secs
lola: 22545612 markings, 32352425 edges, 321356 markings/sec, 55 secs
lola: 24248712 markings, 34800443 edges, 340620 markings/sec, 60 secs
lola: 25924905 markings, 37230154 edges, 335239 markings/sec, 65 secs
lola: 27633029 markings, 39679095 edges, 341625 markings/sec, 70 secs
lola: 29237350 markings, 42005706 edges, 320864 markings/sec, 75 secs
lola: 30817495 markings, 44289661 edges, 316029 markings/sec, 80 secs
lola: 32522980 markings, 46734861 edges, 341097 markings/sec, 85 secs
lola: 34079661 markings, 49012384 edges, 311336 markings/sec, 90 secs
lola: 35749343 markings, 51428974 edges, 333936 markings/sec, 95 secs
lola: 37400030 markings, 53835316 edges, 330137 markings/sec, 100 secs
lola: 39034432 markings, 56200801 edges, 326880 markings/sec, 105 secs
lola: 40570519 markings, 58447348 edges, 307217 markings/sec, 110 secs
lola: 42146793 markings, 60741391 edges, 315255 markings/sec, 115 secs
lola: 43803886 markings, 63159598 edges, 331419 markings/sec, 120 secs
lola: 45116901 markings, 65091050 edges, 262603 markings/sec, 125 secs
lola: 46638073 markings, 67325536 edges, 304234 markings/sec, 130 secs
lola: 48307931 markings, 69704018 edges, 333972 markings/sec, 135 secs
lola: 49906216 markings, 72033549 edges, 319657 markings/sec, 140 secs
lola: 51482689 markings, 74304584 edges, 315295 markings/sec, 145 secs
lola: 53050620 markings, 76599844 edges, 313586 markings/sec, 150 secs
lola: 54630923 markings, 78926763 edges, 316061 markings/sec, 155 secs
lola: 56270232 markings, 81327276 edges, 327862 markings/sec, 160 secs
lola: 57975282 markings, 83816747 edges, 341010 markings/sec, 165 secs
lola: 59590909 markings, 86201441 edges, 323125 markings/sec, 170 secs
lola: 61299479 markings, 88664691 edges, 341714 markings/sec, 175 secs
lola: 62920771 markings, 91040939 edges, 324258 markings/sec, 180 secs
lola: 64462913 markings, 93263732 edges, 308428 markings/sec, 185 secs
lola: 66013126 markings, 95522608 edges, 310043 markings/sec, 190 secs
lola: 67621382 markings, 97856116 edges, 321651 markings/sec, 195 secs
lola: 69288774 markings, 100295149 edges, 333478 markings/sec, 200 secs
lola: 70950427 markings, 102722821 edges, 332331 markings/sec, 205 secs
lola: 72645289 markings, 105195335 edges, 338972 markings/sec, 210 secs
lola: 74272822 markings, 107579014 edges, 325507 markings/sec, 215 secs
lola: 75929505 markings, 109983380 edges, 331337 markings/sec, 220 secs
lola: 77451778 markings, 112184517 edges, 304455 markings/sec, 225 secs
lola: 78867914 markings, 114276278 edges, 283227 markings/sec, 230 secs
lola: 80285535 markings, 116368059 edges, 283524 markings/sec, 235 secs
lola: 81848946 markings, 118641073 edges, 312682 markings/sec, 240 secs
lola: 83084502 markings, 120460985 edges, 247111 markings/sec, 245 secs
lola: 84070535 markings, 121919752 edges, 197207 markings/sec, 250 secs
lola: 85273399 markings, 123686445 edges, 240573 markings/sec, 255 secs
lola: 86460726 markings, 125451883 edges, 237465 markings/sec, 260 secs
lola: 87780400 markings, 127375106 edges, 263935 markings/sec, 265 secs
lola: 88901345 markings, 129034391 edges, 224189 markings/sec, 270 secs
lola: 90283540 markings, 131051716 edges, 276439 markings/sec, 275 secs
lola: 91186987 markings, 132390949 edges, 180689 markings/sec, 280 secs
lola: 92279864 markings, 133995766 edges, 218575 markings/sec, 285 secs
lola: 93630347 markings, 135951675 edges, 270097 markings/sec, 290 secs
lola: 94715922 markings, 137552485 edges, 217115 markings/sec, 295 secs
lola: 95665931 markings, 138949057 edges, 190002 markings/sec, 300 secs
lola: 96781181 markings, 140597729 edges, 223050 markings/sec, 305 secs
lola: 97793422 markings, 142068370 edges, 202448 markings/sec, 310 secs
lola: 98736467 markings, 143464953 edges, 188609 markings/sec, 315 secs
lola: 99830711 markings, 145066066 edges, 218849 markings/sec, 320 secs
lola: 100798855 markings, 146504062 edges, 193629 markings/sec, 325 secs
lola: 101586760 markings, 147676377 edges, 157581 markings/sec, 330 secs
lola: 102620798 markings, 149187277 edges, 206808 markings/sec, 335 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: F (G (((p78 <= 0) OR (p125 <= 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 (((p78 <= 0) OR (p125 <= 0))))
lola: processed formula length: 36
lola: 65 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: 1324720 markings, 2447271 edges, 264944 markings/sec, 0 secs
lola: 2606670 markings, 4810371 edges, 256390 markings/sec, 5 secs
lola: 3817905 markings, 7055614 edges, 242247 markings/sec, 10 secs
lola: 4939621 markings, 9201293 edges, 224343 markings/sec, 15 secs
lola: 6202493 markings, 11553638 edges, 252574 markings/sec, 20 secs
lola: 7581130 markings, 14087484 edges, 275727 markings/sec, 25 secs
lola: 8955261 markings, 16627576 edges, 274826 markings/sec, 30 secs
lola: 10328364 markings, 19172983 edges, 274621 markings/sec, 35 secs
lola: 11631668 markings, 21608477 edges, 260661 markings/sec, 40 secs
lola: 12871700 markings, 23971727 edges, 248006 markings/sec, 45 secs
lola: 14109579 markings, 26336175 edges, 247576 markings/sec, 50 secs
lola: 15375020 markings, 28745556 edges, 253088 markings/sec, 55 secs
lola: 16596415 markings, 31116997 edges, 244279 markings/sec, 60 secs
lola: 17806528 markings, 33446233 edges, 242023 markings/sec, 65 secs
lola: 19043695 markings, 35803955 edges, 247433 markings/sec, 70 secs
lola: 20244226 markings, 38137745 edges, 240106 markings/sec, 75 secs
lola: 21430975 markings, 40438017 edges, 237350 markings/sec, 80 secs
lola: 22574703 markings, 42673728 edges, 228746 markings/sec, 85 secs
lola: 23816765 markings, 44961411 edges, 248412 markings/sec, 90 secs
lola: 25074241 markings, 47289822 edges, 251495 markings/sec, 95 secs
lola: 26383643 markings, 49733942 edges, 261880 markings/sec, 100 secs
lola: 27699441 markings, 52184384 edges, 263160 markings/sec, 105 secs
lola: 28896163 markings, 54501466 edges, 239344 markings/sec, 110 secs
lola: 30092022 markings, 56796978 edges, 239172 markings/sec, 115 secs
lola: 31462702 markings, 59339268 edges, 274136 markings/sec, 120 secs
lola: 32575057 markings, 61504513 edges, 222471 markings/sec, 125 secs
lola: 33616504 markings, 63525623 edges, 208289 markings/sec, 130 secs
lola: 34762091 markings, 65660505 edges, 229117 markings/sec, 135 secs
lola: 35960314 markings, 67910294 edges, 239645 markings/sec, 140 secs
lola: 37020957 markings, 69996207 edges, 212129 markings/sec, 145 secs
lola: 38166909 markings, 72154016 edges, 229190 markings/sec, 150 secs
lola: 39201540 markings, 74161909 edges, 206926 markings/sec, 155 secs
lola: 40263438 markings, 76257999 edges, 212380 markings/sec, 160 secs
lola: 41435047 markings, 78539798 edges, 234322 markings/sec, 165 secs
lola: 42861287 markings, 81167658 edges, 285248 markings/sec, 170 secs
lola: 44178277 markings, 83649876 edges, 263398 markings/sec, 175 secs
lola: 45380612 markings, 85958500 edges, 240467 markings/sec, 180 secs
lola: 46536091 markings, 88207352 edges, 231096 markings/sec, 185 secs
lola: 47877527 markings, 90686864 edges, 268287 markings/sec, 190 secs
lola: 49100967 markings, 93040634 edges, 244688 markings/sec, 195 secs
lola: 50401753 markings, 95492697 edges, 260157 markings/sec, 200 secs
lola: 51697762 markings, 97933056 edges, 259202 markings/sec, 205 secs
lola: 52788200 markings, 100042779 edges, 218088 markings/sec, 210 secs
lola: 53821373 markings, 102044980 edges, 206635 markings/sec, 215 secs
lola: 54977081 markings, 104201611 edges, 231142 markings/sec, 220 secs
lola: 56077809 markings, 106283071 edges, 220146 markings/sec, 225 secs
lola: 57330582 markings, 108653352 edges, 250555 markings/sec, 230 secs
lola: 58562449 markings, 111010609 edges, 246373 markings/sec, 235 secs
lola: 59850291 markings, 113417002 edges, 257568 markings/sec, 240 secs
lola: 60994924 markings, 115635294 edges, 228927 markings/sec, 245 secs
lola: 62424557 markings, 118273636 edges, 285927 markings/sec, 250 secs
lola: 63792260 markings, 120849004 edges, 273541 markings/sec, 255 secs
lola: 65121673 markings, 123366481 edges, 265883 markings/sec, 260 secs
lola: 66555641 markings, 126016724 edges, 286794 markings/sec, 265 secs
lola: 67992671 markings, 128659555 edges, 287406 markings/sec, 270 secs
lola: 69395013 markings, 131257806 edges, 280468 markings/sec, 275 secs
lola: 70758380 markings, 133800226 edges, 272673 markings/sec, 280 secs
lola: 72117885 markings, 136342631 edges, 271901 markings/sec, 285 secs
lola: 73416477 markings, 138803195 edges, 259718 markings/sec, 290 secs
lola: 74683031 markings, 141240090 edges, 253311 markings/sec, 295 secs
lola: 75946432 markings, 143676315 edges, 252680 markings/sec, 300 secs
lola: 77294968 markings, 146192599 edges, 269707 markings/sec, 305 secs
lola: 78524441 markings, 148586929 edges, 245895 markings/sec, 310 secs
lola: 79832904 markings, 151047006 edges, 261693 markings/sec, 315 secs
lola: 81126487 markings, 153512352 edges, 258717 markings/sec, 320 secs
lola: 82313814 markings, 155845500 edges, 237465 markings/sec, 325 secs
lola: 83524079 markings, 158182119 edges, 242053 markings/sec, 330 secs
lola: 84732949 markings, 160541013 edges, 241774 markings/sec, 335 secs
lola: 85980300 markings, 162934195 edges, 249470 markings/sec, 340 secs
lola: 87180573 markings, 165273101 edges, 240055 markings/sec, 345 secs
lola: 88417685 markings, 167580004 edges, 247422 markings/sec, 350 secs
lola: 89365946 markings, 169393836 edges, 189652 markings/sec, 355 secs
lola: 90421027 markings, 171384322 edges, 211016 markings/sec, 360 secs
lola: 91504181 markings, 173385260 edges, 216631 markings/sec, 365 secs
lola: 92430502 markings, 175218979 edges, 185264 markings/sec, 370 secs
lola: 93536467 markings, 177333518 edges, 221193 markings/sec, 375 secs
lola: 94827420 markings, 179720201 edges, 258191 markings/sec, 380 secs
lola: 96083389 markings, 182035004 edges, 251194 markings/sec, 385 secs
lola: 97329232 markings, 184328785 edges, 249169 markings/sec, 390 secs
lola: 98495697 markings, 186559947 edges, 233293 markings/sec, 395 secs
lola: 99608106 markings, 188705269 edges, 222482 markings/sec, 400 secs
lola: 100855879 markings, 191065305 edges, 249555 markings/sec, 405 secs
lola: 102015466 markings, 193309924 edges, 231917 markings/sec, 410 secs
lola: 103161577 markings, 195516067 edges, 229222 markings/sec, 415 secs
lola: 104411421 markings, 197831566 edges, 249969 markings/sec, 420 secs
lola: 105714882 markings, 200233638 edges, 260692 markings/sec, 425 secs
lola: 106830759 markings, 202290369 edges, 223175 markings/sec, 430 secs
lola: 108131028 markings, 204697502 edges, 260054 markings/sec, 435 secs
lola: 109115688 markings, 206515136 edges, 196932 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no no no yes no yes unknown no
lola:
preliminary result: no unknown no no no no no yes no yes unknown no
lola: memory consumption: 3208 KB
lola: time consumption: 1580 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="Raft-PT-05"
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 Raft-PT-05, 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 r189-tajo-162089432700182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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