fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477700618
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldPPPt-PT-004A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15773.090 3600000.00 1359450.00 10202.70 FFFFFF?TFFFFFFFF 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/mcc2020-input.r211-tajo-159033477700618.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldPPPt-PT-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.3K May 14 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 19:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 19:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 27K May 12 20:42 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 ShieldPPPt-PT-004A-00
FORMULA_NAME ShieldPPPt-PT-004A-01
FORMULA_NAME ShieldPPPt-PT-004A-02
FORMULA_NAME ShieldPPPt-PT-004A-03
FORMULA_NAME ShieldPPPt-PT-004A-04
FORMULA_NAME ShieldPPPt-PT-004A-05
FORMULA_NAME ShieldPPPt-PT-004A-06
FORMULA_NAME ShieldPPPt-PT-004A-07
FORMULA_NAME ShieldPPPt-PT-004A-08
FORMULA_NAME ShieldPPPt-PT-004A-09
FORMULA_NAME ShieldPPPt-PT-004A-10
FORMULA_NAME ShieldPPPt-PT-004A-11
FORMULA_NAME ShieldPPPt-PT-004A-12
FORMULA_NAME ShieldPPPt-PT-004A-13
FORMULA_NAME ShieldPPPt-PT-004A-14
FORMULA_NAME ShieldPPPt-PT-004A-15

=== Now, execution of the tool begins

