fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334400010
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for CircadianClock-PT-000100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16253.928 3600000.00 626594.00 9265.20 FFFFFFFTFFFFTF?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334400010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CircadianClock-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334400010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-000100-00
FORMULA_NAME CircadianClock-PT-000100-01
FORMULA_NAME CircadianClock-PT-000100-02
FORMULA_NAME CircadianClock-PT-000100-03
FORMULA_NAME CircadianClock-PT-000100-04
FORMULA_NAME CircadianClock-PT-000100-05
FORMULA_NAME CircadianClock-PT-000100-06
FORMULA_NAME CircadianClock-PT-000100-07
FORMULA_NAME CircadianClock-PT-000100-08
FORMULA_NAME CircadianClock-PT-000100-09
FORMULA_NAME CircadianClock-PT-000100-10
FORMULA_NAME CircadianClock-PT-000100-11
FORMULA_NAME CircadianClock-PT-000100-12
FORMULA_NAME CircadianClock-PT-000100-13
FORMULA_NAME CircadianClock-PT-000100-14
FORMULA_NAME CircadianClock-PT-000100-15

=== Now, execution of the tool begins

BK_START 1620896327796

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 08:58:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 08:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:58:50] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-13 08:58:50] [INFO ] Transformed 14 places.
[2021-05-13 08:58:50] [INFO ] Transformed 16 transitions.
[2021-05-13 08:58:50] [INFO ] Parsed PT model containing 14 places and 16 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 08:58:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-13 08:58:50] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 08:58:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 08:58:51] [INFO ] Flatten gal took : 39 ms
FORMULA CircadianClock-PT-000100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:58:51] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:58:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 08:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CircadianClock-PT-000100 @ 3570 seconds

