Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900400530.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400530
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 2.6K Mar 30 19:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 30 19:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 09:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 09:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 479K Mar 24 05:37 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 DLCround-PT-08a-00
FORMULA_NAME DLCround-PT-08a-01
FORMULA_NAME DLCround-PT-08a-02
FORMULA_NAME DLCround-PT-08a-03
FORMULA_NAME DLCround-PT-08a-04
FORMULA_NAME DLCround-PT-08a-05
FORMULA_NAME DLCround-PT-08a-06
FORMULA_NAME DLCround-PT-08a-07
FORMULA_NAME DLCround-PT-08a-08
FORMULA_NAME DLCround-PT-08a-09
FORMULA_NAME DLCround-PT-08a-10
FORMULA_NAME DLCround-PT-08a-11
FORMULA_NAME DLCround-PT-08a-12
FORMULA_NAME DLCround-PT-08a-13
FORMULA_NAME DLCround-PT-08a-14
FORMULA_NAME DLCround-PT-08a-15

=== Now, execution of the tool begins

BK_START 1591244003700

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:13:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 04:13:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:13:27] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2020-06-04 04:13:27] [INFO ] Transformed 263 places.
[2020-06-04 04:13:27] [INFO ] Transformed 1907 transitions.
[2020-06-04 04:13:27] [INFO ] Found NUPN structural information;
[2020-06-04 04:13:27] [INFO ] Parsed PT model containing 263 places and 1907 transitions in 357 ms.
Ensure Unique test removed 187 transitions
Reduce redundant transitions removed 187 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 704 steps, including 0 resets, run visited all 46 properties in 32 ms. (steps per millisecond=22 )
[2020-06-04 04:13:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 04:13:27] [INFO ] Flatten gal took : 385 ms
FORMULA DLCround-PT-08a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 04:13:27] [INFO ] Applying decomposition
[2020-06-04 04:13:28] [INFO ] Flatten gal took : 146 ms
[2020-06-04 04:13:28] [INFO ] Decomposing Gal with order
[2020-06-04 04:13:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 04:13:29] [INFO ] Removed a total of 2820 redundant transitions.
[2020-06-04 04:13:29] [INFO ] Flatten gal took : 471 ms
[2020-06-04 04:13:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 101 ms.
[2020-06-04 04:13:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 18 ms.
[2020-06-04 04:13:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 56 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DLCround-PT-08a @ 3570 seconds

FORMULA DLCround-PT-08a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DLCround-PT-08a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-08a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2885
rslt: Output for LTLFireability @ DLCround-PT-08a

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"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": "X (G ((F (((1 <= p88) AND (1 <= p231))) AND (((1 <= p88)) AND ((1 <= p231))))))",
"processed_size": 79,
"rewrites": 71
},
"result":
{
"edges": 228,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 3,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196)))) OR (F ((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196))))) AND F (G (((1 <= p11) AND (1 <= p129))))))))",
"processed_size": 211,
"rewrites": 71
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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 <= p112) AND (1 <= p258))",
"processed_size": 29,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 37
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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 <= p29) AND (1 <= p198))",
"processed_size": 28,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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 <= p37) AND (1 <= p215))",
"processed_size": 28,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p37) AND (1 <= p247))))",
"processed_size": 36,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 5,
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"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": "G ((X (F (((1 <= p95) AND (1 <= p244)))) AND ((p14 <= 0) OR (p146 <= 0))))",
"processed_size": 75,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 5,
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((((1 <= p95) AND (1 <= p172)) AND (F (((1 <= p42))) OR G (((1 <= p84)))))))",
"processed_size": 81,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 5,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"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": "X ((F (((p21 <= 0) OR (p139 <= 0))) OR (X (((1 <= p34) AND (1 <= p197))) U ((1 <= p83) AND (1 <= p164)))))",
"processed_size": 107,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p113 <= 0) OR (p190 <= 0))",
"processed_size": 29,
"rewrites": 73
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 40
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((p107 <= 0) OR (p175 <= 0) OR (p48 <= 0) OR (p206 <= 0))))",
"processed_size": 68,
"rewrites": 71
},
"result":
{
"edges": 1145,
"markings": 81,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((((1 <= p88) AND (1 <= p231)) OR (F (((1 <= p88) AND (1 <= p231))) AND F (G (((1 <= p21) AND (1 <= p164)))))))",
"processed_size": 113,
"rewrites": 71
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 3558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((((p57 <= 0) OR (p135 <= 0)) R (((p57 <= 0) OR (p135 <= 0)) R F (((p91 <= 0) OR (p242 <= 0))))) OR (((p71 <= 0)) OR ((p226 <= 0))))))",
"processed_size": 143,
"rewrites": 71
},
"result":
{
"edges": 301501483,
"markings": 19424250,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 52964,
"runtime": 685.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F(*) AND (** AND **)))) : X(G(((X(F(**)) AND (** AND **)) OR (F((X(F(**)) AND (** AND **))) AND F(G(**)))))) : (F(*) AND ((* R *) R X(F(**)))) : F(G(((* R (* R F(*))) OR (* OR *)))) : (X(**) AND (** OR (F(G(*)) AND **))) : (F(**) AND (X(G(**)) OR **)) : X(G(**)) : X(G(**)) : F((** OR (F(**) AND F(G(*))))) : F(**) : F(G(*)) : G((X(F(**)) AND *)) : X(X((** AND (F(**) OR G(**))))) : X((F(*) OR (X(**) U **)))"
},
"net":
{
"arcs": 6692,
"conflict_clusters": 23,
"places": 263,
"places_significant": 106,
"singleton_clusters": 0,
"transitions": 1720
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no no no ",
"value": "no no no no no no no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1983/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 263
lola: finding significant places
lola: 263 places, 1720 transitions, 106 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: G (X (((NOT(G (((p88 <= 0) OR (p231 <= 0)))) AND ((1 <= p88))) AND ((1 <= p231))))) : X (G ((F (G (((1 <= p11) AND (1 <= p129)))) U ((F (X (F (((1 <= p11) AND (1 <= p129))))) AND ((1 <= p36))) AND ((1 <= p196)))))) : (NOT(G (((1 <= p112) AND (1 <= p258)))) AND NOT(((((p67 <= 0) OR (p149 <= 0)) U ((1 <= p51) AND (1 <= p213))) U G (X (G (NOT(F (((1 <= p112) AND (1 <= p258)))))))))) : X (G (NOT(G (F ((((((1 <= p57) AND (1 <= p135)) U (((1 <= p57) AND (1 <= p135)) U G (((1 <= p91) AND (1 <= p242))))) AND ((1 <= p71))) AND ((1 <= p226)))))))) : (X (((1 <= p21) AND (1 <= p172))) AND (((1 <= p29) AND (1 <= p198)) OR (NOT(G (F (X ((((1 <= p21) AND (1 <= p172)) U F (((1 <= p7) AND (1 <= p176)))))))) AND ((p7 <= 0) OR (p176 <= 0))))) : (F (((1 <= p52))) AND (X (G (((1 <= p67) AND (1 <= p258)))) OR ((1 <= p37) AND (1 <= p215)))) : X (G (((1 <= p92) AND (1 <= p246)))) : G (X (((1 <= p37) AND (1 <= p247)))) : (((1 <= p77) AND (1 <= p259) AND (1 <= p21) AND (1 <= p164)) U F ((X (F (NOT(F (((p21 <= 0) OR (p164 <= 0)))))) U ((1 <= p88) AND (1 <= p231))))) : F (((1 <= p113) AND (1 <= p190))) : (F (((1 <= p48) AND (1 <= p206))) U F (X (NOT(G (F (((1 <= p107) AND (1 <= p175) AND (1 <= p48) AND (1 <= p206)))))))) : NOT(F ((X (NOT(F ((((p14 <= 0) OR (p146 <= 0)) U ((1 <= p95) AND (1 <= p244)))))) OR ((1 <= p14) AND (1 <= p146))))) : X (X ((((1 <= p95) AND (1 <= p172)) AND (F (((1 <= p42))) OR G (((1 <= p84))))))) : (NOT(G (X (((1 <= p21) AND (1 <= p139))))) OR X ((X (((1 <= p34) AND (1 <= p197))) U ((1 <= p83) AND (1 <= p164)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p88) AND (1 <= p231))) AND (((1 <= p88)) AND ((1 <= p231))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p88) AND (1 <= p231))) AND (((1 <= p88)) AND ((1 <= p231))))))
lola: processed formula length: 79
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: 24 markings, 228 edges
lola: ========================================
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196)))) OR (F ((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196))))) AND F (G (((1 <= p11) AND (1 <= p129))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196)))) OR (F ((X (F (((1 <= p11) AND (1 <= p129)))) AND (((1 <= p36)) AND ((1 <= p196))))) AND F (G (((1 <= p11) AND (1 <= p129))))))))
lola: processed formula length: 211
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p112 <= 0) OR (p258 <= 0))) AND ((((1 <= p67) AND (1 <= p149)) R ((p51 <= 0) OR (p213 <= 0))) R X (F (((1 <= p112) AND (1 <= p258))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p112 <= 0) OR (p258 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p112) AND (1 <= p258))
lola: processed formula length: 29
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p67) AND (1 <= p149)) R ((p51 <= 0) OR (p213 <= 0))) R X (F (((1 <= p112) AND (1 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p67) AND (1 <= p149)) R ((p51 <= 0) OR (p213 <= 0))) R X (F (((1 <= p112) AND (1 <= p258)))))
lola: processed formula length: 103
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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p21) AND (1 <= p172))) AND (((1 <= p29) AND (1 <= p198)) OR (F (G (((p7 <= 0) OR (p176 <= 0)))) AND ((p7 <= 0) OR (p176 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 <= 0) OR (p176 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p7 <= 0) OR (p176 <= 0))
lola: processed formula length: 27
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p29) AND (1 <= p198))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p29) AND (1 <= p198))
lola: processed formula length: 28
lola: 71 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 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p7 <= 0) OR (p176 <= 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 (((p7 <= 0) OR (p176 <= 0))))
lola: processed formula length: 35
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p52))) AND (X (G (((1 <= p67) AND (1 <= p258)))) OR ((1 <= p37) AND (1 <= p215))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p37) AND (1 <= p215))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p37) AND (1 <= p215))
lola: processed formula length: 28
lola: 71 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 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p52)))
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: ((p52 <= 0))
lola: processed formula length: 12
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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p92) AND (1 <= p246))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p92) AND (1 <= p246))))
lola: processed formula length: 36
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p37) AND (1 <= p247))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p37) AND (1 <= p247))))
lola: processed formula length: 36
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((1 <= p95) AND (1 <= p244)))) AND ((p14 <= 0) OR (p146 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((1 <= p95) AND (1 <= p244)))) AND ((p14 <= 0) OR (p146 <= 0))))
lola: processed formula length: 75
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p95) AND (1 <= p172)) AND (F (((1 <= p42))) OR G (((1 <= p84)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p95) AND (1 <= p172)) AND (F (((1 <= p42))) OR G (((1 <= p84)))))))
lola: processed formula length: 81
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p21 <= 0) OR (p139 <= 0))) OR (X (((1 <= p34) AND (1 <= p197))) U ((1 <= p83) AND (1 <= p164)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p21 <= 0) OR (p139 <= 0))) OR (X (((1 <= p34) AND (1 <= p197))) U ((1 <= p83) AND (1 <= p164)))))
lola: processed formula length: 107
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p113) AND (1 <= p190)))
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: ((p113 <= 0) OR (p190 <= 0))
lola: processed formula length: 29
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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p107 <= 0) OR (p175 <= 0) OR (p48 <= 0) OR (p206 <= 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 (((p107 <= 0) OR (p175 <= 0) OR (p48 <= 0) OR (p206 <= 0))))
lola: processed formula length: 68
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: 81 markings, 1145 edges
lola: ========================================
lola: subprocess 12 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p88) AND (1 <= p231)) OR (F (((1 <= p88) AND (1 <= p231))) AND F (G (((1 <= p21) AND (1 <= p164)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p88) AND (1 <= p231)) OR (F (((1 <= p88) AND (1 <= p231))) AND F (G (((1 <= p21) AND (1 <= p164)))))))
lola: processed formula length: 113
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p57 <= 0) OR (p135 <= 0)) R (((p57 <= 0) OR (p135 <= 0)) R F (((p91 <= 0) OR (p242 <= 0))))) OR (((p71 <= 0)) OR ((p226 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((p57 <= 0) OR (p135 <= 0)) R (((p57 <= 0) OR (p135 <= 0)) R F (((p91 <= 0) OR (p242 <= 0))))) OR (((p71 <= 0)) OR ((p226 <= 0))))))
lola: processed formula length: 143
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: 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: 158826 markings, 2523667 edges, 31765 markings/sec, 0 secs
lola: 312622 markings, 4973593 edges, 30759 markings/sec, 5 secs
lola: 467212 markings, 7431403 edges, 30918 markings/sec, 10 secs
lola: 619882 markings, 9857338 edges, 30534 markings/sec, 15 secs
lola: 776970 markings, 12356210 edges, 31418 markings/sec, 20 secs
lola: 924317 markings, 14701838 edges, 29469 markings/sec, 25 secs
lola: 1082273 markings, 17211020 edges, 31591 markings/sec, 30 secs
lola: 1238403 markings, 19689601 edges, 31226 markings/sec, 35 secs
lola: 1389905 markings, 22105064 edges, 30300 markings/sec, 40 secs
lola: 1543029 markings, 24544747 edges, 30625 markings/sec, 45 secs
lola: 1695542 markings, 26981261 edges, 30503 markings/sec, 50 secs
lola: 1843525 markings, 29348809 edges, 29597 markings/sec, 55 secs
lola: 1997043 markings, 31788244 edges, 30704 markings/sec, 60 secs
lola: 2144809 markings, 34145348 edges, 29553 markings/sec, 65 secs
lola: 2297758 markings, 36587274 edges, 30590 markings/sec, 70 secs
lola: 2446424 markings, 38956353 edges, 29733 markings/sec, 75 secs
lola: 2592995 markings, 41292000 edges, 29314 markings/sec, 80 secs
lola: 2742293 markings, 43672327 edges, 29860 markings/sec, 85 secs
lola: 2899756 markings, 46182144 edges, 31493 markings/sec, 90 secs
lola: 3052697 markings, 48616446 edges, 30588 markings/sec, 95 secs
lola: 3202731 markings, 51000145 edges, 30007 markings/sec, 100 secs
lola: 3348996 markings, 53323845 edges, 29253 markings/sec, 105 secs
lola: 3494278 markings, 55640666 edges, 29056 markings/sec, 110 secs
lola: 3642186 markings, 57993214 edges, 29582 markings/sec, 115 secs
lola: 3793842 markings, 60420883 edges, 30331 markings/sec, 120 secs
lola: 3939544 markings, 62755829 edges, 29140 markings/sec, 125 secs
lola: 4093581 markings, 65209521 edges, 30807 markings/sec, 130 secs
lola: 4240810 markings, 67553630 edges, 29446 markings/sec, 135 secs
lola: 4387057 markings, 69887633 edges, 29249 markings/sec, 140 secs
lola: 4537238 markings, 72283346 edges, 30036 markings/sec, 145 secs
lola: 4685159 markings, 74634968 edges, 29584 markings/sec, 150 secs
lola: 4836172 markings, 77035155 edges, 30203 markings/sec, 155 secs
lola: 4977225 markings, 79284908 edges, 28211 markings/sec, 160 secs
lola: 5120248 markings, 81573476 edges, 28605 markings/sec, 165 secs
lola: 5262001 markings, 83832489 edges, 28351 markings/sec, 170 secs
lola: 5408536 markings, 86151112 edges, 29307 markings/sec, 175 secs
lola: 5560991 markings, 88572939 edges, 30491 markings/sec, 180 secs
lola: 5712265 markings, 90983094 edges, 30255 markings/sec, 185 secs
lola: 5859998 markings, 93324204 edges, 29547 markings/sec, 190 secs
lola: 6007872 markings, 95681682 edges, 29575 markings/sec, 195 secs
lola: 6151813 markings, 97967297 edges, 28788 markings/sec, 200 secs
lola: 6301215 markings, 100344845 edges, 29880 markings/sec, 205 secs
lola: 6444018 markings, 102624506 edges, 28561 markings/sec, 210 secs
lola: 6585134 markings, 104878675 edges, 28223 markings/sec, 215 secs
lola: 6728574 markings, 107169321 edges, 28688 markings/sec, 220 secs
lola: 6872486 markings, 109464566 edges, 28782 markings/sec, 225 secs
lola: 7013435 markings, 111700798 edges, 28190 markings/sec, 230 secs
lola: 7148643 markings, 113871179 edges, 27042 markings/sec, 235 secs
lola: 7285094 markings, 116049238 edges, 27290 markings/sec, 240 secs
lola: 7425569 markings, 118293177 edges, 28095 markings/sec, 245 secs
lola: 7566802 markings, 120552931 edges, 28247 markings/sec, 250 secs
lola: 7707024 markings, 122791763 edges, 28044 markings/sec, 255 secs
lola: 7852537 markings, 125098156 edges, 29103 markings/sec, 260 secs
lola: 7998435 markings, 127424342 edges, 29180 markings/sec, 265 secs
lola: 8142322 markings, 129721510 edges, 28777 markings/sec, 270 secs
lola: 8278446 markings, 131898761 edges, 27225 markings/sec, 275 secs
lola: 8414780 markings, 134070378 edges, 27267 markings/sec, 280 secs
lola: 8560788 markings, 136389780 edges, 29202 markings/sec, 285 secs
lola: 8708729 markings, 138596316 edges, 29588 markings/sec, 290 secs
lola: 8849874 markings, 140616216 edges, 28229 markings/sec, 295 secs
lola: 8997493 markings, 142729899 edges, 29524 markings/sec, 300 secs
lola: 9147794 markings, 144878784 edges, 30060 markings/sec, 305 secs
lola: 9294556 markings, 146983815 edges, 29352 markings/sec, 310 secs
lola: 9439938 markings, 149071493 edges, 29076 markings/sec, 315 secs
lola: 9586031 markings, 151161288 edges, 29219 markings/sec, 320 secs
lola: 9743385 markings, 153406384 edges, 31471 markings/sec, 325 secs
lola: 9898867 markings, 155634473 edges, 31096 markings/sec, 330 secs
lola: 10049283 markings, 157783854 edges, 30083 markings/sec, 335 secs
lola: 10200018 markings, 159943624 edges, 30147 markings/sec, 340 secs
lola: 10346534 markings, 162041736 edges, 29303 markings/sec, 345 secs
lola: 10496688 markings, 164190166 edges, 30031 markings/sec, 350 secs
lola: 10645019 markings, 166310899 edges, 29666 markings/sec, 355 secs
lola: 10792264 markings, 168415822 edges, 29449 markings/sec, 360 secs
lola: 10942034 markings, 170563540 edges, 29954 markings/sec, 365 secs
lola: 11088337 markings, 172654202 edges, 29261 markings/sec, 370 secs
lola: 11237646 markings, 174789387 edges, 29862 markings/sec, 375 secs
lola: 11388920 markings, 176955441 edges, 30255 markings/sec, 380 secs
lola: 11535632 markings, 179050674 edges, 29342 markings/sec, 385 secs
lola: 11685982 markings, 181197246 edges, 30070 markings/sec, 390 secs
lola: 11833572 markings, 183309814 edges, 29518 markings/sec, 395 secs
lola: 11979880 markings, 185408161 edges, 29262 markings/sec, 400 secs
lola: 12131030 markings, 187566192 edges, 30230 markings/sec, 405 secs
lola: 12276852 markings, 189663109 edges, 29164 markings/sec, 410 secs
lola: 12429597 markings, 191844593 edges, 30549 markings/sec, 415 secs
lola: 12588851 markings, 194122009 edges, 31851 markings/sec, 420 secs
lola: 12740010 markings, 196286896 edges, 30232 markings/sec, 425 secs
lola: 12889015 markings, 198421766 edges, 29801 markings/sec, 430 secs
lola: 13032621 markings, 200484376 edges, 28721 markings/sec, 435 secs
lola: 13179045 markings, 202576886 edges, 29285 markings/sec, 440 secs
lola: 13322988 markings, 204646633 edges, 28789 markings/sec, 445 secs
lola: 13465273 markings, 206687087 edges, 28457 markings/sec, 450 secs
lola: 13612051 markings, 208899810 edges, 29356 markings/sec, 455 secs
lola: 13760010 markings, 211257698 edges, 29592 markings/sec, 460 secs
lola: 13903398 markings, 213542464 edges, 28678 markings/sec, 465 secs
lola: 14048486 markings, 215849210 edges, 29018 markings/sec, 470 secs
lola: 14190588 markings, 218114989 edges, 28420 markings/sec, 475 secs
lola: 14334254 markings, 220392621 edges, 28733 markings/sec, 480 secs
lola: 14480293 markings, 222723984 edges, 29208 markings/sec, 485 secs
lola: 14623125 markings, 224996894 edges, 28566 markings/sec, 490 secs
lola: 14770236 markings, 227336789 edges, 29422 markings/sec, 495 secs
lola: 14910756 markings, 229585395 edges, 28104 markings/sec, 500 secs
lola: 15046411 markings, 231745464 edges, 27131 markings/sec, 505 secs
lola: 15184408 markings, 233946593 edges, 27599 markings/sec, 510 secs
lola: 15319217 markings, 236099692 edges, 26962 markings/sec, 515 secs
lola: 15453404 markings, 238234131 edges, 26837 markings/sec, 520 secs
lola: 15591018 markings, 240414643 edges, 27523 markings/sec, 525 secs
lola: 15728519 markings, 242612767 edges, 27500 markings/sec, 530 secs
lola: 15859883 markings, 244705176 edges, 26273 markings/sec, 535 secs
lola: 15994279 markings, 246845876 edges, 26879 markings/sec, 540 secs
lola: 16126903 markings, 248959941 edges, 26525 markings/sec, 545 secs
lola: 16260995 markings, 251095266 edges, 26818 markings/sec, 550 secs
lola: 16396468 markings, 253252659 edges, 27095 markings/sec, 555 secs
lola: 16529582 markings, 255376070 edges, 26623 markings/sec, 560 secs
lola: 16665810 markings, 257542801 edges, 27246 markings/sec, 565 secs
lola: 16804713 markings, 259750378 edges, 27781 markings/sec, 570 secs
lola: 16942994 markings, 261959988 edges, 27656 markings/sec, 575 secs
lola: 17074976 markings, 264054053 edges, 26396 markings/sec, 580 secs
lola: 17205835 markings, 266144475 edges, 26172 markings/sec, 585 secs
lola: 17337993 markings, 268258781 edges, 26432 markings/sec, 590 secs
lola: 17478198 markings, 270489757 edges, 28041 markings/sec, 595 secs
lola: 17606409 markings, 272545838 edges, 25642 markings/sec, 600 secs
lola: 17742630 markings, 274721768 edges, 27244 markings/sec, 605 secs
lola: 17887913 markings, 277033874 edges, 29057 markings/sec, 610 secs
lola: 18029460 markings, 279292672 edges, 28309 markings/sec, 615 secs
lola: 18169086 markings, 281508488 edges, 27925 markings/sec, 620 secs
lola: 18310906 markings, 283772977 edges, 28364 markings/sec, 625 secs
lola: 18441532 markings, 285855896 edges, 26125 markings/sec, 630 secs
lola: 18576841 markings, 287999560 edges, 27062 markings/sec, 635 secs
lola: 18722628 markings, 290316631 edges, 29157 markings/sec, 640 secs
lola: 18856342 markings, 292447901 edges, 26743 markings/sec, 645 secs
lola: 18995095 markings, 294660047 edges, 27751 markings/sec, 650 secs
lola: 19130940 markings, 296823329 edges, 27169 markings/sec, 655 secs
lola: 19260685 markings, 298887262 edges, 25949 markings/sec, 660 secs
lola: 19384853 markings, 300870727 edges, 24834 markings/sec, 665 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: 19424250 markings, 301501483 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no no no
lola:
preliminary result: no no no no no no no no yes no no no no no
lola: memory consumption: 52964 KB
lola: time consumption: 685 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="DLCround-PT-08a"
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 DLCround-PT-08a, 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 r180-ebro-158987900400530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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