fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r132-tall-162075428300206
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for JoinFreeModules-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.928 3600000.00 1165460.00 115202.70 F?FFTFTFTFFFFF?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428300206.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is JoinFreeModules-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.3K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0010-00
FORMULA_NAME JoinFreeModules-PT-0010-01
FORMULA_NAME JoinFreeModules-PT-0010-02
FORMULA_NAME JoinFreeModules-PT-0010-03
FORMULA_NAME JoinFreeModules-PT-0010-04
FORMULA_NAME JoinFreeModules-PT-0010-05
FORMULA_NAME JoinFreeModules-PT-0010-06
FORMULA_NAME JoinFreeModules-PT-0010-07
FORMULA_NAME JoinFreeModules-PT-0010-08
FORMULA_NAME JoinFreeModules-PT-0010-09
FORMULA_NAME JoinFreeModules-PT-0010-10
FORMULA_NAME JoinFreeModules-PT-0010-11
FORMULA_NAME JoinFreeModules-PT-0010-12
FORMULA_NAME JoinFreeModules-PT-0010-13
FORMULA_NAME JoinFreeModules-PT-0010-14
FORMULA_NAME JoinFreeModules-PT-0010-15

=== Now, execution of the tool begins

BK_START 1620917632089

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 14:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:53:53] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-13 14:53:53] [INFO ] Transformed 51 places.
[2021-05-13 14:53:53] [INFO ] Transformed 81 transitions.
[2021-05-13 14:53:53] [INFO ] Parsed PT model containing 51 places and 81 transitions in 87 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 692 steps, including 0 resets, run visited all 42 properties in 11 ms. (steps per millisecond=62 )
[2021-05-13 14:53:54] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 14:53:54] [INFO ] Flatten gal took : 32 ms
FORMULA JoinFreeModules-PT-0010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:53:54] [INFO ] Flatten gal took : 8 ms
[2021-05-13 14:53:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-13 14:53:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ JoinFreeModules-PT-0010 @ 3570 seconds

FORMULA JoinFreeModules-PT-0010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0010-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2208
rslt: Output for LTLFireability @ JoinFreeModules-PT-0010

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p27) OR (G ((3 <= p8)) AND F ((1 <= p27)))) AND F ((3 <= p23))))",
"processed_size": 75,
"rewrites": 96
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((X (F (((10 <= p2) AND (10 <= p7) AND (10 <= p12) AND (10 <= p17) AND (10 <= p22) AND (10 <= p27) AND (10 <= p32) AND (10 <= p37) AND (10 <= p42) AND (10 <= p47)))) AND F ((2 <= p32))))",
"processed_size": 188,
"rewrites": 96
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p45 <= 2) OR (G ((p25 <= 4)) AND F ((p45 <= 2)))))",
"processed_size": 55,
"rewrites": 96
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "LTL model checker",
"value": true
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((p49 <= 4)) AND (F ((G ((p30 <= 4)) AND (p48 <= 3))) OR G (F ((p49 <= 4))))))",
"processed_size": 84,
"rewrites": 96
},
"result":
{
"edges": 4567503,
"markings": 3523874,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p32) U G ((1 <= p32)))",
"processed_size": 29,
"rewrites": 96
},
"result":
{
"edges": 96267,
"markings": 55727,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((p18 <= 3))",
"processed_size": 14,
"rewrites": 96
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F ((((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))) AND ((1 <= p47) OR (((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))))))",
"processed_size": 161,
"rewrites": 96
},
"result":
{
"edges": 2739827,
"markings": 2238324,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 508
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((X (X ((p3 <= 2))) U (X (F ((2 <= p31))) OR (3 <= p3)))))",
"processed_size": 63,
"rewrites": 96
},
"result":
{
"edges": 51,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"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": "((p33 <= 3) OR (p3 <= 2))",
"processed_size": 26,
"rewrites": 98
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((2 <= p36) OR (2 <= p6))))",
"processed_size": 34,
"rewrites": 96
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1451
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((5 <= p10) AND G ((p16 <= 1)))))",
"processed_size": 39,
"rewrites": 96
},
"result":
{
"edges": 3197475,
"markings": 1849259,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 2898
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2898
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(3 <= p35)",
"processed_size": 10,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(3 <= p35)",
"processed_size": 10,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p33 <= 2) AND (p35 <= 2) AND (p43 <= 2)))",
"processed_size": 46,
"rewrites": 96
},
"result":
{
"edges": 3206,
"markings": 1932,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3740,
"runtime": 1362.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((G(F(*)) OR **))) : X(((** OR (G(**) AND F(**))) AND F(**))) : G((X(F(**)) AND F(**))) : X((** OR (G(*) AND F(*)))) : X((F(*) AND (F((G(*) AND *)) OR G(F(*))))) : (X(*) OR (** U G(**))) : F(G((** AND G(*)))) : X(G((F(((** U G(**)) AND **)) AND (** OR ((** U G(**)) AND **))))) : X(X((X(X(**)) U (X(F(**)) OR **)))) : F(**) : (G(*) AND F(*)) : F(G((F(G((F(*) AND *))) OR **))) : G(F(**))"
},
"net":
{
"arcs": 230,
"conflict_clusters": 41,
"places": 50,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "unknown no no yes no yes no no no no no unknown no ",
"value": "unknown no no yes no yes no no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 131/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1600
lola: finding significant places
lola: 50 places, 81 transitions, 40 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 (G ((((5 <= p9) U G (NOT(G ((3 <= p10))))) OR (p9 <= 4)))) : X (((G ((3 <= p8)) U (1 <= p27)) AND (((3 <= p8) AND (1 <= p27)) U F ((3 <= p23))))) : G ((F (X (((10 <= p2) AND (10 <= p7) AND (10 <= p12) AND (10 <= p17) AND (10 <= p22) AND (10 <= p27) AND (10 <= p32) AND (10 <= p37) AND (10 <= p42) AND (10 <= p47)))) AND F ((2 <= p32)))) : X (((p45 <= 2) OR (NOT(F ((5 <= p25))) AND NOT(G ((3 <= p45)))))) : NOT(X ((G ((F ((5 <= p30)) OR (4 <= p48))) U G ((5 <= p49))))) : (NOT(X ((4 <= p18))) OR ((1 <= p32) U G ((1 <= p32)))) : F (G (NOT(X ((NOT(X ((5 <= p10))) OR X (F ((2 <= p16)))))))) : G (X (((1 <= p47) U (((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))))) : X (NOT(X (NOT((X (X ((p3 <= 2))) U (X (F ((2 <= p31))) OR (3 <= p3))))))) : F (((4 <= p33) AND (3 <= p3))) : (NOT(F (((3 <= p33) OR (3 <= p35) OR (3 <= p43)))) AND NOT(G ((3 <= p35)))) : F (NOT(F (NOT(X ((NOT(G (F ((G ((2 <= p1)) OR (2 <= p1))))) OR (5 <= p10))))))) : X (G (F (((2 <= p36) OR (2 <= p6)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p27) OR (G ((3 <= p8)) AND F ((1 <= p27)))) AND F ((3 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p27) OR (G ((3 <= p8)) AND F ((1 <= p27)))) AND F ((3 <= p23))))
lola: processed formula length: 75
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((10 <= p2) AND (10 <= p7) AND (10 <= p12) AND (10 <= p17) AND (10 <= p22) AND (10 <= p27) AND (10 <= p32) AND (10 <= p37) AND (10 <= p42) AND (10 <= p47)))) AND F ((2 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((10 <= p2) AND (10 <= p7) AND (10 <= p12) AND (10 <= p17) AND (10 <= p22) AND (10 <= p27) AND (10 <= p32) AND (10 <= p37) AND (10 <= p42) AND (10 <= p47)))) AND F ((2 <= p32))))
lola: processed formula length: 188
lola: 96 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 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p45 <= 2) OR (G ((p25 <= 4)) AND F ((p45 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p45 <= 2) OR (G ((p25 <= 4)) AND F ((p45 <= 2)))))
lola: processed formula length: 55
lola: 96 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p49 <= 4)) AND (F ((G ((p30 <= 4)) AND (p48 <= 3))) OR G (F ((p49 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p49 <= 4)) AND (F ((G ((p30 <= 4)) AND (p48 <= 3))) OR G (F ((p49 <= 4))))))
lola: processed formula length: 84
lola: 96 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: 3329044 markings, 4314932 edges, 665809 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3523874 markings, 4567503 edges
lola: ========================================
lola: subprocess 4 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p18 <= 3)) OR ((1 <= p32) U G ((1 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p32) U G ((1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p32) U G ((1 <= p32)))
lola: processed formula length: 29
lola: 96 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: 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: 55727 markings, 96267 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p18 <= 3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p18 <= 3))
lola: processed formula length: 14
lola: 96 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22 markings, 21 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))) AND ((1 <= p47) OR (((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))) AND ((1 <= p47) OR (((p47 <= 0) U G ((1 <= p37))) AND ((1 <= p37) OR (1 <= p47)))))))
lola: processed formula length: 161
lola: 96 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: 2238324 markings, 2739827 edges
lola: ========================================
lola: subprocess 6 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X ((p3 <= 2))) U (X (F ((2 <= p31))) OR (3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X ((p3 <= 2))) U (X (F ((2 <= p31))) OR (3 <= p3)))))
lola: processed formula length: 63
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50 markings, 51 edges
lola: ========================================
lola: subprocess 7 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((4 <= p33) AND (3 <= p3)))
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: ((p33 <= 3) OR (p3 <= 2))
lola: processed formula length: 26
lola: 98 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: 150 markings, 150 edges
lola: ========================================
lola: subprocess 8 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((2 <= p36) OR (2 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((2 <= p36) OR (2 <= p6))))
lola: processed formula length: 34
lola: 96 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: 150 markings, 150 edges
lola: ========================================
lola: subprocess 9 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p10 <= 2))) OR (p9 <= 4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p10 <= 2))) OR (p9 <= 4))))
lola: processed formula length: 41
lola: 96 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: 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: 2723091 markings, 4708823 edges, 544618 markings/sec, 0 secs
lola: 5406256 markings, 9348738 edges, 536633 markings/sec, 5 secs
lola: 8078838 markings, 13970412 edges, 534516 markings/sec, 10 secs
lola: 10737136 markings, 18567294 edges, 531660 markings/sec, 15 secs
lola: 13354187 markings, 23092958 edges, 523410 markings/sec, 20 secs
lola: 15963764 markings, 27605616 edges, 521915 markings/sec, 25 secs
lola: 18540251 markings, 32061179 edges, 515297 markings/sec, 30 secs
lola: 21152188 markings, 36577807 edges, 522387 markings/sec, 35 secs
lola: 23776995 markings, 41116969 edges, 524961 markings/sec, 40 secs
lola: 26377456 markings, 45613831 edges, 520092 markings/sec, 45 secs
lola: 29016651 markings, 50177693 edges, 527839 markings/sec, 50 secs
lola: 31614002 markings, 54669266 edges, 519470 markings/sec, 55 secs
lola: 34204894 markings, 59149553 edges, 518178 markings/sec, 60 secs
lola: 36789307 markings, 63618746 edges, 516883 markings/sec, 65 secs
lola: 39378259 markings, 68095842 edges, 517790 markings/sec, 70 secs
lola: 41928115 markings, 72505141 edges, 509971 markings/sec, 75 secs
lola: 44535762 markings, 77014558 edges, 521529 markings/sec, 80 secs
lola: 47111460 markings, 81468667 edges, 515140 markings/sec, 85 secs
lola: 49667323 markings, 85888352 edges, 511173 markings/sec, 90 secs
lola: 52215139 markings, 90294278 edges, 509563 markings/sec, 95 secs
lola: 54777873 markings, 94725984 edges, 512547 markings/sec, 100 secs
lola: 57316498 markings, 99116006 edges, 507725 markings/sec, 105 secs
lola: 59870019 markings, 103531726 edges, 510704 markings/sec, 110 secs
lola: 62408995 markings, 107922239 edges, 507795 markings/sec, 115 secs
lola: 64959343 markings, 112332595 edges, 510070 markings/sec, 120 secs
lola: 67479032 markings, 116689784 edges, 503938 markings/sec, 125 secs
lola: 70090041 markings, 121204971 edges, 522202 markings/sec, 130 secs
lola: 72657086 markings, 125644122 edges, 513409 markings/sec, 135 secs
lola: 75291415 markings, 130199519 edges, 526866 markings/sec, 140 secs
lola: 77819354 markings, 134571128 edges, 505588 markings/sec, 145 secs
lola: 80420863 markings, 139069772 edges, 520302 markings/sec, 150 secs
lola: 83021507 markings, 143567036 edges, 520129 markings/sec, 155 secs
lola: 85572318 markings, 147978110 edges, 510162 markings/sec, 160 secs
lola: 88107616 markings, 152362389 edges, 507060 markings/sec, 165 secs
lola: 90654270 markings, 156766225 edges, 509331 markings/sec, 170 secs
lola: 93215793 markings, 161195863 edges, 512305 markings/sec, 175 secs
lola: 95733225 markings, 165549123 edges, 503486 markings/sec, 180 secs
lola: 98247316 markings, 169896716 edges, 502818 markings/sec, 185 secs
lola: 100745135 markings, 174216125 edges, 499564 markings/sec, 190 secs
lola: 103243281 markings, 178536061 edges, 499629 markings/sec, 195 secs
lola: 105735888 markings, 182846458 edges, 498521 markings/sec, 200 secs
lola: 108289853 markings, 187263061 edges, 510793 markings/sec, 205 secs
lola: 110813567 markings, 191627193 edges, 504743 markings/sec, 210 secs
lola: 113353248 markings, 196019085 edges, 507936 markings/sec, 215 secs
lola: 115883213 markings, 200394044 edges, 505993 markings/sec, 220 secs
lola: 117761065 markings, 203642193 edges, 375570 markings/sec, 225 secs
lola: 119494144 markings, 206639102 edges, 346616 markings/sec, 230 secs
lola: 121795833 markings, 210619545 edges, 460338 markings/sec, 235 secs
lola: 123622732 markings, 213777856 edges, 365380 markings/sec, 240 secs
lola: 124479912 markings, 215260095 edges, 171436 markings/sec, 245 secs
lola: 126539954 markings, 218822581 edges, 412008 markings/sec, 250 secs
lola: 126539954 markings, 218822581 edges, 0 markings/sec, 255 secs
lola: 128495331 markings, 222203877 edges, 391075 markings/sec, 260 secs
lola: 129204970 markings, 223431001 edges, 141928 markings/sec, 265 secs
lola: 130174323 markings, 225107391 edges, 193871 markings/sec, 270 secs
lola: 131661403 markings, 227678966 edges, 297416 markings/sec, 275 secs
lola: 132275778 markings, 228741320 edges, 122875 markings/sec, 280 secs
lola: 134278567 markings, 232204771 edges, 400558 markings/sec, 285 secs
lola: 134278567 markings, 232204771 edges, 0 markings/sec, 290 secs
lola: 136514707 markings, 236071692 edges, 447228 markings/sec, 295 secs
lola: 136514707 markings, 236071692 edges, 0 markings/sec, 300 secs
lola: 137622180 markings, 237986745 edges, 221495 markings/sec, 305 secs
lola: 138766372 markings, 239965323 edges, 228838 markings/sec, 310 secs
lola: 140575214 markings, 243093406 edges, 361768 markings/sec, 315 secs
lola: 141587489 markings, 244843824 edges, 202455 markings/sec, 320 secs
lola: 143193851 markings, 247621724 edges, 321272 markings/sec, 325 secs
lola: 144030075 markings, 249067785 edges, 167245 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1071 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((F ((p1 <= 1)) AND (p1 <= 1)))) OR (5 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((F ((p1 <= 1)) AND (p1 <= 1)))) OR (5 <= p10))))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2698767 markings, 4666643 edges, 539753 markings/sec, 0 secs
lola: 5366205 markings, 9279250 edges, 533488 markings/sec, 5 secs
lola: 8039046 markings, 13901349 edges, 534568 markings/sec, 10 secs
lola: 10713220 markings, 18525752 edges, 534835 markings/sec, 15 secs
lola: 13338817 markings, 23066215 edges, 525119 markings/sec, 20 secs
lola: 15971681 markings, 27619148 edges, 526573 markings/sec, 25 secs
lola: 18567295 markings, 32107659 edges, 519123 markings/sec, 30 secs
lola: 21198035 markings, 36656932 edges, 526148 markings/sec, 35 secs
lola: 23842775 markings, 41230488 edges, 528948 markings/sec, 40 secs
lola: 26445200 markings, 45730775 edges, 520485 markings/sec, 45 secs
lola: 29089747 markings, 50303916 edges, 528909 markings/sec, 50 secs
lola: 31679059 markings, 54781492 edges, 517862 markings/sec, 55 secs
lola: 34296949 markings, 59308531 edges, 523578 markings/sec, 60 secs
lola: 36879428 markings, 63774372 edges, 516496 markings/sec, 65 secs
lola: 39486085 markings, 68282060 edges, 521331 markings/sec, 70 secs
lola: 42050914 markings, 72717371 edges, 512966 markings/sec, 75 secs
lola: 44678225 markings, 77260709 edges, 525462 markings/sec, 80 secs
lola: 47260645 markings, 81726478 edges, 516484 markings/sec, 85 secs
lola: 49832944 markings, 86174599 edges, 514460 markings/sec, 90 secs
lola: 52388881 markings, 90594616 edges, 511187 markings/sec, 95 secs
lola: 54977668 markings, 95071313 edges, 517757 markings/sec, 100 secs
lola: 57518616 markings, 99465221 edges, 508190 markings/sec, 105 secs
lola: 60089119 markings, 103910438 edges, 514101 markings/sec, 110 secs
lola: 62639612 markings, 108320947 edges, 510099 markings/sec, 115 secs
lola: 65192992 markings, 112736386 edges, 510676 markings/sec, 120 secs
lola: 67749017 markings, 117156516 edges, 511205 markings/sec, 125 secs
lola: 70356632 markings, 121665744 edges, 521523 markings/sec, 130 secs
lola: 72910534 markings, 126082219 edges, 510780 markings/sec, 135 secs
lola: 75535857 markings, 130622120 edges, 525065 markings/sec, 140 secs
lola: 78070394 markings, 135004975 edges, 506907 markings/sec, 145 secs
lola: 80685680 markings, 139527570 edges, 523057 markings/sec, 150 secs
lola: 83297699 markings, 144044447 edges, 522404 markings/sec, 155 secs
lola: 85845155 markings, 148449729 edges, 509491 markings/sec, 160 secs
lola: 88400408 markings, 152868491 edges, 511051 markings/sec, 165 secs
lola: 90973082 markings, 157317326 edges, 514535 markings/sec, 170 secs
lola: 93534229 markings, 161746284 edges, 512229 markings/sec, 175 secs
lola: 96057631 markings, 166109894 edges, 504680 markings/sec, 180 secs
lola: 98582325 markings, 170475881 edges, 504939 markings/sec, 185 secs
lola: 101102959 markings, 174834656 edges, 504127 markings/sec, 190 secs
lola: 103613269 markings, 179175741 edges, 502062 markings/sec, 195 secs
lola: 106124231 markings, 183517937 edges, 502192 markings/sec, 200 secs
lola: 108687265 markings, 187950116 edges, 512607 markings/sec, 205 secs
lola: 111211181 markings, 192314648 edges, 504783 markings/sec, 210 secs
lola: 113782529 markings, 196761217 edges, 514270 markings/sec, 215 secs
lola: 116313487 markings, 201137834 edges, 506192 markings/sec, 220 secs
lola: 118777258 markings, 205399189 edges, 492754 markings/sec, 225 secs
lola: 120092040 markings, 207672087 edges, 262956 markings/sec, 230 secs
lola: 121778289 markings, 210588042 edges, 337250 markings/sec, 235 secs
lola: 123028456 markings, 212749970 edges, 250033 markings/sec, 240 secs
lola: 124701096 markings, 215642412 edges, 334528 markings/sec, 245 secs
lola: 126164235 markings, 218172542 edges, 292628 markings/sec, 250 secs
lola: 127914767 markings, 221199693 edges, 350106 markings/sec, 255 secs
lola: 129704286 markings, 224294355 edges, 357904 markings/sec, 260 secs
lola: 131432243 markings, 227282503 edges, 345591 markings/sec, 265 secs
lola: 132956787 markings, 229918827 edges, 304909 markings/sec, 270 secs
lola: 134663278 markings, 232869753 edges, 341298 markings/sec, 275 secs
lola: 136177416 markings, 235488162 edges, 302828 markings/sec, 280 secs
lola: 137896731 markings, 238461371 edges, 343863 markings/sec, 285 secs
lola: 139570892 markings, 241356371 edges, 334832 markings/sec, 290 secs
lola: 141784470 markings, 245184369 edges, 442716 markings/sec, 295 secs
lola: 143196161 markings, 247625523 edges, 282338 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((5 <= p10) AND G ((p16 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((5 <= p10) AND G ((p16 <= 1)))))
lola: processed formula length: 39
lola: 96 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: 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: 1849259 markings, 3197475 edges
lola: ========================================
lola: subprocess 12 will run for 2898 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p33 <= 2) AND (p35 <= 2) AND (p43 <= 2))) AND F ((p35 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2898 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p35 <= 2))
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: (3 <= p35)
lola: processed formula length: 10
lola: 98 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p10 <= 2))) OR (p9 <= 4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p10 <= 2))) OR (p9 <= 4))))
lola: processed formula length: 41
lola: 96 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: 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: 2720441 markings, 4704221 edges, 544088 markings/sec, 0 secs
lola: 5402266 markings, 9341902 edges, 536365 markings/sec, 5 secs
lola: 8083086 markings, 13977796 edges, 536164 markings/sec, 10 secs
lola: 10749796 markings, 18589283 edges, 533342 markings/sec, 15 secs
lola: 13398035 markings, 23168727 edges, 529648 markings/sec, 20 secs
lola: 16045994 markings, 27747800 edges, 529592 markings/sec, 25 secs
lola: 18659642 markings, 32267514 edges, 522730 markings/sec, 30 secs
lola: 21310362 markings, 36851396 edges, 530144 markings/sec, 35 secs
lola: 23972241 markings, 41454454 edges, 532376 markings/sec, 40 secs
lola: 26608840 markings, 46013926 edges, 527320 markings/sec, 45 secs
lola: 29281490 markings, 50635688 edges, 534530 markings/sec, 50 secs
lola: 31906447 markings, 55174906 edges, 524991 markings/sec, 55 secs
lola: 34540802 markings, 59730464 edges, 526871 markings/sec, 60 secs
lola: 37133016 markings, 64213142 edges, 518443 markings/sec, 65 secs
lola: 39748117 markings, 68735338 edges, 523020 markings/sec, 70 secs
lola: 42340385 markings, 73218144 edges, 518454 markings/sec, 75 secs
lola: 44969311 markings, 77764265 edges, 525785 markings/sec, 80 secs
lola: 47549141 markings, 82225514 edges, 515966 markings/sec, 85 secs
lola: 50126801 markings, 86682980 edges, 515532 markings/sec, 90 secs
lola: 52673418 markings, 91086761 edges, 509323 markings/sec, 95 secs
lola: 55255630 markings, 95552128 edges, 516442 markings/sec, 100 secs
lola: 57785580 markings, 99927068 edges, 505990 markings/sec, 105 secs
lola: 60338420 markings, 104341738 edges, 510568 markings/sec, 110 secs
lola: 62879298 markings, 108735614 edges, 508176 markings/sec, 115 secs
lola: 65406518 markings, 113105804 edges, 505444 markings/sec, 120 secs
lola: 67961936 markings, 117524933 edges, 511084 markings/sec, 125 secs
lola: 70524822 markings, 121956808 edges, 512577 markings/sec, 130 secs
lola: 73118691 markings, 126442414 edges, 518774 markings/sec, 135 secs
lola: 75769645 markings, 131026605 edges, 530191 markings/sec, 140 secs
lola: 78991967 markings, 136598823 edges, 644464 markings/sec, 145 secs
lola: 81590878 markings, 141093147 edges, 519782 markings/sec, 150 secs
lola: 84183296 markings, 145576141 edges, 518484 markings/sec, 155 secs
lola: 87145410 markings, 150698506 edges, 592423 markings/sec, 160 secs
lola: 89654284 markings, 155036985 edges, 501775 markings/sec, 165 secs
lola: 92244095 markings, 159515512 edges, 517962 markings/sec, 170 secs
lola: 94778529 markings, 163898172 edges, 506887 markings/sec, 175 secs
lola: 97284510 markings, 168231761 edges, 501196 markings/sec, 180 secs
lola: 99802050 markings, 172585229 edges, 503508 markings/sec, 185 secs
lola: 102343476 markings, 176980145 edges, 508285 markings/sec, 190 secs
lola: 104863967 markings, 181338748 edges, 504098 markings/sec, 195 secs
lola: 107434840 markings, 185784475 edges, 514175 markings/sec, 200 secs
lola: 109997948 markings, 190216818 edges, 512622 markings/sec, 205 secs
lola: 112563301 markings, 194653046 edges, 513071 markings/sec, 210 secs
lola: 115129912 markings, 199091426 edges, 513322 markings/sec, 215 secs
lola: 117326227 markings, 202889913 edges, 439263 markings/sec, 220 secs
lola: 118296381 markings, 204567144 edges, 194031 markings/sec, 225 secs
lola: 119332936 markings, 206360107 edges, 207311 markings/sec, 230 secs
lola: 120804490 markings, 208904298 edges, 294311 markings/sec, 235 secs
lola: 122017848 markings, 211002495 edges, 242672 markings/sec, 240 secs
lola: 123498295 markings, 213562682 edges, 296089 markings/sec, 245 secs
lola: 124873778 markings, 215941207 edges, 275097 markings/sec, 250 secs
lola: 125451751 markings, 216940702 edges, 115595 markings/sec, 255 secs
lola: 127383966 markings, 220281980 edges, 386443 markings/sec, 260 secs
lola: 127383966 markings, 220281980 edges, 0 markings/sec, 265 secs
lola: 129218486 markings, 223454411 edges, 366904 markings/sec, 270 secs
lola: 129960866 markings, 224738217 edges, 148476 markings/sec, 275 secs
lola: 129960866 markings, 224738217 edges, 0 markings/sec, 280 secs
lola: 131401870 markings, 227230121 edges, 288201 markings/sec, 285 secs
lola: 132563382 markings, 229238670 edges, 232302 markings/sec, 290 secs
lola: 132572410 markings, 229254303 edges, 1806 markings/sec, 295 secs
lola: 134469886 markings, 232535602 edges, 379495 markings/sec, 300 secs
lola: 134687160 markings, 232911243 edges, 43455 markings/sec, 305 secs
lola: 135788639 markings, 234816070 edges, 220296 markings/sec, 310 secs
lola: 137255463 markings, 237352646 edges, 293365 markings/sec, 315 secs
lola: 138210026 markings, 239003292 edges, 190913 markings/sec, 320 secs
lola: 140568903 markings, 243082492 edges, 471775 markings/sec, 325 secs
lola: 140618466 markings, 243168121 edges, 9913 markings/sec, 330 secs
lola: 141353872 markings, 244439906 edges, 147081 markings/sec, 335 secs
lola: 143309511 markings, 247821675 edges, 391128 markings/sec, 340 secs
lola: 143309511 markings, 247821675 edges, 0 markings/sec, 345 secs
lola: 143642358 markings, 248397283 edges, 66569 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((F ((p1 <= 1)) AND (p1 <= 1)))) OR (5 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((F ((p1 <= 1)) AND (p1 <= 1)))) OR (5 <= p10))))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2664723 markings, 4607689 edges, 532945 markings/sec, 0 secs
lola: 5315975 markings, 9192535 edges, 530250 markings/sec, 5 secs
lola: 7978821 markings, 13797299 edges, 532569 markings/sec, 10 secs
lola: 10646811 markings, 18411011 edges, 533598 markings/sec, 15 secs
lola: 13265330 markings, 22939146 edges, 523704 markings/sec, 20 secs
lola: 15881039 markings, 27462464 edges, 523142 markings/sec, 25 secs
lola: 18465070 markings, 31930874 edges, 516806 markings/sec, 30 secs
lola: 21080400 markings, 36453428 edges, 523066 markings/sec, 35 secs
lola: 23709406 markings, 40999880 edges, 525801 markings/sec, 40 secs
lola: 26299202 markings, 45478312 edges, 517959 markings/sec, 45 secs
lola: 28928976 markings, 50025911 edges, 525955 markings/sec, 50 secs
lola: 31505308 markings, 54481098 edges, 515266 markings/sec, 55 secs
lola: 34082518 markings, 58937735 edges, 515442 markings/sec, 60 secs
lola: 36659691 markings, 63394433 edges, 515435 markings/sec, 65 secs
lola: 39211907 markings, 67807915 edges, 510443 markings/sec, 70 secs
lola: 41764054 markings, 72221309 edges, 510429 markings/sec, 75 secs
lola: 44371012 markings, 76729503 edges, 521392 markings/sec, 80 secs
lola: 46906391 markings, 81113789 edges, 507076 markings/sec, 85 secs
lola: 49424675 markings, 85468576 edges, 503657 markings/sec, 90 secs
lola: 51947167 markings, 89830750 edges, 504498 markings/sec, 95 secs
lola: 54487022 markings, 94222860 edges, 507971 markings/sec, 100 secs
lola: 56996876 markings, 98563103 edges, 501971 markings/sec, 105 secs
lola: 59513009 markings, 102914187 edges, 503227 markings/sec, 110 secs
lola: 62040822 markings, 107285437 edges, 505563 markings/sec, 115 secs
lola: 64596939 markings, 111705682 edges, 511223 markings/sec, 120 secs
lola: 67108456 markings, 116048801 edges, 502303 markings/sec, 125 secs
lola: 69715725 markings, 120557442 edges, 521454 markings/sec, 130 secs
lola: 72275005 markings, 124983135 edges, 511856 markings/sec, 135 secs
lola: 77817308 markings, 134567415 edges, 1108461 markings/sec, 140 secs
lola: 80419335 markings, 139066948 edges, 520405 markings/sec, 145 secs
lola: 83015956 markings, 143557234 edges, 519324 markings/sec, 150 secs
lola: 86429520 markings, 149460264 edges, 682713 markings/sec, 155 secs
lola: 88943819 markings, 153808216 edges, 502860 markings/sec, 160 secs
lola: 91532982 markings, 158285598 edges, 517833 markings/sec, 165 secs
lola: 94062507 markings, 162659779 edges, 505905 markings/sec, 170 secs
lola: 96578052 markings, 167009852 edges, 503109 markings/sec, 175 secs
lola: 101064454 markings, 174768145 edges, 897280 markings/sec, 180 secs
lola: 103574464 markings, 179108593 edges, 502002 markings/sec, 185 secs
lola: 106071877 markings, 183427386 edges, 499483 markings/sec, 190 secs
lola: 109642828 markings, 189602564 edges, 714190 markings/sec, 195 secs
lola: 112173556 markings, 193978829 edges, 506146 markings/sec, 200 secs
lola: 114727666 markings, 198395615 edges, 510822 markings/sec, 205 secs
lola: 117151688 markings, 202587830 edges, 484804 markings/sec, 210 secs
lola: 118332440 markings, 204647560 edges, 236150 markings/sec, 215 secs
lola: 120433255 markings, 208262172 edges, 420163 markings/sec, 220 secs
lola: 121569667 markings, 210227345 edges, 227282 markings/sec, 225 secs
lola: 122542943 markings, 211910382 edges, 194655 markings/sec, 230 secs
lola: 124147998 markings, 214685932 edges, 321011 markings/sec, 235 secs
lola: 125398986 markings, 216849247 edges, 250198 markings/sec, 240 secs
lola: 126551924 markings, 218842987 edges, 230588 markings/sec, 245 secs
lola: 127921841 markings, 221212037 edges, 273983 markings/sec, 250 secs
lola: 129529022 markings, 223991283 edges, 321436 markings/sec, 255 secs
lola: 131365662 markings, 227167392 edges, 367328 markings/sec, 260 secs
lola: 132255540 markings, 228706166 edges, 177976 markings/sec, 265 secs
lola: 134161897 markings, 232002777 edges, 381271 markings/sec, 270 secs
lola: 135764788 markings, 234774587 edges, 320578 markings/sec, 275 secs
lola: 137401535 markings, 237604959 edges, 327349 markings/sec, 280 secs
lola: 139486958 markings, 241211356 edges, 417085 markings/sec, 285 secs
lola: 141100774 markings, 244001960 edges, 322763 markings/sec, 290 secs
lola: 142858879 markings, 247042253 edges, 351621 markings/sec, 295 secs
lola: 144449537 markings, 249792995 edges, 318132 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (((p33 <= 2) AND (p35 <= 2) AND (p43 <= 2))) AND F ((p35 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p35 <= 2))
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: (3 <= p35)
lola: processed formula length: 10
lola: 98 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: ========================================
lola: ...considering subproblem: G (((p33 <= 2) AND (p35 <= 2) AND (p43 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p33 <= 2) AND (p35 <= 2) AND (p43 <= 2)))
lola: processed formula length: 46
lola: 96 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: 1932 markings, 3206 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: unknown no no yes no yes no no no no no unknown no
lola:
preliminary result: unknown no no yes no yes no no no no no unknown no
lola: ========================================
lola: memory consumption: 3740 KB
lola: time consumption: 1362 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="JoinFreeModules-PT-0010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is JoinFreeModules-PT-0010, 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 r132-tall-162075428300206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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