FORMULA CircadianClock-PT-000100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircadianClock-PT-000100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-000100-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2970
rslt: Output for LTLFireability @ CircadianClock-PT-000100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 08:58:51 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G (F (((p7 <= 0) OR (p9 <= 0)))) OR X ((X (((1 <= p0) AND (1 <= p2))) AND ((1 <= p6) AND (1 <= p13)))))))",
"processed_size": 113,
"rewrites": 159
},
"result":
{
"edges": 1304,
"markings": 1303,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p5) AND (1 <= p10))",
"processed_size": 26,
"rewrites": 161
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (((p3 <= 0) OR (p13 <= 0) OR (p7 <= 0)))",
"processed_size": 44,
"rewrites": 159
},
"result":
{
"edges": 11538210,
"markings": 4127110,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (X (G ((p7 <= 0)))) AND (F ((F (((p5 <= 0) OR (p10 <= 0))) OR (1 <= p7))) OR X (X (G ((p7 <= 0)))))))",
"processed_size": 108,
"rewrites": 159
},
"result":
{
"edges": 402,
"markings": 402,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 323
},
"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 <= p5) AND (1 <= p10))))",
"processed_size": 34,
"rewrites": 159
},
"result":
{
"edges": 402,
"markings": 402,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p13) AND (1 <= p0)) U (X ((1 <= p0)) OR (((p0 <= 0) OR (p2 <= 0)) U (1 <= p0))))",
"processed_size": 103,
"rewrites": 159
},
"result":
{
"edges": 402,
"markings": 402,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((((p6 <= 0) OR (p13 <= 0)) AND (F (((p2 <= 0) OR (p11 <= 0))) OR ((1 <= p2) AND (1 <= p11))))))",
"processed_size": 103,
"rewrites": 159
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"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 <= p5) AND (1 <= p13))",
"processed_size": 26,
"rewrites": 159
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((X (((p1 <= 0) OR (p9 <= 0))) OR (((p0 <= 0) OR (p4 <= 0)) R ((1 <= p3) AND (1 <= p11))))))",
"processed_size": 99,
"rewrites": 159
},
"result":
{
"edges": 8129418,
"markings": 4133527,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 710
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (((p0 <= 0) R (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))) AND (1 <= p0))))",
"processed_size": 105,
"rewrites": 159
},
"result":
{
"edges": 406,
"markings": 405,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p4)) U (F ((F (G (((1 <= p7) AND (1 <= p9)))) AND (1 <= p8))) OR G ((p8 <= 0))))",
"processed_size": 102,
"rewrites": 159
},
"result":
{
"edges": 403,
"markings": 403,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3380,
"runtime": 599.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G(F(**)) OR X((X(**) AND (** AND **)))))) : (** U (F((F(G(**)) AND **)) OR G(*))) : (X(G(**)) AND (F(**) AND G(*))) : G((X(X(G(*))) AND (F((F(*) OR *)) OR X(X(G(*)))))) : G(F((F(*) AND **))) : X(G(**)) : X(X(G((* OR *)))) : (** U (X(**) OR (** U **))) : X(F((* AND (F(*) OR *)))) : F(**) : (X(((** OR (G(**) AND F(**))) U **)) OR ((G(**) AND X(F(**))) OR **)) : F(G((X(*) OR (* R *)))) : F(G((G(F(**)) OR ((G(*) AND *) OR *)))) : F(G((X((* R (F(**) AND (* AND *)))) AND **)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no unknown no ",
"value": "no no no no no no no no no no no no 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: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G (F ((F (X (G (F (((p7 <= 0) OR (p9 <= 0)))))) OR X (((X (((1 <= p0) AND (1 <= p2))) AND (1 <= p6)) AND (1 <= p13)))))) : (((1 <= p0) AND (1 <= p4)) U (F ((F (G (X (G (((1 <= p7) AND (1 <= p9)))))) AND (1 <= p8))) OR NOT(F ((1 <= p8))))) : ((G (X (G (((1 <= p3) AND (1 <= p13))))) AND F (((p5 <= 0) OR (p10 <= 0)))) AND NOT(F (((1 <= p3) AND (1 <= p13) AND (1 <= p7))))) : NOT(F ((G ((G (((1 <= p5) AND (1 <= p10))) AND (p7 <= 0))) U X (F (X ((1 <= p7))))))) : G (((0 <= 0) U F ((NOT(G (((1 <= p6) AND (1 <= p13)))) AND (1 <= p0))))) : G (X (((1 <= p5) AND (1 <= p10)))) : NOT(X (F ((X (((1 <= p5) AND (1 <= p10))) AND X (((1 <= p3) AND (1 <= p13))))))) : (((1 <= p3) AND (1 <= p13) AND (1 <= p0)) U (X ((1 <= p0)) OR (((p0 <= 0) OR (p2 <= 0)) U (1 <= p0)))) : F ((NOT(X (((1 <= p6) AND (1 <= p13)))) AND (NOT(X (G (((1 <= p2) AND (1 <= p11))))) OR NOT(X (((p2 <= 0) OR (p11 <= 0))))))) : NOT(G (NOT(((NOT(G (X (NOT(F (X (X (((1 <= p0) AND (1 <= p2))))))))) AND (p0 <= 0)) U (1 <= p0))))) : ((G ((1 <= p6)) U X (((G (((p6 <= 0) AND (1 <= p5) AND (1 <= p13))) U ((1 <= p5) AND (1 <= p13))) U ((1 <= p5) AND (1 <= p13))))) OR ((1 <= p5) AND (1 <= p13))) : X (NOT(G (NOT(F (NOT(F (X ((X (((1 <= p1) AND (1 <= p9))) AND (((1 <= p0) AND (1 <= p4)) U ((p3 <= 0) OR (p11 <= 0)))))))))))) : F (G (NOT(X (((NOT(G (F ((1 <= p8)))) AND (F ((1 <= p8)) OR ((1 <= p4) AND (1 <= p10)))) AND (1 <= p8)))))) : G (F (G ((NOT(X (((1 <= p0) U ((NOT(F (((1 <= p3) AND (1 <= p13)))) OR (p3 <= 0)) OR (p13 <= 0))))) AND (1 <= p0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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 (F ((G (F (((p7 <= 0) OR (p9 <= 0)))) OR X ((X (((1 <= p0) AND (1 <= p2))) AND ((1 <= p6) AND (1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F (((p7 <= 0) OR (p9 <= 0)))) OR X ((X (((1 <= p0) AND (1 <= p2))) AND ((1 <= p6) AND (1 <= p13)))))))
lola: processed formula length: 113
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 1303 markings, 1304 edges
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p3) AND (1 <= p13)))) AND (F (((p5 <= 0) OR (p10 <= 0))) AND G (((p3 <= 0) OR (p13 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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: F (((p5 <= 0) OR (p10 <= 0)))
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: ((1 <= p5) AND (1 <= p10))
lola: processed formula length: 26
lola: 161 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: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p13 <= 0) OR (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p13 <= 0) OR (p7 <= 0)))
lola: processed formula length: 44
lola: 159 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: 3518134 markings, 9744023 edges, 703627 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4127110 markings, 11538210 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G ((p7 <= 0)))) AND (F ((F (((p5 <= 0) OR (p10 <= 0))) OR (1 <= p7))) OR X (X (G ((p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G ((p7 <= 0)))) AND (F ((F (((p5 <= 0) OR (p10 <= 0))) OR (1 <= p7))) OR X (X (G ((p7 <= 0)))))))
lola: processed formula length: 108
lola: 159 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 402 markings, 402 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p5) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p5) AND (1 <= p10))))
lola: processed formula length: 34
lola: 159 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: 402 markings, 402 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p5 <= 0) OR (p10 <= 0)) OR ((p3 <= 0) OR (p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p5 <= 0) OR (p10 <= 0)) OR ((p3 <= 0) OR (p13 <= 0))))))
lola: processed formula length: 70
lola: 159 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: 3763055 markings, 10533714 edges, 752611 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3954801 markings, 11124122 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p13) AND (1 <= p0)) U (X ((1 <= p0)) OR (((p0 <= 0) OR (p2 <= 0)) U (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p3) AND (1 <= p13) AND (1 <= p0)) U (X ((1 <= p0)) OR (((p0 <= 0) OR (p2 <= 0)) U (1 <= p0))))
lola: processed formula length: 103
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 402 markings, 402 edges
lola: ========================================
lola: subprocess 6 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p6 <= 0) OR (p13 <= 0)) AND (F (((p2 <= 0) OR (p11 <= 0))) OR ((1 <= p2) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p6 <= 0) OR (p13 <= 0)) AND (F (((p2 <= 0) OR (p11 <= 0))) OR ((1 <= p2) AND (1 <= p11))))))
lola: processed formula length: 103
lola: 159 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: 602 markings, 602 edges
lola: ========================================
lola: subprocess 7 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((1 <= p5) AND (1 <= p13)) OR (G (((p6 <= 0) AND (1 <= p5) AND (1 <= p13))) AND F (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13)))) OR ((G ((1 <= p6)) AND X (F (((1 <= p5) AND (1 <= p13))))) OR ((1 <= p5) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p13))
lola: processed formula length: 26
lola: 159 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 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p6))
lola: processed formula length: 13
lola: 159 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p5) AND (1 <= p13)) OR (G (((p6 <= 0) AND (1 <= p5) AND (1 <= p13))) AND F (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p5) AND (1 <= p13)) OR (G (((p6 <= 0) AND (1 <= p5) AND (1 <= p13))) AND F (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13))))
lola: processed formula length: 148
lola: 159 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: 402 markings, 402 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p1 <= 0) OR (p9 <= 0))) OR (((p0 <= 0) OR (p4 <= 0)) R ((1 <= p3) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p1 <= 0) OR (p9 <= 0))) OR (((p0 <= 0) OR (p4 <= 0)) R ((1 <= p3) AND (1 <= p11))))))
lola: processed formula length: 99
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4133527 markings, 8129418 edges
lola: ========================================
lola: subprocess 9 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p0 <= 0) R (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p0 <= 0) R (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))) AND (1 <= p0))))
lola: processed formula length: 105
lola: 159 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: 405 markings, 406 edges
lola: ========================================
lola: subprocess 10 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0))
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: (p0 <= 0)
lola: processed formula length: 9
lola: 161 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: 302 markings, 302 edges
lola: ========================================
lola: subprocess 11 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((1 <= p8))) OR ((G ((p8 <= 0)) AND ((p4 <= 0) OR (p10 <= 0))) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((1 <= p8))) OR ((G ((p8 <= 0)) AND ((p4 <= 0) OR (p10 <= 0))) OR (p8 <= 0)))))
lola: processed formula length: 92
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 4203964 markings, 9053757 edges, 840793 markings/sec, 0 secs
lola: 8133907 markings, 18896670 edges, 785989 markings/sec, 5 secs
lola: 8182007 markings, 32784980 edges, 9620 markings/sec, 10 secs
lola: 11135174 markings, 42727943 edges, 590633 markings/sec, 15 secs
lola: 14818484 markings, 51125340 edges, 736662 markings/sec, 20 secs
lola: 16353222 markings, 62001249 edges, 306948 markings/sec, 25 secs
lola: 16615465 markings, 74213337 edges, 52449 markings/sec, 30 secs
lola: 18817308 markings, 84113067 edges, 440369 markings/sec, 35 secs
lola: 20879819 markings, 93723793 edges, 412502 markings/sec, 40 secs
lola: 22847709 markings, 103523947 edges, 393578 markings/sec, 45 secs
lola: 24789711 markings, 113230400 edges, 388400 markings/sec, 50 secs
lola: 26743666 markings, 122996269 edges, 390791 markings/sec, 55 secs
lola: 28698854 markings, 132768394 edges, 391038 markings/sec, 60 secs
lola: 32752663 markings, 141834726 edges, 810762 markings/sec, 65 secs
lola: 36725114 markings, 151084231 edges, 794490 markings/sec, 70 secs
lola: 37031832 markings, 164363095 edges, 61344 markings/sec, 75 secs
lola: 38079324 markings, 176191896 edges, 209498 markings/sec, 80 secs
lola: 41939778 markings, 184586679 edges, 772091 markings/sec, 85 secs
lola: 45211919 markings, 192959973 edges, 654428 markings/sec, 90 secs
lola: 45256185 markings, 204473848 edges, 8853 markings/sec, 95 secs
lola: 45500478 markings, 215720076 edges, 48859 markings/sec, 100 secs
lola: 47918619 markings, 226003780 edges, 483628 markings/sec, 105 secs
lola: 49895065 markings, 235823644 edges, 395289 markings/sec, 110 secs
lola: 51810300 markings, 245395083 edges, 383047 markings/sec, 115 secs
lola: 53711483 markings, 254884627 edges, 380237 markings/sec, 120 secs
lola: 55610511 markings, 264375169 edges, 379806 markings/sec, 125 secs
lola: 59504323 markings, 273180371 edges, 778762 markings/sec, 130 secs
lola: 63341718 markings, 282090021 edges, 767479 markings/sec, 135 secs
lola: 63989571 markings, 294604096 edges, 129571 markings/sec, 140 secs
lola: 64360878 markings, 306705160 edges, 74261 markings/sec, 145 secs
lola: 68473932 markings, 315496161 edges, 822611 markings/sec, 150 secs
lola: 72014439 markings, 323931567 edges, 708101 markings/sec, 155 secs
lola: 72221920 markings, 335831440 edges, 41496 markings/sec, 160 secs
lola: 72453245 markings, 347547368 edges, 46265 markings/sec, 165 secs
lola: 74865983 markings, 357809741 edges, 482548 markings/sec, 170 secs
lola: 76765454 markings, 367215877 edges, 379894 markings/sec, 175 secs
lola: 78627138 markings, 376519865 edges, 372337 markings/sec, 180 secs
lola: 82230553 markings, 385166392 edges, 720683 markings/sec, 185 secs
lola: 85983974 markings, 393778014 edges, 750684 markings/sec, 190 secs
lola: 87188903 markings, 405510777 edges, 240986 markings/sec, 195 secs
lola: 87224645 markings, 418391942 edges, 7148 markings/sec, 200 secs
lola: 90920990 markings, 426956968 edges, 739269 markings/sec, 205 secs
lola: 94519677 markings, 435274052 edges, 719737 markings/sec, 210 secs
lola: 95404851 markings, 445816280 edges, 177035 markings/sec, 215 secs
lola: 95443858 markings, 456950458 edges, 7801 markings/sec, 220 secs
lola: 97004548 markings, 466649918 edges, 312138 markings/sec, 225 secs
lola: 98947891 markings, 475258176 edges, 388669 markings/sec, 230 secs
lola: 101048628 markings, 484160593 edges, 420147 markings/sec, 235 secs
lola: 102673265 markings, 491663917 edges, 324927 markings/sec, 240 secs
lola: 104504944 markings, 499830959 edges, 366336 markings/sec, 245 secs
lola: 105827453 markings, 507759094 edges, 264502 markings/sec, 250 secs
lola: 107208360 markings, 515989124 edges, 276181 markings/sec, 255 secs
lola: 108751046 markings, 524469184 edges, 308537 markings/sec, 260 secs
lola: 110537886 markings, 533421556 edges, 357368 markings/sec, 265 secs
lola: 112264923 markings, 542048232 edges, 345407 markings/sec, 270 secs
lola: 113940082 markings, 550384844 edges, 335032 markings/sec, 275 secs
lola: 115302902 markings, 557213906 edges, 272564 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p6 <= 0) OR (p13 <= 0))) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p6 <= 0) OR (p13 <= 0))) AND (1 <= p0))))
lola: processed formula length: 54
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 501 markings, 501 edges
lola: ========================================
lola: subprocess 13 will run for 3263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p4)) U (F ((F (G (((1 <= p7) AND (1 <= p9)))) AND (1 <= p8))) OR G ((p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p0) AND (1 <= p4)) U (F ((F (G (((1 <= p7) AND (1 <= p9)))) AND (1 <= p8))) OR G ((p8 <= 0))))
lola: processed formula length: 102
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 403 markings, 403 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((1 <= p8))) OR ((G ((p8 <= 0)) AND ((p4 <= 0) OR (p10 <= 0))) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((1 <= p8))) OR ((G ((p8 <= 0)) AND ((p4 <= 0) OR (p10 <= 0))) OR (p8 <= 0)))))
lola: processed formula length: 92
lola: 159 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 4282099 markings, 9229637 edges, 856420 markings/sec, 0 secs
lola: 8136951 markings, 19286773 edges, 770970 markings/sec, 5 secs
lola: 8182007 markings, 33064521 edges, 9011 markings/sec, 10 secs
lola: 11046092 markings, 42527324 edges, 572817 markings/sec, 15 secs
lola: 14570470 markings, 50506713 edges, 704876 markings/sec, 20 secs
lola: 16353222 markings, 60038565 edges, 356550 markings/sec, 25 secs
lola: 16363618 markings, 71651475 edges, 2079 markings/sec, 30 secs
lola: 18235956 markings, 81224610 edges, 374468 markings/sec, 35 secs
lola: 20186020 markings, 90396967 edges, 390013 markings/sec, 40 secs
lola: 22003034 markings, 99335896 edges, 363403 markings/sec, 45 secs
lola: 23847294 markings, 108511537 edges, 368852 markings/sec, 50 secs
lola: 25638327 markings, 117482560 edges, 358207 markings/sec, 55 secs
lola: 27615983 markings, 127345694 edges, 395531 markings/sec, 60 secs
lola: 30547232 markings, 136857804 edges, 586250 markings/sec, 65 secs
lola: 34576640 markings, 145972996 edges, 805882 markings/sec, 70 secs
lola: 37002389 markings, 157148816 edges, 485150 markings/sec, 75 secs
lola: 37055460 markings, 170200158 edges, 10614 markings/sec, 80 secs
lola: 39876233 markings, 179969469 edges, 564155 markings/sec, 85 secs
lola: 43503132 markings, 188193077 edges, 725380 markings/sec, 90 secs
lola: 45243994 markings, 197848563 edges, 348172 markings/sec, 95 secs
lola: 45275141 markings, 209382795 edges, 6229 markings/sec, 100 secs
lola: 46333721 markings, 219429312 edges, 211716 markings/sec, 105 secs
lola: 48598068 markings, 229374886 edges, 452869 markings/sec, 110 secs
lola: 50563066 markings, 239147052 edges, 393000 markings/sec, 115 secs
lola: 52482537 markings, 248751448 edges, 383894 markings/sec, 120 secs
lola: 54400264 markings, 258312372 edges, 383545 markings/sec, 125 secs
lola: 56968104 markings, 267649545 edges, 513568 markings/sec, 130 secs
lola: 60916698 markings, 276431077 edges, 789719 markings/sec, 135 secs
lola: 63960103 markings, 286551355 edges, 608681 markings/sec, 140 secs
lola: 64006801 markings, 299280997 edges, 9340 markings/sec, 145 secs
lola: 66088110 markings, 310151666 edges, 416262 markings/sec, 150 secs
lola: 69908806 markings, 318725103 edges, 764139 markings/sec, 155 secs
lola: 72204049 markings, 328450144 edges, 459049 markings/sec, 160 secs
lola: 72229870 markings, 340228448 edges, 5164 markings/sec, 165 secs
lola: 73288692 markings, 351253809 edges, 211764 markings/sec, 170 secs
lola: 75524042 markings, 361053742 edges, 447070 markings/sec, 175 secs
lola: 77441874 markings, 370581612 edges, 383566 markings/sec, 180 secs
lola: 79722521 markings, 379808672 edges, 456129 markings/sec, 185 secs
lola: 83792070 markings, 388694901 edges, 813910 markings/sec, 190 secs
lola: 87151675 markings, 398023802 edges, 671921 markings/sec, 195 secs
lola: 87199521 markings, 410951977 edges, 9569 markings/sec, 200 secs
lola: 88805067 markings, 422268106 edges, 321109 markings/sec, 205 secs
lola: 92632621 markings, 430888200 edges, 765511 markings/sec, 210 secs
lola: 95379358 markings, 440192174 edges, 549347 markings/sec, 215 secs
lola: 95422219 markings, 451680327 edges, 8572 markings/sec, 220 secs
lola: 96067184 markings, 462285093 edges, 128993 markings/sec, 225 secs
lola: 98134438 markings, 471183579 edges, 413451 markings/sec, 230 secs
lola: 99604050 markings, 478436554 edges, 293922 markings/sec, 235 secs
lola: 101577451 markings, 486257280 edges, 394680 markings/sec, 240 secs
lola: 102537026 markings, 490843797 edges, 191915 markings/sec, 245 secs
lola: 104374040 markings, 499069906 edges, 367403 markings/sec, 250 secs
lola: 105661770 markings, 506762509 edges, 257546 markings/sec, 255 secs
lola: 107023680 markings, 514903574 edges, 272382 markings/sec, 260 secs
lola: 108510718 markings, 523285131 edges, 297408 markings/sec, 265 secs
lola: 110309794 markings, 532278654 edges, 359815 markings/sec, 270 secs
lola: 112100594 markings, 541224745 edges, 358160 markings/sec, 275 secs
lola: 113832002 markings, 549846358 edges, 346282 markings/sec, 280 secs
lola: 114966410 markings, 555528978 edges, 226882 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no unknown no
lola:
preliminary result: no no no no no no no no no no no no unknown no
lola: memory consumption: 3380 KB
lola: time consumption: 599 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="CircadianClock-PT-000100"
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 CircadianClock-PT-000100, 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 r056-oct2-162038334400010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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