BK_START 1591317017535

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:30:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 00:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:30:20] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-06-05 00:30:20] [INFO ] Transformed 103 places.
[2020-06-05 00:30:20] [INFO ] Transformed 75 transitions.
[2020-06-05 00:30:20] [INFO ] Found NUPN structural information;
[2020-06-05 00:30:20] [INFO ] Parsed PT model containing 103 places and 75 transitions in 103 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 437 steps, including 0 resets, run visited all 43 properties in 13 ms. (steps per millisecond=33 )
[2020-06-05 00:30:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 00:30:20] [INFO ] Flatten gal took : 54 ms
FORMULA ShieldPPPt-PT-004A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:30:20] [INFO ] Applying decomposition
[2020-06-05 00:30:20] [INFO ] Flatten gal took : 9 ms
[2020-06-05 00:30:20] [INFO ] Decomposing Gal with order
[2020-06-05 00:30:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 00:30:20] [INFO ] Removed a total of 24 redundant transitions.
[2020-06-05 00:30:20] [INFO ] Flatten gal took : 62 ms
[2020-06-05 00:30:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2020-06-05 00:30:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-05 00:30:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-004A @ 3570 seconds

FORMULA ShieldPPPt-PT-004A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-004A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2287
rslt: Output for LTLFireability @ ShieldPPPt-PT-004A

{
"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 Jun 5 00:30:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((((((1 <= p79) AND (1 <= p98)) U G (((1 <= p74)))) OR ((1 <= p74))) AND (((1 <= p79)) AND ((1 <= p98))))) OR X (((1 <= p37) AND (1 <= p39)))))",
"processed_size": 149,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p91 <= 0) OR (p102 <= 0))))",
"processed_size": 36,
"rewrites": 63
},
"result":
{
"edges": 11708,
"markings": 10914,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 3,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p78) AND (1 <= p101)))) U ((G (((1 <= p41) AND (1 <= p52))) OR ((1 <= p81) AND (1 <= p96))) U (((1 <= p78) AND (1 <= p101)) U ((1 <= p74)))))",
"processed_size": 155,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 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 <= p15) AND (1 <= p49))",
"processed_size": 27,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((p74 <= 0)))",
"processed_size": 16,
"rewrites": 63
},
"result":
{
"edges": 34,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 1,
"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 (((p37 <= 0) OR (p39 <= 0)))",
"processed_size": 31,
"rewrites": 63
},
"result":
{
"edges": 70,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 0,
"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 (((1 <= p37) AND (1 <= p39)))",
"processed_size": 31,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F (((1 <= p11) AND (1 <= p21))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 80,
"markings": 80,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G (((p99 <= 0)))))",
"processed_size": 24,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p76 <= 0))",
"processed_size": 12,
"rewrites": 65
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G (((p53 <= 0) OR (p76 <= 0))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p81 <= 0) OR (p96 <= 0))",
"processed_size": 27,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X (F (((1 <= p72)))) OR ((1 <= p72))))",
"processed_size": 42,
"rewrites": 63
},
"result":
{
"edges": 96,
"markings": 96,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((X (((1 <= p20))) AND ((1 <= p41) AND (1 <= p52))))))",
"processed_size": 62,
"rewrites": 63
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p93 <= 0) OR (p100 <= 0))))",
"processed_size": 36,
"rewrites": 63
},
"result":
{
"edges": 10755,
"markings": 10027,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 <= p70) AND (1 <= p85))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0)))",
"processed_size": 92,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p79) AND (1 <= p98))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 38,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3796,
"runtime": 1283.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G((((** U G(**)) OR **) AND (** AND **))) OR X(**))) : F(G(*)) : (X((X(**) OR (** OR **))) AND G(F(*))) : (X(G(**)) U ((G(**) OR **) U (** U **))) : (G(*) AND (F(*) AND (X(**) OR **))) : F(G((** OR ((G(**) AND F(**)) OR G(F((* OR *))))))) : (X(**) OR ((G(**) AND X(F(**))) OR X(F(**)))) : X(X(G(*))) : F((G(F(**)) OR **)) : (X(G(*)) OR F(*)) : G(F(**)) : (F(G(**)) AND (* R *)) : (** AND X((X(F(**)) OR **))) : X(X(G((X(**) AND **))))"
},
"net":
{
"arcs": 292,
"conflict_clusters": 47,
"places": 103,
"places_significant": 58,
"singleton_clusters": 0,
"transitions": 74
},
"result":
{
"preliminary_value": "no no no no no unknown no no no no no no no no ",
"value": "no no no no no unknown no no no 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: 177/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3296
lola: finding significant places
lola: 103 places, 74 transitions, 58 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: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: G ((G (((((((1 <= p79) AND (1 <= p98)) U G (((1 <= p74)))) OR ((1 <= p74))) AND ((1 <= p79))) AND ((1 <= p98)))) OR X (((1 <= p37) AND (1 <= p39))))) : NOT((((G ((X ((((1 <= p93) AND (1 <= p100)) OR ((1 <= p101)))) AND G (((1 <= p93) AND (1 <= p100))))) AND ((1 <= p28))) AND ((1 <= p51))) U G (F (((1 <= p93) AND (1 <= p100)))))) : (X (((X (((1 <= p99))) OR ((p99 <= 0))) OR ((p76 <= 0)))) AND NOT(F (G (((1 <= p91) AND (1 <= p102)))))) : (X (G (((1 <= p78) AND (1 <= p101)))) U ((G (((1 <= p41) AND (1 <= p52))) OR ((1 <= p81) AND (1 <= p96))) U (((1 <= p78) AND (1 <= p101)) U ((1 <= p74))))) : ((NOT(F (((1 <= p74)))) AND NOT(G (((1 <= p62) AND (1 <= p64))))) AND (X (((p31 <= 0) OR (p46 <= 0))) OR ((1 <= p15) AND (1 <= p49)))) : F (G (((G (((1 <= p92) AND (1 <= p94))) U ((1 <= p18) AND (1 <= p25))) OR G ((NOT(G (((1 <= p16) AND (1 <= p27)))) OR NOT(G (((1 <= p40) AND (1 <= p74))))))))) : ((G (((p37 <= 0) OR (p39 <= 0))) U X (((1 <= p37) AND (1 <= p39)))) OR F (X (((1 <= p11) AND (1 <= p21))))) : NOT(X (F (X (((1 <= p99)))))) : F ((F (X (((1 <= p83) AND (1 <= p100)))) U (NOT(F (NOT(X (F (((1 <= p76))))))) OR ((1 <= p76))))) : (NOT(X (F (((1 <= p53) AND (1 <= p76))))) OR NOT(G (((p76 <= 0))))) : G (X ((X (((((1 <= p90)) U G (((1 <= p70) AND (1 <= p85)))) AND ((1 <= p90)))) U F (X (((1 <= p70) AND (1 <= p85))))))) : (F (G (X (((1 <= p79) AND (1 <= p98))))) AND NOT(((((1 <= p79) AND (1 <= p98) AND (1 <= p24)) OR ((1 <= p24))) U ((1 <= p4) AND (1 <= p23))))) : (((p81 <= 0) OR (p96 <= 0)) AND (X (X (F (((1 <= p72))))) OR X (((1 <= p72))))) : G (X ((X (X (((1 <= p20)))) AND X (((1 <= p41) AND (1 <= p52))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:353
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((((1 <= p79) AND (1 <= p98)) U G (((1 <= p74)))) OR ((1 <= p74))) AND (((1 <= p79)) AND ((1 <= p98))))) OR X (((1 <= p37) AND (1 <= p39)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((((1 <= p79) AND (1 <= p98)) U G (((1 <= p74)))) OR ((1 <= p74))) AND (((1 <= p79)) AND ((1 <= p98))))) OR X (((1 <= p37) AND (1 <= p39)))))
lola: processed formula length: 149
lola: 63 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (((1 <= p99))) OR (((p99 <= 0)) OR ((p76 <= 0))))) AND G (F (((p91 <= 0) OR (p102 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p91 <= 0) OR (p102 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p91 <= 0) OR (p102 <= 0))))
lola: processed formula length: 36
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10914 markings, 11708 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p78) AND (1 <= p101)))) U ((G (((1 <= p41) AND (1 <= p52))) OR ((1 <= p81) AND (1 <= p96))) U (((1 <= p78) AND (1 <= p101)) U ((1 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p78) AND (1 <= p101)))) U ((G (((1 <= p41) AND (1 <= p52))) OR ((1 <= p81) AND (1 <= p96))) U (((1 <= p78) AND (1 <= p101)) U ((1 <= p74)))))
lola: processed formula length: 155
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p74 <= 0))) AND (F (((p62 <= 0) OR (p64 <= 0))) AND (X (((p31 <= 0) OR (p46 <= 0))) OR ((1 <= p15) AND (1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p49))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p49))
lola: processed formula length: 27
lola: 63 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 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p74 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p74 <= 0)))
lola: processed formula length: 16
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p37) AND (1 <= p39))) OR ((G (((p37 <= 0) OR (p39 <= 0))) AND X (F (((1 <= p37) AND (1 <= p39))))) OR X (F (((1 <= p11) AND (1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p37 <= 0) OR (p39 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p37 <= 0) OR (p39 <= 0)))
lola: processed formula length: 31
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 68 markings, 70 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p37) AND (1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p37) AND (1 <= p39)))
lola: processed formula length: 31
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p11) AND (1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p11) AND (1 <= p21))))
lola: processed formula length: 35
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 80 markings, 80 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p99 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p99 <= 0)))))
lola: processed formula length: 24
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p53 <= 0) OR (p76 <= 0)))) OR F (((1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p76 <= 0))
lola: processed formula length: 12
lola: 65 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p53 <= 0) OR (p76 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p53 <= 0) OR (p76 <= 0))))
lola: processed formula length: 35
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p81 <= 0) OR (p96 <= 0)) AND X ((X (F (((1 <= p72)))) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p81 <= 0) OR (p96 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p81 <= 0) OR (p96 <= 0))
lola: processed formula length: 27
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((1 <= p72)))) OR ((1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((1 <= p72)))) OR ((1 <= p72))))
lola: processed formula length: 42
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 96 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: lola: ================================================================================

