fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938500082
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RefineWMG-PT-025025

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15798.210 3600000.00 684264.00 272019.40 F??FFFFF?FFTFFTF 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-158987938500082.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-025025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.0K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 2.8K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 56K 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-025025-00
FORMULA_NAME RefineWMG-PT-025025-01
FORMULA_NAME RefineWMG-PT-025025-02
FORMULA_NAME RefineWMG-PT-025025-03
FORMULA_NAME RefineWMG-PT-025025-04
FORMULA_NAME RefineWMG-PT-025025-05
FORMULA_NAME RefineWMG-PT-025025-06
FORMULA_NAME RefineWMG-PT-025025-07
FORMULA_NAME RefineWMG-PT-025025-08
FORMULA_NAME RefineWMG-PT-025025-09
FORMULA_NAME RefineWMG-PT-025025-10
FORMULA_NAME RefineWMG-PT-025025-11
FORMULA_NAME RefineWMG-PT-025025-12
FORMULA_NAME RefineWMG-PT-025025-13
FORMULA_NAME RefineWMG-PT-025025-14
FORMULA_NAME RefineWMG-PT-025025-15

=== Now, execution of the tool begins

BK_START 1591226001178

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:13:23] [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:13:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:13:23] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-06-03 23:13:23] [INFO ] Transformed 129 places.
[2020-06-03 23:13:23] [INFO ] Transformed 103 transitions.
[2020-06-03 23:13:23] [INFO ] Parsed PT model containing 129 places and 103 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 121 ms. (steps per millisecond=826 ) properties seen :[1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 103 rows 129 cols
[2020-06-03 23:13:23] [INFO ] Computed 52 place invariants in 6 ms
[2020-06-03 23:13:25] [INFO ] [Real]Absence check using 52 positive place invariants in 25 ms returned sat
[2020-06-03 23:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:13:25] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 23:13:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:13:25] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2020-06-03 23:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:13:25] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-06-03 23:13:25] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 7 ms.
[2020-06-03 23:13:25] [INFO ] Added : 51 causal constraints over 11 iterations in 85 ms. Result :sat
[2020-06-03 23:13:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 23:13:25] [INFO ] Flatten gal took : 40 ms
FORMULA RefineWMG-PT-025025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:13:25] [INFO ] Flatten gal took : 10 ms
[2020-06-03 23:13:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-03 23:13:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-025025 @ 3570 seconds

FORMULA RefineWMG-PT-025025-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2392
rslt: Output for LTLFireability @ RefineWMG-PT-025025

{
"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:13:33 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((1 <= p32))",
"processed_size": 14,
"rewrites": 55
},
"result":
{
"edges": 1505,
"markings": 952,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U (1 <= p20))",
"processed_size": 61,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"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": "G (F ((1 <= p107)))",
"processed_size": 19,
"rewrites": 55
},
"result":
{
"edges": 353,
"markings": 229,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "F ((F ((X (G ((1 <= p113))) AND ((1 <= p113) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))) AND (1 <= p88)))",
"processed_size": 111,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((((1 <= p51) AND (1 <= p52) AND (1 <= p54)) U ((p1 <= 1) OR (p2 <= 1))))",
"processed_size": 76,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"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": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "X ((F ((p105 <= 0)) U (1 <= p105)))",
"processed_size": 35,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p83) U (3 <= p3)) AND (3 <= p3)) OR (G ((1 <= p55)) OR X ((1 <= p77)))))",
"processed_size": 84,
"rewrites": 55
},
"result":
{
"edges": 4210,
"markings": 1465,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 502
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F ((X (X (G ((1 <= p13)))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) OR ((1 <= p25) OR (1 <= p25))))",
"processed_size": 113,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 602
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 602
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p103) AND (1 <= p113))) AND ((1 <= p103) OR X (F (((1 <= p103) AND (1 <= p113))))))))",
"processed_size": 102,
"rewrites": 55
},
"result":
{
"edges": 32,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (((1 <= p80) U (1 <= p108))))",
"processed_size": 34,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p58) AND (1 <= p100))))",
"processed_size": 36,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 1004
},
"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 <= p73)))",
"processed_size": 18,
"rewrites": 55
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p5 <= 0))",
"processed_size": 13,
"rewrites": 55
},
"result":
{
"edges": 657,
"markings": 549,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3013
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((5 <= p4)) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))))",
"processed_size": 69,
"rewrites": 55
},
"result":
{
"edges": 13,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3408,
"runtime": 1178.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X(**) U **) OR G(**)) : (** U (X(X(G(*))) R (X(G(**)) AND G(*)))) : X(G((G(F((G(*) AND *))) OR (* OR (* OR *))))) : (G(F(**)) AND X(X(G(*)))) : F(G((F(**) OR **))) : F(G(**)) : F((F((X(G(**)) AND **)) AND **)) : G(**) : G((F((F(**) OR **)) AND (X(**) OR **))) : X((** U **)) : X((F(**) U **)) : X((((** U **) AND **) OR (G(**) OR X(**)))) : X((F((X(X(G(**))) OR **)) OR (** OR **))) : (F(G((F(**) AND (** OR X(F(**)))))) OR X(X((** U **)))) : X(F(**))"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "no unknown unknown no no no no no unknown no no yes no no no ",
"value": "no unknown unknown no no no no no unknown no no yes 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: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 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 (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U (1 <= p20)) OR G ((1 <= p32))) : ((1 <= p88) U NOT((X (F (X (((1 <= p91) AND (1 <= p92) AND (1 <= p94))))) U (X (NOT(G (((1 <= p86) AND (1 <= p87) AND (1 <= p89))))) OR F ((1 <= p88)))))) : X (NOT(F ((((1 <= p111) AND (1 <= p112) AND (1 <= p114)) U (((F (G ((F (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) OR (1 <= p10)))) AND (1 <= p111)) AND (1 <= p112)) AND (1 <= p114)))))) : (G (F ((1 <= p107))) AND G (X (NOT(X (F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))) : F (G ((F ((5 <= p4)) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89))))) : F ((((1 <= p73) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))) U G ((1 <= p73)))) : F ((F ((X (G ((1 <= p113))) AND ((1 <= p113) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))) AND (1 <= p88))) : G ((p5 <= 0)) : G ((F ((F ((1 <= p68)) OR (p68 <= 0))) AND (X ((1 <= p90)) OR (p68 <= 0)))) : X ((((1 <= p51) AND (1 <= p52) AND (1 <= p54)) U ((p1 <= 1) OR (p2 <= 1)))) : (X (F ((p105 <= 0))) U X ((1 <= p105))) : (X (((((1 <= p83) U (3 <= p3)) AND (3 <= p3)) OR G ((1 <= p55)))) OR X (X ((1 <= p77)))) : (X ((F ((G (X (G (X ((1 <= p13))))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) OR (1 <= p25))) OR X ((1 <= p25))) : (F (G (((1 <= p103) U X (F (((1 <= p103) AND (1 <= p113))))))) OR X (X (((1 <= p80) U (1 <= p108))))) : F (X ((F ((1 <= p100)) U ((1 <= p58) AND (1 <= p100)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U (1 <= p20)) OR G ((1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p32))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p32))
lola: processed formula length: 14
lola: 55 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: 952 markings, 1505 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U (1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U (1 <= p20))
lola: processed formula length: 61
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p88) U (X (X (G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))))) R (X (G (((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND G ((p88 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p88) U (X (X (G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))))) R (X (G (((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND G ((p88 <= 0)))))
lola: processed formula length: 145
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 37 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: 3782665 markings, 5749616 edges, 756533 markings/sec, 0 secs
lola: 7506682 markings, 11410116 edges, 744803 markings/sec, 5 secs
lola: 11232203 markings, 17072908 edges, 745104 markings/sec, 10 secs
lola: 14950681 markings, 22724998 edges, 743696 markings/sec, 15 secs
lola: 18530351 markings, 28166109 edges, 715934 markings/sec, 20 secs
lola: 22062946 markings, 33535643 edges, 706519 markings/sec, 25 secs
lola: 25681316 markings, 39035570 edges, 723674 markings/sec, 30 secs
lola: 29285903 markings, 44514545 edges, 720917 markings/sec, 35 secs
lola: 32847360 markings, 49927950 edges, 712291 markings/sec, 40 secs
lola: 36446666 markings, 55398887 edges, 719861 markings/sec, 45 secs
lola: 39954628 markings, 60730994 edges, 701592 markings/sec, 50 secs
lola: 43404025 markings, 65974074 edges, 689879 markings/sec, 55 secs
lola: 46810203 markings, 71151482 edges, 681236 markings/sec, 60 secs
lola: 50387382 markings, 76588791 edges, 715436 markings/sec, 65 secs
lola: 53743305 markings, 81689993 edges, 671185 markings/sec, 70 secs
lola: 55754164 markings, 84747495 edges, 402172 markings/sec, 75 secs
lola: 57199283 markings, 86948999 edges, 289024 markings/sec, 80 secs
lola: 58662913 markings, 89167592 edges, 292726 markings/sec, 85 secs
lola: 58662913 markings, 89167592 edges, 0 markings/sec, 90 secs
lola: 58742572 markings, 89288670 edges, 15932 markings/sec, 95 secs
lola: 61327188 markings, 93222057 edges, 516923 markings/sec, 100 secs
lola: 63175267 markings, 96026376 edges, 369616 markings/sec, 105 secs
lola: 65446868 markings, 99479191 edges, 454320 markings/sec, 110 secs
lola: 65494942 markings, 99552284 edges, 9615 markings/sec, 115 secs
lola: 65879746 markings, 100137183 edges, 76961 markings/sec, 120 secs
lola: 66008341 markings, 100332645 edges, 25719 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))) AND (p10 <= 0)))) OR ((p111 <= 0) OR ((p112 <= 0) OR (p114 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))) AND (p10 <= 0)))) OR ((p111 <= 0) OR ((p112 <= 0) OR (p114 <= 0))))))
lola: processed formula length: 130
lola: 55 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: 3475025 markings, 5282005 edges, 695005 markings/sec, 0 secs
lola: 7061777 markings, 10733865 edges, 717350 markings/sec, 5 secs
lola: 10554375 markings, 16042600 edges, 698520 markings/sec, 10 secs
lola: 14091518 markings, 21419065 edges, 707429 markings/sec, 15 secs
lola: 17502341 markings, 26603519 edges, 682165 markings/sec, 20 secs
lola: 20814231 markings, 31637604 edges, 662378 markings/sec, 25 secs
lola: 24237339 markings, 36840719 edges, 684622 markings/sec, 30 secs
lola: 27786337 markings, 42235194 edges, 709800 markings/sec, 35 secs
lola: 31147837 markings, 47344685 edges, 672300 markings/sec, 40 secs
lola: 34575575 markings, 52554833 edges, 685548 markings/sec, 45 secs
lola: 38004453 markings, 57766731 edges, 685776 markings/sec, 50 secs
lola: 41296658 markings, 62770884 edges, 658441 markings/sec, 55 secs
lola: 44609841 markings, 67806923 edges, 662637 markings/sec, 60 secs
lola: 47862103 markings, 72750369 edges, 650452 markings/sec, 65 secs
lola: 51302197 markings, 77979298 edges, 688019 markings/sec, 70 secs
lola: 54389010 markings, 82685144 edges, 617363 markings/sec, 75 secs
lola: 54901146 markings, 83449707 edges, 102427 markings/sec, 80 secs
lola: 55579649 markings, 84481032 edges, 135701 markings/sec, 85 secs
lola: 57645181 markings, 87636010 edges, 413106 markings/sec, 90 secs
lola: 59152088 markings, 89911127 edges, 301381 markings/sec, 95 secs
lola: 61551335 markings, 93557989 edges, 479849 markings/sec, 100 secs
lola: 62569509 markings, 95105614 edges, 203635 markings/sec, 105 secs
lola: 62569509 markings, 95105614 edges, 0 markings/sec, 110 secs
lola: 62758631 markings, 95393078 edges, 37824 markings/sec, 115 secs
lola: 63585273 markings, 96649566 edges, 165328 markings/sec, 120 secs
lola: 66179501 markings, 100592795 edges, 518846 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p107))) AND X (X (G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p107)))
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 <= p107)))
lola: processed formula length: 19
lola: 55 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: 229 markings, 353 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((X (G ((1 <= p113))) AND ((1 <= p113) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))) AND (1 <= p88)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((X (G ((1 <= p113))) AND ((1 <= p113) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))) AND (1 <= p88)))
lola: processed formula length: 111
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F ((1 <= p68)) OR (p68 <= 0))) AND (X ((1 <= p90)) OR (p68 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F ((1 <= p68)) OR (p68 <= 0))) AND (X ((1 <= p90)) OR (p68 <= 0))))
lola: processed formula length: 75
lola: 55 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: 3719396 markings, 5653466 edges, 743879 markings/sec, 0 secs
lola: 7415029 markings, 11270809 edges, 739127 markings/sec, 5 secs
lola: 11075000 markings, 16833965 edges, 731994 markings/sec, 10 secs
lola: 14781487 markings, 22467823 edges, 741297 markings/sec, 15 secs
lola: 18417802 markings, 27995022 edges, 727263 markings/sec, 20 secs
lola: 21914257 markings, 33309648 edges, 699291 markings/sec, 25 secs
lola: 25508868 markings, 38773449 edges, 718922 markings/sec, 30 secs
lola: 29202444 markings, 44387675 edges, 738715 markings/sec, 35 secs
lola: 32932900 markings, 50057981 edges, 746091 markings/sec, 40 secs
lola: 36681816 markings, 55756304 edges, 749783 markings/sec, 45 secs
lola: 40419561 markings, 61437703 edges, 747549 markings/sec, 50 secs
lola: 43916215 markings, 66752610 edges, 699331 markings/sec, 55 secs
lola: 47431625 markings, 72096033 edges, 703082 markings/sec, 60 secs
lola: 51161395 markings, 77765294 edges, 745954 markings/sec, 65 secs
lola: 53820972 markings, 81809181 edges, 531915 markings/sec, 70 secs
lola: 56399316 markings, 85727373 edges, 515669 markings/sec, 75 secs
lola: 56500225 markings, 85880306 edges, 20182 markings/sec, 80 secs
lola: 56500225 markings, 85880306 edges, 0 markings/sec, 85 secs
lola: 56500225 markings, 85880306 edges, 0 markings/sec, 90 secs
lola: 56500225 markings, 85880306 edges, 0 markings/sec, 95 secs
lola: 57999583 markings, 88159324 edges, 299872 markings/sec, 100 secs
lola: 59703047 markings, 90756037 edges, 340693 markings/sec, 105 secs
lola: 62751659 markings, 95382492 edges, 609722 markings/sec, 110 secs
lola: 65811428 markings, 100039499 edges, 611954 markings/sec, 115 secs
lola: 66751123 markings, 101461680 edges, 187939 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p51) AND (1 <= p52) AND (1 <= p54)) U ((p1 <= 1) OR (p2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p51) AND (1 <= p52) AND (1 <= p54)) U ((p1 <= 1) OR (p2 <= 1))))
lola: processed formula length: 76
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p105 <= 0)) U (1 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p105 <= 0)) U (1 <= p105)))
lola: processed formula length: 35
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p83) U (3 <= p3)) AND (3 <= p3)) OR (G ((1 <= p55)) OR X ((1 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p83) U (3 <= p3)) AND (3 <= p3)) OR (G ((1 <= p55)) OR X ((1 <= p77)))))
lola: processed formula length: 84
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 1465 markings, 4210 edges
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F ((X (X (G ((1 <= p13)))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) OR ((1 <= p25) OR (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (X (G ((1 <= p13)))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) OR ((1 <= p25) OR (1 <= p25))))
lola: processed formula length: 113
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: subprocess 10 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p103) AND (1 <= p113))) AND ((1 <= p103) OR X (F (((1 <= p103) AND (1 <= p113)))))))) OR X (X (((1 <= p80) U (1 <= p108)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p103) AND (1 <= p113))) AND ((1 <= p103) OR X (F (((1 <= p103) AND (1 <= p113))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p103) AND (1 <= p113))) AND ((1 <= p103) OR X (F (((1 <= p103) AND (1 <= p113))))))))
lola: processed formula length: 102
lola: 55 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: add low 102
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 32 edges
lola: ========================================
lola: subprocess 11 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p80) U (1 <= p108))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p80) U (1 <= p108))))
lola: processed formula length: 34
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p58) AND (1 <= p100))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p58) AND (1 <= p100))))
lola: processed formula length: 36
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 1004 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p73)))
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 <= p73)))
lola: processed formula length: 18
lola: 55 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 101
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: ========================================
lola: subprocess 13 will run for 1506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 0))
lola: processed formula length: 13
lola: 55 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: 549 markings, 657 edges
lola: ========================================
lola: subprocess 14 will run for 3013 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((5 <= p4)) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((5 <= p4)) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))))
lola: processed formula length: 69
lola: 55 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: add low 102
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 13 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p88) U (X (X (G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))))) R (X (G (((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND G ((p88 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p88) U (X (X (G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))))) R (X (G (((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND G ((p88 <= 0)))))
lola: processed formula length: 145
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 37 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: 3864710 markings, 5874325 edges, 772942 markings/sec, 0 secs
lola: 7765363 markings, 11803312 edges, 780131 markings/sec, 5 secs
lola: 11613458 markings, 17652412 edges, 769619 markings/sec, 10 secs
lola: 15464875 markings, 23506571 edges, 770283 markings/sec, 15 secs
lola: 19041516 markings, 28943081 edges, 715328 markings/sec, 20 secs
lola: 22564532 markings, 34298058 edges, 704603 markings/sec, 25 secs
lola: 26227647 markings, 39865998 edges, 732623 markings/sec, 30 secs
lola: 29834876 markings, 45348969 edges, 721446 markings/sec, 35 secs
lola: 33425199 markings, 50806260 edges, 718065 markings/sec, 40 secs
lola: 37042995 markings, 56305303 edges, 723559 markings/sec, 45 secs
lola: 40595994 markings, 61705871 edges, 710600 markings/sec, 50 secs
lola: 44090703 markings, 67017833 edges, 698942 markings/sec, 55 secs
lola: 47534663 markings, 72252669 edges, 688792 markings/sec, 60 secs
lola: 51228704 markings, 77867601 edges, 738808 markings/sec, 65 secs
lola: 54405296 markings, 82697308 edges, 635318 markings/sec, 70 secs
lola: 57440006 markings, 87310858 edges, 606942 markings/sec, 75 secs
lola: 59298151 markings, 90133154 edges, 371629 markings/sec, 80 secs
lola: 62342167 markings, 94761049 edges, 608803 markings/sec, 85 secs
lola: 65078155 markings, 98933271 edges, 547198 markings/sec, 90 secs
lola: 66055977 markings, 100405056 edges, 195564 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))) AND (p10 <= 0)))) OR ((p111 <= 0) OR ((p112 <= 0) OR (p114 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((G (((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0))) AND (p10 <= 0)))) OR ((p111 <= 0) OR ((p112 <= 0) OR (p114 <= 0))))))
lola: processed formula length: 130
lola: 55 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: 3510144 markings, 5335391 edges, 702029 markings/sec, 0 secs
lola: 6935924 markings, 10542570 edges, 685156 markings/sec, 5 secs
lola: 10379434 markings, 15776695 edges, 688702 markings/sec, 10 secs
lola: 14009267 markings, 21294047 edges, 725967 markings/sec, 15 secs
lola: 17441294 markings, 26510731 edges, 686405 markings/sec, 20 secs
lola: 20881726 markings, 31740202 edges, 688086 markings/sec, 25 secs
lola: 24246404 markings, 36854504 edges, 672936 markings/sec, 30 secs
lola: 27829907 markings, 42301414 edges, 716701 markings/sec, 35 secs
lola: 31326387 markings, 47616064 edges, 699296 markings/sec, 40 secs
lola: 34735605 markings, 52798091 edges, 681844 markings/sec, 45 secs
lola: 38281823 markings, 58188350 edges, 709244 markings/sec, 50 secs
lola: 41663992 markings, 63329219 edges, 676434 markings/sec, 55 secs
lola: 45061984 markings, 68494186 edges, 679598 markings/sec, 60 secs
lola: 48469536 markings, 73673668 edges, 681510 markings/sec, 65 secs
lola: 51885799 markings, 78866392 edges, 683253 markings/sec, 70 secs
lola: 54578316 markings, 82960038 edges, 538503 markings/sec, 75 secs
lola: 56154943 markings, 85369768 edges, 315325 markings/sec, 80 secs
lola: 58096359 markings, 88307295 edges, 388283 markings/sec, 85 secs
lola: 60885755 markings, 92548630 edges, 557879 markings/sec, 90 secs
lola: 62648112 markings, 95225082 edges, 352471 markings/sec, 95 secs
lola: 64274195 markings, 97696737 edges, 325217 markings/sec, 100 secs
lola: 66358640 markings, 100865095 edges, 416889 markings/sec, 105 secs
lola: 66437223 markings, 100984554 edges, 15717 markings/sec, 110 secs
lola: 66444898 markings, 100996198 edges, 1535 markings/sec, 115 secs
lola: 66695966 markings, 101377832 edges, 50214 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((F ((F ((1 <= p68)) OR (p68 <= 0))) AND (X ((1 <= p90)) OR (p68 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F ((1 <= p68)) OR (p68 <= 0))) AND (X ((1 <= p90)) OR (p68 <= 0))))
lola: processed formula length: 75
lola: 55 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: 3736721 markings, 5679797 edges, 747344 markings/sec, 0 secs
lola: 7462663 markings, 11343213 edges, 745188 markings/sec, 5 secs
lola: 11176979 markings, 16988984 edges, 742863 markings/sec, 10 secs
lola: 14871153 markings, 22604115 edges, 738835 markings/sec, 15 secs
lola: 18452508 markings, 28047787 edges, 716271 markings/sec, 20 secs
lola: 22002075 markings, 33443132 edges, 709913 markings/sec, 25 secs
lola: 25658196 markings, 39000443 edges, 731224 markings/sec, 30 secs
lola: 29349330 markings, 44610962 edges, 738227 markings/sec, 35 secs
lola: 33101176 markings, 50313755 edges, 750369 markings/sec, 40 secs
lola: 36771226 markings, 55892229 edges, 734010 markings/sec, 45 secs
lola: 40451067 markings, 61485583 edges, 735968 markings/sec, 50 secs
lola: 44049885 markings, 66955799 edges, 719764 markings/sec, 55 secs
lola: 47597132 markings, 72347622 edges, 709449 markings/sec, 60 secs
lola: 51370464 markings, 78083068 edges, 754666 markings/sec, 65 secs
lola: 53942591 markings, 81992722 edges, 514425 markings/sec, 70 secs
lola: 55684496 markings, 84641366 edges, 348381 markings/sec, 75 secs
lola: 58146857 markings, 88383962 edges, 492472 markings/sec, 80 secs
lola: 59406881 markings, 90298443 edges, 252005 markings/sec, 85 secs
lola: 59406881 markings, 90298443 edges, 0 markings/sec, 90 secs
lola: 59406881 markings, 90298443 edges, 0 markings/sec, 95 secs
lola: 59454249 markings, 90370430 edges, 9474 markings/sec, 100 secs
lola: 62179228 markings, 94513497 edges, 544996 markings/sec, 105 secs
lola: 65100003 markings, 98951979 edges, 584155 markings/sec, 110 secs
lola: 66785312 markings, 101513647 edges, 337062 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown unknown no no no no no unknown no no yes no no no
lola:
preliminary result: no unknown unknown no no no no no unknown no no yes no no no
lola: memory consumption: 3408 KB
lola: time consumption: 1178 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-025025"
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-025025, 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-158987938500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025025.tgz
mv RefineWMG-PT-025025 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;