About the Execution of 2020-gold for DNAwalker-PT-11ringRR
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10375.111 | 3600000.00 | 1669904.00 | 4738.40 | FFFFTFFTTFFFFFFT | 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.r075-tall-162039097500306.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 DNAwalker-PT-11ringRR, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097500306
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-11ringRR-00
FORMULA_NAME DNAwalker-PT-11ringRR-01
FORMULA_NAME DNAwalker-PT-11ringRR-02
FORMULA_NAME DNAwalker-PT-11ringRR-03
FORMULA_NAME DNAwalker-PT-11ringRR-04
FORMULA_NAME DNAwalker-PT-11ringRR-05
FORMULA_NAME DNAwalker-PT-11ringRR-06
FORMULA_NAME DNAwalker-PT-11ringRR-07
FORMULA_NAME DNAwalker-PT-11ringRR-08
FORMULA_NAME DNAwalker-PT-11ringRR-09
FORMULA_NAME DNAwalker-PT-11ringRR-10
FORMULA_NAME DNAwalker-PT-11ringRR-11
FORMULA_NAME DNAwalker-PT-11ringRR-12
FORMULA_NAME DNAwalker-PT-11ringRR-13
FORMULA_NAME DNAwalker-PT-11ringRR-14
FORMULA_NAME DNAwalker-PT-11ringRR-15
=== Now, execution of the tool begins
BK_START 1620561551503
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 11:59:13] [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-09 11:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 11:59:13] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-09 11:59:13] [INFO ] Transformed 27 places.
[2021-05-09 11:59:13] [INFO ] Transformed 260 transitions.
[2021-05-09 11:59:13] [INFO ] Parsed PT model containing 27 places and 260 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8061 resets, run finished after 449 ms. (steps per millisecond=222 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2021-05-09 11:59:13] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2021-05-09 11:59:13] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-09 11:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 11:59:14] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-09 11:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 11:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 11:59:14] [INFO ] [Nat]Absence check using state equation in 213 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-09 11:59:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-09 11:59:14] [INFO ] Flatten gal took : 45 ms
FORMULA DNAwalker-PT-11ringRR-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-11ringRR-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 11:59:14] [INFO ] Flatten gal took : 15 ms
[2021-05-09 11:59:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-09 11:59:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DNAwalker-PT-11ringRR @ 3570 seconds
FORMULA DNAwalker-PT-11ringRR-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-11ringRR-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1913
rslt: Output for LTLFireability @ DNAwalker-PT-11ringRR
{
"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": "Sun May 9 11:59:15 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 192
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 192
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((2 <= p15) AND (1 <= p22))",
"processed_size": 27,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 207
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((2 <= p5) AND (1 <= p8))) OR X (((2 <= p15) AND (1 <= p22)))))",
"processed_size": 70,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 207
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 207
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((2 <= p13))))",
"processed_size": 20,
"rewrites": 76
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 224
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((p4 <= 1) OR (p7 <= 0))))",
"processed_size": 33,
"rewrites": 76
},
"result":
{
"edges": 1054633,
"markings": 150365,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"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": "((p3 <= 1) OR (p25 <= 0))",
"processed_size": 26,
"rewrites": 78
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 43
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 245
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 4,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (X (G (((p13 <= 0) OR (p17 <= 1)))))) U (F (((1 <= p8) AND (2 <= p11))) OR ((1 <= p13) AND (2 <= p17)))))",
"processed_size": 115,
"rewrites": 76
},
"result":
{
"edges": 4103099,
"markings": 556785,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X ((((p11 <= 1)) R X (((p3 <= 1) OR (p15 <= 0))))) AND (((2 <= p11)) U (F (((2 <= p3) AND (1 <= p15))) U ((1 <= p19) AND (2 <= p21)))))))",
"processed_size": 145,
"rewrites": 76
},
"result":
{
"edges": 663,
"markings": 517,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 269
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((((p8 <= 0) OR (p17 <= 1)) R ((p1 <= 0) OR (p17 <= 1))) U X (((p12 <= 0) OR (p5 <= 0) OR (p25 <= 1)))))",
"processed_size": 111,
"rewrites": 76
},
"result":
{
"edges": 1700,
"markings": 1329,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (F ((X (F (((1 <= p21) AND (2 <= p25)))) OR (G (F (((p2 <= 0) OR (p23 <= 1)))) AND ((p2 <= 0) OR (p4 <= 1)))))))",
"processed_size": 119,
"rewrites": 76
},
"result":
{
"edges": 244160114,
"markings": 31114022,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((((p0 <= 1) OR (p9 <= 0)) AND ((p1 <= 1) OR (p13 <= 0)))) OR (F (((2 <= p0) AND (1 <= p9))) U ((p13 <= 0) OR (p17 <= 1)))))",
"processed_size": 133,
"rewrites": 76
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 357
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (((1 <= p13) AND (2 <= p15))) AND (F (((2 <= p18))) OR (F (((1 <= p9) AND (2 <= p15))) AND ((1 <= p13) AND (2 <= p15))))))",
"processed_size": 128,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((2 <= p0) AND (1 <= p3)) OR ((2 <= p13) AND (1 <= p18))))",
"processed_size": 63,
"rewrites": 76
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"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": "F (G ((X (((2 <= p8) AND (1 <= p9))) OR ((2 <= p9)))))",
"processed_size": 54,
"rewrites": 76
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((p4 <= 0) OR (p25 <= 1))) AND G (((p0 <= 1) OR (p23 <= 0)))))",
"processed_size": 71,
"rewrites": 76
},
"result":
{
"edges": 240858803,
"markings": 28208081,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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 (F ((X ((F (((2 <= p8))) OR (p26 <= 0))) AND (1 <= p26))))",
"processed_size": 60,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 772
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p10 <= 0) U (G (((p23 <= 0) OR (p25 <= 1))) AND X ((((p4 <= 1) OR (p15 <= 0)) OR ((p23 <= 0) OR (p25 <= 1))))))",
"processed_size": 116,
"rewrites": 76
},
"result":
{
"edges": 47825,
"markings": 9497,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"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": 1158
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X (F (((p0 <= 1) OR (p13 <= 0)))) OR (G (F (((p17 <= 0) OR (p21 <= 1)))) OR F ((X (((2 <= p22) AND (1 <= p25))) AND F (((p17 <= 0) OR (p21 <= 1))))))))",
"processed_size": 158,
"rewrites": 76
},
"result":
{
"edges": 502826599,
"markings": 71404498,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"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": 1913
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p13 <= 0) OR (p17 <= 1)) AND ((p7 <= 0) OR (p17 <= 1)))",
"processed_size": 60,
"rewrites": 78
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 67
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 48808,
"runtime": 1657.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F((G(**) OR X(**))) OR **) : (X(G(*)) OR (G(F(**)) AND F(G(*)))) : (X((X(X(X(G(*)))) U (F(**) OR **))) OR F(**)) : G(F((X((* R X(*))) AND (** U (F(**) U **))))) : X(((* R *) U X(*))) : F(**) : X(X(F((X(F(**)) OR (G(F(*)) AND *))))) : X((G(*) OR (F(**) U **))) : F((X(**) AND (F(**) OR (F(**) AND (** AND **))))) : (G(**) OR F(G((X(**) OR **)))) : X((X(*) AND G(*))) : X(F((X((F(**) OR **)) AND **))) : (** U (G(*) AND X((* OR *)))) : G((X(F(*)) OR (G(F(*)) OR F((X(*) AND F(*))))))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no no no yes no yes yes no no no no no yes ",
"value": "no no no no yes no yes yes no no no no no yes "
},
"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: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: (F ((G (((2 <= p5) AND (1 <= p8))) OR X (((2 <= p15) AND (1 <= p22))))) OR ((2 <= p15) AND (1 <= p22))) : (G (NOT(F (NOT(F (((2 <= p13))))))) U NOT(X (F (((2 <= p4) AND (1 <= p7)))))) : (X ((X (X (G (NOT(X (((1 <= p13) AND (2 <= p17))))))) U (F (((1 <= p8) AND (2 <= p11))) OR ((1 <= p13) AND (2 <= p17))))) OR F (((2 <= p3) AND (1 <= p25)))) : G (F ((NOT(X ((((2 <= p11)) U X (((2 <= p3) AND (1 <= p15)))))) AND (((2 <= p11)) U (F (((2 <= p3) AND (1 <= p15))) U ((1 <= p19) AND (2 <= p21))))))) : X ((NOT((((1 <= p8) AND (2 <= p17)) U ((1 <= p1) AND (2 <= p17)))) U NOT(X (((1 <= p12) AND (1 <= p5) AND (2 <= p25)))))) : (F (X (X (((2 <= p1))))) U F ((((1 <= p13) AND (2 <= p17)) OR ((1 <= p7) AND (2 <= p17))))) : X (F ((F (X (X (((1 <= p21) AND (2 <= p25))))) OR NOT(X ((F (G (((1 <= p2) AND (2 <= p23)))) OR ((1 <= p2) AND (2 <= p4)))))))) : (NOT(F (X (F ((((2 <= p0) AND (1 <= p9)) OR ((2 <= p1) AND (1 <= p13))))))) OR X ((F (((2 <= p0) AND (1 <= p9))) U ((p13 <= 0) OR (p17 <= 1))))) : F ((X (((1 <= p13) AND (2 <= p15))) AND (F (((2 <= p18))) OR ((F (((1 <= p9) AND (2 <= p15))) AND (1 <= p13)) AND (2 <= p15))))) : (G ((((2 <= p0) AND (1 <= p3)) OR ((2 <= p13) AND (1 <= p18)))) OR G (F (G ((X (((2 <= p8) AND (1 <= p9))) OR ((2 <= p9))))))) : X ((NOT(X (((1 <= p4) AND (2 <= p25)))) AND NOT(F (((2 <= p0) AND (1 <= p23)))))) : F (X ((X ((F (((2 <= p8))) OR (p26 <= 0))) AND (1 <= p26)))) : ((p10 <= 0) U (NOT(F ((((1 <= p21) AND (2 <= p25)) U ((1 <= p23) AND (2 <= p25))))) AND (NOT(X (((2 <= p4) AND (1 <= p15)))) OR NOT(X (((1 <= p23) AND (2 <= p25))))))) : NOT(F ((X (G (((2 <= p0) AND (1 <= p13)))) AND G ((X (((p22 <= 1) OR (p25 <= 0))) U G (((1 <= p17) AND (2 <= p21))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((2 <= p5) AND (1 <= p8))) OR X (((2 <= p15) AND (1 <= p22))))) OR ((2 <= p15) AND (1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p15) AND (1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p15) AND (1 <= p22))
lola: processed formula length: 27
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((2 <= p5) AND (1 <= p8))) OR X (((2 <= p15) AND (1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((2 <= p5) AND (1 <= p8))) OR X (((2 <= p15) AND (1 <= p22)))))
lola: processed formula length: 70
lola: 76 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p4 <= 1) OR (p7 <= 0)))) OR (G (F (((2 <= p13)))) AND F (G (((p4 <= 1) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((2 <= p13))))
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 <= p13))))
lola: processed formula length: 20
lola: 76 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p4 <= 1) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p4 <= 1) OR (p7 <= 0))))
lola: processed formula length: 33
lola: 76 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: 150365 markings, 1054633 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X (X (G (((p13 <= 0) OR (p17 <= 1)))))) U (F (((1 <= p8) AND (2 <= p11))) OR ((1 <= p13) AND (2 <= p17))))) OR F (((2 <= p3) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((2 <= p3) AND (1 <= p25)))
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: ((p3 <= 1) OR (p25 <= 0))
lola: processed formula length: 26
lola: 78 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (G (((p13 <= 0) OR (p17 <= 1)))))) U (F (((1 <= p8) AND (2 <= p11))) OR ((1 <= p13) AND (2 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (G (((p13 <= 0) OR (p17 <= 1)))))) U (F (((1 <= p8) AND (2 <= p11))) OR ((1 <= p13) AND (2 <= p17)))))
lola: processed formula length: 115
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 556785 markings, 4103099 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((p11 <= 1)) R X (((p3 <= 1) OR (p15 <= 0))))) AND (((2 <= p11)) U (F (((2 <= p3) AND (1 <= p15))) U ((1 <= p19) AND (2 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((p11 <= 1)) R X (((p3 <= 1) OR (p15 <= 0))))) AND (((2 <= p11)) U (F (((2 <= p3) AND (1 <= p15))) U ((1 <= p19) AND (2 <= p21)))))))
lola: processed formula length: 145
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 517 markings, 663 edges
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p8 <= 0) OR (p17 <= 1)) R ((p1 <= 0) OR (p17 <= 1))) U X (((p12 <= 0) OR (p5 <= 0) OR (p25 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p8 <= 0) OR (p17 <= 1)) R ((p1 <= 0) OR (p17 <= 1))) U X (((p12 <= 0) OR (p5 <= 0) OR (p25 <= 1)))))
lola: processed formula length: 111
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1329 markings, 1700 edges
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F (((1 <= p21) AND (2 <= p25)))) OR (G (F (((p2 <= 0) OR (p23 <= 1)))) AND ((p2 <= 0) OR (p4 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F (((1 <= p21) AND (2 <= p25)))) OR (G (F (((p2 <= 0) OR (p23 <= 1)))) AND ((p2 <= 0) OR (p4 <= 1)))))))
lola: processed formula length: 119
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
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: 1115953 markings, 7797741 edges, 223191 markings/sec, 0 secs
lola: 2071982 markings, 14725361 edges, 191206 markings/sec, 5 secs
lola: 2942415 markings, 21272045 edges, 174087 markings/sec, 10 secs
lola: 3976762 markings, 28621745 edges, 206869 markings/sec, 15 secs
lola: 4785933 markings, 34623335 edges, 161834 markings/sec, 20 secs
lola: 5708884 markings, 41874056 edges, 184590 markings/sec, 25 secs
lola: 6503693 markings, 48721836 edges, 158962 markings/sec, 30 secs
lola: 7498491 markings, 55817642 edges, 198960 markings/sec, 35 secs
lola: 8223378 markings, 61213422 edges, 144977 markings/sec, 40 secs
lola: 9179015 markings, 68206069 edges, 191127 markings/sec, 45 secs
lola: 9825204 markings, 73584187 edges, 129238 markings/sec, 50 secs
lola: 10751788 markings, 80471030 edges, 185317 markings/sec, 55 secs
lola: 11514446 markings, 86093266 edges, 152532 markings/sec, 60 secs
lola: 12309675 markings, 92530832 edges, 159046 markings/sec, 65 secs
lola: 13101191 markings, 99440336 edges, 158303 markings/sec, 70 secs
lola: 13899162 markings, 105880021 edges, 159594 markings/sec, 75 secs
lola: 14864862 markings, 112870199 edges, 193140 markings/sec, 80 secs
lola: 15569076 markings, 118143654 edges, 140843 markings/sec, 85 secs
lola: 16470033 markings, 124936293 edges, 180191 markings/sec, 90 secs
lola: 17072384 markings, 129710634 edges, 120470 markings/sec, 95 secs
lola: 18009339 markings, 136629913 edges, 187391 markings/sec, 100 secs
lola: 18621801 markings, 141432160 edges, 122492 markings/sec, 105 secs
lola: 19501666 markings, 148285301 edges, 175973 markings/sec, 110 secs
lola: 20295206 markings, 155068448 edges, 158708 markings/sec, 115 secs
lola: 20980004 markings, 161255418 edges, 136960 markings/sec, 120 secs
lola: 21851212 markings, 168153978 edges, 174242 markings/sec, 125 secs
lola: 22650121 markings, 174008323 edges, 159782 markings/sec, 130 secs
lola: 23346224 markings, 179643393 edges, 139221 markings/sec, 135 secs
lola: 24199763 markings, 186232850 edges, 170708 markings/sec, 140 secs
lola: 24746988 markings, 190872581 edges, 109445 markings/sec, 145 secs
lola: 25519033 markings, 197407549 edges, 154409 markings/sec, 150 secs
lola: 26388597 markings, 204042692 edges, 173913 markings/sec, 155 secs
lola: 26918336 markings, 208399469 edges, 105948 markings/sec, 160 secs
lola: 27732109 markings, 215076722 edges, 162755 markings/sec, 165 secs
lola: 28545615 markings, 221668533 edges, 162701 markings/sec, 170 secs
lola: 29331701 markings, 228199457 edges, 157217 markings/sec, 175 secs
lola: 30109657 markings, 234846507 edges, 155591 markings/sec, 180 secs
lola: 30839196 markings, 241451634 edges, 145908 markings/sec, 185 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: 31114022 markings, 244160114 edges
lola: ========================================
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p0 <= 1) OR (p9 <= 0)) AND ((p1 <= 1) OR (p13 <= 0)))) OR (F (((2 <= p0) AND (1 <= p9))) U ((p13 <= 0) OR (p17 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p0 <= 1) OR (p9 <= 0)) AND ((p1 <= 1) OR (p13 <= 0)))) OR (F (((2 <= p0) AND (1 <= p9))) U ((p13 <= 0) OR (p17 <= 1)))))
lola: processed formula length: 133
lola: 76 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: 27 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p13) AND (2 <= p15))) AND (F (((2 <= p18))) OR (F (((1 <= p9) AND (2 <= p15))) AND ((1 <= p13) AND (2 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p13) AND (2 <= p15))) AND (F (((2 <= p18))) OR (F (((1 <= p9) AND (2 <= p15))) AND ((1 <= p13) AND (2 <= p15))))))
lola: processed formula length: 128
lola: 76 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((2 <= p0) AND (1 <= p3)) OR ((2 <= p13) AND (1 <= p18)))) OR F (G ((X (((2 <= p8) AND (1 <= p9))) OR ((2 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((2 <= p0) AND (1 <= p3)) OR ((2 <= p13) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((2 <= p0) AND (1 <= p3)) OR ((2 <= p13) AND (1 <= p18))))
lola: processed formula length: 63
lola: 76 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((2 <= p8) AND (1 <= p9))) OR ((2 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((2 <= p8) AND (1 <= p9))) OR ((2 <= p9)))))
lola: processed formula length: 54
lola: 76 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: 5 markings, 6 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((p4 <= 0) OR (p25 <= 1))) AND G (((p0 <= 1) OR (p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((p4 <= 0) OR (p25 <= 1))) AND G (((p0 <= 1) OR (p23 <= 0)))))
lola: processed formula length: 71
lola: 76 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: 1065842 markings, 7881982 edges, 213168 markings/sec, 0 secs
lola: 2019574 markings, 15197441 edges, 190746 markings/sec, 5 secs
lola: 2859581 markings, 21860923 edges, 168001 markings/sec, 10 secs
lola: 3772376 markings, 28812341 edges, 182559 markings/sec, 15 secs
lola: 4607284 markings, 35505312 edges, 166982 markings/sec, 20 secs
lola: 5464310 markings, 42785394 edges, 171405 markings/sec, 25 secs
lola: 6273240 markings, 49843486 edges, 161786 markings/sec, 30 secs
lola: 7144167 markings, 56720474 edges, 174185 markings/sec, 35 secs
lola: 7878720 markings, 62809415 edges, 146911 markings/sec, 40 secs
lola: 8674916 markings, 69320836 edges, 159239 markings/sec, 45 secs
lola: 9324027 markings, 75138739 edges, 129822 markings/sec, 50 secs
lola: 10206997 markings, 82326895 edges, 176594 markings/sec, 55 secs
lola: 10814370 markings, 87545469 edges, 121475 markings/sec, 60 secs
lola: 11602198 markings, 94668097 edges, 157566 markings/sec, 65 secs
lola: 12379825 markings, 101611060 edges, 155525 markings/sec, 70 secs
lola: 13216870 markings, 108458982 edges, 167409 markings/sec, 75 secs
lola: 13930661 markings, 113967115 edges, 142758 markings/sec, 80 secs
lola: 14754655 markings, 120644730 edges, 164799 markings/sec, 85 secs
lola: 15435417 markings, 126166966 edges, 136152 markings/sec, 90 secs
lola: 16234698 markings, 132741148 edges, 159856 markings/sec, 95 secs
lola: 16934148 markings, 138330470 edges, 139890 markings/sec, 100 secs
lola: 17680231 markings, 144735873 edges, 149217 markings/sec, 105 secs
lola: 18447568 markings, 151481139 edges, 153467 markings/sec, 110 secs
lola: 19129578 markings, 157806546 edges, 136402 markings/sec, 115 secs
lola: 19903335 markings, 164826689 edges, 154751 markings/sec, 120 secs
lola: 20692789 markings, 171312521 edges, 157891 markings/sec, 125 secs
lola: 21308019 markings, 176830434 edges, 123046 markings/sec, 130 secs
lola: 22106065 markings, 183662501 edges, 159609 markings/sec, 135 secs
lola: 22646573 markings, 188591137 edges, 108102 markings/sec, 140 secs
lola: 23340558 markings, 195134193 edges, 138797 markings/sec, 145 secs
lola: 24141206 markings, 201996504 edges, 160130 markings/sec, 150 secs
lola: 24663074 markings, 206864565 edges, 104374 markings/sec, 155 secs
lola: 25405831 markings, 213787793 edges, 148551 markings/sec, 160 secs
lola: 26134480 markings, 220634112 edges, 145730 markings/sec, 165 secs
lola: 26838889 markings, 227414263 edges, 140882 markings/sec, 170 secs
lola: 27543780 markings, 234323173 edges, 140978 markings/sec, 175 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: 28208081 markings, 240858803 edges
lola: ========================================
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((F (((2 <= p8))) OR (p26 <= 0))) AND (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((F (((2 <= p8))) OR (p26 <= 0))) AND (1 <= p26))))
lola: processed formula length: 60
lola: 76 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) U (G (((p23 <= 0) OR (p25 <= 1))) AND X ((((p4 <= 1) OR (p15 <= 0)) OR ((p23 <= 0) OR (p25 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p10 <= 0) U (G (((p23 <= 0) OR (p25 <= 1))) AND X ((((p4 <= 1) OR (p15 <= 0)) OR ((p23 <= 0) OR (p25 <= 1))))))
lola: processed formula length: 116
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9497 markings, 47825 edges
lola: ========================================
lola: subprocess 12 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p0 <= 1) OR (p13 <= 0)))) OR (G (F (((p17 <= 0) OR (p21 <= 1)))) OR F ((X (((2 <= p22) AND (1 <= p25))) AND F (((p17 <= 0) OR (p21 <= 1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p0 <= 1) OR (p13 <= 0)))) OR (G (F (((p17 <= 0) OR (p21 <= 1)))) OR F ((X (((2 <= p22) AND (1 <= p25))) AND F (((p17 <= 0) OR (p21 <= 1))))))))
lola: processed formula length: 158
lola: 76 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: 1065627 markings, 7893229 edges, 213125 markings/sec, 0 secs
lola: 2023413 markings, 15000740 edges, 191557 markings/sec, 5 secs
lola: 2881661 markings, 21609827 edges, 171650 markings/sec, 10 secs
lola: 3810357 markings, 28712608 edges, 185739 markings/sec, 15 secs
lola: 4684003 markings, 35395097 edges, 174729 markings/sec, 20 secs
lola: 5424821 markings, 41472594 edges, 148164 markings/sec, 25 secs
lola: 6369946 markings, 48716265 edges, 189025 markings/sec, 30 secs
lola: 7263836 markings, 55527976 edges, 178778 markings/sec, 35 secs
lola: 7886591 markings, 60659055 edges, 124551 markings/sec, 40 secs
lola: 8819325 markings, 67865559 edges, 186547 markings/sec, 45 secs
lola: 9667751 markings, 74667753 edges, 169685 markings/sec, 50 secs
lola: 10468050 markings, 81649119 edges, 160060 markings/sec, 55 secs
lola: 11263394 markings, 88523200 edges, 159069 markings/sec, 60 secs
lola: 11958020 markings, 94788687 edges, 138925 markings/sec, 65 secs
lola: 12882887 markings, 101970653 edges, 184973 markings/sec, 70 secs
lola: 13920515 markings, 108470135 edges, 207526 markings/sec, 75 secs
lola: 15086768 markings, 114318402 edges, 233251 markings/sec, 80 secs
lola: 15961786 markings, 118832120 edges, 175004 markings/sec, 85 secs
lola: 16812063 markings, 125756679 edges, 170055 markings/sec, 90 secs
lola: 17705550 markings, 132244817 edges, 178697 markings/sec, 95 secs
lola: 18966796 markings, 138318848 edges, 252249 markings/sec, 100 secs
lola: 19898281 markings, 143245110 edges, 186297 markings/sec, 105 secs
lola: 20665343 markings, 148510572 edges, 153412 markings/sec, 110 secs
lola: 21496813 markings, 155053171 edges, 166294 markings/sec, 115 secs
lola: 22338581 markings, 161941540 edges, 168354 markings/sec, 120 secs
lola: 23565328 markings, 167941257 edges, 245349 markings/sec, 125 secs
lola: 24585962 markings, 173182260 edges, 204127 markings/sec, 130 secs
lola: 25435735 markings, 177897256 edges, 169955 markings/sec, 135 secs
lola: 26533966 markings, 184448952 edges, 219646 markings/sec, 140 secs
lola: 27503487 markings, 190919647 edges, 193904 markings/sec, 145 secs
lola: 28346487 markings, 197266727 edges, 168600 markings/sec, 150 secs
lola: 29282724 markings, 203623001 edges, 187247 markings/sec, 155 secs
lola: 30156058 markings, 209889388 edges, 174667 markings/sec, 160 secs
lola: 30998400 markings, 215513776 edges, 168468 markings/sec, 165 secs
lola: 31891226 markings, 222384099 edges, 178565 markings/sec, 170 secs
lola: 32758408 markings, 229071334 edges, 173436 markings/sec, 175 secs
lola: 33514894 markings, 234830668 edges, 151297 markings/sec, 180 secs
lola: 34245465 markings, 240881829 edges, 146114 markings/sec, 185 secs
lola: 35095652 markings, 247760563 edges, 170037 markings/sec, 190 secs
lola: 35912056 markings, 254173470 edges, 163281 markings/sec, 195 secs
lola: 36559950 markings, 259442805 edges, 129579 markings/sec, 200 secs
lola: 37224263 markings, 265202657 edges, 132863 markings/sec, 205 secs
lola: 38081763 markings, 272161627 edges, 171500 markings/sec, 210 secs
lola: 38919433 markings, 278690831 edges, 167534 markings/sec, 215 secs
lola: 39600483 markings, 284210762 edges, 136210 markings/sec, 220 secs
lola: 40266808 markings, 290055556 edges, 133265 markings/sec, 225 secs
lola: 41075818 markings, 296910439 edges, 161802 markings/sec, 230 secs
lola: 41846945 markings, 303457580 edges, 154225 markings/sec, 235 secs
lola: 42597079 markings, 310217171 edges, 150027 markings/sec, 240 secs
lola: 43330018 markings, 316861904 edges, 146588 markings/sec, 245 secs
lola: 44000233 markings, 322821932 edges, 134043 markings/sec, 250 secs
lola: 44730429 markings, 329157719 edges, 146039 markings/sec, 255 secs
lola: 45578790 markings, 336170604 edges, 169672 markings/sec, 260 secs
lola: 46386673 markings, 342819313 edges, 161577 markings/sec, 265 secs
lola: 47699135 markings, 348998578 edges, 262492 markings/sec, 270 secs
lola: 48699476 markings, 353995794 edges, 200068 markings/sec, 275 secs
lola: 49496143 markings, 359201088 edges, 159333 markings/sec, 280 secs
lola: 50285737 markings, 366068706 edges, 157919 markings/sec, 285 secs
lola: 51049903 markings, 372669396 edges, 152833 markings/sec, 290 secs
lola: 52299698 markings, 378587349 edges, 249959 markings/sec, 295 secs
lola: 53296784 markings, 384071163 edges, 199417 markings/sec, 300 secs
lola: 54161014 markings, 388829540 edges, 172846 markings/sec, 305 secs
lola: 54931238 markings, 394613367 edges, 154045 markings/sec, 310 secs
lola: 55702311 markings, 400985531 edges, 154215 markings/sec, 315 secs
lola: 56490857 markings, 407850249 edges, 157709 markings/sec, 320 secs
lola: 57457437 markings, 413990710 edges, 193316 markings/sec, 325 secs
lola: 58650675 markings, 419970117 edges, 238648 markings/sec, 330 secs
lola: 59580798 markings, 424646508 edges, 186025 markings/sec, 335 secs
lola: 60343432 markings, 429672889 edges, 152527 markings/sec, 340 secs
lola: 61052779 markings, 436301579 edges, 141869 markings/sec, 345 secs
lola: 61770156 markings, 442903252 edges, 143475 markings/sec, 350 secs
lola: 62463179 markings, 449235217 edges, 138605 markings/sec, 355 secs
lola: 63538522 markings, 455365658 edges, 215069 markings/sec, 360 secs
lola: 64711853 markings, 461331487 edges, 234666 markings/sec, 365 secs
lola: 65822309 markings, 467257816 edges, 222091 markings/sec, 370 secs
lola: 66878374 markings, 472920221 edges, 211213 markings/sec, 375 secs
lola: 68002442 markings, 478846807 edges, 224814 markings/sec, 380 secs
lola: 68991485 markings, 485082654 edges, 197809 markings/sec, 385 secs
lola: 69928926 markings, 491280450 edges, 187488 markings/sec, 390 secs
lola: 70793151 markings, 497604309 edges, 172845 markings/sec, 395 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: 71404498 markings, 502826599 edges
lola: ========================================
lola: subprocess 13 will run for 1913 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p13) AND (2 <= p17)) OR ((1 <= p7) AND (2 <= p17))))
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: (((p13 <= 0) OR (p17 <= 1)) AND ((p7 <= 0) OR (p17 <= 1)))
lola: processed formula length: 60
lola: 78 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: 9 markings, 9 edges
lola: RESULT
lola:
SUMMARY: no no no no yes no yes yes no no no no no yes
lola:
preliminary result: no no no no yes no yes yes no no no no no yes
lola: ========================================
lola: memory consumption: 48808 KB
lola: time consumption: 1657 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="DNAwalker-PT-11ringRR"
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 DNAwalker-PT-11ringRR, 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 r075-tall-162039097500306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-11ringRR.tgz
mv DNAwalker-PT-11ringRR 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 ;