About the Execution of 2020-gold for HouseConstruction-PT-00100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16256.495 | 3600000.00 | 1199968.00 | 33430.50 | TFTFFTFFFTFFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428200090.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 HouseConstruction-PT-00100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428200090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00100-00
FORMULA_NAME HouseConstruction-PT-00100-01
FORMULA_NAME HouseConstruction-PT-00100-02
FORMULA_NAME HouseConstruction-PT-00100-03
FORMULA_NAME HouseConstruction-PT-00100-04
FORMULA_NAME HouseConstruction-PT-00100-05
FORMULA_NAME HouseConstruction-PT-00100-06
FORMULA_NAME HouseConstruction-PT-00100-07
FORMULA_NAME HouseConstruction-PT-00100-08
FORMULA_NAME HouseConstruction-PT-00100-09
FORMULA_NAME HouseConstruction-PT-00100-10
FORMULA_NAME HouseConstruction-PT-00100-11
FORMULA_NAME HouseConstruction-PT-00100-12
FORMULA_NAME HouseConstruction-PT-00100-13
FORMULA_NAME HouseConstruction-PT-00100-14
FORMULA_NAME HouseConstruction-PT-00100-15
=== Now, execution of the tool begins
BK_START 1620899579124
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 09:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:53:00] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-13 09:53:00] [INFO ] Transformed 26 places.
[2021-05-13 09:53:00] [INFO ] Transformed 18 transitions.
[2021-05-13 09:53:00] [INFO ] Parsed PT model containing 26 places and 18 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100044 steps, including 54 resets, run finished after 53 ms. (steps per millisecond=1887 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 26 cols
[2021-05-13 09:53:00] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-13 09:53:00] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-13 09:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:53:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 09:53:00] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 3 ms.
[2021-05-13 09:53:00] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-13 09:53:01] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 09:53:01] [INFO ] Flatten gal took : 22 ms
FORMULA HouseConstruction-PT-00100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:53:01] [INFO ] Flatten gal took : 5 ms
[2021-05-13 09:53:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 09:53:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ HouseConstruction-PT-00100 @ 3570 seconds
FORMULA HouseConstruction-PT-00100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2364
rslt: Output for LTLFireability @ HouseConstruction-PT-00100
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 09:53:01 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((1 <= p5) AND (1 <= p14)) OR (1 <= p6)) U ((1 <= p22) AND (1 <= p23)))",
"processed_size": 74,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (G ((1 <= p6))) U (1 <= p14))",
"processed_size": 32,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((G (((1 <= p10) AND (1 <= p11))) AND (G ((p6 <= 0)) OR ((1 <= p16) AND (1 <= p17))))))",
"processed_size": 92,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "G ((X (G ((1 <= p4))) OR ((1 <= p3) AND (1 <= p7))))",
"processed_size": 52,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((X (G ((1 <= p6))) AND F ((1 <= p8))))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 396
},
"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": "((p10 <= 0) OR (p11 <= 0))",
"processed_size": 27,
"rewrites": 37
},
"result":
{
"edges": 900,
"markings": 901,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 104687,
"markings": 93094,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 1803,
"markings": 1802,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "G ((((1 <= p8) AND (p18 <= 0)) OR ((F (((1 <= p8) AND (p18 <= 0))) AND F (G ((1 <= p8)))) OR G (F (((1 <= p10) AND (1 <= p11) AND (1 <= p1)))))))",
"processed_size": 145,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 743
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 743
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p25)",
"processed_size": 10,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 991
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p20 <= 0) OR (p21 <= 0) OR (p24 <= 0))",
"processed_size": 42,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p25 <= 0))",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 991
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 991
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p4)",
"processed_size": 9,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1487
},
"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": "((p10 <= 0) OR (p11 <= 0))",
"processed_size": 27,
"rewrites": 37
},
"result":
{
"edges": 900,
"markings": 901,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1487
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2974
},
"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 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 37
},
"result":
{
"edges": 1400,
"markings": 1401,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2974
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2974
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p8)))",
"processed_size": 17,
"rewrites": 35
},
"result":
{
"edges": 1803,
"markings": 1802,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 37
},
"result":
{
"edges": 1400,
"markings": 1401,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((G ((1 <= p14)) AND ((p3 <= 0) OR (p7 <= 0))) OR ((p16 <= 0) OR (p17 <= 0))))",
"processed_size": 82,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p8)))",
"processed_size": 17,
"rewrites": 35
},
"result":
{
"edges": 1803,
"markings": 1802,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (G ((1 <= p8))) AND (1 <= p6)))",
"processed_size": 37,
"rewrites": 35
},
"result":
{
"edges": 1801,
"markings": 1801,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3720,
"runtime": 1206.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) OR (G(F(**)) OR **)) : (** OR (G(((G(**) AND *) OR (* OR *))) AND F(**))) : (** AND (G(*) OR **)) : F(**) : ((X(G(**)) U **) OR (** U **)) : G((** OR ((F(**) AND F(G(**))) OR G(F(**))))) : X(G((G(**) AND (G(**) OR **)))) : G((X(G(**)) OR **)) : F(G(**)) : (G((F(G(**)) AND **)) OR F(G(**))) : G(F(**)) : X(X(F((X(G(*)) AND F(**))))) : F((G((F(**) AND (** OR **))) AND (** AND **)))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes no no yes no no no no no no no no unknown ",
"value": "yes no no yes no no no no no no no no unknown "
},
"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: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: ((F (((1 <= p10) AND (1 <= p11))) OR G (F ((((1 <= p10) AND (1 <= p11)) OR (p6 <= 0))))) OR (1 <= p4)) : (NOT(F ((((NOT(G ((1 <= p14))) OR ((1 <= p3) AND (1 <= p7))) AND (1 <= p16)) AND (1 <= p17)))) U ((1 <= p3) AND (1 <= p7))) : (((p20 <= 0) OR (p21 <= 0) OR (p24 <= 0)) AND (NOT(F ((1 <= p25))) OR (1 <= p25))) : F (((1 <= p10) AND (1 <= p11))) : ((G (X ((1 <= p6))) U (1 <= p14)) OR ((((1 <= p5) AND (1 <= p14)) OR (1 <= p6)) U ((1 <= p22) AND (1 <= p23)))) : G (((F (G ((1 <= p8))) U ((1 <= p8) AND (p18 <= 0))) OR G (F (((1 <= p10) AND (1 <= p11) AND (1 <= p1)))))) : G ((X (G (((1 <= p10) AND (1 <= p11)))) AND X ((G ((p6 <= 0)) OR ((1 <= p16) AND (1 <= p17)))))) : G ((G (X ((1 <= p4))) OR ((1 <= p3) AND (1 <= p7)))) : F (G (((1 <= p9) AND (1 <= p12) AND (1 <= p13)))) : (G ((F (G ((1 <= p8))) AND (1 <= p6))) OR F (X (G ((1 <= p8))))) : G (F (((1 <= p9) AND (1 <= p12) AND (1 <= p13)))) : F (X ((X (NOT(F (X ((p6 <= 0))))) AND F (X ((1 <= p8)))))) : F (((G (((1 <= p25) U (1 <= p8))) AND (1 <= p3)) AND (1 <= p7)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G ((1 <= p6))) U (1 <= p14)) OR ((((1 <= p5) AND (1 <= p14)) OR (1 <= p6)) U ((1 <= p22) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p5) AND (1 <= p14)) OR (1 <= p6)) U ((1 <= p22) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p5) AND (1 <= p14)) OR (1 <= p6)) U ((1 <= p22) AND (1 <= p23)))
lola: processed formula length: 74
lola: 35 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: 1801 markings, 1801 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p6))) U (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((1 <= p6))) U (1 <= p14))
lola: processed formula length: 32
lola: 35 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: 1801 markings, 1801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p10) AND (1 <= p11))) AND (G ((p6 <= 0)) OR ((1 <= p16) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p10) AND (1 <= p11))) AND (G ((p6 <= 0)) OR ((1 <= p16) AND (1 <= p17))))))
lola: processed formula length: 92
lola: 35 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: 1801 markings, 1801 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((1 <= p4))) OR ((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((1 <= p4))) OR ((1 <= p3) AND (1 <= p7))))
lola: processed formula length: 52
lola: 35 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: 1801 markings, 1801 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (G ((1 <= p6))) AND F ((1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (G ((1 <= p6))) AND F ((1 <= p8))))))
lola: processed formula length: 49
lola: 35 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1801 markings, 1801 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p10) AND (1 <= p11)))
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: ((p10 <= 0) OR (p11 <= 0))
lola: processed formula length: 27
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 901 markings, 900 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p9) AND (1 <= p12) AND (1 <= 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 (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))
lola: processed formula length: 49
lola: 35 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: 93094 markings, 104687 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))
lola: processed formula length: 49
lola: 35 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: 1802 markings, 1803 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((1 <= p8)) AND ((1 <= p25) OR (1 <= p8)))) AND ((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((1 <= p8)) AND ((1 <= p25) OR (1 <= p8)))) AND ((1 <= p3) AND (1 <= p7))))
lola: processed formula length: 85
lola: 35 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: 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: 2121010 markings, 6104264 edges, 424202 markings/sec, 0 secs
lola: 4138250 markings, 12035066 edges, 403448 markings/sec, 5 secs
lola: 6287720 markings, 18154355 edges, 429894 markings/sec, 10 secs
lola: 8314091 markings, 24122125 edges, 405274 markings/sec, 15 secs
lola: 10319946 markings, 30009124 edges, 401171 markings/sec, 20 secs
lola: 12306355 markings, 35794702 edges, 397282 markings/sec, 25 secs
lola: 14307320 markings, 41556131 edges, 400193 markings/sec, 30 secs
lola: 16323588 markings, 47315523 edges, 403254 markings/sec, 35 secs
lola: 18334130 markings, 53003814 edges, 402108 markings/sec, 40 secs
lola: 20368885 markings, 58721551 edges, 406951 markings/sec, 45 secs
lola: 22421265 markings, 64474805 edges, 410476 markings/sec, 50 secs
lola: 24251895 markings, 69928072 edges, 366126 markings/sec, 55 secs
lola: 25642298 markings, 74733807 edges, 278081 markings/sec, 60 secs
lola: 26958836 markings, 79282988 edges, 263308 markings/sec, 65 secs
lola: 28224036 markings, 83654133 edges, 253040 markings/sec, 70 secs
lola: 29451680 markings, 87897176 edges, 245529 markings/sec, 75 secs
lola: 30625838 markings, 91956869 edges, 234832 markings/sec, 80 secs
lola: 31806778 markings, 96036152 edges, 236188 markings/sec, 85 secs
lola: 32951226 markings, 99995419 edges, 228890 markings/sec, 90 secs
lola: 34101120 markings, 103967872 edges, 229979 markings/sec, 95 secs
lola: 35216782 markings, 107827942 edges, 223132 markings/sec, 100 secs
lola: 36330684 markings, 111676506 edges, 222780 markings/sec, 105 secs
lola: 37425888 markings, 115466013 edges, 219041 markings/sec, 110 secs
lola: 38521104 markings, 119251012 edges, 219043 markings/sec, 115 secs
lola: 39636919 markings, 123107771 edges, 223163 markings/sec, 120 secs
lola: 40736784 markings, 126909451 edges, 219973 markings/sec, 125 secs
lola: 41847546 markings, 130744677 edges, 222152 markings/sec, 130 secs
lola: 42985130 markings, 134657538 edges, 227517 markings/sec, 135 secs
lola: 44205447 markings, 138820160 edges, 244063 markings/sec, 140 secs
lola: 45462359 markings, 143040823 edges, 251382 markings/sec, 145 secs
lola: 46765712 markings, 147321563 edges, 260671 markings/sec, 150 secs
lola: 48123999 markings, 151657168 edges, 271657 markings/sec, 155 secs
lola: 49624592 markings, 156177984 edges, 300119 markings/sec, 160 secs
lola: 51185678 markings, 161131669 edges, 312217 markings/sec, 165 secs
lola: 52687052 markings, 166133431 edges, 300275 markings/sec, 170 secs
lola: 54034531 markings, 170790275 edges, 269496 markings/sec, 175 secs
lola: 55330249 markings, 175267415 edges, 259144 markings/sec, 180 secs
lola: 56586682 markings, 179608521 edges, 251287 markings/sec, 185 secs
lola: 57831553 markings, 183909753 edges, 248974 markings/sec, 190 secs
lola: 59033886 markings, 188063417 edges, 240467 markings/sec, 195 secs
lola: 60217964 markings, 192159950 edges, 236816 markings/sec, 200 secs
lola: 61382869 markings, 196185467 edges, 232981 markings/sec, 205 secs
lola: 62543393 markings, 200195516 edges, 232105 markings/sec, 210 secs
lola: 63687090 markings, 204147476 edges, 228739 markings/sec, 215 secs
lola: 64811606 markings, 208039112 edges, 224903 markings/sec, 220 secs
lola: 65961275 markings, 212013516 edges, 229934 markings/sec, 225 secs
lola: 67105200 markings, 215968202 edges, 228785 markings/sec, 230 secs
lola: 68254139 markings, 219937174 edges, 229788 markings/sec, 235 secs
lola: 69381961 markings, 223836535 edges, 225564 markings/sec, 240 secs
lola: 70531897 markings, 227809367 edges, 229987 markings/sec, 245 secs
lola: 71697291 markings, 231836141 edges, 233079 markings/sec, 250 secs
lola: 72868914 markings, 235880257 edges, 234325 markings/sec, 255 secs
lola: 74066037 markings, 240004159 edges, 239425 markings/sec, 260 secs
lola: 75361110 markings, 244428308 edges, 259015 markings/sec, 265 secs
lola: 76803041 markings, 249234059 edges, 288386 markings/sec, 270 secs
lola: 78144064 markings, 253868719 edges, 268205 markings/sec, 275 secs
lola: 79428891 markings, 258308167 edges, 256965 markings/sec, 280 secs
lola: 80681815 markings, 262636926 edges, 250585 markings/sec, 285 secs
lola: 81899574 markings, 266844009 edges, 243552 markings/sec, 290 secs
lola: 83070311 markings, 270887859 edges, 234147 markings/sec, 295 secs
lola: 84245816 markings, 274953434 edges, 235101 markings/sec, 300 secs
lola: 85423874 markings, 279025071 edges, 235612 markings/sec, 305 secs
lola: 86581330 markings, 283024867 edges, 231491 markings/sec, 310 secs
lola: 87722682 markings, 286969073 edges, 228270 markings/sec, 315 secs
lola: 88860985 markings, 290903094 edges, 227661 markings/sec, 320 secs
lola: 89982936 markings, 294780970 edges, 224390 markings/sec, 325 secs
lola: 91111003 markings, 298680869 edges, 225613 markings/sec, 330 secs
lola: 92220207 markings, 302515655 edges, 221841 markings/sec, 335 secs
lola: 93338868 markings, 306382780 edges, 223732 markings/sec, 340 secs
lola: 94452751 markings, 310231095 edges, 222777 markings/sec, 345 secs
lola: 95639774 markings, 314329304 edges, 237405 markings/sec, 350 secs
lola: 96821875 markings, 318410378 edges, 236420 markings/sec, 355 secs
lola: 97999946 markings, 322470755 edges, 235614 markings/sec, 360 secs
lola: 99280161 markings, 326856531 edges, 256043 markings/sec, 365 secs
lola: 100703894 markings, 331619373 edges, 284747 markings/sec, 370 secs
lola: 102065319 markings, 336324282 edges, 272285 markings/sec, 375 secs
lola: 103363632 markings, 340805018 edges, 259663 markings/sec, 380 secs
lola: 104607638 markings, 345103251 edges, 248801 markings/sec, 385 secs
lola: 105817621 markings, 349283565 edges, 241997 markings/sec, 390 secs
lola: 106983300 markings, 353310283 edges, 233136 markings/sec, 395 secs
lola: 108137631 markings, 357302431 edges, 230866 markings/sec, 400 secs
lola: 109270831 markings, 361218735 edges, 226640 markings/sec, 405 secs
lola: 110396286 markings, 365107653 edges, 225091 markings/sec, 410 secs
lola: 111507526 markings, 368947583 edges, 222248 markings/sec, 415 secs
lola: 112614158 markings, 372771996 edges, 221326 markings/sec, 420 secs
lola: 113707141 markings, 376549542 edges, 218597 markings/sec, 425 secs
lola: 114813476 markings, 380374073 edges, 221267 markings/sec, 430 secs
lola: 115917635 markings, 384187733 edges, 220832 markings/sec, 435 secs
lola: 117005707 markings, 387949380 edges, 217614 markings/sec, 440 secs
lola: 118115930 markings, 391784576 edges, 222045 markings/sec, 445 secs
lola: 119269826 markings, 395767959 edges, 230779 markings/sec, 450 secs
lola: 120435940 markings, 399790142 edges, 233223 markings/sec, 455 secs
lola: 121308297 markings, 402791419 edges, 174471 markings/sec, 460 secs
lola: 122553034 markings, 407077083 edges, 248947 markings/sec, 465 secs
lola: 123714425 markings, 410927920 edges, 232278 markings/sec, 470 secs
lola: 124948972 markings, 415193172 edges, 246909 markings/sec, 475 secs
lola: 126100468 markings, 419169549 edges, 230299 markings/sec, 480 secs
lola: 127263322 markings, 423185784 edges, 232571 markings/sec, 485 secs
lola: 128390917 markings, 427085259 edges, 225519 markings/sec, 490 secs
lola: 129489740 markings, 430880790 edges, 219765 markings/sec, 495 secs
lola: 130557968 markings, 434569735 edges, 213646 markings/sec, 500 secs
lola: 131522622 markings, 437904558 edges, 192931 markings/sec, 505 secs
lola: 132589035 markings, 441588305 edges, 213283 markings/sec, 510 secs
lola: 133541269 markings, 444880114 edges, 190447 markings/sec, 515 secs
lola: 134604650 markings, 448554696 edges, 212676 markings/sec, 520 secs
lola: 135653796 markings, 452180046 edges, 209829 markings/sec, 525 secs
lola: 136604381 markings, 455463458 edges, 190117 markings/sec, 530 secs
lola: 137649638 markings, 459076331 edges, 209051 markings/sec, 535 secs
lola: 138711703 markings, 462746780 edges, 212413 markings/sec, 540 secs
lola: 139765404 markings, 466386689 edges, 210740 markings/sec, 545 secs
lola: 140781685 markings, 469895934 edges, 203256 markings/sec, 550 secs
lola: 141885291 markings, 473704473 edges, 220721 markings/sec, 555 secs
lola: 143009887 markings, 477578134 edges, 224919 markings/sec, 560 secs
lola: 144096402 markings, 481306127 edges, 217303 markings/sec, 565 secs
lola: 145298690 markings, 485312197 edges, 240458 markings/sec, 570 secs
lola: 146425771 markings, 489205538 edges, 225416 markings/sec, 575 secs
lola: 147605370 markings, 493278286 edges, 235920 markings/sec, 580 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p8) AND (p18 <= 0)) OR ((F (((1 <= p8) AND (p18 <= 0))) AND F (G ((1 <= p8)))) OR G (F (((1 <= p10) AND (1 <= p11) AND (1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p8) AND (p18 <= 0)) OR ((F (((1 <= p8) AND (p18 <= 0))) AND F (G ((1 <= p8)))) OR G (F (((1 <= p10) AND (1 <= p11) AND (1 <= p1)))))))
lola: processed formula length: 145
lola: 35 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 1801 markings, 1801 edges
lola: ========================================
lola: subprocess 9 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p20 <= 0) OR (p21 <= 0) OR (p24 <= 0)) AND (G ((p25 <= 0)) OR (1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p25)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 10 will run for 991 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p20 <= 0) OR (p21 <= 0) OR (p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p20 <= 0) OR (p21 <= 0) OR (p24 <= 0))
lola: processed formula length: 42
lola: 35 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p25 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p25 <= 0))
lola: processed formula length: 14
lola: 35 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: 1801 markings, 1801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 991 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p10) AND (1 <= p11))) OR (G (F ((((1 <= p10) AND (1 <= p11)) OR (p6 <= 0)))) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 991 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 35 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 11 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p10) AND (1 <= p11)))
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: ((p10 <= 0) OR (p11 <= 0))
lola: processed formula length: 27
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 901 markings, 900 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) OR (G (((G ((1 <= p14)) AND ((p3 <= 0) OR (p7 <= 0))) OR ((p16 <= 0) OR (p17 <= 0)))) AND F (((1 <= p3) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p7))
lola: processed formula length: 25
lola: 35 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 12 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p7)))
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 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1401 markings, 1400 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (G ((1 <= p8))) AND (1 <= p6))) OR F (G ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p8)))
lola: processed formula length: 17
lola: 35 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: 1802 markings, 1803 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((1 <= p8)) AND ((1 <= p25) OR (1 <= p8)))) AND ((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((1 <= p8)) AND ((1 <= p25) OR (1 <= p8)))) AND ((1 <= p3) AND (1 <= p7))))
lola: processed formula length: 85
lola: 35 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: 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: 2113307 markings, 6081498 edges, 422661 markings/sec, 0 secs
lola: 4127877 markings, 12005174 edges, 402914 markings/sec, 5 secs
lola: 6273513 markings, 18112190 edges, 429127 markings/sec, 10 secs
lola: 8294493 markings, 24066318 edges, 404196 markings/sec, 15 secs
lola: 10293806 markings, 29931230 edges, 399863 markings/sec, 20 secs
lola: 12283405 markings, 35727583 edges, 397920 markings/sec, 25 secs
lola: 14270987 markings, 41452939 edges, 397516 markings/sec, 30 secs
lola: 16257337 markings, 47123315 edges, 397270 markings/sec, 35 secs
lola: 18230193 markings, 52704784 edges, 394571 markings/sec, 40 secs
lola: 20229528 markings, 58323229 edges, 399867 markings/sec, 45 secs
lola: 22230611 markings, 63939161 edges, 400217 markings/sec, 50 secs
lola: 24056853 markings, 69256492 edges, 365248 markings/sec, 55 secs
lola: 25409116 markings, 73929432 edges, 270453 markings/sec, 60 secs
lola: 26674049 markings, 78299756 edges, 252987 markings/sec, 65 secs
lola: 27923801 markings, 82617128 edges, 249950 markings/sec, 70 secs
lola: 29173150 markings, 86933196 edges, 249870 markings/sec, 75 secs
lola: 30364638 markings, 91055017 edges, 238298 markings/sec, 80 secs
lola: 31526069 markings, 95066800 edges, 232286 markings/sec, 85 secs
lola: 32653565 markings, 98966868 edges, 225499 markings/sec, 90 secs
lola: 33783159 markings, 102868812 edges, 225919 markings/sec, 95 secs
lola: 34897544 markings, 106724262 edges, 222877 markings/sec, 100 secs
lola: 36049029 markings, 110703276 edges, 230297 markings/sec, 105 secs
lola: 37179269 markings, 114613193 edges, 226048 markings/sec, 110 secs
lola: 38249928 markings, 118313908 edges, 214132 markings/sec, 115 secs
lola: 39341325 markings, 122085569 edges, 218279 markings/sec, 120 secs
lola: 40416306 markings, 125805122 edges, 214996 markings/sec, 125 secs
lola: 41500702 markings, 129550563 edges, 216879 markings/sec, 130 secs
lola: 42591651 markings, 133309152 edges, 218190 markings/sec, 135 secs
lola: 43774846 markings, 137356507 edges, 236639 markings/sec, 140 secs
lola: 45039286 markings, 141630504 edges, 252888 markings/sec, 145 secs
lola: 46336314 markings, 145924562 edges, 259406 markings/sec, 150 secs
lola: 47670350 markings, 150223158 edges, 266807 markings/sec, 155 secs
lola: 49029519 markings, 154447334 edges, 271834 markings/sec, 160 secs
lola: 50661506 markings, 159497880 edges, 326397 markings/sec, 165 secs
lola: 52198108 markings, 164446457 edges, 307320 markings/sec, 170 secs
lola: 53546646 markings, 169100969 edges, 269708 markings/sec, 175 secs
lola: 54828087 markings, 173528354 edges, 256288 markings/sec, 180 secs
lola: 56076839 markings, 177848334 edges, 249750 markings/sec, 185 secs
lola: 57290972 markings, 182043354 edges, 242827 markings/sec, 190 secs
lola: 58489359 markings, 186183486 edges, 239677 markings/sec, 195 secs
lola: 59683484 markings, 190308902 edges, 238825 markings/sec, 200 secs
lola: 60853990 markings, 194358331 edges, 234101 markings/sec, 205 secs
lola: 62000940 markings, 198321820 edges, 229390 markings/sec, 210 secs
lola: 63148940 markings, 202288649 edges, 229600 markings/sec, 215 secs
lola: 64294770 markings, 206248449 edges, 229166 markings/sec, 220 secs
lola: 65415297 markings, 210126215 edges, 224105 markings/sec, 225 secs
lola: 66553390 markings, 214060668 edges, 227619 markings/sec, 230 secs
lola: 67667537 markings, 217912300 edges, 222829 markings/sec, 235 secs
lola: 68805090 markings, 221841345 edges, 227511 markings/sec, 240 secs
lola: 69918884 markings, 225692820 edges, 222759 markings/sec, 245 secs
lola: 71049688 markings, 229599403 edges, 226161 markings/sec, 250 secs
lola: 72172756 markings, 233478824 edges, 224614 markings/sec, 255 secs
lola: 73308803 markings, 237398251 edges, 227209 markings/sec, 260 secs
lola: 74498198 markings, 241489106 edges, 237879 markings/sec, 265 secs
lola: 75852178 markings, 246135910 edges, 270796 markings/sec, 270 secs
lola: 77292927 markings, 250930014 edges, 288150 markings/sec, 275 secs
lola: 78574805 markings, 255358819 edges, 256376 markings/sec, 280 secs
lola: 79803799 markings, 259604533 edges, 245799 markings/sec, 285 secs
lola: 81009708 markings, 263770218 edges, 241182 markings/sec, 290 secs
lola: 82180220 markings, 267813202 edges, 234102 markings/sec, 295 secs
lola: 83321849 markings, 271760358 edges, 228326 markings/sec, 300 secs
lola: 84454121 markings, 275673039 edges, 226454 markings/sec, 305 secs
lola: 85578926 markings, 279558621 edges, 224961 markings/sec, 310 secs
lola: 86686514 markings, 283385790 edges, 221518 markings/sec, 315 secs
lola: 87769625 markings, 287132175 edges, 216622 markings/sec, 320 secs
lola: 88860881 markings, 290902723 edges, 218251 markings/sec, 325 secs
lola: 89935691 markings, 294616674 edges, 214962 markings/sec, 330 secs
lola: 91022427 markings, 298372710 edges, 217347 markings/sec, 335 secs
lola: 92099042 markings, 302094377 edges, 215323 markings/sec, 340 secs
lola: 93172630 markings, 305806133 edges, 214718 markings/sec, 345 secs
lola: 94231260 markings, 309466054 edges, 211726 markings/sec, 350 secs
lola: 95330808 markings, 313264203 edges, 219910 markings/sec, 355 secs
lola: 96439099 markings, 317089212 edges, 221658 markings/sec, 360 secs
lola: 97547534 markings, 320913363 edges, 221687 markings/sec, 365 secs
lola: 98728961 markings, 324970809 edges, 236285 markings/sec, 370 secs
lola: 100062004 markings, 329508833 edges, 266609 markings/sec, 375 secs
lola: 101426642 markings, 334117879 edges, 272928 markings/sec, 380 secs
lola: 102680059 markings, 338447776 edges, 250683 markings/sec, 385 secs
lola: 103893588 markings, 342639854 edges, 242706 markings/sec, 390 secs
lola: 105083944 markings, 346751914 edges, 238071 markings/sec, 395 secs
lola: 106228715 markings, 350706187 edges, 228954 markings/sec, 400 secs
lola: 107371986 markings, 354655322 edges, 228654 markings/sec, 405 secs
lola: 108501091 markings, 358555516 edges, 225821 markings/sec, 410 secs
lola: 109606029 markings, 362376976 edges, 220988 markings/sec, 415 secs
lola: 110739862 markings, 366295552 edges, 226767 markings/sec, 420 secs
lola: 111827253 markings, 370053172 edges, 217478 markings/sec, 425 secs
lola: 112904475 markings, 373775614 edges, 215444 markings/sec, 430 secs
lola: 113980829 markings, 377495630 edges, 215271 markings/sec, 435 secs
lola: 115071703 markings, 381266599 edges, 218175 markings/sec, 440 secs
lola: 116133674 markings, 384937087 edges, 212394 markings/sec, 445 secs
lola: 117190397 markings, 388586565 edges, 211345 markings/sec, 450 secs
lola: 118278192 markings, 392344202 edges, 217559 markings/sec, 455 secs
lola: 119374823 markings, 396131815 edges, 219326 markings/sec, 460 secs
lola: 120474809 markings, 399925104 edges, 219997 markings/sec, 465 secs
lola: 121540713 markings, 403588987 edges, 213181 markings/sec, 470 secs
lola: 122579030 markings, 407167552 edges, 207663 markings/sec, 475 secs
lola: 123573167 markings, 410443538 edges, 198827 markings/sec, 480 secs
lola: 124788879 markings, 414642953 edges, 243142 markings/sec, 485 secs
lola: 125924427 markings, 418564270 edges, 227110 markings/sec, 490 secs
lola: 126852531 markings, 421770651 edges, 185621 markings/sec, 495 secs
lola: 127639050 markings, 424485772 edges, 157304 markings/sec, 500 secs
lola: 128666601 markings, 428037606 edges, 205510 markings/sec, 505 secs
lola: 129753900 markings, 431793011 edges, 217460 markings/sec, 510 secs
lola: 130839829 markings, 435543491 edges, 217186 markings/sec, 515 secs
lola: 131910525 markings, 439241233 edges, 214139 markings/sec, 520 secs
lola: 132894794 markings, 442645301 edges, 196854 markings/sec, 525 secs
lola: 133833269 markings, 445888977 edges, 187695 markings/sec, 530 secs
lola: 134768316 markings, 449118535 edges, 187009 markings/sec, 535 secs
lola: 135600118 markings, 451993633 edges, 166360 markings/sec, 540 secs
lola: 136394614 markings, 454739514 edges, 158899 markings/sec, 545 secs
lola: 137363206 markings, 458085797 edges, 193718 markings/sec, 550 secs
lola: 138394885 markings, 461651848 edges, 206336 markings/sec, 555 secs
lola: 139424599 markings, 465207210 edges, 205943 markings/sec, 560 secs
lola: 140466852 markings, 468806886 edges, 208451 markings/sec, 565 secs
lola: 141503923 markings, 472388378 edges, 207414 markings/sec, 570 secs
lola: 142567485 markings, 476054675 edges, 212712 markings/sec, 575 secs
lola: 143672149 markings, 479846595 edges, 220933 markings/sec, 580 secs
lola: 144836665 markings, 483796712 edges, 232903 markings/sec, 585 secs
lola: 145845518 markings, 487204724 edges, 201771 markings/sec, 590 secs
lola: 146966572 markings, 491076303 edges, 224211 markings/sec, 595 secs
lola: 147906468 markings, 494318549 edges, 187979 markings/sec, 600 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) OR (G (((G ((1 <= p14)) AND ((p3 <= 0) OR (p7 <= 0))) OR ((p16 <= 0) OR (p17 <= 0)))) AND F (((1 <= p3) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p7))
lola: processed formula length: 25
lola: 35 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: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p7)))
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 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1401 markings, 1400 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((G ((1 <= p14)) AND ((p3 <= 0) OR (p7 <= 0))) OR ((p16 <= 0) OR (p17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((1 <= p14)) AND ((p3 <= 0) OR (p7 <= 0))) OR ((p16 <= 0) OR (p17 <= 0))))
lola: processed formula length: 82
lola: 35 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: 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: 1801 markings, 1801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((F (G ((1 <= p8))) AND (1 <= p6))) OR F (G ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p8)))
lola: processed formula length: 17
lola: 35 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: 1802 markings, 1803 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (G ((1 <= p8))) AND (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((1 <= p8))) AND (1 <= p6)))
lola: processed formula length: 37
lola: 35 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: 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: 1801 markings, 1801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no no no no no no unknown
lola:
preliminary result: yes no no yes no no no no no no no no unknown
lola: memory consumption: 3720 KB
lola: time consumption: 1206 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="HouseConstruction-PT-00100"
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 HouseConstruction-PT-00100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428200090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00100.tgz
mv HouseConstruction-PT-00100 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 ;