About the Execution of ITS-LoLa for ARMCacheCoherence-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.450 | 3600000.00 | 59679.00 | 408.50 | FFFFFFFTFFTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787100002.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 ARMCacheCoherence-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787100002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 3.4K Mar 25 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 09:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14M 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 ARMCacheCoherence-PT-none-00
FORMULA_NAME ARMCacheCoherence-PT-none-01
FORMULA_NAME ARMCacheCoherence-PT-none-02
FORMULA_NAME ARMCacheCoherence-PT-none-03
FORMULA_NAME ARMCacheCoherence-PT-none-04
FORMULA_NAME ARMCacheCoherence-PT-none-05
FORMULA_NAME ARMCacheCoherence-PT-none-06
FORMULA_NAME ARMCacheCoherence-PT-none-07
FORMULA_NAME ARMCacheCoherence-PT-none-08
FORMULA_NAME ARMCacheCoherence-PT-none-09
FORMULA_NAME ARMCacheCoherence-PT-none-10
FORMULA_NAME ARMCacheCoherence-PT-none-11
FORMULA_NAME ARMCacheCoherence-PT-none-12
FORMULA_NAME ARMCacheCoherence-PT-none-13
FORMULA_NAME ARMCacheCoherence-PT-none-14
FORMULA_NAME ARMCacheCoherence-PT-none-15
=== Now, execution of the tool begins
BK_START 1591124635502
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 19:03:58] [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-02 19:03:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 19:03:59] [INFO ] Load time of PNML (sax parser for PT used): 1407 ms
[2020-06-02 19:03:59] [INFO ] Transformed 87 places.
[2020-06-02 19:04:00] [INFO ] Transformed 33676 transitions.
[2020-06-02 19:04:00] [INFO ] Found NUPN structural information;
[2020-06-02 19:04:00] [INFO ] Parsed PT model containing 87 places and 33676 transitions in 1624 ms.
Ensure Unique test removed 32425 transitions
Reduce redundant transitions removed 32425 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 203 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 76 resets, run finished after 994 ms. (steps per millisecond=100 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 19:04:01] [INFO ] Flow matrix only has 500 transitions (discarded 751 similar events)
// Phase 1: matrix 500 rows 87 cols
[2020-06-02 19:04:01] [INFO ] Computed 12 place invariants in 21 ms
[2020-06-02 19:04:01] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned unsat
[2020-06-02 19:04:01] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2020-06-02 19:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:01] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2020-06-02 19:04:02] [INFO ] State equation strengthened by 192 read => feed constraints.
[2020-06-02 19:04:02] [INFO ] [Real]Added 192 Read/Feed constraints in 443 ms returned sat
[2020-06-02 19:04:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 19:04:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2020-06-02 19:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:02] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-06-02 19:04:03] [INFO ] [Nat]Added 192 Read/Feed constraints in 342 ms returned sat
[2020-06-02 19:04:03] [INFO ] Computed and/alt/rep : 1250/122617/499 causal constraints in 491 ms.
[2020-06-02 19:04:22] [INFO ] Added : 140 causal constraints over 28 iterations in 19282 ms. Result :unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 19:04:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 19:04:23] [INFO ] Flatten gal took : 243 ms
FORMULA ARMCacheCoherence-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ARMCacheCoherence-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 19:04:23] [INFO ] Applying decomposition
[2020-06-02 19:04:23] [INFO ] Flatten gal took : 134 ms
[2020-06-02 19:04:23] [INFO ] Decomposing Gal with order
[2020-06-02 19:04:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 19:04:23] [INFO ] Removed a total of 3843 redundant transitions.
[2020-06-02 19:04:23] [INFO ] Flatten gal took : 340 ms
[2020-06-02 19:04:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 33 ms.
[2020-06-02 19:04:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-02 19:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ARMCacheCoherence-PT-none @ 3570 seconds
FORMULA ARMCacheCoherence-PT-none-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ARMCacheCoherence-PT-none-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLFireability @ ARMCacheCoherence-PT-none
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 19:04:25 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p1) AND (1 <= p67) AND (1 <= p80))))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))) AND (X (((1 <= p3) AND (1 <= p67) AND (1 <= p84))) OR ((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))))))",
"processed_size": 182,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))",
"processed_size": 64,
"rewrites": 83
},
"result":
{
"edges": 1414,
"markings": 469,
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))) OR (((p5 <= 0)) OR (((p37 <= 0)) OR ((p80 <= 0))))) R X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))))",
"processed_size": 156,
"rewrites": 83
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((p2 <= 0) OR (p37 <= 0) OR (p84 <= 0))))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((G (((p5 <= 0) OR (p22 <= 0) OR (p39 <= 0) OR (p84 <= 0))) AND X (((1 <= p4) AND (1 <= p67) AND (1 <= p76)))))",
"processed_size": 116,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((X (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))) AND G (F (((1 <= p4) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))))) U ((1 <= p4) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)))",
"processed_size": 192,
"rewrites": 83
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p4)) AND ((1 <= p24)) AND ((1 <= p39)) AND ((1 <= p80)))",
"processed_size": 64,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p3 <= 0) OR (p22 <= 0) OR (p80 <= 0)))",
"processed_size": 45,
"rewrites": 83
},
"result":
{
"edges": 9308,
"markings": 2549,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p5) AND (1 <= p32) AND (1 <= p86))))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 593
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((1 <= p2) AND (1 <= p52) AND (1 <= p69) AND (1 <= p80))))",
"processed_size": 64,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((G ((((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84)) OR (F (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) AND F (G (((p5 <= 0) OR (p52 <= 0) OR (p69 <= 0) OR (p84 <= 0))))))) OR ((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) U G (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))))",
"processed_size": 324,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((G (((1 <= p3) AND (1 <= p47) AND (1 <= p82))) AND (((1 <= p3)) AND (((1 <= p54)) AND (((1 <= p67)) AND (((1 <= p80)) AND (((1 <= p47)) AND ((1 <= p82))))))))))",
"processed_size": 166,
"rewrites": 83
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"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": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)) R F (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))",
"processed_size": 121,
"rewrites": 83
},
"result":
{
"edges": 657,
"markings": 213,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((G (F ((G (F (((1 <= p1) AND (1 <= p52) AND (1 <= p67) AND (1 <= p80)))) OR G (((1 <= p2) AND (1 <= p52) AND (1 <= p83)))))) AND ((p5 <= 0) OR (p54 <= 0) OR (p69 <= 0) OR (p80 <= 0))))",
"processed_size": 190,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3563
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"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 (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))",
"processed_size": 60,
"rewrites": 83
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"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 (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))",
"processed_size": 60,
"rewrites": 83
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND (((1 <= p4)) AND (((1 <= p54)) AND (((1 <= p67)) AND ((1 <= p84)))))))",
"processed_size": 139,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 8,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 101172,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : (F((F(**) AND (** AND (** AND (** AND **))))) OR G(**)) : F((G(F((G(F(**)) OR G(**)))) AND **)) : (* R F(*)) : F(G((F(**) AND (X(**) OR **)))) : F(G(**)) : F(G((G(**) AND (** AND (** AND (** AND (** AND (** AND **)))))))) : (((X(F(*)) OR (* OR (* OR *))) R X(F(*))) OR X(G(**))) : ((G((** OR (F(**) AND F(G(**))))) OR **) U G(**)) : X(F(*)) : F((G(*) AND X(**))) : ((X(**) AND G(F(*))) U **) : (G(*) OR ((X(**) U **) AND (** AND (** AND (** AND **))))) : X(F(**))"
},
"net":
{
"arcs": 8037,
"conflict_clusters": 25,
"places": 87,
"places_significant": 75,
"singleton_clusters": 0,
"transitions": 1251
},
"result":
{
"preliminary_value": "no no no no no no no yes no yes no no no no ",
"value": "no no no no no no no yes no yes no no no 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: 1338/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 87
lola: finding significant places
lola: 87 places, 1251 transitions, 75 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: NOT(X (NOT(G (((1 <= p1) AND (1 <= p67) AND (1 <= p80)))))) : (F (((((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND ((1 <= p4))) AND ((1 <= p54))) AND ((1 <= p67))) AND ((1 <= p84)))) OR G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))) : F ((G (F ((G (F (((1 <= p1) AND (1 <= p52) AND (1 <= p67) AND (1 <= p80)))) OR G (((1 <= p2) AND (1 <= p52) AND (1 <= p83)))))) AND ((p5 <= 0) OR (p54 <= 0) OR (p69 <= 0) OR (p80 <= 0)))) : NOT((((p3 <= 0) OR (p52 <= 0) OR (p67 <= 0) OR (p84 <= 0)) U G (((1 <= p4) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))))) : G (F (G ((((1 <= 0) U F (((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84)))) AND (X (((1 <= p3) AND (1 <= p67) AND (1 <= p84))) OR ((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))))))) : G (NOT(F (G (F (X (NOT(G (((1 <= p2) AND (1 <= p52) AND (1 <= p69) AND (1 <= p80)))))))))) : F (G (((((((G (((1 <= p3) AND (1 <= p47) AND (1 <= p82))) AND ((1 <= p3))) AND ((1 <= p54))) AND ((1 <= p67))) AND ((1 <= p80))) AND ((1 <= p47))) AND ((1 <= p82))))) : (NOT(((((G (X (((1 <= p5) AND (1 <= p67) AND (1 <= p84)))) AND ((1 <= p5))) AND ((1 <= p37))) AND ((1 <= p80))) U G (X (((1 <= p5) AND (1 <= p67) AND (1 <= p84)))))) OR G (X (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))) : ((G ((F (G (((p5 <= 0) OR (p52 <= 0) OR (p69 <= 0) OR (p84 <= 0)))) U ((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84)))) OR ((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) U G (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84)))) : NOT(G (X (((1 <= p2) AND (1 <= p37) AND (1 <= p84))))) : F ((NOT(F (((1 <= p5) AND (1 <= p22) AND (1 <= p39) AND (1 <= p84)))) AND X (((1 <= p4) AND (1 <= p67) AND (1 <= p76))))) : ((X (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))) AND (X (G (((1 <= p4) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80)))) U NOT(F (G (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))))) U ((1 <= p4) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84))) : (NOT(F (((1 <= p3) AND (1 <= p22) AND (1 <= p80)))) OR (((((X (((1 <= p5) AND (1 <= p67) AND (1 <= p80))) U ((1 <= p2) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))) AND ((1 <= p4))) AND ((1 <= p24))) AND ((1 <= p39))) AND ((1 <= p80)))) : F (X (((1 <= p5) AND (1 <= p32) AND (1 <= p86))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:338
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:374
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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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 (G (((1 <= p1) AND (1 <= p67) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p1) AND (1 <= p67) AND (1 <= p80))))
lola: processed formula length: 49
lola: 83 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))) AND (X (((1 <= p3) AND (1 <= p67) AND (1 <= p84))) OR ((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))) AND (X (((1 <= p3) AND (1 <= p67) AND (1 <= p84))) OR ((1 <= p3) AND (1 <= p24) AND (1 <= p37) AND (1 <= p84))))))
lola: processed formula length: 182
lola: 83 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))) OR (((p5 <= 0)) OR (((p37 <= 0)) OR ((p80 <= 0))))) R X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0))))) OR X (G (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))
lola: processed formula length: 64
lola: 83 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: 469 markings, 1414 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))) OR (((p5 <= 0)) OR (((p37 <= 0)) OR ((p80 <= 0))))) R X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))) OR (((p5 <= 0)) OR (((p37 <= 0)) OR ((p80 <= 0))))) R X (F (((p5 <= 0) OR (p67 <= 0) OR (p84 <= 0)))))
lola: processed formula length: 156
lola: 83 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p2 <= 0) OR (p37 <= 0) OR (p84 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p2 <= 0) OR (p37 <= 0) OR (p84 <= 0))))
lola: processed formula length: 49
lola: 83 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p5 <= 0) OR (p22 <= 0) OR (p39 <= 0) OR (p84 <= 0))) AND X (((1 <= p4) AND (1 <= p67) AND (1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p5 <= 0) OR (p22 <= 0) OR (p39 <= 0) OR (p84 <= 0))) AND X (((1 <= p4) AND (1 <= p67) AND (1 <= p76)))))
lola: processed formula length: 116
lola: 83 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))) AND G (F (((1 <= p4) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))))) U ((1 <= p4) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))) AND G (F (((1 <= p4) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))))) U ((1 <= p4) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)))
lola: processed formula length: 192
lola: 83 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p3 <= 0) OR (p22 <= 0) OR (p80 <= 0))) OR ((X (((1 <= p5) AND (1 <= p67) AND (1 <= p80))) U ((1 <= p2) AND (1 <= p24) AND (1 <= p37) AND (1 <= p80))) AND (((1 <= p4)) AND (((1 <= p24)) AND (((1 <= p39)) AND ((1 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4)) AND (((1 <= p24)) AND (((1 <= p39)) AND ((1 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p4)) AND ((1 <= p24)) AND ((1 <= p39)) AND ((1 <= p80)))
lola: processed formula length: 64
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p22 <= 0) OR (p80 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p22 <= 0) OR (p80 <= 0)))
lola: processed formula length: 45
lola: 83 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: 2549 markings, 9308 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p5) AND (1 <= p32) AND (1 <= p86))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p5) AND (1 <= p32) AND (1 <= p86))))
lola: processed formula length: 49
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p2) AND (1 <= p52) AND (1 <= p69) AND (1 <= p80))))
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 <= p2) AND (1 <= p52) AND (1 <= p69) AND (1 <= p80))))
lola: processed formula length: 64
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84)) OR (F (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) AND F (G (((p5 <= 0) OR (p52 <= 0) OR (p69 <= 0) OR (p84 <= 0))))))) OR ((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) U G (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: ((G ((((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84)) OR (F (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) AND F (G (((p5 <= 0) OR (p52 <= 0) OR (p69 <= 0) OR (p84 <= 0))))))) OR ((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))) U G (((1 <= p5) AND (1 <= p52) AND (1 <= p69) AND (1 <= p84))))
lola: processed formula length: 324
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p3) AND (1 <= p47) AND (1 <= p82))) AND (((1 <= p3)) AND (((1 <= p54)) AND (((1 <= p67)) AND (((1 <= p80)) AND (((1 <= p47)) AND ((1 <= p82))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p3) AND (1 <= p47) AND (1 <= p82))) AND (((1 <= p3)) AND (((1 <= p54)) AND (((1 <= p67)) AND (((1 <= p80)) AND (((1 <= p47)) AND ((1 <= p82))))))))))
lola: processed formula length: 166
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)) R F (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p3) AND (1 <= p52) AND (1 <= p67) AND (1 <= p84)) R F (((p4 <= 0) OR (p24 <= 0) OR (p37 <= 0) OR (p80 <= 0))))
lola: processed formula length: 121
lola: 83 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: 213 markings, 657 edges
lola: ========================================
lola: subprocess 12 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((G (F (((1 <= p1) AND (1 <= p52) AND (1 <= p67) AND (1 <= p80)))) OR G (((1 <= p2) AND (1 <= p52) AND (1 <= p83)))))) AND ((p5 <= 0) OR (p54 <= 0) OR (p69 <= 0) OR (p80 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((G (F (((1 <= p1) AND (1 <= p52) AND (1 <= p67) AND (1 <= p80)))) OR G (((1 <= p2) AND (1 <= p52) AND (1 <= p83)))))) AND ((p5 <= 0) OR (p54 <= 0) OR (p69 <= 0) OR (p80 <= 0))))
lola: processed formula length: 190
lola: 83 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND (((1 <= p4)) AND (((1 <= p54)) AND (((1 <= p67)) AND ((1 <= p84))))))) OR G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))
lola: processed formula length: 60
lola: 83 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: 2 markings, 2 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 ((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND (((1 <= p4)) AND (((1 <= p54)) AND (((1 <= p67)) AND ((1 <= p84))))))) OR G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) AND (1 <= p22) AND (1 <= p39) AND (1 <= p80)))
lola: processed formula length: 60
lola: 83 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: 2 markings, 2 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND (((1 <= p4)) AND (((1 <= p54)) AND (((1 <= p67)) AND ((1 <= p84)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p4) AND (1 <= p54) AND (1 <= p67) AND (1 <= p84))) AND (((1 <= p4)) AND (((1 <= p54)) AND (((1 <= p67)) AND ((1 <= p84)))))))
lola: processed formula length: 139
lola: 83 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no yes no no no no
lola:
preliminary result: no no no no no no no yes no yes no no no no
lola: memory consumption: 101172 KB
lola: time consumption: 7 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="ARMCacheCoherence-PT-none"
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 ARMCacheCoherence-PT-none, 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 r166-smll-158987787100002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ARMCacheCoherence-PT-none.tgz
mv ARMCacheCoherence-PT-none 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 ;