About the Execution of ITS-LoLa for SimpleLoadBal-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.490 | 3600000.00 | 17109.00 | 80.90 | FFTFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987939200602.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SimpleLoadBal-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939200602
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.0K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 153K Mar 24 05:38 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 SimpleLoadBal-PT-05-00
FORMULA_NAME SimpleLoadBal-PT-05-01
FORMULA_NAME SimpleLoadBal-PT-05-02
FORMULA_NAME SimpleLoadBal-PT-05-03
FORMULA_NAME SimpleLoadBal-PT-05-04
FORMULA_NAME SimpleLoadBal-PT-05-05
FORMULA_NAME SimpleLoadBal-PT-05-06
FORMULA_NAME SimpleLoadBal-PT-05-07
FORMULA_NAME SimpleLoadBal-PT-05-08
FORMULA_NAME SimpleLoadBal-PT-05-09
FORMULA_NAME SimpleLoadBal-PT-05-10
FORMULA_NAME SimpleLoadBal-PT-05-11
FORMULA_NAME SimpleLoadBal-PT-05-12
FORMULA_NAME SimpleLoadBal-PT-05-13
FORMULA_NAME SimpleLoadBal-PT-05-14
FORMULA_NAME SimpleLoadBal-PT-05-15
=== Now, execution of the tool begins
BK_START 1591252794505
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:39:55] [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-04 06:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:39:56] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-06-04 06:39:56] [INFO ] Transformed 59 places.
[2020-06-04 06:39:56] [INFO ] Transformed 180 transitions.
[2020-06-04 06:39:56] [INFO ] Parsed PT model containing 59 places and 180 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 269 ms. (steps per millisecond=371 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0]
[2020-06-04 06:39:56] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2020-06-04 06:39:56] [INFO ] Computed 19 place invariants in 6 ms
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 4 ms returned unsat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:56] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-04 06:39:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-04 06:39:56] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2020-06-04 06:39:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:39:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:56] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-04 06:39:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2020-06-04 06:39:56] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 40 ms.
[2020-06-04 06:39:58] [INFO ] Added : 133 causal constraints over 27 iterations in 1808 ms. Result :sat
[2020-06-04 06:39:58] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2020-06-04 06:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned unsat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:58] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2020-06-04 06:39:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:39:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 06:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Nat]Added 61 Read/Feed constraints in 10 ms returned sat
[2020-06-04 06:39:59] [INFO ] Deduced a trap composed of 26 places in 32 ms
[2020-06-04 06:39:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2020-06-04 06:39:59] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Real]Added 61 Read/Feed constraints in 8 ms returned sat
[2020-06-04 06:39:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:39:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:39:59] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-06-04 06:39:59] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2020-06-04 06:39:59] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-04 06:39:59] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-06-04 06:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2020-06-04 06:39:59] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 13 ms.
[2020-06-04 06:40:00] [INFO ] Added : 118 causal constraints over 25 iterations in 1673 ms. Result :sat
[2020-06-04 06:40:00] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-06-04 06:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-04 06:40:01] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-06-04 06:40:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:40:01] [INFO ] Flatten gal took : 96 ms
FORMULA SimpleLoadBal-PT-05-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:40:01] [INFO ] Flatten gal took : 32 ms
[2020-06-04 06:40:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 06:40:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SimpleLoadBal-PT-05 @ 3570 seconds
FORMULA SimpleLoadBal-PT-05-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ SimpleLoadBal-PT-05
{
"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": "Thu Jun 4 06:40:01 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": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p26) AND (1 <= p46) AND (1 <= p50))) AND ((1 <= p38) AND ((1 <= p46) AND ((1 <= p51) AND (1 <= p55))))))",
"processed_size": 118,
"rewrites": 67
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((X (((p36 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))) R ((p43 <= 0) OR (p47 <= 0) OR (p54 <= 0)))))",
"processed_size": 116,
"rewrites": 67
},
"result":
{
"edges": 1148036,
"markings": 233860,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))",
"processed_size": 57,
"rewrites": 69
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 126
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0)))",
"processed_size": 46,
"rewrites": 67
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"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": 7,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) OR ((1 <= p33) AND (1 <= p46) AND (1 <= p49) AND (1 <= p57))))",
"processed_size": 128,
"rewrites": 67
},
"result":
{
"edges": 11,
"markings": 11,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (((p8 <= 0) OR (p18 <= 0))) AND ((p21 <= 0) OR (p33 <= 0))))",
"processed_size": 68,
"rewrites": 67
},
"result":
{
"edges": 40,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((p6 <= 0) OR (p16 <= 0))))",
"processed_size": 34,
"rewrites": 67
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p41) AND (1 <= p50) AND (1 <= p55))",
"processed_size": 42,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((1 <= p30) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))))",
"processed_size": 65,
"rewrites": 67
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p20) AND (1 <= p32)) OR ((1 <= p21) AND (1 <= p37))))))",
"processed_size": 73,
"rewrites": 67
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p13 <= 0) OR (p40 <= 0))",
"processed_size": 27,
"rewrites": 69
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 147
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0))",
"processed_size": 42,
"rewrites": 69
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 83
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 5972,
"markings": 4259,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p51))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p43) AND (1 <= p49) AND (1 <= p55))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 24,
"markings": 23,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G (((p34 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0)))",
"processed_size": 61,
"rewrites": 67
},
"result":
{
"edges": 3672,
"markings": 2749,
"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": 3566
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p46) AND (1 <= p48) AND (1 <= p53))",
"processed_size": 42,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p50))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 30,
"markings": 30,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 37948,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) AND (** AND (** AND (** AND **))))) : F(G(**)) : (G(F((X(*) R *))) OR X((X(**) AND (** AND (** AND **))))) : (** OR (G(F(**)) AND F(**))) : F(**) : (X(*) AND (G((X(**) OR **)) OR F(**))) : G(F(**)) : G((X(*) AND *)) : F(**) : X(F(**)) : F(G(*)) : G(**) : (X(G(**)) OR (F(**) AND (** AND (** AND **)))) : X(X(F(**)))"
},
"net":
{
"arcs": 1158,
"conflict_clusters": 15,
"places": 59,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"preliminary_value": "no no yes no no no no no no yes no no no no ",
"value": "no no yes no no no no no 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: 239/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 59
lola: finding significant places
lola: 59 places, 180 transitions, 40 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 (((((G (((1 <= p26) AND (1 <= p46) AND (1 <= p50))) AND (1 <= p38)) AND (1 <= p46)) AND (1 <= p51)) AND (1 <= p55))) : F (X (X (G (X (F (G (X (((1 <= p43) AND (1 <= p49) AND (1 <= p55)))))))))) : (G (F (NOT((X (((1 <= p36) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) U ((1 <= p43) AND (1 <= p47) AND (1 <= p54)))))) OR X ((((X ((((1 <= p44) AND (1 <= p47) AND (1 <= p54)) OR ((1 <= p45) AND (1 <= p47) AND (1 <= p53)))) AND (1 <= p43)) AND (1 <= p47)) AND (1 <= p54)))) : (F (G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p50))))) U ((1 <= p46) AND (1 <= p48) AND (1 <= p53))) : F (F (((1 <= p45) AND (1 <= p50) AND (1 <= p56)))) : (NOT(X (((1 <= p26) AND (1 <= p40) AND (1 <= p51)))) AND (G ((X (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) OR ((1 <= p33) AND (1 <= p46) AND (1 <= p49) AND (1 <= p57)))) OR F (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))))) : (((1 <= p44) AND (1 <= p48) AND (1 <= p54)) U F (G (F (X (F (((1 <= p26) AND (1 <= p40) AND (1 <= p51)))))))) : NOT(F ((((1 <= p8) AND (1 <= p18)) U (X (((1 <= p8) AND (1 <= p18))) OR ((1 <= p21) AND (1 <= p33)))))) : F (F (((1 <= p13) AND (1 <= p40)))) : (G (F ((((p45 <= 0) OR (p47 <= 0) OR (p54 <= 0)) U (1 <= 0)))) U F ((((1 <= p6) AND (1 <= p16)) U X (((p6 <= 0) OR (p16 <= 0)))))) : G (NOT(G (F ((F ((((((NOT(G (((1 <= p39) AND (1 <= p46) AND (1 <= p47) AND (1 <= p55)))) OR (p1 <= 0)) AND (1 <= p34)) AND (1 <= p46)) AND (1 <= p52)) AND (1 <= p56))) U ((1 <= p26) AND (1 <= p40) AND (1 <= p51))))))) : G (((p34 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))) : (X (G (((1 <= p30) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55)))) OR (((F (((1 <= p46) AND (1 <= p49) AND (1 <= p54))) AND (1 <= p41)) AND (1 <= p50)) AND (1 <= p55))) : F (X ((F (X (((1 <= p20) AND (1 <= p32)))) U X ((((1 <= p20) AND (1 <= p32)) OR ((1 <= p21) AND (1 <= p37)))))))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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 <= p26) AND (1 <= p46) AND (1 <= p50))) AND ((1 <= p38) AND ((1 <= p46) AND ((1 <= p51) AND (1 <= p55))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p26) AND (1 <= p46) AND (1 <= p50))) AND ((1 <= p38) AND ((1 <= p46) AND ((1 <= p51) AND (1 <= p55))))))
lola: processed formula length: 118
lola: 67 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X (((p36 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))) R ((p43 <= 0) OR (p47 <= 0) OR (p54 <= 0))))) OR X ((X ((((1 <= p44) AND (1 <= p47) AND (1 <= p54)) OR ((1 <= p45) AND (1 <= p47) AND (1 <= p53)))) AND ((1 <= p43) AND ((1 <= p47) AND (1 <= p54))))))
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: G (F ((X (((p36 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))) R ((p43 <= 0) OR (p47 <= 0) OR (p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p36 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))) R ((p43 <= 0) OR (p47 <= 0) OR (p54 <= 0)))))
lola: processed formula length: 116
lola: 67 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 233860 markings, 1148036 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 (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0))) AND (G ((X (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) OR ((1 <= p33) AND (1 <= p46) AND (1 <= p49) AND (1 <= p57)))) OR F (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55)))
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: ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0))
lola: processed formula length: 57
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0)))
lola: processed formula length: 46
lola: 67 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) OR ((1 <= p33) AND (1 <= p46) AND (1 <= p49) AND (1 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p38) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))) OR ((1 <= p33) AND (1 <= p46) AND (1 <= p49) AND (1 <= p57))))
lola: processed formula length: 128
lola: 67 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p8 <= 0) OR (p18 <= 0))) AND ((p21 <= 0) OR (p33 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p8 <= 0) OR (p18 <= 0))) AND ((p21 <= 0) OR (p33 <= 0))))
lola: processed formula length: 68
lola: 67 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: 39 markings, 40 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p6 <= 0) OR (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p6 <= 0) OR (p16 <= 0))))
lola: processed formula length: 34
lola: 67 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p30) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55)))) OR (F (((1 <= p46) AND (1 <= p49) AND (1 <= p54))) AND ((1 <= p41) AND ((1 <= p50) AND (1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p41) AND ((1 <= p50) AND (1 <= p55)))
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: processed formula: ((1 <= p41) AND (1 <= p50) AND (1 <= p55))
lola: processed formula length: 42
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p30) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p30) AND (1 <= p46) AND (1 <= p51) AND (1 <= p55))))
lola: processed formula length: 65
lola: 67 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p20) AND (1 <= p32)) OR ((1 <= p21) AND (1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p20) AND (1 <= p32)) OR ((1 <= p21) AND (1 <= p37))))))
lola: processed formula length: 73
lola: 67 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p13) AND (1 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p13 <= 0) OR (p40 <= 0))
lola: processed formula length: 27
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 21 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p45) AND (1 <= p50) AND (1 <= p56)))
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: ((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0))
lola: processed formula length: 42
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0))))
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 (((p26 <= 0) OR (p40 <= 0) OR (p51 <= 0))))
lola: processed formula length: 50
lola: 67 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: 4259 markings, 5972 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p51))))
lola: processed formula length: 50
lola: 67 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p43) AND (1 <= p49) AND (1 <= p55))))
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 <= p43) AND (1 <= p49) AND (1 <= p55))))
lola: processed formula length: 50
lola: 67 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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p34 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p34 <= 0) OR (p46 <= 0) OR (p51 <= 0) OR (p55 <= 0)))
lola: processed formula length: 61
lola: 67 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: 2749 markings, 3672 edges
lola: ========================================
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p46) AND (1 <= p48) AND (1 <= p53)) OR (G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p50)))) AND F (((1 <= p46) AND (1 <= p48) AND (1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p46) AND (1 <= p48) AND (1 <= p53))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p46) AND (1 <= p48) AND (1 <= p53))
lola: processed formula length: 42
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p26) AND (1 <= p40) AND (1 <= p50))))
lola: processed formula length: 50
lola: 67 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: 30 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no yes no no no no
lola:
preliminary result: no no yes no no no no no no yes no no no no
lola: memory consumption: 37948 KB
lola: time consumption: 4 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="SimpleLoadBal-PT-05"
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 SimpleLoadBal-PT-05, 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 r186-oct2-158987939200602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 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 ;