lola: ...considering subproblem: X (X (G ((X (((1 <= p20))) AND ((1 <= p41) AND (1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (((1 <= p20))) AND ((1 <= p41) AND (1 <= p52))))))
lola: processed formula length: 62
lola: 63 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p93 <= 0) OR (p100 <= 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 (((p93 <= 0) OR (p100 <= 0))))
lola: processed formula length: 36
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10027 markings, 10755 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p70) AND (1 <= p85))))
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 <= p70) AND (1 <= p85))))
lola: processed formula length: 35
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((1 <= p76)))) OR ((1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((1 <= p76)))) OR ((1 <= p76))))
lola: processed formula length: 42
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p18) AND (1 <= p25)) OR ((G (((1 <= p92) AND (1 <= p94))) AND F (((1 <= p18) AND (1 <= p25)))) OR G (F ((((p16 <= 0) OR (p27 <= 0)) OR ((p40 <= 0) OR (p74 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p18) AND (1 <= p25)) OR ((G (((1 <= p92) AND (1 <= p94))) AND F (((1 <= p18) AND (1 <= p25)))) OR G (F ((((p16 <= 0) OR (p27 <= 0)) OR ((p40 <= 0) OR (p74 <= 0)))))))))
lola: processed formula length: 184
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 1360609 markings, 3213774 edges, 272122 markings/sec, 0 secs
lola: 2695610 markings, 6623434 edges, 267000 markings/sec, 5 secs
lola: 4091599 markings, 10305788 edges, 279198 markings/sec, 10 secs
lola: 5415979 markings, 13853106 edges, 264876 markings/sec, 15 secs
lola: 6673316 markings, 17279617 edges, 251467 markings/sec, 20 secs
lola: 7746361 markings, 20208277 edges, 214609 markings/sec, 25 secs
lola: 8849123 markings, 23241101 edges, 220552 markings/sec, 30 secs
lola: 9961694 markings, 26319139 edges, 222514 markings/sec, 35 secs
lola: 11090423 markings, 29443347 edges, 225746 markings/sec, 40 secs
lola: 12135741 markings, 32366875 edges, 209064 markings/sec, 45 secs
lola: 13202894 markings, 35366055 edges, 213431 markings/sec, 50 secs
lola: 14334577 markings, 38570947 edges, 226337 markings/sec, 55 secs
lola: 15494767 markings, 41852781 edges, 232038 markings/sec, 60 secs
lola: 16644264 markings, 45108609 edges, 229899 markings/sec, 65 secs
lola: 17778207 markings, 48329839 edges, 226789 markings/sec, 70 secs
lola: 18932011 markings, 51618603 edges, 230761 markings/sec, 75 secs
lola: 20105313 markings, 54963334 edges, 234660 markings/sec, 80 secs
lola: 21357654 markings, 58558276 edges, 250468 markings/sec, 85 secs
lola: 22602010 markings, 62137943 edges, 248871 markings/sec, 90 secs
lola: 23844188 markings, 65721667 edges, 248436 markings/sec, 95 secs
lola: 25053956 markings, 69196489 edges, 241954 markings/sec, 100 secs
lola: 26279416 markings, 72748177 edges, 245092 markings/sec, 105 secs
lola: 27595637 markings, 76562420 edges, 263244 markings/sec, 110 secs
lola: 28872759 markings, 80279501 edges, 255424 markings/sec, 115 secs
lola: 30070789 markings, 83768541 edges, 239606 markings/sec, 120 secs
lola: 31282195 markings, 87286672 edges, 242281 markings/sec, 125 secs
lola: 32505002 markings, 90843030 edges, 244561 markings/sec, 130 secs
lola: 33664060 markings, 94201309 edges, 231812 markings/sec, 135 secs
lola: 34862527 markings, 97702254 edges, 239693 markings/sec, 140 secs
lola: 36121505 markings, 101395839 edges, 251796 markings/sec, 145 secs
lola: 37332565 markings, 104943534 edges, 242212 markings/sec, 150 secs
lola: 38556814 markings, 108538326 edges, 244850 markings/sec, 155 secs
lola: 39788930 markings, 112158003 edges, 246423 markings/sec, 160 secs
lola: 41044943 markings, 115839964 edges, 251203 markings/sec, 165 secs
lola: 42314368 markings, 119571731 edges, 253885 markings/sec, 170 secs
lola: 43474338 markings, 122960308 edges, 231994 markings/sec, 175 secs
lola: 44649412 markings, 126438352 edges, 235015 markings/sec, 180 secs
lola: 45884432 markings, 130076764 edges, 247004 markings/sec, 185 secs
lola: 47142369 markings, 133796088 edges, 251587 markings/sec, 190 secs
lola: 48401779 markings, 137506463 edges, 251882 markings/sec, 195 secs
lola: 49663701 markings, 141241669 edges, 252384 markings/sec, 200 secs
lola: 50919031 markings, 144954594 edges, 251066 markings/sec, 205 secs
lola: 52177691 markings, 148684632 edges, 251732 markings/sec, 210 secs
lola: 53427378 markings, 152407168 edges, 249937 markings/sec, 215 secs
lola: 54699077 markings, 156179604 edges, 254340 markings/sec, 220 secs
lola: 55943168 markings, 159874739 edges, 248818 markings/sec, 225 secs
lola: 57189872 markings, 163573945 edges, 249341 markings/sec, 230 secs
lola: 58430861 markings, 167270091 edges, 248198 markings/sec, 235 secs
lola: 59679778 markings, 170993167 edges, 249783 markings/sec, 240 secs
lola: 60931197 markings, 174745928 edges, 250284 markings/sec, 245 secs
lola: 62172778 markings, 178461440 edges, 248316 markings/sec, 250 secs
lola: 63414973 markings, 182177152 edges, 248439 markings/sec, 255 secs
lola: 64653572 markings, 185862433 edges, 247720 markings/sec, 260 secs
lola: 65898809 markings, 189574933 edges, 249047 markings/sec, 265 secs
lola: 67140874 markings, 193301846 edges, 248413 markings/sec, 270 secs
lola: 68377987 markings, 197015759 edges, 247423 markings/sec, 275 secs
lola: 69615178 markings, 200719902 edges, 247438 markings/sec, 280 secs
lola: 70856485 markings, 204445182 edges, 248261 markings/sec, 285 secs
lola: 72100290 markings, 208184502 edges, 248761 markings/sec, 290 secs
lola: 73338370 markings, 211920134 edges, 247616 markings/sec, 295 secs
lola: 74561195 markings, 215589952 edges, 244565 markings/sec, 300 secs
lola: 75790569 markings, 219293425 edges, 245875 markings/sec, 305 secs
lola: 77035471 markings, 223031719 edges, 248980 markings/sec, 310 secs
lola: 78267401 markings, 226752467 edges, 246386 markings/sec, 315 secs
lola: 79479563 markings, 230404609 edges, 242432 markings/sec, 320 secs
lola: 80696485 markings, 234072299 edges, 243384 markings/sec, 325 secs
lola: 81921202 markings, 237777319 edges, 244943 markings/sec, 330 secs
lola: 83135590 markings, 241441214 edges, 242878 markings/sec, 335 secs
lola: 84353125 markings, 245142520 edges, 243507 markings/sec, 340 secs
lola: 85581426 markings, 248861021 edges, 245660 markings/sec, 345 secs
lola: 86802473 markings, 252576694 edges, 244209 markings/sec, 350 secs
lola: 88024920 markings, 256281186 edges, 244489 markings/sec, 355 secs
lola: 89246736 markings, 259970977 edges, 244363 markings/sec, 360 secs
lola: 90456925 markings, 263635534 edges, 242038 markings/sec, 365 secs
lola: 91665764 markings, 267303859 edges, 241768 markings/sec, 370 secs
lola: 92876167 markings, 270977585 edges, 242081 markings/sec, 375 secs
lola: 94086854 markings, 274668559 edges, 242137 markings/sec, 380 secs
lola: 95293612 markings, 278313683 edges, 241352 markings/sec, 385 secs
lola: 96503755 markings, 281986737 edges, 242029 markings/sec, 390 secs
lola: 97689482 markings, 285595029 edges, 237145 markings/sec, 395 secs
lola: 98890981 markings, 289243948 edges, 240300 markings/sec, 400 secs
lola: 100092462 markings, 292911242 edges, 240296 markings/sec, 405 secs
lola: 101293501 markings, 296575489 edges, 240208 markings/sec, 410 secs
lola: 102491007 markings, 300228400 edges, 239501 markings/sec, 415 secs
lola: 103691024 markings, 303890596 edges, 240003 markings/sec, 420 secs
lola: 104876023 markings, 307509396 edges, 237000 markings/sec, 425 secs
lola: 106073289 markings, 311169177 edges, 239453 markings/sec, 430 secs
lola: 107274700 markings, 314830685 edges, 240282 markings/sec, 435 secs
lola: 108456186 markings, 318441620 edges, 236297 markings/sec, 440 secs
lola: 109573766 markings, 321874389 edges, 223516 markings/sec, 445 secs
lola: 110437239 markings, 324522099 edges, 172695 markings/sec, 450 secs
lola: 111259944 markings, 327033289 edges, 164541 markings/sec, 455 secs
lola: 111918425 markings, 329055994 edges, 131696 markings/sec, 460 secs
lola: 112762663 markings, 331644103 edges, 168848 markings/sec, 465 secs
lola: 113584113 markings, 334155777 edges, 164290 markings/sec, 470 secs
lola: 114345845 markings, 336489244 edges, 152346 markings/sec, 475 secs
lola: 114855576 markings, 338054112 edges, 101946 markings/sec, 480 secs
lola: 115505517 markings, 340037529 edges, 129988 markings/sec, 485 secs
lola: 116227649 markings, 342254707 edges, 144426 markings/sec, 490 secs
lola: 116878515 markings, 344254621 edges, 130173 markings/sec, 495 secs
lola: 117706560 markings, 346801850 edges, 165609 markings/sec, 500 secs
lola: 118521079 markings, 349297339 edges, 162904 markings/sec, 505 secs
lola: 119361472 markings, 351852907 edges, 168079 markings/sec, 510 secs
lola: 120224063 markings, 354500158 edges, 172518 markings/sec, 515 secs
lola: 121172937 markings, 357410339 edges, 189775 markings/sec, 520 secs
lola: 121933966 markings, 359734149 edges, 152206 markings/sec, 525 secs
lola: 122707288 markings, 362106572 edges, 154664 markings/sec, 530 secs
lola: 123538444 markings, 364668666 edges, 166231 markings/sec, 535 secs
lola: 124268793 markings, 366900331 edges, 146070 markings/sec, 540 secs
lola: 125049006 markings, 369294181 edges, 156043 markings/sec, 545 secs
lola: 125872774 markings, 371840484 edges, 164754 markings/sec, 550 secs
lola: 126617125 markings, 374141407 edges, 148870 markings/sec, 555 secs
lola: 127329390 markings, 376327307 edges, 142453 markings/sec, 560 secs
lola: 128204802 markings, 379039836 edges, 175082 markings/sec, 565 secs
lola: 128965860 markings, 381388876 edges, 152212 markings/sec, 570 secs
lola: 129728009 markings, 383730155 edges, 152430 markings/sec, 575 secs
lola: 130433353 markings, 385899145 edges, 141069 markings/sec, 580 secs
lola: 131302599 markings, 388558204 edges, 173849 markings/sec, 585 secs
lola: 132146526 markings, 391156301 edges, 168785 markings/sec, 590 secs
lola: 133051023 markings, 393937417 edges, 180899 markings/sec, 595 secs
lola: 133943699 markings, 396675910 edges, 178535 markings/sec, 600 secs
lola: 134676774 markings, 398918635 edges, 146615 markings/sec, 605 secs
lola: 135272711 markings, 400748699 edges, 119187 markings/sec, 610 secs
lola: 135884938 markings, 402638592 edges, 122445 markings/sec, 615 secs
lola: 136740982 markings, 405280834 edges, 171209 markings/sec, 620 secs
lola: 137365524 markings, 407204407 edges, 124908 markings/sec, 625 secs
lola: 137646424 markings, 408065874 edges, 56180 markings/sec, 630 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 2929 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p79) AND (1 <= p98)))) AND ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2929 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0)))
lola: processed formula length: 92
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: 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 ((((1 <= p18) AND (1 <= p25)) OR ((G (((1 <= p92) AND (1 <= p94))) AND F (((1 <= p18) AND (1 <= p25)))) OR G (F ((((p16 <= 0) OR (p27 <= 0)) OR ((p40 <= 0) OR (p74 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p18) AND (1 <= p25)) OR ((G (((1 <= p92) AND (1 <= p94))) AND F (((1 <= p18) AND (1 <= p25)))) OR G (F ((((p16 <= 0) OR (p27 <= 0)) OR ((p40 <= 0) OR (p74 <= 0)))))))))
lola: processed formula length: 184
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 1607103 markings, 3833600 edges, 321421 markings/sec, 0 secs
lola: 2998132 markings, 7415601 edges, 278206 markings/sec, 5 secs
lola: 4340398 markings, 10965885 edges, 268453 markings/sec, 10 secs
lola: 5665296 markings, 14532579 edges, 264980 markings/sec, 15 secs
lola: 6964234 markings, 18073370 edges, 259788 markings/sec, 20 secs
lola: 8231983 markings, 21541519 edges, 253550 markings/sec, 25 secs
lola: 9490118 markings, 25013334 edges, 251627 markings/sec, 30 secs
lola: 10739419 markings, 28469788 edges, 249860 markings/sec, 35 secs
lola: 11970395 markings, 31905473 edges, 246195 markings/sec, 40 secs
lola: 13200233 markings, 35359233 edges, 245968 markings/sec, 45 secs
lola: 14432530 markings, 38848917 edges, 246459 markings/sec, 50 secs
lola: 15658635 markings, 42315674 edges, 245221 markings/sec, 55 secs
lola: 16891234 markings, 45812904 edges, 246520 markings/sec, 60 secs
lola: 18117955 markings, 49292233 edges, 245344 markings/sec, 65 secs
lola: 19340509 markings, 52780366 edges, 244511 markings/sec, 70 secs
lola: 20554371 markings, 56253363 edges, 242772 markings/sec, 75 secs
lola: 21748878 markings, 59681357 edges, 238901 markings/sec, 80 secs
lola: 22928970 markings, 63086198 edges, 236018 markings/sec, 85 secs
lola: 24116710 markings, 66506872 edges, 237548 markings/sec, 90 secs
lola: 25296310 markings, 69898185 edges, 235920 markings/sec, 95 secs
lola: 26483005 markings, 73338732 edges, 237339 markings/sec, 100 secs
lola: 27650759 markings, 76719798 edges, 233551 markings/sec, 105 secs
lola: 28822826 markings, 80132047 edges, 234413 markings/sec, 110 secs
lola: 29978585 markings, 83502476 edges, 231152 markings/sec, 115 secs
lola: 31145814 markings, 86886481 edges, 233446 markings/sec, 120 secs
lola: 32300864 markings, 90252963 edges, 231010 markings/sec, 125 secs
lola: 33442149 markings, 93563567 edges, 228257 markings/sec, 130 secs
lola: 34579719 markings, 96882002 edges, 227514 markings/sec, 135 secs
lola: 35717232 markings, 100212864 edges, 227503 markings/sec, 140 secs
lola: 36772876 markings, 103301556 edges, 211129 markings/sec, 145 secs
lola: 37799522 markings, 106315882 edges, 205329 markings/sec, 150 secs
lola: 38826425 markings, 109333867 edges, 205381 markings/sec, 155 secs
lola: 39910392 markings, 112515055 edges, 216793 markings/sec, 160 secs
lola: 41029889 markings, 115795844 edges, 223899 markings/sec, 165 secs
lola: 42119550 markings, 118997908 edges, 217932 markings/sec, 170 secs
lola: 43154090 markings, 122021379 edges, 206908 markings/sec, 175 secs
lola: 44178668 markings, 125045690 edges, 204916 markings/sec, 180 secs
lola: 45286571 markings, 128307513 edges, 221581 markings/sec, 185 secs
lola: 46312343 markings, 131341178 edges, 205154 markings/sec, 190 secs
lola: 47340685 markings, 134374694 edges, 205668 markings/sec, 195 secs
lola: 48361131 markings, 137391822 edges, 204089 markings/sec, 200 secs
lola: 49422257 markings, 140535935 edges, 212225 markings/sec, 205 secs
lola: 50493526 markings, 143698980 edges, 214254 markings/sec, 210 secs
lola: 51532413 markings, 146773959 edges, 207777 markings/sec, 215 secs
lola: 52563909 markings, 149832891 edges, 206299 markings/sec, 220 secs
lola: 53592424 markings, 152899416 edges, 205703 markings/sec, 225 secs
lola: 54727935 markings, 156265112 edges, 227102 markings/sec, 230 secs
lola: 55875172 markings, 159674426 edges, 229447 markings/sec, 235 secs
lola: 57033760 markings, 163103552 edges, 231718 markings/sec, 240 secs
lola: 58181729 markings, 166525600 edges, 229594 markings/sec, 245 secs
lola: 59334401 markings, 169964197 edges, 230534 markings/sec, 250 secs
lola: 60495229 markings, 173432868 edges, 232166 markings/sec, 255 secs
lola: 61645221 markings, 176881540 edges, 229998 markings/sec, 260 secs
lola: 62800873 markings, 180335314 edges, 231130 markings/sec, 265 secs
lola: 63949442 markings, 183758005 edges, 229714 markings/sec, 270 secs
lola: 65097237 markings, 187181844 edges, 229559 markings/sec, 275 secs
lola: 66247733 markings, 190624763 edges, 230099 markings/sec, 280 secs
lola: 67398085 markings, 194073645 edges, 230070 markings/sec, 285 secs
lola: 68542345 markings, 197506953 edges, 228852 markings/sec, 290 secs
lola: 69693142 markings, 200951360 edges, 230159 markings/sec, 295 secs
lola: 70844198 markings, 204409497 edges, 230211 markings/sec, 300 secs
lola: 71998193 markings, 207873958 edges, 230799 markings/sec, 305 secs
lola: 73147137 markings, 211340610 edges, 229789 markings/sec, 310 secs
lola: 74291501 markings, 214777411 edges, 228873 markings/sec, 315 secs
lola: 75437677 markings, 218226713 edges, 229235 markings/sec, 320 secs
lola: 76593232 markings, 221705010 edges, 231111 markings/sec, 325 secs
lola: 77748550 markings, 225182414 edges, 231064 markings/sec, 330 secs
lola: 78898138 markings, 228665902 edges, 229918 markings/sec, 335 secs
lola: 80041026 markings, 232097718 edges, 228578 markings/sec, 340 secs
lola: 81195232 markings, 235575135 edges, 230841 markings/sec, 345 secs
lola: 82347331 markings, 239068190 edges, 230420 markings/sec, 350 secs
lola: 83506714 markings, 242571523 edges, 231877 markings/sec, 355 secs
lola: 84676552 markings, 246131164 edges, 233968 markings/sec, 360 secs
lola: 85842288 markings, 249655328 edges, 233147 markings/sec, 365 secs
lola: 86990804 markings, 253151298 edges, 229703 markings/sec, 370 secs
lola: 88165394 markings, 256707137 edges, 234918 markings/sec, 375 secs
lola: 89365854 markings, 260329959 edges, 240092 markings/sec, 380 secs
lola: 90572256 markings, 263983135 edges, 241280 markings/sec, 385 secs
lola: 91778917 markings, 267647085 edges, 241332 markings/sec, 390 secs
lola: 92992974 markings, 271333518 edges, 242811 markings/sec, 395 secs
lola: 94205280 markings, 275025753 edges, 242461 markings/sec, 400 secs
lola: 95424056 markings, 278702799 edges, 243755 markings/sec, 405 secs
lola: 96628681 markings, 282369432 edges, 240925 markings/sec, 410 secs
lola: 97823596 markings, 286003610 edges, 238983 markings/sec, 415 secs
lola: 99025963 markings, 289657216 edges, 240473 markings/sec, 420 secs
lola: 100225168 markings, 293315869 edges, 239841 markings/sec, 425 secs
lola: 101429669 markings, 296988760 edges, 240900 markings/sec, 430 secs
lola: 102622931 markings, 300637190 edges, 238652 markings/sec, 435 secs
lola: 103828860 markings, 304311566 edges, 241186 markings/sec, 440 secs
lola: 105028368 markings, 307968736 edges, 239902 markings/sec, 445 secs
lola: 106227900 markings, 311646386 edges, 239906 markings/sec, 450 secs
lola: 107430152 markings, 315309608 edges, 240450 markings/sec, 455 secs
lola: 108621387 markings, 318950885 edges, 238247 markings/sec, 460 secs
lola: 109623581 markings, 322024859 edges, 200439 markings/sec, 465 secs
lola: 110669842 markings, 325229462 edges, 209252 markings/sec, 470 secs
lola: 111714790 markings, 328434221 edges, 208990 markings/sec, 475 secs
lola: 112698377 markings, 331447108 edges, 196717 markings/sec, 480 secs
lola: 113532537 markings, 333996571 edges, 166832 markings/sec, 485 secs
lola: 114283332 markings, 336299805 edges, 150159 markings/sec, 490 secs
lola: 115111329 markings, 338837139 edges, 165599 markings/sec, 495 secs
lola: 115941671 markings, 341373452 edges, 166068 markings/sec, 500 secs
lola: 116784186 markings, 343965523 edges, 168503 markings/sec, 505 secs
lola: 117695642 markings, 346768887 edges, 182291 markings/sec, 510 secs
lola: 118316354 markings, 348666888 edges, 124142 markings/sec, 515 secs
lola: 119056046 markings, 350929506 edges, 147938 markings/sec, 520 secs
lola: 119853571 markings, 353366668 edges, 159505 markings/sec, 525 secs
lola: 120674971 markings, 355881446 edges, 164280 markings/sec, 530 secs
lola: 121535936 markings, 358514793 edges, 172193 markings/sec, 535 secs
lola: 122394717 markings, 361146579 edges, 171756 markings/sec, 540 secs
lola: 123259790 markings, 363797971 edges, 173015 markings/sec, 545 secs
lola: 124174150 markings, 366612302 edges, 182872 markings/sec, 550 secs
lola: 124940229 markings, 368960560 edges, 153216 markings/sec, 555 secs
lola: 125845529 markings, 371758805 edges, 181060 markings/sec, 560 secs
lola: 126629301 markings, 374178410 edges, 156754 markings/sec, 565 secs
lola: 127330733 markings, 376331487 edges, 140286 markings/sec, 570 secs
lola: 128082439 markings, 378657474 edges, 150341 markings/sec, 575 secs
lola: 128737499 markings, 380684853 edges, 131012 markings/sec, 580 secs
lola: 129537944 markings, 383152304 edges, 160089 markings/sec, 585 secs
lola: 130414683 markings, 385842213 edges, 175348 markings/sec, 590 secs
lola: 131333110 markings, 388652899 edges, 183685 markings/sec, 595 secs
lola: 132168306 markings, 391223857 edges, 167039 markings/sec, 600 secs
lola: 132943719 markings, 393604559 edges, 155083 markings/sec, 605 secs
lola: 133753837 markings, 396088354 edges, 162024 markings/sec, 610 secs
lola: 134734123 markings, 399095296 edges, 196057 markings/sec, 615 secs
lola: 135481643 markings, 401397337 edges, 149504 markings/sec, 620 secs
lola: 136549688 markings, 404690714 edges, 213609 markings/sec, 625 secs
lola: 137325724 markings, 407081660 edges, 155207 markings/sec, 630 secs
lola: 137652290 markings, 408085030 edges, 65313 markings/sec, 635 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p79) AND (1 <= p98)))) AND ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p79 <= 0) OR (p98 <= 0) OR (p24 <= 0)) AND ((p24 <= 0))) R ((p4 <= 0) OR (p23 <= 0)))
lola: processed formula length: 92
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: ========================================
lola: ...considering subproblem: F (G (((1 <= p79) AND (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p79) AND (1 <= p98))))
lola: processed formula length: 35
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 37 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no no no no no no
lola:
preliminary result: no no no no no unknown no no no no no no no no
lola: memory consumption: 3796 KB
lola: time consumption: 1283 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="ShieldPPPt-PT-004A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldPPPt-PT-004A, 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 r211-tajo-159033477700618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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