About the Execution of ITS-LoLa for DatabaseWithMutex-COL-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.070 | 3600000.00 | 12437.00 | 62.70 | TTTFFFTTTTFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882100226.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DatabaseWithMutex-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882100226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.0K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 19K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-COL-02-00
FORMULA_NAME DatabaseWithMutex-COL-02-01
FORMULA_NAME DatabaseWithMutex-COL-02-02
FORMULA_NAME DatabaseWithMutex-COL-02-03
FORMULA_NAME DatabaseWithMutex-COL-02-04
FORMULA_NAME DatabaseWithMutex-COL-02-05
FORMULA_NAME DatabaseWithMutex-COL-02-06
FORMULA_NAME DatabaseWithMutex-COL-02-07
FORMULA_NAME DatabaseWithMutex-COL-02-08
FORMULA_NAME DatabaseWithMutex-COL-02-09
FORMULA_NAME DatabaseWithMutex-COL-02-10
FORMULA_NAME DatabaseWithMutex-COL-02-11
FORMULA_NAME DatabaseWithMutex-COL-02-12
FORMULA_NAME DatabaseWithMutex-COL-02-13
FORMULA_NAME DatabaseWithMutex-COL-02-14
FORMULA_NAME DatabaseWithMutex-COL-02-15
=== Now, execution of the tool begins
BK_START 1591210751417
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:59:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:59:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 18:59:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2020-06-03 18:59:14] [INFO ] sort/places :
site->all_active,all_passive,
file->Mutex,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,
[2020-06-03 18:59:14] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 13 ms.
[2020-06-03 18:59:14] [INFO ] Computed order based on color domains.
[2020-06-03 18:59:14] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 9 ms.
[2020-06-03 18:59:14] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-06-03 18:59:14] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:14] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:14] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:14] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:14] [INFO ] Reduced 2 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 71 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 74 steps, including 0 resets, run visited all 37 properties in 4 ms. (steps per millisecond=18 )
[2020-06-03 18:59:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 18:59:14] [INFO ] Flatten gal took : 46 ms
FORMULA DatabaseWithMutex-COL-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 18:59:14] [INFO ] Applying decomposition
[2020-06-03 18:59:14] [INFO ] Flatten gal took : 19 ms
[2020-06-03 18:59:14] [INFO ] Decomposing Gal with order
[2020-06-03 18:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 18:59:14] [INFO ] Removed a total of 12 redundant transitions.
[2020-06-03 18:59:14] [INFO ] Flatten gal took : 44 ms
[2020-06-03 18:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-03 18:59:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2020-06-03 18:59:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DatabaseWithMutex-COL-02 @ 3570 seconds
FORMULA DatabaseWithMutex-COL-02-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ DatabaseWithMutex-COL-02
{
"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": "Wed Jun 3 18:59:15 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 6,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (X ((F (((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR (((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))))))",
"processed_size": 263,
"rewrites": 120
},
"result":
{
"edges": 16,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))",
"processed_size": 122,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))",
"processed_size": 61,
"rewrites": 120
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(X (((p4 <= 0) AND (p5 <= 0))) U (((1 <= p4) OR (1 <= p5)) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))",
"processed_size": 249,
"rewrites": 120
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 5,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0) AND (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))))",
"processed_size": 195,
"rewrites": 120
},
"result":
{
"edges": 12,
"markings": 12,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (X (G ((G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))) OR F (G (((1 <= p4) OR (1 <= p5)))))))))",
"processed_size": 116,
"rewrites": 120
},
"result":
{
"edges": 16,
"markings": 16,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 3,
"aconj": 13,
"adisj": 2,
"aneg": 0,
"comp": 28,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(X (G ((F (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))) AND X (X ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))) U (F ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))) OR (((1 <= p3) AND (1 <= p29)) OR (((1 <= p0) AND (1 <= p28)) OR (((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))",
"processed_size": 463,
"rewrites": 120
},
"result":
{
"edges": 496,
"markings": 261,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))",
"processed_size": 133,
"rewrites": 120
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R ((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)))))",
"processed_size": 127,
"rewrites": 120
},
"result":
{
"edges": 16,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 5,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((F (((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U G (((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))) AND F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))) AND G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))))",
"processed_size": 399,
"rewrites": 120
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 5,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p4) OR (1 <= p5))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))))",
"processed_size": 165,
"rewrites": 120
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((X (X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))",
"processed_size": 208,
"rewrites": 120
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR (1 <= p15)))))))",
"processed_size": 133,
"rewrites": 120
},
"result":
{
"edges": 1322,
"markings": 427,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 1189
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))",
"processed_size": 118,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))",
"processed_size": 65,
"rewrites": 120
},
"result":
{
"edges": 11,
"markings": 10,
"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": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p4) OR (1 <= p5)))",
"processed_size": 29,
"rewrites": 120
},
"result":
{
"edges": 17,
"markings": 17,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))",
"processed_size": 185,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))",
"processed_size": 57,
"rewrites": 122
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 54172,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F(*) OR (G(**) OR **)))) : G(F((G(**) OR (** OR (** OR (** OR **)))))) : (G(**) OR ((X(**) U (** U **)) OR (** OR (** OR (** OR **))))) : X(G(*)) : X(X(X(G((G(*) OR F(G(**))))))) : (F(G(**)) OR (** OR (** OR (** OR **)))) : (X(G((F(**) AND X(X(**))))) U (F(**) OR (** OR (** OR (** OR **))))) : X(F(**)) : (((** U **) U **) OR F(**)) : X(X((* R *))) : X(G((F(((** U G(**)) AND F(**))) AND G(**)))) : (F((G(**) OR (* OR (* OR (* OR *))))) OR X((G(**) AND **))) : X((X(X(X(G(*)))) OR F(*))) : (** OR (G(*) AND F(**)))"
},
"net":
{
"arcs": 88,
"conflict_clusters": 26,
"places": 38,
"places_significant": 28,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "yes yes yes no no no yes yes yes yes no yes yes no ",
"value": "yes yes yes no no no yes yes yes yes no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 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: X (X (((NOT(G (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) OR G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))) OR (((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))))) : X (G (F (X (X (((((G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) OR (1 <= p15))))))) : (((((G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))) OR (X (((p4 <= 0) AND (p5 <= 0))) U (((1 <= p4) OR (1 <= p5)) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))) OR ((1 <= p11) AND (1 <= p37))) OR ((1 <= p10) AND (1 <= p36))) OR ((1 <= p10) AND (1 <= p34))) OR ((1 <= p11) AND (1 <= p35))) : X (G (NOT(F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))))) : G (NOT(F (X (F (X (X ((F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) AND G (NOT(F (G (((1 <= p4) OR (1 <= p5)))))))))))))) : ((((G (X (NOT(X (X (NOT(F (X (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))))))))) OR ((1 <= p8) AND (1 <= p24))) OR ((1 <= p9) AND (1 <= p25))) OR ((1 <= p6) AND (1 <= p26))) OR ((1 <= p7) AND (1 <= p27))) : (G (X ((F (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))) AND X (X ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))) U ((((F ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))) OR ((1 <= p3) AND (1 <= p29))) OR ((1 <= p0) AND (1 <= p28))) OR ((1 <= p2) AND (1 <= p29))) OR ((1 <= p1) AND (1 <= p28)))) : X (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) : ((((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) U ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23))) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))) OR F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) : NOT(X (X ((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U ((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))))) : X (G ((F (((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U G (((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))) AND F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))) AND G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))))) : (NOT(G (((((NOT(G (((1 <= p4) OR (1 <= p5)))) AND ((p11 <= 0) OR (p37 <= 0))) AND ((p10 <= 0) OR (p36 <= 0))) AND ((p10 <= 0) OR (p34 <= 0))) AND ((p11 <= 0) OR (p35 <= 0))))) OR (G (X (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) AND X (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))) : NOT(X ((F (X (((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) U X (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))))) AND G ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))))) : (NOT(F (((p4 <= 0) AND (p5 <= 0)))) U ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR (((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR (((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))))))
lola: processed formula length: 263
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))) OR ((X (((p4 <= 0) AND (p5 <= 0))) U (((1 <= p4) OR (1 <= p5)) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))
lola: processed formula length: 122
lola: 125 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))
lola: processed formula length: 61
lola: 120 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p4 <= 0) AND (p5 <= 0))) U (((1 <= p4) OR (1 <= p5)) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((p4 <= 0) AND (p5 <= 0))) U (((1 <= p4) OR (1 <= p5)) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))
lola: processed formula length: 249
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0) AND (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0) AND (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))))
lola: processed formula length: 195
lola: 120 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))) OR F (G (((1 <= p4) OR (1 <= p5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))) OR F (G (((1 <= p4) OR (1 <= p5)))))))))
lola: processed formula length: 116
lola: 120 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))) AND X (X ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))) U (F ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))) OR (((1 <= p3) AND (1 <= p29)) OR (((1 <= p0) AND (1 <= p28)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((F (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))) AND X (X ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))) U (F ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))) OR (((1 <= p3) AND (1 <= p29)) OR (((1 <= p0) AND (1 <= p28)) OR... (shortened)
lola: processed formula length: 463
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 261 markings, 496 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))
lola: processed formula length: 133
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R ((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R ((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)))))
lola: processed formula length: 127
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U G (((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))) AND F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))) AND G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U G (((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))) AND F (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))) AND G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))))
lola: processed formula length: 399
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p4) OR (1 <= p5))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))))) OR X ((G (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p4) OR (1 <= p5))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p4) OR (1 <= p5))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))))
lola: processed formula length: 165
lola: 120 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))
lola: processed formula length: 208
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR (1 <= p15)))))))
lola: processed formula length: 133
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 427 markings, 1322 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) OR (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR (((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p24)) OR (((1 <= p9) AND (1 <= p25)) OR (((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))
lola: processed formula length: 118
lola: 125 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 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 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))
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 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))
lola: processed formula length: 65
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))) OR (G (((1 <= p4) OR (1 <= p5))) AND F (((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) OR (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) OR (1 <= p5)))
lola: processed formula length: 29
lola: 120 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))
lola: processed formula length: 185
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 12 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))) U ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23))) U (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))) OR F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))
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: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))
lola: processed formula length: 57
lola: 122 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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no yes yes yes yes no yes yes no
lola:
preliminary result: yes yes yes no no no yes yes yes yes no yes yes no
lola: memory consumption: 54172 KB
lola: time consumption: 3 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="DatabaseWithMutex-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DatabaseWithMutex-COL-02, 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 r178-tajo-158987882100226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 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 ;