Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938400034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is RefineWMG-PT-007007, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:38 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 RefineWMG-PT-007007-00
FORMULA_NAME RefineWMG-PT-007007-01
FORMULA_NAME RefineWMG-PT-007007-02
FORMULA_NAME RefineWMG-PT-007007-03
FORMULA_NAME RefineWMG-PT-007007-04
FORMULA_NAME RefineWMG-PT-007007-05
FORMULA_NAME RefineWMG-PT-007007-06
FORMULA_NAME RefineWMG-PT-007007-07
FORMULA_NAME RefineWMG-PT-007007-08
FORMULA_NAME RefineWMG-PT-007007-09
FORMULA_NAME RefineWMG-PT-007007-10
FORMULA_NAME RefineWMG-PT-007007-11
FORMULA_NAME RefineWMG-PT-007007-12
FORMULA_NAME RefineWMG-PT-007007-13
FORMULA_NAME RefineWMG-PT-007007-14
FORMULA_NAME RefineWMG-PT-007007-15

=== Now, execution of the tool begins

BK_START 1591223786144

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:36:27] [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-03 22:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:36:27] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2020-06-03 22:36:27] [INFO ] Transformed 39 places.
[2020-06-03 22:36:27] [INFO ] Transformed 31 transitions.
[2020-06-03 22:36:27] [INFO ] Parsed PT model containing 39 places and 31 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 32839 steps, including 0 resets, run visited all 32 properties in 39 ms. (steps per millisecond=842 )
[2020-06-03 22:36:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 22:36:28] [INFO ] Flatten gal took : 23 ms
FORMULA RefineWMG-PT-007007-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:36:28] [INFO ] Flatten gal took : 4 ms
[2020-06-03 22:36:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 22:36:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-007007 @ 3570 seconds

FORMULA RefineWMG-PT-007007-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-007007-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2530
rslt: Output for LTLFireability @ RefineWMG-PT-007007

{
"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": "Wed Jun 3 22:36:28 2020
",
"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": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((X (((p1 <= 1) OR (p2 <= 1))) OR (p15 <= 0))) AND F (((2 <= p1) AND (2 <= p2))))))",
"processed_size": 93,
"rewrites": 71
},
"result":
{
"edges": 3426087,
"markings": 2180246,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p35 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))",
"processed_size": 54,
"rewrites": 73
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"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": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((1 <= p5))) AND ((1 <= p5) AND (1 <= p12))))",
"processed_size": 54,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((p22 <= 0)) AND (X (F ((p28 <= 0))) AND ((1 <= p22) U (1 <= p28)))))",
"processed_size": 75,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p35) U (X ((((p5 <= 0) R (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)) R X ((p5 <= 0)))) OR (1 <= p5))) AND (p5 <= 0)))",
"processed_size": 124,
"rewrites": 71
},
"result":
{
"edges": 232,
"markings": 131,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F (G ((F ((1 <= p23)) AND (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p38) U (1 <= p23)))))) AND (1 <= p38)))",
"processed_size": 123,
"rewrites": 71
},
"result":
{
"edges": 15,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p25)))",
"processed_size": 18,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND X (G ((1 <= p37))))))",
"processed_size": 76,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"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": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))",
"processed_size": 47,
"rewrites": 71
},
"result":
{
"edges": 151,
"markings": 125,
"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": 780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (((1 <= p18) OR G ((1 <= p22))))",
"processed_size": 34,
"rewrites": 71
},
"result":
{
"edges": 147,
"markings": 108,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1040
},
"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 (((p30 <= 0) OR (p32 <= 0)))",
"processed_size": 31,
"rewrites": 71
},
"result":
{
"edges": 102,
"markings": 79,
"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": 1560
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3120
},
"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 <= p35))",
"processed_size": 14,
"rewrites": 71
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "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": 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 <= p35))",
"processed_size": 14,
"rewrites": 71
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"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 (((2 <= p1) AND (2 <= p2))))",
"processed_size": 33,
"rewrites": 71
},
"result":
{
"edges": 87,
"markings": 66,
"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": 3848,
"runtime": 1040.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : (G((F(**) AND (** OR **))) AND F((F(**) AND (** AND **)))) : (F(G(**)) OR (G(**) AND F(G(**)))) : G(F((G((X(*) OR *)) AND F(**)))) : F((** OR G(**))) : G(**) : (F(**) AND (X(**) AND (** OR (G(**) AND F(**))))) : X((X(G(**)) AND (** AND **))) : F((F(**) AND (X(F(*)) AND (** U **)))) : (** U (X(((* R (* R X(*))) OR *)) AND **)) : X((F(G((F(**) AND (** OR (** U **))))) AND **)) : X(G(((F(*) U **) OR (G(*) AND F(**))))) : X(G(**)) : X(X((F(**) AND X(G(*)))))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 24,
"places": 39,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no unknown no no ",
"value": "no no no no no no no no no yes no unknown 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 31 transitions, 23 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: F (NOT(X (((1 <= p15) U F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))) : (G ((((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0) OR (p1 <= 1) OR (p2 <= 1)) U ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) AND F (((F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) AND (2 <= p1)) AND (2 <= p2)))) : (G ((1 <= p35)) U G (F (G (((2 <= p1) AND (2 <= p2)))))) : X (G (F ((NOT(F ((X (((2 <= p1) AND (2 <= p2))) AND (1 <= p15)))) AND F (((2 <= p1) AND (2 <= p2))))))) : F ((F ((1 <= p18)) OR F (G ((1 <= p22))))) : G (((p30 <= 0) OR (p32 <= 0))) : ((F (((1 <= p35) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND X (((1 <= p6) AND (1 <= p7) AND (1 <= p9)))) AND (G (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) U ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)))) : X (((X (G ((1 <= p5))) AND (1 <= p5)) AND (1 <= p12))) : F (((F ((p22 <= 0)) AND NOT(X (G ((1 <= p28))))) AND ((1 <= p22) U (1 <= p28)))) : ((1 <= p35) U (NOT(X ((((1 <= p5) U (((1 <= p16) AND (1 <= p17) AND (1 <= p19)) U X ((1 <= p5)))) AND (p5 <= 0)))) AND (p5 <= 0))) : X ((F (G (X (G ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) U ((1 <= p38) U (1 <= p23))))))) AND (1 <= p38))) : X (G ((NOT(F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))) U (NOT(G ((5 <= p4))) U ((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))) : NOT(X (NOT(G ((1 <= p25))))) : X ((NOT(G (NOT(F (X (((1 <= p37) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))))) AND NOT(F (X (X ((p37 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: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:525
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 ((X (((p1 <= 1) OR (p2 <= 1))) OR (p15 <= 0))) AND F (((2 <= p1) AND (2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((X (((p1 <= 1) OR (p2 <= 1))) OR (p15 <= 0))) AND F (((2 <= p1) AND (2 <= p2))))))
lola: processed formula length: 93
lola: 71 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: 2180246 markings, 3426087 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p35) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND (X (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND (((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) OR (G (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND F (((p6 <= 0) OR (p7 <= 0) OR (p9 <= 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: F (((1 <= p35) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)))
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: ((p35 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))
lola: processed formula length: 54
lola: 73 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: 7 markings, 7 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 ((X (G ((1 <= p5))) AND ((1 <= p5) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p5))) AND ((1 <= p5) AND (1 <= p12))))
lola: processed formula length: 54
lola: 71 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p22 <= 0)) AND (X (F ((p28 <= 0))) AND ((1 <= p22) U (1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p22 <= 0)) AND (X (F ((p28 <= 0))) AND ((1 <= p22) U (1 <= p28)))))
lola: processed formula length: 75
lola: 71 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p35) U (X ((((p5 <= 0) R (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)) R X ((p5 <= 0)))) OR (1 <= p5))) AND (p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p35) U (X ((((p5 <= 0) R (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)) R X ((p5 <= 0)))) OR (1 <= p5))) AND (p5 <= 0)))
lola: processed formula length: 124
lola: 71 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 131 markings, 232 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((F ((1 <= p23)) AND (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p38) U (1 <= p23)))))) AND (1 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((F ((1 <= p23)) AND (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p38) U (1 <= p23)))))) AND (1 <= p38)))
lola: processed formula length: 123
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 30
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: 13 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((p4 <= 4)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p29))) OR (G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((p4 <= 4)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p29))) OR (G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: processed formula length: 173
lola: 71 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3746588 markings, 8614954 edges, 749318 markings/sec, 0 secs
lola: 5548091 markings, 18708835 edges, 360301 markings/sec, 5 secs
lola: 6936688 markings, 29341445 edges, 277719 markings/sec, 10 secs
lola: 8664789 markings, 39317311 edges, 345620 markings/sec, 15 secs
lola: 10022516 markings, 49466534 edges, 271545 markings/sec, 20 secs
lola: 11597526 markings, 59927228 edges, 315002 markings/sec, 25 secs
lola: 13058296 markings, 69888884 edges, 292154 markings/sec, 30 secs
lola: 14308377 markings, 80108875 edges, 250016 markings/sec, 35 secs
lola: 15936624 markings, 89828611 edges, 325649 markings/sec, 40 secs
lola: 17360237 markings, 100288840 edges, 284723 markings/sec, 45 secs
lola: 18724265 markings, 110486760 edges, 272806 markings/sec, 50 secs
lola: 20424313 markings, 120669085 edges, 340010 markings/sec, 55 secs
lola: 21699249 markings, 130840361 edges, 254987 markings/sec, 60 secs
lola: 23406448 markings, 140677931 edges, 341440 markings/sec, 65 secs
lola: 24624749 markings, 150467709 edges, 243660 markings/sec, 70 secs
lola: 25890518 markings, 160492128 edges, 253154 markings/sec, 75 secs
lola: 27548536 markings, 170193611 edges, 331604 markings/sec, 80 secs
lola: 28820502 markings, 180315839 edges, 254393 markings/sec, 85 secs
lola: 30294105 markings, 190494262 edges, 294721 markings/sec, 90 secs
lola: 31944469 markings, 200393051 edges, 330073 markings/sec, 95 secs
lola: 33196793 markings, 210243553 edges, 250465 markings/sec, 100 secs
lola: 34904164 markings, 220109958 edges, 341474 markings/sec, 105 secs
lola: 36112366 markings, 229984487 edges, 241640 markings/sec, 110 secs
lola: 37361641 markings, 240074536 edges, 249855 markings/sec, 115 secs
lola: 38764377 markings, 249959793 edges, 280547 markings/sec, 120 secs
lola: 40284597 markings, 259843286 edges, 304044 markings/sec, 125 secs
lola: 41485679 markings, 269622103 edges, 240216 markings/sec, 130 secs
lola: 42698267 markings, 279737540 edges, 242518 markings/sec, 135 secs
lola: 44251665 markings, 289341137 edges, 310680 markings/sec, 140 secs
lola: 45187640 markings, 300056869 edges, 187195 markings/sec, 145 secs
lola: 47029546 markings, 309841517 edges, 368381 markings/sec, 150 secs
lola: 48659880 markings, 319501505 edges, 326067 markings/sec, 155 secs
lola: 49930679 markings, 329481283 edges, 254160 markings/sec, 160 secs
lola: 51217301 markings, 339316331 edges, 257324 markings/sec, 165 secs
lola: 52442539 markings, 349522477 edges, 245048 markings/sec, 170 secs
lola: 54213630 markings, 359464449 edges, 354218 markings/sec, 175 secs
lola: 55916267 markings, 369016683 edges, 340527 markings/sec, 180 secs
lola: 57191030 markings, 379081766 edges, 254953 markings/sec, 185 secs
lola: 58416714 markings, 389164621 edges, 245137 markings/sec, 190 secs
lola: 60016809 markings, 398518435 edges, 320019 markings/sec, 195 secs
lola: 61316844 markings, 408638388 edges, 260007 markings/sec, 200 secs
lola: 62556889 markings, 418646410 edges, 248009 markings/sec, 205 secs
lola: 63957273 markings, 428265641 edges, 280077 markings/sec, 210 secs
lola: 65388691 markings, 437775695 edges, 286284 markings/sec, 215 secs
lola: 66573876 markings, 447553320 edges, 237037 markings/sec, 220 secs
lola: 67809294 markings, 457709303 edges, 247084 markings/sec, 225 secs
lola: 69548819 markings, 467601535 edges, 347905 markings/sec, 230 secs
lola: 70792857 markings, 477522875 edges, 248808 markings/sec, 235 secs
lola: 71998649 markings, 487442290 edges, 241158 markings/sec, 240 secs
lola: 73306536 markings, 496941864 edges, 261577 markings/sec, 245 secs
lola: 74784848 markings, 506454648 edges, 295662 markings/sec, 250 secs
lola: 75570466 markings, 516818400 edges, 157124 markings/sec, 255 secs
lola: 77297542 markings, 526382726 edges, 345415 markings/sec, 260 secs
lola: 78987165 markings, 535779041 edges, 337925 markings/sec, 265 secs
lola: 80253771 markings, 545626748 edges, 253321 markings/sec, 270 secs
lola: 81454809 markings, 555275127 edges, 240208 markings/sec, 275 secs
lola: 82724472 markings, 565265071 edges, 253933 markings/sec, 280 secs
lola: 84492628 markings, 575194411 edges, 353631 markings/sec, 285 secs
lola: 86003947 markings, 585322986 edges, 302264 markings/sec, 290 secs
lola: 87509128 markings, 595378584 edges, 301036 markings/sec, 295 secs
lola: 88747991 markings, 605450217 edges, 247773 markings/sec, 300 secs
lola: 90256404 markings, 615126916 edges, 301683 markings/sec, 305 secs
lola: 91690896 markings, 625097117 edges, 286898 markings/sec, 310 secs
lola: 92901639 markings, 634986686 edges, 242149 markings/sec, 315 secs
lola: 93662661 markings, 638932199 edges, 152204 markings/sec, 320 secs
lola: 94068411 markings, 643954200 edges, 81150 markings/sec, 325 secs
lola: 94123949 markings, 644645252 edges, 11108 markings/sec, 330 secs
lola: 95057310 markings, 651528079 edges, 186672 markings/sec, 335 secs
lola: 95168642 markings, 651716443 edges, 22266 markings/sec, 340 secs
lola: 95767684 markings, 653372762 edges, 119808 markings/sec, 345 secs
lola: 96156049 markings, 658243633 edges, 77673 markings/sec, 350 secs
lola: 96156049 markings, 658243633 edges, 0 markings/sec, 355 secs
lola: 97336238 markings, 666975616 edges, 236038 markings/sec, 360 secs
lola: 97404981 markings, 667093075 edges, 13749 markings/sec, 365 secs
lola: 97991399 markings, 670230784 edges, 117284 markings/sec, 370 secs
lola: 98354712 markings, 674724969 edges, 72663 markings/sec, 375 secs
lola: 98354712 markings, 674724969 edges, 0 markings/sec, 380 secs
lola: 98967420 markings, 677099802 edges, 122542 markings/sec, 385 secs
lola: 99475014 markings, 682651026 edges, 101519 markings/sec, 390 secs
lola: 100139409 markings, 686708513 edges, 132879 markings/sec, 395 secs
lola: 100748984 markings, 691305010 edges, 121915 markings/sec, 400 secs
lola: 101635307 markings, 700760397 edges, 177265 markings/sec, 405 secs
lola: 102444912 markings, 705999280 edges, 161921 markings/sec, 410 secs
lola: 103398416 markings, 711300614 edges, 190701 markings/sec, 415 secs
lola: 104507675 markings, 719749496 edges, 221852 markings/sec, 420 secs
lola: 105165759 markings, 722349606 edges, 131617 markings/sec, 425 secs
lola: 105898102 markings, 731963170 edges, 146469 markings/sec, 430 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown no no no yes no unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p25)))
lola: processed formula length: 18
lola: 71 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: 8 markings, 8 edges
lola: subprocess 8 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND X (G ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) AND X (G ((1 <= p37))))))
lola: processed formula length: 76
lola: 71 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p6 <= 0) OR (p7 <= 0) OR (p9 <= 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 (((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))
lola: processed formula length: 47
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 29
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 125 markings, 151 edges
lola: ========================================
lola: subprocess 10 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p18) OR G ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p18) OR G ((1 <= p22))))
lola: processed formula length: 34
lola: 71 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: 108 markings, 147 edges
lola: ========================================
lola: subprocess 11 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p30 <= 0) OR (p32 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p30 <= 0) OR (p32 <= 0)))
lola: processed formula length: 31
lola: 71 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: 79 markings, 102 edges
lola: ========================================
lola: subprocess 12 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0) OR (p1 <= 1) OR (p2 <= 1)) OR ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))))) AND F ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) AND ((2 <= p1) AND (2 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) AND ((2 <= p1) AND (2 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) AND ((2 <= p1) AND (2 <= p2))))
lola: processed formula length: 82
lola: 71 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((2 <= p1) AND (2 <= p2)))) OR (G ((1 <= p35)) AND F (G (((2 <= p1) AND (2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p35))
lola: processed formula length: 14
lola: 71 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: 7 markings, 7 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((F ((p4 <= 4)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p29))) OR (G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((p4 <= 4)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p29))) OR (G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: processed formula length: 173
lola: 71 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3751037 markings, 8663714 edges, 750207 markings/sec, 0 secs
lola: 5579138 markings, 19045513 edges, 365620 markings/sec, 5 secs
lola: 6967078 markings, 29715542 edges, 277588 markings/sec, 10 secs
lola: 8701312 markings, 39627614 edges, 346847 markings/sec, 15 secs
lola: 10075187 markings, 50112535 edges, 274775 markings/sec, 20 secs
lola: 11822317 markings, 60344725 edges, 349426 markings/sec, 25 secs
lola: 13133306 markings, 70768462 edges, 262198 markings/sec, 30 secs
lola: 14379766 markings, 81116444 edges, 249292 markings/sec, 35 secs
lola: 16088595 markings, 90768071 edges, 341766 markings/sec, 40 secs
lola: 17448273 markings, 101449435 edges, 271936 markings/sec, 45 secs
lola: 19173297 markings, 111372237 edges, 345005 markings/sec, 50 secs
lola: 20530682 markings, 121966287 edges, 271477 markings/sec, 55 secs
lola: 21961198 markings, 132073692 edges, 286103 markings/sec, 60 secs
lola: 23519484 markings, 142154049 edges, 311657 markings/sec, 65 secs
lola: 24765355 markings, 152207647 edges, 249174 markings/sec, 70 secs
lola: 26419736 markings, 162238945 edges, 330876 markings/sec, 75 secs
lola: 27732143 markings, 172538416 edges, 262481 markings/sec, 80 secs
lola: 29061262 markings, 183145248 edges, 265824 markings/sec, 85 secs
lola: 30887045 markings, 193293514 edges, 365157 markings/sec, 90 secs
lola: 32195130 markings, 203585722 edges, 261617 markings/sec, 95 secs
lola: 33908549 markings, 213378848 edges, 342684 markings/sec, 100 secs
lola: 35193082 markings, 223861575 edges, 256907 markings/sec, 105 secs
lola: 36408563 markings, 234016735 edges, 243096 markings/sec, 110 secs
lola: 38160453 markings, 244374763 edges, 350378 markings/sec, 115 secs
lola: 39429201 markings, 254747112 edges, 253750 markings/sec, 120 secs
lola: 40635388 markings, 264599278 edges, 241237 markings/sec, 125 secs
lola: 42291633 markings, 274283268 edges, 331249 markings/sec, 130 secs
lola: 43533303 markings, 284799705 edges, 248334 markings/sec, 135 secs
lola: 44824327 markings, 295672541 edges, 258205 markings/sec, 140 secs
lola: 46650839 markings, 306307713 edges, 365302 markings/sec, 145 secs
lola: 47969392 markings, 316764307 edges, 263711 markings/sec, 150 secs
lola: 49681530 markings, 326428232 edges, 342428 markings/sec, 155 secs
lola: 50938732 markings, 336525337 edges, 251440 markings/sec, 160 secs
lola: 52216410 markings, 346796517 edges, 255536 markings/sec, 165 secs
lola: 54000502 markings, 356906831 edges, 356818 markings/sec, 170 secs
lola: 55298351 markings, 367155193 edges, 259570 markings/sec, 175 secs
lola: 56978431 markings, 376513497 edges, 336016 markings/sec, 180 secs
lola: 58224116 markings, 386470503 edges, 249137 markings/sec, 185 secs
lola: 59408790 markings, 396170185 edges, 236935 markings/sec, 190 secs
lola: 61072705 markings, 405808809 edges, 332783 markings/sec, 195 secs
lola: 62319225 markings, 415654539 edges, 249304 markings/sec, 200 secs
lola: 63544466 markings, 425490647 edges, 245048 markings/sec, 205 secs
lola: 64725255 markings, 435156311 edges, 236158 markings/sec, 210 secs
lola: 66359198 markings, 444589994 edges, 326789 markings/sec, 215 secs
lola: 67540424 markings, 454346056 edges, 236245 markings/sec, 220 secs
lola: 68403729 markings, 464979519 edges, 172661 markings/sec, 225 secs
lola: 70469234 markings, 474128521 edges, 413101 markings/sec, 230 secs
lola: 71734319 markings, 483905737 edges, 253017 markings/sec, 235 secs
lola: 72935832 markings, 493659280 edges, 240303 markings/sec, 240 secs
lola: 74092213 markings, 503351209 edges, 231276 markings/sec, 245 secs
lola: 75297478 markings, 513273876 edges, 241053 markings/sec, 250 secs
lola: 76989666 markings, 522786240 edges, 338438 markings/sec, 255 secs
lola: 78263692 markings, 532535415 edges, 254805 markings/sec, 260 secs
lola: 79829346 markings, 542074592 edges, 313131 markings/sec, 265 secs
lola: 81171312 markings, 551503865 edges, 268393 markings/sec, 270 secs
lola: 82409339 markings, 561333355 edges, 247605 markings/sec, 275 secs
lola: 83846233 markings, 571063049 edges, 287379 markings/sec, 280 secs
lola: 85450347 markings, 581223388 edges, 320823 markings/sec, 285 secs
lola: 86718302 markings, 591325482 edges, 253591 markings/sec, 290 secs
lola: 88413530 markings, 601006263 edges, 339046 markings/sec, 295 secs
lola: 89622847 markings, 610691714 edges, 241863 markings/sec, 300 secs
lola: 90895851 markings, 620797450 edges, 254601 markings/sec, 305 secs
lola: 92541021 markings, 630531708 edges, 329034 markings/sec, 310 secs
lola: 93790448 markings, 640469873 edges, 249885 markings/sec, 315 secs
lola: 94651064 markings, 650839638 edges, 172123 markings/sec, 320 secs
lola: 96356404 markings, 659294290 edges, 341068 markings/sec, 325 secs
lola: 97004523 markings, 663213120 edges, 129624 markings/sec, 330 secs
lola: 97004523 markings, 663213120 edges, 0 markings/sec, 335 secs
lola: 97221431 markings, 666224759 edges, 43382 markings/sec, 340 secs
lola: 98370332 markings, 674752507 edges, 229780 markings/sec, 345 secs
lola: 98370332 markings, 674752507 edges, 0 markings/sec, 350 secs
lola: 98392820 markings, 674792143 edges, 4498 markings/sec, 355 secs
lola: 99267684 markings, 681112011 edges, 174973 markings/sec, 360 secs
lola: 99280152 markings, 681285031 edges, 2494 markings/sec, 365 secs
lola: 100135869 markings, 686661826 edges, 171143 markings/sec, 370 secs
lola: 100366927 markings, 690039174 edges, 46212 markings/sec, 375 secs
lola: 100803407 markings, 691400937 edges, 87296 markings/sec, 380 secs
lola: 101679931 markings, 701353942 edges, 175305 markings/sec, 385 secs
lola: 101768327 markings, 702455611 edges, 17679 markings/sec, 390 secs
lola: 101768327 markings, 702455611 edges, 0 markings/sec, 395 secs
lola: 101814506 markings, 703068684 edges, 9236 markings/sec, 400 secs
lola: 103446658 markings, 711932806 edges, 326430 markings/sec, 405 secs
lola: 103542451 markings, 713173239 edges, 19159 markings/sec, 410 secs
lola: 103542451 markings, 713173239 edges, 0 markings/sec, 415 secs
lola: 104479925 markings, 719359079 edges, 187495 markings/sec, 420 secs
lola: 105208031 markings, 722884491 edges, 145621 markings/sec, 425 secs
lola: 105341571 markings, 724609381 edges, 26708 markings/sec, 430 secs
lola: 106097831 markings, 734532494 edges, 151252 markings/sec, 435 secs
lola: 107511910 markings, 740575587 edges, 282816 markings/sec, 440 secs
lola: 107511910 markings, 740575587 edges, 0 markings/sec, 445 secs
lola: 107840037 markings, 743880165 edges, 65625 markings/sec, 450 secs
lola: 108122937 markings, 744363577 edges, 56580 markings/sec, 455 secs
lola: 108285819 markings, 744641917 edges, 32576 markings/sec, 460 secs
lola: 108650329 markings, 749409556 edges, 72902 markings/sec, 465 secs
lola: 109691269 markings, 757102464 edges, 208188 markings/sec, 470 secs
lola: 109918735 markings, 759449821 edges, 45493 markings/sec, 475 secs
lola: 109932044 markings, 759473278 edges, 2662 markings/sec, 480 secs
lola: 110877196 markings, 766829056 edges, 189030 markings/sec, 485 secs
lola: 110882983 markings, 766906446 edges, 1157 markings/sec, 490 secs
lola: 111329865 markings, 767890956 edges, 89376 markings/sec, 495 secs
lola: 111462667 markings, 768462900 edges, 26560 markings/sec, 500 secs
lola: 111981046 markings, 775444728 edges, 103676 markings/sec, 505 secs
lola: 112764972 markings, 779963982 edges, 156785 markings/sec, 510 secs
lola: 112764972 markings, 779963982 edges, 0 markings/sec, 515 secs
lola: 113266402 markings, 786669577 edges, 100286 markings/sec, 520 secs
lola: 113728523 markings, 790250516 edges, 92424 markings/sec, 525 secs
lola: 114961355 markings, 796750821 edges, 246566 markings/sec, 530 secs
lola: 114961355 markings, 796750821 edges, 0 markings/sec, 535 secs
lola: 115881836 markings, 803023574 edges, 184096 markings/sec, 540 secs
lola: 116247979 markings, 807034929 edges, 73229 markings/sec, 545 secs
lola: 116268136 markings, 807070618 edges, 4031 markings/sec, 550 secs
lola: 116357948 markings, 807229616 edges, 17962 markings/sec, 555 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G (((2 <= p1) AND (2 <= p2)))) OR (G ((1 <= p35)) AND F (G (((2 <= p1) AND (2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p35))
lola: processed formula length: 14
lola: 71 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: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p1) AND (2 <= p2))))
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 (((2 <= p1) AND (2 <= p2))))
lola: processed formula length: 33
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 29
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 66 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no unknown no no
lola:
preliminary result: no no no no no no no no no yes no unknown no no
lola: memory consumption: 3848 KB
lola: time consumption: 1040 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="RefineWMG-PT-007007"
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 RefineWMG-PT-007007, 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 r186-oct2-158987938400034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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