About the Execution of ITS-LoLa for CloudDeployment-PT-7a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.500 | 3600000.00 | 342709.00 | 1361.60 | FTFFFTFFTTFFTFFT | 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.r168-smll-158987806600346.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 CloudDeployment-PT-7a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 3.1K Mar 30 01:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 420K 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 CloudDeployment-PT-7a-00
FORMULA_NAME CloudDeployment-PT-7a-01
FORMULA_NAME CloudDeployment-PT-7a-02
FORMULA_NAME CloudDeployment-PT-7a-03
FORMULA_NAME CloudDeployment-PT-7a-04
FORMULA_NAME CloudDeployment-PT-7a-05
FORMULA_NAME CloudDeployment-PT-7a-06
FORMULA_NAME CloudDeployment-PT-7a-07
FORMULA_NAME CloudDeployment-PT-7a-08
FORMULA_NAME CloudDeployment-PT-7a-09
FORMULA_NAME CloudDeployment-PT-7a-10
FORMULA_NAME CloudDeployment-PT-7a-11
FORMULA_NAME CloudDeployment-PT-7a-12
FORMULA_NAME CloudDeployment-PT-7a-13
FORMULA_NAME CloudDeployment-PT-7a-14
FORMULA_NAME CloudDeployment-PT-7a-15
=== Now, execution of the tool begins
BK_START 1591311655481
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 23:00:57] [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 23:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 23:00:58] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2020-06-04 23:00:58] [INFO ] Transformed 264 places.
[2020-06-04 23:00:58] [INFO ] Transformed 1174 transitions.
[2020-06-04 23:00:58] [INFO ] Found NUPN structural information;
[2020-06-04 23:00:58] [INFO ] Parsed PT model containing 264 places and 1174 transitions in 253 ms.
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 978 resets, run finished after 753 ms. (steps per millisecond=132 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-04 23:00:58] [INFO ] Flow matrix only has 475 transitions (discarded 545 similar events)
// Phase 1: matrix 475 rows 264 cols
[2020-06-04 23:00:59] [INFO ] Computed 42 place invariants in 31 ms
[2020-06-04 23:00:59] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 40 ms returned sat
[2020-06-04 23:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:00:59] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2020-06-04 23:00:59] [INFO ] State equation strengthened by 240 read => feed constraints.
[2020-06-04 23:00:59] [INFO ] [Real]Added 240 Read/Feed constraints in 71 ms returned sat
[2020-06-04 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:01:00] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 59 ms returned sat
[2020-06-04 23:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:01:00] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2020-06-04 23:01:00] [INFO ] [Nat]Added 240 Read/Feed constraints in 72 ms returned sat
[2020-06-04 23:01:00] [INFO ] Computed and/alt/rep : 1019/8271/474 causal constraints in 100 ms.
[2020-06-04 23:01:02] [INFO ] Added : 243 causal constraints over 50 iterations in 2256 ms. Result :sat
[2020-06-04 23:01:03] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 44 ms returned sat
[2020-06-04 23:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:01:03] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2020-06-04 23:01:03] [INFO ] [Real]Added 240 Read/Feed constraints in 59 ms returned sat
[2020-06-04 23:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:01:03] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 33 ms returned sat
[2020-06-04 23:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:01:04] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-06-04 23:01:04] [INFO ] [Nat]Added 240 Read/Feed constraints in 94 ms returned sat
[2020-06-04 23:01:04] [INFO ] Computed and/alt/rep : 1019/8271/474 causal constraints in 76 ms.
[2020-06-04 23:01:06] [INFO ] Added : 230 causal constraints over 46 iterations in 2364 ms. Result :sat
[2020-06-04 23:01:06] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 28 ms returned sat
[2020-06-04 23:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:01:07] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2020-06-04 23:01:07] [INFO ] [Real]Added 240 Read/Feed constraints in 41 ms returned sat
[2020-06-04 23:01:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:01:07] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 35 ms returned sat
[2020-06-04 23:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:01:07] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2020-06-04 23:01:07] [INFO ] [Nat]Added 240 Read/Feed constraints in 57 ms returned sat
[2020-06-04 23:01:07] [INFO ] Computed and/alt/rep : 1019/8271/474 causal constraints in 53 ms.
[2020-06-04 23:01:09] [INFO ] Added : 238 causal constraints over 48 iterations in 2086 ms. Result :sat
[2020-06-04 23:01:09] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 22 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 23:01:10] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 23:01:10] [INFO ] Flatten gal took : 197 ms
FORMULA CloudDeployment-PT-7a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 23:01:10] [INFO ] Applying decomposition
[2020-06-04 23:01:10] [INFO ] Flatten gal took : 95 ms
[2020-06-04 23:01:10] [INFO ] Decomposing Gal with order
[2020-06-04 23:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 23:01:10] [INFO ] Removed a total of 2862 redundant transitions.
[2020-06-04 23:01:10] [INFO ] Flatten gal took : 286 ms
[2020-06-04 23:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 39 ms.
[2020-06-04 23:01:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-04 23:01:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudDeployment-PT-7a @ 3570 seconds
FORMULA CloudDeployment-PT-7a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-7a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3260
rslt: Output for LTLFireability @ CloudDeployment-PT-7a
{
"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 23:01:12 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (((((1 <= p60) AND (1 <= p142)) OR (G (((p107 <= 0))) AND F (((1 <= p60) AND (1 <= p142))))) AND F ((F (((1 <= p185))) OR ((1 <= p107)))))))",
"processed_size": 145,
"rewrites": 97
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 7,
"adisj": 2,
"aneg": 2,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 4,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X ((F (((p86 <= 0) OR (p88 <= 0) OR (p110 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR (X (((p170 <= 0) OR (p172 <= 0) OR (p196 <= 0) OR (p204 <= 0))) OR (((p30 <= 0)) OR (((p234 <= 0)) OR (X (G (((1 <= p170) AND (1 <= p172) AND (1 <= p196) AND (1 <= p204)))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p56)) AND ((1 <= p246)))))))))))",
"processed_size": 343,
"rewrites": 97
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((G (((p2 <= 0) OR (p4 <= 0) OR (p24 <= 0) OR (p247 <= 0) OR (p262 <= 0))) AND F (((((p67 <= 0)) R ((p15 <= 0))) OR ((p67 <= 0)))))))",
"processed_size": 142,
"rewrites": 97
},
"result":
{
"edges": 29537790,
"markings": 392809,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G (((((p48 <= 0)) R X (X (X (F (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p247 <= 0) OR (p262 <= 0))))))) AND (((1 <= p60)) AND ((1 <= p170))))))",
"processed_size": 152,
"rewrites": 97
},
"result":
{
"edges": 102506325,
"markings": 1364735,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((X ((X ((X (((1 <= p142) AND (1 <= p144) AND (1 <= p146) AND (1 <= p247) AND (1 <= p262))) AND (((1 <= p88)) AND ((1 <= p114))))) OR ((1 <= p195)))) OR (G (((1 <= p88) AND (1 <= p114))) OR ((1 <= p60)))))",
"processed_size": 207,
"rewrites": 97
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 14
},
"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": 466
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((X (((p114 <= 0) OR (p116 <= 0) OR (p128 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p156) AND (1 <= p247) AND (1 <= p262))))",
"processed_size": 168,
"rewrites": 97
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p246))) OR (((p30 <= 0)) OR ((p172 <= 0)))))",
"processed_size": 104,
"rewrites": 97
},
"result":
{
"edges": 3,
"markings": 3,
"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": 653
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p142) AND (1 <= p144) AND (1 <= p165) AND (1 <= p247) AND (1 <= p262))",
"processed_size": 77,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((G (((1 <= p32) AND (1 <= p36))) AND (F (((p32 <= 0) OR (p36 <= 0))) OR G (((1 <= p32) AND (1 <= p36)))))))",
"processed_size": 114,
"rewrites": 97
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p88) AND (1 <= p94))) AND (G (F (((p73 <= 0)))) AND (((1 <= p73)) OR ((1 <= p88) AND (1 <= p172))))))",
"processed_size": 116,
"rewrites": 97
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"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": 1089
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p88) AND (1 <= p172))) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)) OR ((1 <= p88) AND (1 <= p172)))))",
"processed_size": 149,
"rewrites": 97
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (X (F ((((1 <= p96)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)))))))",
"processed_size": 106,
"rewrites": 97
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1634
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p4) AND (1 <= p172)))",
"processed_size": 31,
"rewrites": 97
},
"result":
{
"edges": 6,
"markings": 6,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3268
},
"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 (((p142 <= 0) OR (p144 <= 0) OR (p168 <= 0) OR (p211 <= 0)))",
"processed_size": 65,
"rewrites": 97
},
"result":
{
"edges": 3318851,
"markings": 71728,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3260
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3260
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p60) AND (1 <= p62))",
"processed_size": 27,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p60) AND (1 <= p62))))",
"processed_size": 35,
"rewrites": 97
},
"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": "fairness",
"workflow": "product automaton"
}
},
{
"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": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p114) AND (1 <= p116) AND (1 <= p138) AND (1 <= p247) AND (1 <= p262))))",
"processed_size": 85,
"rewrites": 97
},
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 77652,
"runtime": 310.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(((** OR (G(**) AND F(**))) AND F((F(**) OR **))))) : X((F(*) OR (X(*) OR (** OR (** OR (X(G(**)) AND (** AND (** AND (** AND **))))))))) : X(G((G(*) AND F(((* R *) OR *))))) : (** OR ((G(F(**)) AND F(**)) OR (G(F(**)) AND F((** OR (G(F(**)) AND F(**))))))) : F(G(((* R X(X(X(F(*))))) AND (** AND **)))) : (G(**) OR G(**)) : X((X((X((X(**) AND (** AND **))) OR **)) OR (G(**) OR **))) : F((X(*) OR **)) : X((F(*) OR (** OR **))) : (X(X((G(**) AND (F(*) OR G(**))))) OR **) : X((X(**) AND (G(F(*)) AND **))) : (G((F(**) AND (** OR **))) OR X(X(X(F((** OR **))))))"
},
"net":
{
"arcs": 6771,
"conflict_clusters": 60,
"places": 264,
"places_significant": 222,
"singleton_clusters": 0,
"transitions": 1020
},
"result":
{
"preliminary_value": "no yes no no no no yes yes no no no no ",
"value": "no yes no no no no yes 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: 1284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 264
lola: finding significant places
lola: 264 places, 1020 transitions, 222 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: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 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: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 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: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 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: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: X (X (((G (((p107 <= 0))) U ((1 <= p60) AND (1 <= p142))) AND F ((F (((1 <= p185))) OR ((1 <= p107))))))) : X (((((NOT(G (((1 <= p86) AND (1 <= p88) AND (1 <= p110) AND (1 <= p247) AND (1 <= p262)))) OR NOT(X (((1 <= p170) AND (1 <= p172) AND (1 <= p196) AND (1 <= p204))))) OR ((p30 <= 0))) OR ((p234 <= 0))) OR ((((X (G (((1 <= p170) AND (1 <= p172) AND (1 <= p196) AND (1 <= p204)))) AND ((1 <= p30))) AND ((1 <= p32))) AND ((1 <= p56))) AND ((1 <= p246))))) : NOT(F ((F (X (F (((1 <= p2) AND (1 <= p4) AND (1 <= p24) AND (1 <= p247) AND (1 <= p262))))) OR X (G (((((1 <= p67)) U ((1 <= p15))) AND ((1 <= p67)))))))) : (G (((X (((1 <= p68))) OR ((1 <= p131))) U F (((1 <= p114) AND (1 <= p116) AND (1 <= p138) AND (1 <= p247) AND (1 <= p262))))) U (G (F (X (((1 <= p60) AND (1 <= p62))))) U ((1 <= p60) AND (1 <= p62)))) : F (G (((NOT((((1 <= p48)) U X (NOT(F (NOT(X (G (X (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p247) AND (1 <= p262))))))))))) AND ((1 <= p60))) AND ((1 <= p170))))) : (G (((p142 <= 0) OR (p144 <= 0) OR (p168 <= 0) OR (p211 <= 0))) OR G (((1 <= p4) AND (1 <= p172)))) : X ((((X (X (((X (((1 <= p142) AND (1 <= p144) AND (1 <= p146) AND (1 <= p247) AND (1 <= p262))) AND ((1 <= p88))) AND ((1 <= p114))))) OR X (((1 <= p195)))) OR G (((1 <= p88) AND (1 <= p114)))) OR ((1 <= p60)))) : F ((NOT(X (((1 <= p114) AND (1 <= p116) AND (1 <= p128) AND (1 <= p247) AND (1 <= p262)))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p156) AND (1 <= p247) AND (1 <= p262)))) : X (((1 <= 0) U ((NOT(G (((p86 <= 0) OR (p88 <= 0) OR (p112 <= 0) OR (p246 <= 0)))) OR ((p30 <= 0))) OR ((p172 <= 0))))) : (X (NOT((X (G (((1 <= p32) AND (1 <= p36)))) U F (NOT(G (X (((1 <= p32) AND (1 <= p36))))))))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p165) AND (1 <= p247) AND (1 <= p262))) : X (((X (((1 <= p88) AND (1 <= p94))) AND NOT(F (G (((1 <= p73)))))) AND (((1 <= p73)) OR ((1 <= p88) AND (1 <= p172))))) : (G ((((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)) U ((1 <= p88) AND (1 <= p172)))) OR F (X (X ((X (((1 <= p96))) OR X (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((((1 <= p60) AND (1 <= p142)) OR (G (((p107 <= 0))) AND F (((1 <= p60) AND (1 <= p142))))) AND F ((F (((1 <= p185))) OR ((1 <= p107)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((((1 <= p60) AND (1 <= p142)) OR (G (((p107 <= 0))) AND F (((1 <= p60) AND (1 <= p142))))) AND F ((F (((1 <= p185))) OR ((1 <= p107)))))))
lola: processed formula length: 145
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p86 <= 0) OR (p88 <= 0) OR (p110 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR (X (((p170 <= 0) OR (p172 <= 0) OR (p196 <= 0) OR (p204 <= 0))) OR (((p30 <= 0)) OR (((p234 <= 0)) OR (X (G (((1 <= p170) AND (1 <= p172) AND (1 <= p196) AND (1 <= p204)))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p56)) AND ((1 <= p246)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p86 <= 0) OR (p88 <= 0) OR (p110 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR (X (((p170 <= 0) OR (p172 <= 0) OR (p196 <= 0) OR (p204 <= 0))) OR (((p30 <= 0)) OR (((p234 <= 0)) OR (X (G (((1 <= p170) AND (1 <= p172) AND (1 <= p196) AND (1 <= p204)))) AND (((1 <= p30)) AND (((1 <= p32)) AND (((1 <= p56)) AND ((1 <= p246)))))))))))
lola: processed formula length: 343
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p2 <= 0) OR (p4 <= 0) OR (p24 <= 0) OR (p247 <= 0) OR (p262 <= 0))) AND F (((((p67 <= 0)) R ((p15 <= 0))) OR ((p67 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p2 <= 0) OR (p4 <= 0) OR (p24 <= 0) OR (p247 <= 0) OR (p262 <= 0))) AND F (((((p67 <= 0)) R ((p15 <= 0))) OR ((p67 <= 0)))))))
lola: processed formula length: 142
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 31259 markings, 2338385 edges, 6252 markings/sec, 0 secs
lola: 62309 markings, 4667337 edges, 6210 markings/sec, 5 secs
lola: 92341 markings, 6925496 edges, 6006 markings/sec, 10 secs
lola: 122348 markings, 9183635 edges, 6001 markings/sec, 15 secs
lola: 152263 markings, 11435057 edges, 5983 markings/sec, 20 secs
lola: 182345 markings, 13696239 edges, 6016 markings/sec, 25 secs
lola: 212534 markings, 15970186 edges, 6038 markings/sec, 30 secs
lola: 242459 markings, 18226556 edges, 5985 markings/sec, 35 secs
lola: 271768 markings, 20425171 edges, 5862 markings/sec, 40 secs
lola: 301301 markings, 22650647 edges, 5907 markings/sec, 45 secs
lola: 331431 markings, 24919957 edges, 6026 markings/sec, 50 secs
lola: 361367 markings, 27167987 edges, 5987 markings/sec, 55 secs
lola: 390749 markings, 29382221 edges, 5876 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 392809 markings, 29537790 edges
lola: ========================================
lola: subprocess 3 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p48 <= 0)) R X (X (X (F (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p247 <= 0) OR (p262 <= 0))))))) AND (((1 <= p60)) AND ((1 <= p170))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((p48 <= 0)) R X (X (X (F (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0) OR (p247 <= 0) OR (p262 <= 0))))))) AND (((1 <= p60)) AND ((1 <= p170))))))
lola: processed formula length: 152
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 38439 markings, 2309710 edges, 7688 markings/sec, 0 secs
lola: 69397 markings, 4625825 edges, 6192 markings/sec, 5 secs
lola: 100027 markings, 6945393 edges, 6126 markings/sec, 10 secs
lola: 131569 markings, 9271598 edges, 6308 markings/sec, 15 secs
lola: 162103 markings, 11605357 edges, 6107 markings/sec, 20 secs
lola: 192628 markings, 13919805 edges, 6105 markings/sec, 25 secs
lola: 223139 markings, 16225583 edges, 6102 markings/sec, 30 secs
lola: 254606 markings, 18585432 edges, 6293 markings/sec, 35 secs
lola: 285208 markings, 20881766 edges, 6120 markings/sec, 40 secs
lola: 313254 markings, 23005165 edges, 5609 markings/sec, 45 secs
lola: 342139 markings, 25181815 edges, 5777 markings/sec, 50 secs
lola: 371855 markings, 27434143 edges, 5943 markings/sec, 55 secs
lola: 401887 markings, 29707755 edges, 6006 markings/sec, 60 secs
lola: 431001 markings, 31907636 edges, 5823 markings/sec, 65 secs
lola: 460988 markings, 34172421 edges, 5997 markings/sec, 70 secs
lola: 490292 markings, 36383443 edges, 5861 markings/sec, 75 secs
lola: 519689 markings, 38605779 edges, 5879 markings/sec, 80 secs
lola: 548820 markings, 40819865 edges, 5826 markings/sec, 85 secs
lola: 579150 markings, 43090660 edges, 6066 markings/sec, 90 secs
lola: 609328 markings, 45371416 edges, 6036 markings/sec, 95 secs
lola: 638947 markings, 47610839 edges, 5924 markings/sec, 100 secs
lola: 668485 markings, 49849545 edges, 5908 markings/sec, 105 secs
lola: 698267 markings, 52091946 edges, 5956 markings/sec, 110 secs
lola: 727932 markings, 54334005 edges, 5933 markings/sec, 115 secs
lola: 757397 markings, 56568686 edges, 5893 markings/sec, 120 secs
lola: 788665 markings, 58882627 edges, 6254 markings/sec, 125 secs
lola: 818187 markings, 61149803 edges, 5904 markings/sec, 130 secs
lola: 847089 markings, 63343179 edges, 5780 markings/sec, 135 secs
lola: 874883 markings, 65440636 edges, 5559 markings/sec, 140 secs
lola: 904236 markings, 67667301 edges, 5871 markings/sec, 145 secs
lola: 933832 markings, 69900269 edges, 5919 markings/sec, 150 secs
lola: 963353 markings, 72131676 edges, 5904 markings/sec, 155 secs
lola: 992354 markings, 74340000 edges, 5800 markings/sec, 160 secs
lola: 1021155 markings, 76507157 edges, 5760 markings/sec, 165 secs
lola: 1049952 markings, 78647367 edges, 5759 markings/sec, 170 secs
lola: 1077657 markings, 80749607 edges, 5541 markings/sec, 175 secs
lola: 1105454 markings, 82882763 edges, 5559 markings/sec, 180 secs
lola: 1133936 markings, 85039075 edges, 5696 markings/sec, 185 secs
lola: 1163118 markings, 87235157 edges, 5836 markings/sec, 190 secs
lola: 1192551 markings, 89460914 edges, 5887 markings/sec, 195 secs
lola: 1221322 markings, 91642346 edges, 5754 markings/sec, 200 secs
lola: 1250262 markings, 93831407 edges, 5788 markings/sec, 205 secs
lola: 1279387 markings, 96043530 edges, 5825 markings/sec, 210 secs
lola: 1309132 markings, 98290738 edges, 5949 markings/sec, 215 secs
lola: 1338989 markings, 100552399 edges, 5971 markings/sec, 220 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1364735 markings, 102506325 edges
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X ((X (((1 <= p142) AND (1 <= p144) AND (1 <= p146) AND (1 <= p247) AND (1 <= p262))) AND (((1 <= p88)) AND ((1 <= p114))))) OR ((1 <= p195)))) OR (G (((1 <= p88) AND (1 <= p114))) OR ((1 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X ((X (((1 <= p142) AND (1 <= p144) AND (1 <= p146) AND (1 <= p247) AND (1 <= p262))) AND (((1 <= p88)) AND ((1 <= p114))))) OR ((1 <= p195)))) OR (G (((1 <= p88) AND (1 <= p114))) OR ((1 <= p60)))))
lola: processed formula length: 207
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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 5 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p114 <= 0) OR (p116 <= 0) OR (p128 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p156) AND (1 <= p247) AND (1 <= p262))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p114 <= 0) OR (p116 <= 0) OR (p128 <= 0) OR (p247 <= 0) OR (p262 <= 0))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p156) AND (1 <= p247) AND (1 <= p262))))
lola: processed formula length: 168
lola: 97 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 6 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p246))) OR (((p30 <= 0)) OR ((p172 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p246))) OR (((p30 <= 0)) OR ((p172 <= 0)))))
lola: processed formula length: 104
lola: 97 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((G (((1 <= p32) AND (1 <= p36))) AND (F (((p32 <= 0) OR (p36 <= 0))) OR G (((1 <= p32) AND (1 <= p36))))))) OR ((1 <= p142) AND (1 <= p144) AND (1 <= p165) AND (1 <= p247) AND (1 <= p262)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p142) AND (1 <= p144) AND (1 <= p165) AND (1 <= p247) AND (1 <= p262))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p142) AND (1 <= p144) AND (1 <= p165) AND (1 <= p247) AND (1 <= p262))
lola: processed formula length: 77
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 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 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p32) AND (1 <= p36))) AND (F (((p32 <= 0) OR (p36 <= 0))) OR G (((1 <= p32) AND (1 <= p36)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p32) AND (1 <= p36))) AND (F (((p32 <= 0) OR (p36 <= 0))) OR G (((1 <= p32) AND (1 <= p36)))))))
lola: processed formula length: 114
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p88) AND (1 <= p94))) AND (G (F (((p73 <= 0)))) AND (((1 <= p73)) OR ((1 <= p88) AND (1 <= p172))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p88) AND (1 <= p94))) AND (G (F (((p73 <= 0)))) AND (((1 <= p73)) OR ((1 <= p88) AND (1 <= p172))))))
lola: processed formula length: 116
lola: 97 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p88) AND (1 <= p172))) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)) OR ((1 <= p88) AND (1 <= p172))))) OR X (X (X (F ((((1 <= p96)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p88) AND (1 <= p172))) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)) OR ((1 <= p88) AND (1 <= p172)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p88) AND (1 <= p172))) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)) OR ((1 <= p88) AND (1 <= p172)))))
lola: processed formula length: 149
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((((1 <= p96)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((((1 <= p96)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p247) AND (1 <= p262)))))))
lola: processed formula length: 106
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p142 <= 0) OR (p144 <= 0) OR (p168 <= 0) OR (p211 <= 0))) OR G (((1 <= p4) AND (1 <= p172))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) AND (1 <= p172)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) AND (1 <= p172)))
lola: processed formula length: 31
lola: 97 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p142 <= 0) OR (p144 <= 0) OR (p168 <= 0) OR (p211 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p142 <= 0) OR (p144 <= 0) OR (p168 <= 0) OR (p211 <= 0)))
lola: processed formula length: 65
lola: 97 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: 44878 markings, 2049829 edges, 8976 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 71728 markings, 3318851 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p60) AND (1 <= p62)) OR ((G (F (((1 <= p60) AND (1 <= p62)))) AND F (((1 <= p60) AND (1 <= p62)))) OR (G (F (((1 <= p114) AND (1 <= p116) AND (1 <= p138) AND (1 <= p247) AND (1 <= p262)))) AND F ((((1 <= p60) AND (1 <= p62)) OR (G (F (((1 <= p60) AND (1 <= p62)))) AND F (((1 <= p60) AND (1 <= p62)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p60) AND (1 <= p62))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p60) AND (1 <= p62))
lola: processed formula length: 27
lola: 97 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p60) AND (1 <= p62))))
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 <= p60) AND (1 <= p62))))
lola: processed formula length: 35
lola: 97 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: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p114) AND (1 <= p116) AND (1 <= p138) AND (1 <= p247) AND (1 <= p262))))
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 <= p114) AND (1 <= p116) AND (1 <= p138) AND (1 <= p247) AND (1 <= p262))))
lola: processed formula length: 85
lola: 97 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no yes yes no no no no
lola:
preliminary result: no yes no no no no yes yes no no no no
lola: memory consumption: 77652 KB
lola: time consumption: 310 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="CloudDeployment-PT-7a"
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 CloudDeployment-PT-7a, 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 r168-smll-158987806600346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7a.tgz
mv CloudDeployment-PT-7a 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 ;