About the Execution of 2020-gold for ShieldIIPs-PT-002A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12198.420 | 3600000.00 | 1028207.00 | 4963.70 | TTFFFFFFTFTFFFTF | 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.r227-tall-162098230800090.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 ShieldIIPs-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230800090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:52 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 ShieldIIPs-PT-002A-00
FORMULA_NAME ShieldIIPs-PT-002A-01
FORMULA_NAME ShieldIIPs-PT-002A-02
FORMULA_NAME ShieldIIPs-PT-002A-03
FORMULA_NAME ShieldIIPs-PT-002A-04
FORMULA_NAME ShieldIIPs-PT-002A-05
FORMULA_NAME ShieldIIPs-PT-002A-06
FORMULA_NAME ShieldIIPs-PT-002A-07
FORMULA_NAME ShieldIIPs-PT-002A-08
FORMULA_NAME ShieldIIPs-PT-002A-09
FORMULA_NAME ShieldIIPs-PT-002A-10
FORMULA_NAME ShieldIIPs-PT-002A-11
FORMULA_NAME ShieldIIPs-PT-002A-12
FORMULA_NAME ShieldIIPs-PT-002A-13
FORMULA_NAME ShieldIIPs-PT-002A-14
FORMULA_NAME ShieldIIPs-PT-002A-15
=== Now, execution of the tool begins
BK_START 1621121813055
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 23:36:54] [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-15 23:36:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:36:54] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-15 23:36:54] [INFO ] Transformed 53 places.
[2021-05-15 23:36:54] [INFO ] Transformed 51 transitions.
[2021-05-15 23:36:54] [INFO ] Found NUPN structural information;
[2021-05-15 23:36:54] [INFO ] Parsed PT model containing 53 places and 51 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1181 steps, including 8 resets, run visited all 50 properties in 14 ms. (steps per millisecond=84 )
[2021-05-15 23:36:54] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-15 23:36:54] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldIIPs-PT-002A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 23:36:54] [INFO ] Applying decomposition
[2021-05-15 23:36:54] [INFO ] Flatten gal took : 9 ms
[2021-05-15 23:36:54] [INFO ] Decomposing Gal with order
[2021-05-15 23:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:36:55] [INFO ] Removed a total of 34 redundant transitions.
[2021-05-15 23:36:55] [INFO ] Flatten gal took : 37 ms
[2021-05-15 23:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2021-05-15 23:36:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-15 23:36:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPs-PT-002A @ 3570 seconds
FORMULA ShieldIIPs-PT-002A-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-002A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2550
rslt: Output for LTLFireability @ ShieldIIPs-PT-002A
{
"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": "Sat May 15 23:36:55 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 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": "((p12 <= 0) OR (p45 <= 0))",
"processed_size": 27,
"rewrites": 104
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((X (G (((1 <= p12) AND (1 <= p45)))) OR (((p11 <= 0)) OR (((p17 <= 0)) OR ((p27 <= 0)))))))",
"processed_size": 97,
"rewrites": 102
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((G ((X (((1 <= p33) AND (1 <= p47))) OR (G (((p33 <= 0) OR (p47 <= 0))) AND X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))) AND X (((1 <= p7) AND (1 <= p9)))))",
"processed_size": 165,
"rewrites": 102
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F (((p8 <= 0) OR (p22 <= 0))) OR (((p30 <= 0)) OR ((p43 <= 0))))))",
"processed_size": 74,
"rewrites": 102
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 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": "X (F (((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p38) AND (1 <= p48) AND (1 <= p52))))",
"processed_size": 95,
"rewrites": 102
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((X (((1 <= p6) AND (1 <= p17))) AND (((1 <= p6)) AND ((1 <= p17))))) OR G (((p41 <= 0)))))",
"processed_size": 97,
"rewrites": 102
},
"result":
{
"edges": 130,
"markings": 130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 3,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (((((1 <= p29) AND (1 <= p44)) U X (((1 <= p13) AND (1 <= p23) AND (1 <= p25)))) U (X (G (((1 <= p14) AND (1 <= p35)))) OR (G (((p13 <= 0) OR (p23 <= 0) OR (p25 <= 0))) AND F (G (((1 <= p14) AND (1 <= p35))))))))",
"processed_size": 216,
"rewrites": 102
},
"result":
{
"edges": 1151,
"markings": 964,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 54
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((F (((1 <= p41))) AND ((X (((1 <= p31) AND (1 <= p42))) OR (((p36 <= 0)) OR (((p42 <= 0)) OR ((p51 <= 0))))) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))",
"processed_size": 165,
"rewrites": 102
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p11 <= 0) OR (p15 <= 0) OR (p26 <= 0))",
"processed_size": 42,
"rewrites": 104
},
"result":
{
"edges": 178,
"markings": 178,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G (((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))) OR (((p2 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))))))",
"processed_size": 135,
"rewrites": 102
},
"result":
{
"edges": 626565818,
"markings": 88846245,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G (((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))) OR (((p33 <= 0)) OR ((p48 <= 0))))))",
"processed_size": 90,
"rewrites": 102
},
"result":
{
"edges": 287166930,
"markings": 59138251,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 2551
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2551
},
"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": "((p28 <= 0) OR (p49 <= 0))",
"processed_size": 27,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"child":
[
{
"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": "((p28 <= 0) OR (p49 <= 0))",
"processed_size": 27,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G (((p11 <= 0) OR (p15 <= 0) OR (p27 <= 0))) OR (G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50))) AND F (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))))",
"processed_size": 184,
"rewrites": 102
},
"result":
{
"edges": 113,
"markings": 113,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 12,
"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": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47356,
"runtime": 1019.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X((X(G(**)) OR (* OR (* OR *))))) AND F(**)) : X((G((X(**) OR (G(**) AND X(**)))) AND X(**))) : F(**) : (F((G(*) OR (G(**) AND F(*)))) AND **) : X(X((F(*) OR (* OR *)))) : X(F(**)) : G(F((G(*) OR (* OR *)))) : X((F((X(**) AND (** AND **))) OR G(*))) : X(((** U X(**)) U (X(G(**)) OR (G(**) AND F(G(**)))))) : G(F((G(*) OR (* AND *)))) : G(F((F(**) AND ((X(*) OR (* OR (* OR *))) AND *))))"
},
"net":
{
"arcs": 222,
"conflict_clusters": 17,
"places": 53,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 51
},
"result":
{
"preliminary_value": "yes no no no yes no yes no no yes no ",
"value": "yes no no no yes no yes no no yes 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: 104/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 53
lola: finding significant places
lola: 53 places, 51 transitions, 34 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: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: (NOT(X (X ((((NOT(X (G (((1 <= p12) AND (1 <= p45))))) AND ((1 <= p11))) AND ((1 <= p17))) AND ((1 <= p27)))))) AND F ((F (((1 <= p50))) U ((1 <= p12) AND (1 <= p45))))) : (X (G ((X (((1 <= p33) AND (1 <= p47))) OR (G (((p33 <= 0) OR (p47 <= 0))) AND X (((1 <= p11) AND (1 <= p17) AND (1 <= p27))))))) AND X (X (((1 <= p7) AND (1 <= p9))))) : F ((F ((F (X (((1 <= p8) AND (1 <= p23)))) OR ((1 <= p11) AND (1 <= p15) AND (1 <= p26) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50)))) U F (((1 <= p11) AND (1 <= p15) AND (1 <= p26))))) : (NOT(G ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) AND (NOT(G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50)))) OR G (((1 <= p38) AND (1 <= p48) AND (1 <= p50))))))) AND ((p28 <= 0) OR (p49 <= 0))) : X (NOT(X (((G (((1 <= p8) AND (1 <= p22))) AND ((1 <= p30))) AND ((1 <= p43)))))) : F (((G (((1 <= p11) AND (1 <= p17) AND (1 <= p26))) U ((1 <= p11) AND (1 <= p17) AND (1 <= p26))) U X (((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p38) AND (1 <= p48) AND (1 <= p52))))) : G (X (X (X (NOT(F (G (((F (((1 <= p38) AND (1 <= p46) AND (1 <= p52))) AND ((1 <= p33))) AND ((1 <= p48)))))))))) : (X (F (((X (((1 <= p6) AND (1 <= p17))) AND ((1 <= p6))) AND ((1 <= p17))))) OR G (NOT(X (((1 <= p41)))))) : X (((((1 <= p29) AND (1 <= p44)) U X (((1 <= p13) AND (1 <= p23) AND (1 <= p25)))) U (G (((p13 <= 0) OR (p23 <= 0) OR (p25 <= 0))) U X (G (((1 <= p14) AND (1 <= p35))))))) : G (X (NOT(F (G (X (G ((((1 <= p2) AND (1 <= p10)) U ((1 <= p2) AND (1 <= p10) AND ((p0 <= 0))))))))))) : F (G (NOT(G (((NOT(F (((1 <= p41)))) OR (((X (((p31 <= 0) OR (p42 <= 0))) AND ((1 <= p36))) AND ((1 <= p42))) AND ((1 <= p51)))) OR ((1 <= p36) AND (1 <= p42) AND (1 <= p51)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((X (G (((1 <= p12) AND (1 <= p45)))) OR (((p11 <= 0)) OR (((p17 <= 0)) OR ((p27 <= 0))))))) AND F (((1 <= p12) AND (1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p12) AND (1 <= p45)))
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: ((p12 <= 0) OR (p45 <= 0))
lola: processed formula length: 27
lola: 104 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G (((1 <= p12) AND (1 <= p45)))) OR (((p11 <= 0)) OR (((p17 <= 0)) OR ((p27 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G (((1 <= p12) AND (1 <= p45)))) OR (((p11 <= 0)) OR (((p17 <= 0)) OR ((p27 <= 0)))))))
lola: processed formula length: 97
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X (((1 <= p33) AND (1 <= p47))) OR (G (((p33 <= 0) OR (p47 <= 0))) AND X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))) AND X (((1 <= p7) AND (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (((1 <= p33) AND (1 <= p47))) OR (G (((p33 <= 0) OR (p47 <= 0))) AND X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))) AND X (((1 <= p7) AND (1 <= p9)))))
lola: processed formula length: 165
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 127 markings, 127 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p8 <= 0) OR (p22 <= 0))) OR (((p30 <= 0)) OR ((p43 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p8 <= 0) OR (p22 <= 0))) OR (((p30 <= 0)) OR ((p43 <= 0))))))
lola: processed formula length: 74
lola: 102 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: 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 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p38) AND (1 <= p48) AND (1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p38) AND (1 <= p48) AND (1 <= p52))))
lola: processed formula length: 95
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 127 markings, 127 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (((1 <= p6) AND (1 <= p17))) AND (((1 <= p6)) AND ((1 <= p17))))) OR G (((p41 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (((1 <= p6) AND (1 <= p17))) AND (((1 <= p6)) AND ((1 <= p17))))) OR G (((p41 <= 0)))))
lola: processed formula length: 97
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p29) AND (1 <= p44)) U X (((1 <= p13) AND (1 <= p23) AND (1 <= p25)))) U (X (G (((1 <= p14) AND (1 <= p35)))) OR (G (((p13 <= 0) OR (p23 <= 0) OR (p25 <= 0))) AND F (G (((1 <= p14) AND (1 <= p35))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p29) AND (1 <= p44)) U X (((1 <= p13) AND (1 <= p23) AND (1 <= p25)))) U (X (G (((1 <= p14) AND (1 <= p35)))) OR (G (((p13 <= 0) OR (p23 <= 0) OR (p25 <= 0))) AND F (G (((1 <= p14) AND (1 <= p35))))))))
lola: processed formula length: 216
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 54 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: 964 markings, 1151 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((1 <= p41))) AND ((X (((1 <= p31) AND (1 <= p42))) OR (((p36 <= 0)) OR (((p42 <= 0)) OR ((p51 <= 0))))) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((1 <= p41))) AND ((X (((1 <= p31) AND (1 <= p42))) OR (((p36 <= 0)) OR (((p42 <= 0)) OR ((p51 <= 0))))) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))
lola: processed formula length: 165
lola: 102 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: 149 markings, 149 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p15) AND (1 <= p26)))
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: ((p11 <= 0) OR (p15 <= 0) OR (p26 <= 0))
lola: processed formula length: 42
lola: 104 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: 178 markings, 178 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))) OR (((p2 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))) OR (((p2 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR ((1 <= p0)))))))
lola: processed formula length: 135
lola: 102 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: 957899 markings, 6530869 edges, 191580 markings/sec, 0 secs
lola: 1818201 markings, 12712250 edges, 172060 markings/sec, 5 secs
lola: 2714054 markings, 19003036 edges, 179171 markings/sec, 10 secs
lola: 3665956 markings, 24534248 edges, 190380 markings/sec, 15 secs
lola: 4473208 markings, 29864080 edges, 161450 markings/sec, 20 secs
lola: 5342143 markings, 35080407 edges, 173787 markings/sec, 25 secs
lola: 6087476 markings, 40033743 edges, 149067 markings/sec, 30 secs
lola: 6887279 markings, 45256536 edges, 159961 markings/sec, 35 secs
lola: 7669286 markings, 50420201 edges, 156401 markings/sec, 40 secs
lola: 8413309 markings, 55578471 edges, 148805 markings/sec, 45 secs
lola: 9120499 markings, 60414435 edges, 141438 markings/sec, 50 secs
lola: 9778519 markings, 65091164 edges, 131604 markings/sec, 55 secs
lola: 10432043 markings, 69826463 edges, 130705 markings/sec, 60 secs
lola: 11138541 markings, 74392897 edges, 141300 markings/sec, 65 secs
lola: 11956038 markings, 79376661 edges, 163499 markings/sec, 70 secs
lola: 12655741 markings, 84067223 edges, 139941 markings/sec, 75 secs
lola: 13362174 markings, 88869110 edges, 141287 markings/sec, 80 secs
lola: 14012564 markings, 93406026 edges, 130078 markings/sec, 85 secs
lola: 14634905 markings, 97985250 edges, 124468 markings/sec, 90 secs
lola: 15237770 markings, 102347751 edges, 120573 markings/sec, 95 secs
lola: 15962951 markings, 107553201 edges, 145036 markings/sec, 100 secs
lola: 16721356 markings, 112575989 edges, 151681 markings/sec, 105 secs
lola: 17397224 markings, 117273455 edges, 135174 markings/sec, 110 secs
lola: 18102520 markings, 122243877 edges, 141059 markings/sec, 115 secs
lola: 18758904 markings, 126962014 edges, 131277 markings/sec, 120 secs
lola: 19421174 markings, 131791786 edges, 132454 markings/sec, 125 secs
lola: 20096950 markings, 136632721 edges, 135155 markings/sec, 130 secs
lola: 20716629 markings, 140955349 edges, 123936 markings/sec, 135 secs
lola: 21295288 markings, 145347561 edges, 115732 markings/sec, 140 secs
lola: 21915332 markings, 149992356 edges, 124009 markings/sec, 145 secs
lola: 22530848 markings, 154430562 edges, 123103 markings/sec, 150 secs
lola: 23126229 markings, 158988007 edges, 119076 markings/sec, 155 secs
lola: 23888151 markings, 163769624 edges, 152384 markings/sec, 160 secs
lola: 24614327 markings, 168555161 edges, 145235 markings/sec, 165 secs
lola: 25305036 markings, 173156450 edges, 138142 markings/sec, 170 secs
lola: 25931539 markings, 177519663 edges, 125301 markings/sec, 175 secs
lola: 26588651 markings, 182126110 edges, 131422 markings/sec, 180 secs
lola: 27207553 markings, 186470857 edges, 123780 markings/sec, 185 secs
lola: 27789434 markings, 190556297 edges, 116376 markings/sec, 190 secs
lola: 28450983 markings, 195363738 edges, 132310 markings/sec, 195 secs
lola: 29068441 markings, 199686560 edges, 123492 markings/sec, 200 secs
lola: 29629548 markings, 203981249 edges, 112221 markings/sec, 205 secs
lola: 30201661 markings, 208175485 edges, 114423 markings/sec, 210 secs
lola: 30827938 markings, 212821707 edges, 125255 markings/sec, 215 secs
lola: 31419453 markings, 217306198 edges, 118303 markings/sec, 220 secs
lola: 32006868 markings, 221497318 edges, 117483 markings/sec, 225 secs
lola: 32649049 markings, 226388783 edges, 128436 markings/sec, 230 secs
lola: 33203238 markings, 230722561 edges, 110838 markings/sec, 235 secs
lola: 33961584 markings, 236051824 edges, 151669 markings/sec, 240 secs
lola: 34669822 markings, 241060133 edges, 141648 markings/sec, 245 secs
lola: 35339807 markings, 245884859 edges, 133997 markings/sec, 250 secs
lola: 36024584 markings, 250627804 edges, 136955 markings/sec, 255 secs
lola: 36693388 markings, 255392510 edges, 133761 markings/sec, 260 secs
lola: 37289267 markings, 259713211 edges, 119176 markings/sec, 265 secs
lola: 37949721 markings, 264514554 edges, 132091 markings/sec, 270 secs
lola: 38577051 markings, 269143310 edges, 125466 markings/sec, 275 secs
lola: 39184302 markings, 273493712 edges, 121450 markings/sec, 280 secs
lola: 39783678 markings, 278017111 edges, 119875 markings/sec, 285 secs
lola: 40402120 markings, 282678024 edges, 123688 markings/sec, 290 secs
lola: 40992162 markings, 287244524 edges, 118008 markings/sec, 295 secs
lola: 41607676 markings, 291754698 edges, 123103 markings/sec, 300 secs
lola: 42270412 markings, 296485643 edges, 132547 markings/sec, 305 secs
lola: 42882425 markings, 301085096 edges, 122403 markings/sec, 310 secs
lola: 43554278 markings, 306026765 edges, 134371 markings/sec, 315 secs
lola: 44390845 markings, 311110674 edges, 167313 markings/sec, 320 secs
lola: 45088095 markings, 315619875 edges, 139450 markings/sec, 325 secs
lola: 45784583 markings, 320599178 edges, 139298 markings/sec, 330 secs
lola: 46414687 markings, 325077949 edges, 126021 markings/sec, 335 secs
lola: 47047538 markings, 329534774 edges, 126570 markings/sec, 340 secs
lola: 47630806 markings, 333787762 edges, 116654 markings/sec, 345 secs
lola: 48269719 markings, 338552021 edges, 127783 markings/sec, 350 secs
lola: 48837547 markings, 342820978 edges, 113566 markings/sec, 355 secs
lola: 49430364 markings, 347148169 edges, 118563 markings/sec, 360 secs
lola: 50007658 markings, 351515440 edges, 115459 markings/sec, 365 secs
lola: 50640957 markings, 356020183 edges, 126660 markings/sec, 370 secs
lola: 51294582 markings, 360874627 edges, 130725 markings/sec, 375 secs
lola: 51908291 markings, 365417744 edges, 122742 markings/sec, 380 secs
lola: 52502327 markings, 370038852 edges, 118807 markings/sec, 385 secs
lola: 53163538 markings, 374876187 edges, 132242 markings/sec, 390 secs
lola: 53793137 markings, 379567811 edges, 125920 markings/sec, 395 secs
lola: 54411997 markings, 384167168 edges, 123772 markings/sec, 400 secs
lola: 55035359 markings, 388892339 edges, 124672 markings/sec, 405 secs
lola: 55652015 markings, 393430903 edges, 123331 markings/sec, 410 secs
lola: 56241776 markings, 397853086 edges, 117952 markings/sec, 415 secs
lola: 56814505 markings, 402197733 edges, 114546 markings/sec, 420 secs
lola: 57535537 markings, 407551312 edges, 144206 markings/sec, 425 secs
lola: 58265024 markings, 412599755 edges, 145897 markings/sec, 430 secs
lola: 58954954 markings, 417480274 edges, 137986 markings/sec, 435 secs
lola: 59634432 markings, 422137102 edges, 135896 markings/sec, 440 secs
lola: 60313087 markings, 427015505 edges, 135731 markings/sec, 445 secs
lola: 60987691 markings, 432003336 edges, 134921 markings/sec, 450 secs
lola: 61652480 markings, 436894599 edges, 132958 markings/sec, 455 secs
lola: 62281843 markings, 441532279 edges, 125873 markings/sec, 460 secs
lola: 62910427 markings, 445946117 edges, 125717 markings/sec, 465 secs
lola: 63495198 markings, 450424165 edges, 116954 markings/sec, 470 secs
lola: 64158313 markings, 455266665 edges, 132623 markings/sec, 475 secs
lola: 64795361 markings, 459703632 edges, 127410 markings/sec, 480 secs
lola: 65552924 markings, 464578229 edges, 151513 markings/sec, 485 secs
lola: 66268981 markings, 469403117 edges, 143211 markings/sec, 490 secs
lola: 66890397 markings, 474149029 edges, 124283 markings/sec, 495 secs
lola: 67612061 markings, 479146456 edges, 144333 markings/sec, 500 secs
lola: 68260166 markings, 483734967 edges, 129621 markings/sec, 505 secs
lola: 68868678 markings, 488060767 edges, 121702 markings/sec, 510 secs
lola: 69453388 markings, 492605476 edges, 116942 markings/sec, 515 secs
lola: 70090829 markings, 497388855 edges, 127488 markings/sec, 520 secs
lola: 70719130 markings, 502132280 edges, 125660 markings/sec, 525 secs
lola: 71354528 markings, 506825832 edges, 127080 markings/sec, 530 secs
lola: 72020206 markings, 511620036 edges, 133136 markings/sec, 535 secs
lola: 72649815 markings, 516253146 edges, 125922 markings/sec, 540 secs
lola: 73277227 markings, 520815549 edges, 125482 markings/sec, 545 secs
lola: 73892994 markings, 525404321 edges, 123153 markings/sec, 550 secs
lola: 74536104 markings, 530132703 edges, 128622 markings/sec, 555 secs
lola: 75268514 markings, 535125658 edges, 146482 markings/sec, 560 secs
lola: 75982912 markings, 539895019 edges, 142880 markings/sec, 565 secs
lola: 76641177 markings, 544443837 edges, 131653 markings/sec, 570 secs
lola: 77331776 markings, 549470759 edges, 138120 markings/sec, 575 secs
lola: 78001510 markings, 554069518 edges, 133947 markings/sec, 580 secs
lola: 78735268 markings, 558847501 edges, 146752 markings/sec, 585 secs
lola: 79394426 markings, 563654939 edges, 131832 markings/sec, 590 secs
lola: 80041949 markings, 568285845 edges, 129505 markings/sec, 595 secs
lola: 80709285 markings, 573016472 edges, 133467 markings/sec, 600 secs
lola: 81355343 markings, 577750012 edges, 129212 markings/sec, 605 secs
lola: 81993438 markings, 582267428 edges, 127619 markings/sec, 610 secs
lola: 82713541 markings, 587097779 edges, 144021 markings/sec, 615 secs
lola: 83376521 markings, 591657220 edges, 132596 markings/sec, 620 secs
lola: 84065435 markings, 596299252 edges, 137783 markings/sec, 625 secs
lola: 84745329 markings, 601134087 edges, 135979 markings/sec, 630 secs
lola: 85433243 markings, 605703617 edges, 137583 markings/sec, 635 secs
lola: 86227829 markings, 610688269 edges, 158917 markings/sec, 640 secs
lola: 87009556 markings, 615526710 edges, 156345 markings/sec, 645 secs
lola: 87755790 markings, 620166712 edges, 149247 markings/sec, 650 secs
lola: 88536002 markings, 624717115 edges, 156042 markings/sec, 655 secs
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: 88846245 markings, 626565818 edges
lola: ========================================
lola: subprocess 9 will run for 1452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))) OR (((p33 <= 0)) OR ((p48 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))) OR (((p33 <= 0)) OR ((p48 <= 0))))))
lola: processed formula length: 90
lola: 102 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: 1608816 markings, 5179200 edges, 321763 markings/sec, 0 secs
lola: 2619099 markings, 9781472 edges, 202057 markings/sec, 5 secs
lola: 3715566 markings, 14492632 edges, 219293 markings/sec, 10 secs
lola: 4694297 markings, 18983583 edges, 195746 markings/sec, 15 secs
lola: 5608384 markings, 23342948 edges, 182817 markings/sec, 20 secs
lola: 6441697 markings, 27342141 edges, 166663 markings/sec, 25 secs
lola: 7284109 markings, 31588793 edges, 168482 markings/sec, 30 secs
lola: 8183606 markings, 35988602 edges, 179899 markings/sec, 35 secs
lola: 9028206 markings, 40111003 edges, 168920 markings/sec, 40 secs
lola: 9805168 markings, 43967849 edges, 155392 markings/sec, 45 secs
lola: 10700325 markings, 48136689 edges, 179031 markings/sec, 50 secs
lola: 11709135 markings, 52444265 edges, 201762 markings/sec, 55 secs
lola: 12540359 markings, 56473947 edges, 166245 markings/sec, 60 secs
lola: 13347845 markings, 60437588 edges, 161497 markings/sec, 65 secs
lola: 14225040 markings, 64395803 edges, 175439 markings/sec, 70 secs
lola: 14950797 markings, 68217468 edges, 145151 markings/sec, 75 secs
lola: 15768363 markings, 71999631 edges, 163513 markings/sec, 80 secs
lola: 16488523 markings, 75749515 edges, 144032 markings/sec, 85 secs
lola: 17310029 markings, 79653284 edges, 164301 markings/sec, 90 secs
lola: 18018059 markings, 83441880 edges, 141606 markings/sec, 95 secs
lola: 18754255 markings, 87289991 edges, 147239 markings/sec, 100 secs
lola: 19562940 markings, 91094381 edges, 161737 markings/sec, 105 secs
lola: 20270418 markings, 94782493 edges, 141496 markings/sec, 110 secs
lola: 21045428 markings, 98501125 edges, 155002 markings/sec, 115 secs
lola: 21752308 markings, 102191795 edges, 141376 markings/sec, 120 secs
lola: 22465148 markings, 105971357 edges, 142568 markings/sec, 125 secs
lola: 23245313 markings, 109964211 edges, 156033 markings/sec, 130 secs
lola: 24059114 markings, 113851874 edges, 162760 markings/sec, 135 secs
lola: 24858209 markings, 117704894 edges, 159819 markings/sec, 140 secs
lola: 25618840 markings, 121497313 edges, 152126 markings/sec, 145 secs
lola: 26323375 markings, 125139768 edges, 140907 markings/sec, 150 secs
lola: 27298736 markings, 129476251 edges, 195072 markings/sec, 155 secs
lola: 28132774 markings, 133467887 edges, 166808 markings/sec, 160 secs
lola: 28931500 markings, 137469762 edges, 159745 markings/sec, 165 secs
lola: 29691780 markings, 141342636 edges, 152056 markings/sec, 170 secs
lola: 30510722 markings, 145122636 edges, 163788 markings/sec, 175 secs
lola: 31299458 markings, 149026472 edges, 157747 markings/sec, 180 secs
lola: 32105009 markings, 153034295 edges, 161110 markings/sec, 185 secs
lola: 32873339 markings, 157030906 edges, 153666 markings/sec, 190 secs
lola: 33568277 markings, 160812393 edges, 138988 markings/sec, 195 secs
lola: 34432490 markings, 164789915 edges, 172843 markings/sec, 200 secs
lola: 35224593 markings, 168679738 edges, 158421 markings/sec, 205 secs
lola: 35938248 markings, 172480023 edges, 142731 markings/sec, 210 secs
lola: 36695194 markings, 176341415 edges, 151389 markings/sec, 215 secs
lola: 37451745 markings, 180168877 edges, 151310 markings/sec, 220 secs
lola: 38167959 markings, 184106912 edges, 143243 markings/sec, 225 secs
lola: 38973231 markings, 188083130 edges, 161054 markings/sec, 230 secs
lola: 39808225 markings, 192038044 edges, 166999 markings/sec, 235 secs
lola: 40517808 markings, 195937419 edges, 141917 markings/sec, 240 secs
lola: 41315427 markings, 199911969 edges, 159524 markings/sec, 245 secs
lola: 42050272 markings, 203872840 edges, 146969 markings/sec, 250 secs
lola: 42928278 markings, 207903049 edges, 175601 markings/sec, 255 secs
lola: 43719742 markings, 211859450 edges, 158293 markings/sec, 260 secs
lola: 44596653 markings, 215972182 edges, 175382 markings/sec, 265 secs
lola: 45603904 markings, 220493019 edges, 201450 markings/sec, 270 secs
lola: 46493379 markings, 224772389 edges, 177895 markings/sec, 275 secs
lola: 47371279 markings, 229086852 edges, 175580 markings/sec, 280 secs
lola: 48218599 markings, 233346979 edges, 169464 markings/sec, 285 secs
lola: 49064672 markings, 237514072 edges, 169215 markings/sec, 290 secs
lola: 49854147 markings, 241612972 edges, 157895 markings/sec, 295 secs
lola: 50721153 markings, 245849173 edges, 173401 markings/sec, 300 secs
lola: 51555363 markings, 249981165 edges, 166842 markings/sec, 305 secs
lola: 52368821 markings, 254111207 edges, 162692 markings/sec, 310 secs
lola: 53176633 markings, 258268892 edges, 161562 markings/sec, 315 secs
lola: 53981452 markings, 262304533 edges, 160964 markings/sec, 320 secs
lola: 54846600 markings, 266424458 edges, 173030 markings/sec, 325 secs
lola: 55648068 markings, 270543392 edges, 160294 markings/sec, 330 secs
lola: 56525615 markings, 274756160 edges, 175509 markings/sec, 335 secs
lola: 57489902 markings, 279245946 edges, 192857 markings/sec, 340 secs
lola: 58409397 markings, 283595069 edges, 183899 markings/sec, 345 secs
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: 59138251 markings, 287166930 edges
lola: ========================================
lola: subprocess 10 will run for 2551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((p11 <= 0) OR (p15 <= 0) OR (p27 <= 0))) OR (G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50))) AND F (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0)))))) AND ((p28 <= 0) OR (p49 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p28 <= 0) OR (p49 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p28 <= 0) OR (p49 <= 0))
lola: processed formula length: 27
lola: 102 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: 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 (((p11 <= 0) OR (p15 <= 0) OR (p27 <= 0))) OR (G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50))) AND F (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0)))))) AND ((p28 <= 0) OR (p49 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p28 <= 0) OR (p49 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p28 <= 0) OR (p49 <= 0))
lola: processed formula length: 27
lola: 102 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: ========================================
lola: ...considering subproblem: F ((G (((p11 <= 0) OR (p15 <= 0) OR (p27 <= 0))) OR (G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50))) AND F (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p11 <= 0) OR (p15 <= 0) OR (p27 <= 0))) OR (G (((1 <= p1) AND (1 <= p20) AND (1 <= p38) AND (1 <= p48) AND (1 <= p50))) AND F (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))))
lola: processed formula length: 184
lola: 102 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: 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: 113 markings, 113 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no yes no no yes no
lola:
preliminary result: yes no no no yes no yes no no yes no
lola: memory consumption: 47356 KB
lola: time consumption: 1019 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="ShieldIIPs-PT-002A"
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 ShieldIIPs-PT-002A, 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 r227-tall-162098230800090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002A.tgz
mv ShieldIIPs-PT-002A 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 '
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 ;