About the Execution of ITS-LoLa for RefineWMG-PT-050050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15799.450 | 3600000.00 | 538200.00 | 110030.40 | FF?F?FFTFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-050050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 110K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-050050-00
FORMULA_NAME RefineWMG-PT-050050-01
FORMULA_NAME RefineWMG-PT-050050-02
FORMULA_NAME RefineWMG-PT-050050-03
FORMULA_NAME RefineWMG-PT-050050-04
FORMULA_NAME RefineWMG-PT-050050-05
FORMULA_NAME RefineWMG-PT-050050-06
FORMULA_NAME RefineWMG-PT-050050-07
FORMULA_NAME RefineWMG-PT-050050-08
FORMULA_NAME RefineWMG-PT-050050-09
FORMULA_NAME RefineWMG-PT-050050-10
FORMULA_NAME RefineWMG-PT-050050-11
FORMULA_NAME RefineWMG-PT-050050-12
FORMULA_NAME RefineWMG-PT-050050-13
FORMULA_NAME RefineWMG-PT-050050-14
FORMULA_NAME RefineWMG-PT-050050-15
=== Now, execution of the tool begins
BK_START 1591227328680
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:35:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:35:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:35:30] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 23:35:30] [INFO ] Transformed 254 places.
[2020-06-03 23:35:30] [INFO ] Transformed 203 transitions.
[2020-06-03 23:35:30] [INFO ] Parsed PT model containing 254 places and 203 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100025 steps, including 0 resets, run finished after 197 ms. (steps per millisecond=507 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:35:30] [INFO ] Computed 102 place invariants in 5 ms
[2020-06-03 23:35:33] [INFO ] [Real]Absence check using 102 positive place invariants in 41 ms returned sat
[2020-06-03 23:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 23:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:33] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:35:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:34] [INFO ] Added : 91 causal constraints over 19 iterations in 265 ms. Result :sat
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-03 23:35:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:34] [INFO ] Added : 43 causal constraints over 9 iterations in 112 ms. Result :sat
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:34] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-06-03 23:35:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:35] [INFO ] Added : 48 causal constraints over 10 iterations in 122 ms. Result :sat
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-03 23:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 23:35:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:35:35] [INFO ] Added : 66 causal constraints over 14 iterations in 174 ms. Result :sat
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:35] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 23:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:36] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:35:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:36] [INFO ] Added : 95 causal constraints over 19 iterations in 246 ms. Result :sat
[2020-06-03 23:35:36] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:36] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:35:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:36] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-03 23:35:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:37] [INFO ] Added : 75 causal constraints over 15 iterations in 191 ms. Result :sat
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:35:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:35:37] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:35:37] [INFO ] Added : 72 causal constraints over 15 iterations in 184 ms. Result :sat
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:37] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:35:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:38] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:35:38] [INFO ] Added : 62 causal constraints over 13 iterations in 142 ms. Result :sat
[2020-06-03 23:35:38] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:38] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:35:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 39 ms returned sat
[2020-06-03 23:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:38] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-03 23:35:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 26 ms.
[2020-06-03 23:35:38] [INFO ] Added : 45 causal constraints over 9 iterations in 123 ms. Result :sat
[2020-06-03 23:35:38] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:38] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 23:35:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:39] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:35:39] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:35:39] [INFO ] Added : 73 causal constraints over 15 iterations in 162 ms. Result :sat
[2020-06-03 23:35:39] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:39] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:35:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:35:39] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:39] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:35:39] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:35:39] [INFO ] Added : 54 causal constraints over 11 iterations in 119 ms. Result :sat
[2020-06-03 23:35:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 23:35:40] [INFO ] Flatten gal took : 42 ms
FORMULA RefineWMG-PT-050050-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:35:40] [INFO ] Flatten gal took : 16 ms
[2020-06-03 23:35:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 23:35:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-050050 @ 3570 seconds
FORMULA RefineWMG-PT-050050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2814
rslt: Output for LTLFireability @ RefineWMG-PT-050050
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:35:43 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (X (G (((1 <= p250) OR (p28 <= 0))))) AND F (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))",
"processed_size": 97,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p155 <= 0)",
"processed_size": 11,
"rewrites": 88
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G ((F ((1 <= p93)) AND (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) U (1 <= p93))))) AND F ((1 <= p93)))))",
"processed_size": 165,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p148)))",
"processed_size": 19,
"rewrites": 86
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((G ((p232 <= 0)) OR ((p232 <= 0) AND X ((p232 <= 0)))))",
"processed_size": 58,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p203 <= 0)))",
"processed_size": 19,
"rewrites": 86
},
"result":
{
"edges": 62,
"markings": 62,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F ((1 <= p137))) OR (F (G ((p105 <= 0))) OR X (((p136 <= 0) OR (p137 <= 0) OR (p139 <= 0))))))",
"processed_size": 103,
"rewrites": 86
},
"result":
{
"edges": 2703,
"markings": 1380,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p221) AND (1 <= p222) AND (1 <= p224))))",
"processed_size": 53,
"rewrites": 86
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p62) U X ((p62 <= 0)))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((F (((1 <= p106) AND (1 <= p107) AND (1 <= p109))) AND (1 <= p27))) U (1 <= p230))",
"processed_size": 86,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p252) OR (1 <= p202)))",
"processed_size": 33,
"rewrites": 86
},
"result":
{
"edges": 5610,
"markings": 3678,
"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": 1617
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((G ((p65 <= 0)) OR (p42 <= 0))))",
"processed_size": 38,
"rewrites": 86
},
"result":
{
"edges": 1078,
"markings": 877,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3234
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3234
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p238 <= 0)",
"processed_size": 11,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p238 <= 0)",
"processed_size": 11,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88))",
"processed_size": 79,
"rewrites": 86
},
"result":
{
"edges": 566,
"markings": 365,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3680,
"runtime": 756.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(X(G(*))) AND F(**))) : (G((X(**) OR **)) AND F(**)) : G(F((X((* R *)) AND (F(G(*)) OR X(G(*)))))) : X(G((G((F(**) AND (** OR (** U **)))) AND F(**)))) : (F(**) U X((X(G((F(**) AND **))) OR G(**)))) : (((** U G(**)) U **) AND **) : F(G((G(*) OR **))) : G(**) : (F((G(*) OR (* AND X(*)))) OR (F((G(*) OR (* AND X(*)))) AND F(G(**)))) : X(F(*)) : X((X(F(**)) OR (F(G(*)) OR X(**)))) : (G(F(**)) OR (** U X(**))) : (X((F(**) AND *)) U **)"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "no no unknown no unknown no no no no no yes no no ",
"value": "no no unknown no unknown no no no no no yes 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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X ((NOT(F (X (X (((p250 <= 0) AND (1 <= p28)))))) AND F (((1 <= p16) AND (1 <= p17) AND (1 <= p19))))) : (G ((X ((1 <= p155)) OR (1 <= p52))) AND F ((1 <= p155))) : NOT(F (G ((G (X (X (F (X (X ((1 <= p237))))))) U X (((1 <= p117) U (1 <= p230))))))) : G ((G (X (G ((((1 <= p126) AND (1 <= p127) AND (1 <= p129)) U (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) U (1 <= p93)))))) AND F (X ((1 <= p93))))) : (F (((1 <= p76) AND (1 <= p77) AND (1 <= p79))) U X ((X (G ((F ((((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR (1 <= p202))) AND (1 <= p10)))) OR G ((1 <= p167))))) : ((((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88)) AND (p238 <= 0)) : F (NOT(G (NOT(G ((NOT(F ((1 <= p65))) OR (p42 <= 0))))))) : G (((1 <= p252) OR (1 <= p202))) : (F (G ((1 <= p148))) U ((1 <= p232) U NOT(G (((1 <= p232) U X ((1 <= p232))))))) : NOT(X (G ((1 <= p203)))) : X (((X (F ((1 <= p137))) OR NOT(G (F ((1 <= p105))))) OR X (((p136 <= 0) OR (p137 <= 0) OR (p139 <= 0))))) : (G (F (((1 <= p221) AND (1 <= p222) AND (1 <= p224)))) OR ((1 <= p62) U X ((p62 <= 0)))) : (NOT(X ((G (NOT(F (((1 <= p106) AND (1 <= p107) AND (1 <= p109))))) OR (p27 <= 0)))) U (1 <= p230))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G (((1 <= p250) OR (p28 <= 0))))) AND F (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G (((1 <= p250) OR (p28 <= 0))))) AND F (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))
lola: processed formula length: 97
lola: 86 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X ((1 <= p155)) OR (1 <= p52))) AND F ((1 <= p155)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p155))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p155 <= 0)
lola: processed formula length: 11
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p117 <= 0) R (p230 <= 0))) AND (F (G ((p237 <= 0))) OR X (G ((p230 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p117 <= 0) R (p230 <= 0))) AND (F (G ((p237 <= 0))) OR X (G ((p230 <= 0)))))))
lola: processed formula length: 90
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 2431257 markings, 3671153 edges, 486251 markings/sec, 0 secs
lola: 4895641 markings, 7392346 edges, 492877 markings/sec, 5 secs
lola: 7349412 markings, 11097559 edges, 490754 markings/sec, 10 secs
lola: 9708539 markings, 14659828 edges, 471825 markings/sec, 15 secs
lola: 12054640 markings, 18202446 edges, 469220 markings/sec, 20 secs
lola: 14389251 markings, 21727743 edges, 466922 markings/sec, 25 secs
lola: 16649983 markings, 25141426 edges, 452146 markings/sec, 30 secs
lola: 18948382 markings, 28611965 edges, 459680 markings/sec, 35 secs
lola: 21320192 markings, 32193398 edges, 474362 markings/sec, 40 secs
lola: 23687206 markings, 35767602 edges, 473403 markings/sec, 45 secs
lola: 25869543 markings, 39062974 edges, 436467 markings/sec, 50 secs
lola: 28156979 markings, 42517001 edges, 457487 markings/sec, 55 secs
lola: 30493687 markings, 46045429 edges, 467342 markings/sec, 60 secs
lola: 32673444 markings, 49336858 edges, 435951 markings/sec, 65 secs
lola: 34918736 markings, 52727202 edges, 449058 markings/sec, 70 secs
lola: 37190985 markings, 56158319 edges, 454450 markings/sec, 75 secs
lola: 39404864 markings, 59501298 edges, 442776 markings/sec, 80 secs
lola: 41592368 markings, 62804417 edges, 437501 markings/sec, 85 secs
lola: 42541988 markings, 64246030 edges, 189924 markings/sec, 90 secs
lola: 44480022 markings, 67165665 edges, 387607 markings/sec, 95 secs
lola: 45987156 markings, 69440913 edges, 301427 markings/sec, 100 secs
lola: 48100414 markings, 72633352 edges, 422652 markings/sec, 105 secs
lola: 50146752 markings, 75722062 edges, 409268 markings/sec, 110 secs
lola: 51544751 markings, 77832511 edges, 279600 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((F ((1 <= p93)) AND (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) U (1 <= p93))))) AND F ((1 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((F ((1 <= p93)) AND (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (((1 <= p126) AND (1 <= p127) AND (1 <= p129)) U (1 <= p93))))) AND F ((1 <= p93)))))
lola: processed formula length: 165
lola: 86 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: 51 markings, 51 edges
lola: subprocess 4 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p76) AND (1 <= p77) AND (1 <= p79))) U X ((X (G ((F ((((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR (1 <= p202))) AND (1 <= p10)))) OR G ((1 <= p167)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p76) AND (1 <= p77) AND (1 <= p79))) U X ((X (G ((F ((((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR (1 <= p202))) AND (1 <= p10)))) OR G ((1 <= p167)))))
lola: processed formula length: 165
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 2398781 markings, 3622117 edges, 479756 markings/sec, 0 secs
lola: 4780742 markings, 7218899 edges, 476392 markings/sec, 5 secs
lola: 7178352 markings, 10839280 edges, 479522 markings/sec, 10 secs
lola: 9523047 markings, 14379750 edges, 468939 markings/sec, 15 secs
lola: 11840394 markings, 17878947 edges, 463469 markings/sec, 20 secs
lola: 14110909 markings, 21307425 edges, 454103 markings/sec, 25 secs
lola: 16413913 markings, 24784958 edges, 460601 markings/sec, 30 secs
lola: 18782511 markings, 28361527 edges, 473720 markings/sec, 35 secs
lola: 21177531 markings, 31978028 edges, 479004 markings/sec, 40 secs
lola: 23517402 markings, 35511221 edges, 467974 markings/sec, 45 secs
lola: 25814853 markings, 38980369 edges, 459490 markings/sec, 50 secs
lola: 28155284 markings, 42514436 edges, 468086 markings/sec, 55 secs
lola: 30523490 markings, 46090428 edges, 473641 markings/sec, 60 secs
lola: 32904690 markings, 49686035 edges, 476240 markings/sec, 65 secs
lola: 35314306 markings, 53324536 edges, 481923 markings/sec, 70 secs
lola: 37639031 markings, 56834883 edges, 464945 markings/sec, 75 secs
lola: 39978270 markings, 60367147 edges, 467848 markings/sec, 80 secs
lola: 42341754 markings, 63935980 edges, 472697 markings/sec, 85 secs
lola: 43480362 markings, 65655302 edges, 227722 markings/sec, 90 secs
lola: 44503035 markings, 67205762 edges, 204535 markings/sec, 95 secs
lola: 45197581 markings, 68251722 edges, 138909 markings/sec, 100 secs
lola: 47352152 markings, 71502502 edges, 430914 markings/sec, 105 secs
lola: 47356408 markings, 71508073 edges, 851 markings/sec, 110 secs
lola: 47402182 markings, 71577220 edges, 9155 markings/sec, 115 secs
lola: 49603826 markings, 74903497 edges, 440329 markings/sec, 120 secs
lola: 51680017 markings, 78038014 edges, 415238 markings/sec, 125 secs
lola: 53149697 markings, 80255984 edges, 293936 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p232 <= 0)) OR ((p232 <= 0) AND X ((p232 <= 0))))) OR (F ((G ((p232 <= 0)) OR ((p232 <= 0) AND X ((p232 <= 0))))) AND F (G ((1 <= p148)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p148)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p148)))
lola: processed formula length: 19
lola: 86 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: add low 201
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: subprocess 6 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p232 <= 0)) OR ((p232 <= 0) AND X ((p232 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p232 <= 0)) OR ((p232 <= 0) AND X ((p232 <= 0)))))
lola: processed formula length: 58
lola: 86 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: ========================================
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: 51 markings, 51 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================
lola: subprocess 6 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p203 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p203 <= 0)))
lola: processed formula length: 19
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 62 markings, 62 edges
lola: ========================================
lola: subprocess 7 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p137))) OR (F (G ((p105 <= 0))) OR X (((p136 <= 0) OR (p137 <= 0) OR (p139 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p137))) OR (F (G ((p105 <= 0))) OR X (((p136 <= 0) OR (p137 <= 0) OR (p139 <= 0))))))
lola: processed formula length: 103
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1380 markings, 2703 edges
lola: ========================================
lola: subprocess 8 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p221) AND (1 <= p222) AND (1 <= p224)))) OR ((1 <= p62) U X ((p62 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p221) AND (1 <= p222) AND (1 <= p224))))
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 <= p221) AND (1 <= p222) AND (1 <= p224))))
lola: processed formula length: 53
lola: 86 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: 7 markings, 7 edges
lola: subprocess 9 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p62) U X ((p62 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p62) U X ((p62 <= 0)))
lola: processed formula length: 29
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: ========================================
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: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p106) AND (1 <= p107) AND (1 <= p109))) AND (1 <= p27))) U (1 <= p230))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((F (((1 <= p106) AND (1 <= p107) AND (1 <= p109))) AND (1 <= p27))) U (1 <= p230))
lola: processed formula length: 86
lola: 86 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 10 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p252) OR (1 <= p202)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p252) OR (1 <= p202)))
lola: processed formula length: 33
lola: 86 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: 3678 markings, 5610 edges
lola: ========================================
lola: subprocess 11 will run for 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p65 <= 0)) OR (p42 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p65 <= 0)) OR (p42 <= 0))))
lola: processed formula length: 38
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 49
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: 877 markings, 1078 edges
lola: subprocess 12 will run for 3234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88)) AND (p238 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p238 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p238 <= 0)
lola: processed formula length: 11
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p117 <= 0) R (p230 <= 0))) AND (F (G ((p237 <= 0))) OR X (G ((p230 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p117 <= 0) R (p230 <= 0))) AND (F (G ((p237 <= 0))) OR X (G ((p230 <= 0)))))))
lola: processed formula length: 90
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 2371379 markings, 3580752 edges, 474276 markings/sec, 0 secs
lola: 4759849 markings, 7187341 edges, 477694 markings/sec, 5 secs
lola: 7105515 markings, 10729281 edges, 469133 markings/sec, 10 secs
lola: 9400018 markings, 14193986 edges, 458901 markings/sec, 15 secs
lola: 11711635 markings, 17684532 edges, 462323 markings/sec, 20 secs
lola: 14023836 markings, 21175952 edges, 462440 markings/sec, 25 secs
lola: 17676957 markings, 26692138 edges, 730624 markings/sec, 30 secs
lola: 20054417 markings, 30282111 edges, 475492 markings/sec, 35 secs
lola: 22397052 markings, 33819480 edges, 468527 markings/sec, 40 secs
lola: 24740137 markings, 37357558 edges, 468617 markings/sec, 45 secs
lola: 27050603 markings, 40846403 edges, 462093 markings/sec, 50 secs
lola: 29433341 markings, 44444318 edges, 476548 markings/sec, 55 secs
lola: 31797740 markings, 48014515 edges, 472880 markings/sec, 60 secs
lola: 34188570 markings, 51624693 edges, 478166 markings/sec, 65 secs
lola: 36578280 markings, 55233134 edges, 477942 markings/sec, 70 secs
lola: 38886874 markings, 58719120 edges, 461719 markings/sec, 75 secs
lola: 41202995 markings, 62216488 edges, 463224 markings/sec, 80 secs
lola: 42916441 markings, 64803778 edges, 342689 markings/sec, 85 secs
lola: 44915054 markings, 67826353 edges, 399723 markings/sec, 90 secs
lola: 46442144 markings, 70129469 edges, 305418 markings/sec, 95 secs
lola: 48484527 markings, 73211783 edges, 408477 markings/sec, 100 secs
lola: 48549696 markings, 73309986 edges, 13034 markings/sec, 105 secs
lola: 48549696 markings, 73309986 edges, 0 markings/sec, 110 secs
lola: 48549696 markings, 73309986 edges, 0 markings/sec, 115 secs
lola: 50161118 markings, 75743231 edges, 322284 markings/sec, 120 secs
lola: 50322637 markings, 75987121 edges, 32304 markings/sec, 125 secs
lola: 50322637 markings, 75987121 edges, 0 markings/sec, 130 secs
lola: 50322637 markings, 75987121 edges, 0 markings/sec, 135 secs
lola: 50536913 markings, 76310685 edges, 42855 markings/sec, 140 secs
lola: 52394106 markings, 79115044 edges, 371439 markings/sec, 145 secs
lola: 52394106 markings, 79115044 edges, 0 markings/sec, 150 secs
lola: 52394106 markings, 79115044 edges, 0 markings/sec, 155 secs
lola: 53105697 markings, 80189576 edges, 142318 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p76) AND (1 <= p77) AND (1 <= p79))) U X ((X (G ((F ((((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR (1 <= p202))) AND (1 <= p10)))) OR G ((1 <= p167)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p76) AND (1 <= p77) AND (1 <= p79))) U X ((X (G ((F ((((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR (1 <= p202))) AND (1 <= p10)))) OR G ((1 <= p167)))))
lola: processed formula length: 165
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 2389133 markings, 3607561 edges, 477827 markings/sec, 0 secs
lola: 4812440 markings, 7266741 edges, 484661 markings/sec, 5 secs
lola: 7209444 markings, 10886211 edges, 479401 markings/sec, 10 secs
lola: 9566661 markings, 14445626 edges, 471443 markings/sec, 15 secs
lola: 11889299 markings, 17952787 edges, 464528 markings/sec, 20 secs
lola: 14241047 markings, 21503935 edges, 470350 markings/sec, 25 secs
lola: 16622889 markings, 25100480 edges, 476368 markings/sec, 30 secs
lola: 18977870 markings, 28656505 edges, 470996 markings/sec, 35 secs
lola: 21346063 markings, 32232479 edges, 473639 markings/sec, 40 secs
lola: 23677034 markings, 35752256 edges, 466194 markings/sec, 45 secs
lola: 25985784 markings, 39238485 edges, 461750 markings/sec, 50 secs
lola: 28336680 markings, 42788335 edges, 470179 markings/sec, 55 secs
lola: 30696994 markings, 46352423 edges, 472063 markings/sec, 60 secs
lola: 33042859 markings, 49894645 edges, 469173 markings/sec, 65 secs
lola: 35440151 markings, 53514549 edges, 479458 markings/sec, 70 secs
lola: 37768865 markings, 57030929 edges, 465743 markings/sec, 75 secs
lola: 40082100 markings, 60523941 edges, 462647 markings/sec, 80 secs
lola: 42444969 markings, 64091866 edges, 472574 markings/sec, 85 secs
lola: 42800116 markings, 64628693 edges, 71029 markings/sec, 90 secs
lola: 43057059 markings, 65019228 edges, 51389 markings/sec, 95 secs
lola: 45135404 markings, 68224840 edges, 415669 markings/sec, 100 secs
lola: 47141774 markings, 71184492 edges, 401274 markings/sec, 105 secs
lola: 47229280 markings, 71316171 edges, 17501 markings/sec, 110 secs
lola: 47229280 markings, 71316171 edges, 0 markings/sec, 115 secs
lola: 47229280 markings, 71316171 edges, 0 markings/sec, 120 secs
lola: 47229280 markings, 71316171 edges, 0 markings/sec, 125 secs
lola: 47229280 markings, 71316171 edges, 0 markings/sec, 130 secs
lola: 47958133 markings, 72416721 edges, 145771 markings/sec, 135 secs
lola: 49000653 markings, 73990901 edges, 208504 markings/sec, 140 secs
lola: 51072203 markings, 77118968 edges, 414310 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88)) AND (p238 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p238 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p238 <= 0)
lola: processed formula length: 11
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p60) U G ((((p238 <= 0) OR (p60 <= 0)) AND (p88 <= 0)))) U (1 <= p88))
lola: processed formula length: 79
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 365 markings, 566 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: RESULT
lola:
SUMMARY: no no unknown no unknown no no no no no yes no no
lola:
preliminary result: no no unknown no unknown no no no no no yes no no
========================================
lola: memory consumption: 3680 KB
lola: time consumption: 756 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="RefineWMG-PT-050050"
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 RefineWMG-PT-050050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 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 ;