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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15798.140 3600000.00 658607.00 229597.00 TFFF?FFFFTFF??FF 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-158987938400058.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-010011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:00 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.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 24K 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-010011-00
FORMULA_NAME RefineWMG-PT-010011-01
FORMULA_NAME RefineWMG-PT-010011-02
FORMULA_NAME RefineWMG-PT-010011-03
FORMULA_NAME RefineWMG-PT-010011-04
FORMULA_NAME RefineWMG-PT-010011-05
FORMULA_NAME RefineWMG-PT-010011-06
FORMULA_NAME RefineWMG-PT-010011-07
FORMULA_NAME RefineWMG-PT-010011-08
FORMULA_NAME RefineWMG-PT-010011-09
FORMULA_NAME RefineWMG-PT-010011-10
FORMULA_NAME RefineWMG-PT-010011-11
FORMULA_NAME RefineWMG-PT-010011-12
FORMULA_NAME RefineWMG-PT-010011-13
FORMULA_NAME RefineWMG-PT-010011-14
FORMULA_NAME RefineWMG-PT-010011-15

=== Now, execution of the tool begins

BK_START 1591223875148

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:37:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 22:37:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:37:57] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-06-03 22:37:57] [INFO ] Transformed 54 places.
[2020-06-03 22:37:57] [INFO ] Transformed 43 transitions.
[2020-06-03 22:37:57] [INFO ] Parsed PT model containing 54 places and 43 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=1176 ) properties seen :[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, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:37:57] [INFO ] Computed 22 place invariants in 3 ms
[2020-06-03 22:37:57] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2020-06-03 22:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-03 22:37:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2020-06-03 22:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 22:37:57] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:57] [INFO ] Added : 21 causal constraints over 5 iterations in 52 ms. Result :sat
[2020-06-03 22:37:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 22:37:57] [INFO ] Flatten gal took : 38 ms
FORMULA RefineWMG-PT-010011-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:37:57] [INFO ] Flatten gal took : 6 ms
[2020-06-03 22:37:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-03 22:37:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-010011 @ 3570 seconds

FORMULA RefineWMG-PT-010011-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA RefineWMG-PT-010011-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA RefineWMG-PT-010011-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2508
rslt: Output for LTLFireability @ RefineWMG-PT-010011

{
"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 22:37:57 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))) AND G ((G ((1 <= p38)) OR (1 <= p38))))))",
"processed_size": 99,
"rewrites": 98
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))",
"processed_size": 98,
"rewrites": 98
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 324
},
"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 <= p5)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34)))",
"processed_size": 60,
"rewrites": 98
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X ((((p18 <= 0) R F ((p7 <= 0))) OR F (((1 <= p7) AND (1 <= p18))))))",
"processed_size": 72,
"rewrites": 98
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((X (G ((p53 <= 0))) R (X (((p12 <= 0) R (p53 <= 0))) AND (p52 <= 0))))))",
"processed_size": 81,
"rewrites": 98
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 425
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((1 <= p23))",
"processed_size": 14,
"rewrites": 98
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"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 ((p42 <= 0)))",
"processed_size": 18,
"rewrites": 98
},
"result":
{
"edges": 12,
"markings": 12,
"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": 754
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X ((G (((1 <= p47) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR X (G (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))))",
"processed_size": 127,
"rewrites": 98
},
"result":
{
"edges": 196,
"markings": 135,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1006
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p47 <= 0) OR (p35 <= 0))))",
"processed_size": 35,
"rewrites": 98
},
"result":
{
"edges": 213,
"markings": 144,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((F ((1 <= p8)) AND (p4 <= 4)) OR G ((1 <= p20))))",
"processed_size": 53,
"rewrites": 98
},
"result":
{
"edges": 7,
"markings": 7,
"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": 3018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G ((1 <= p50))) AND ((p8 <= 0) R (p10 <= 0))))",
"processed_size": 53,
"rewrites": 98
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"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": 3088,
"runtime": 1062.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(G(**)) AND (* R *))) : F(G((X(F(*)) AND G((G(**) OR *))))) : (F(G(**)) OR (X(**) U **)) : X(X(X(X((X(F(**)) AND G(*)))))) : X(X(((* R F(*)) OR F(*)))) : G(F(*)) : X(X(G((X(G(*)) R (X((* R *)) AND *))))) : ((X(F(**)) U **) AND X(**)) : X(F(*)) : G(F((X((* OR *)) OR (* OR (* OR *))))) : X(G((F((G(*) AND X(*))) AND **))) : F(((F(**) AND **) OR G(**))) : X(X((G(**) OR X(G(*)))))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "no no no unknown no no no no no unknown unknown no no ",
"value": "no no no unknown no no no no no unknown unknown 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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: F ((F (G (X ((1 <= p50)))) AND NOT(((1 <= p8) U (1 <= p10))))) : F (NOT(F (G (F ((X (G (((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR F ((NOT(G ((1 <= p38))) AND (p38 <= 0))))))))) : (F (G ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52))))) OR (X ((1 <= p5)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) : X (X (X ((X (F (X ((3 <= p3)))) AND NOT(F (X (((1 <= p0) AND (1 <= p51) AND (1 <= p52))))))))) : NOT(X (X ((((1 <= p18) U G ((1 <= p7))) AND G (((p7 <= 0) OR (p18 <= 0))))))) : X (G (X (F (NOT(X (((1 <= p47) AND (1 <= p35)))))))) : X (X (G (NOT((X (F ((1 <= p53))) U (X (((1 <= p12) U (1 <= p53))) OR (1 <= p52))))))) : ((X (F ((p53 <= 0))) U (p53 <= 0)) AND X ((1 <= p23))) : F (NOT(X ((1 <= p42)))) : NOT(X (X (G (((1 <= p27) U F (G (((((X (((1 <= p36) AND (1 <= p37) AND (1 <= p39))) AND X ((1 <= p30))) AND (1 <= p36)) AND (1 <= p37)) AND (1 <= p39))))))))) : X ((F (NOT(X (F (X (G ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) OR X ((1 <= p13))))))))) AND G ((1 <= p27)))) : (F ((F ((1 <= p8)) AND (p4 <= 4))) OR G (F (X (G ((1 <= p20)))))) : X (X ((G (((1 <= p47) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR G (NOT(X (F (((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:519
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:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))) AND G ((G ((1 <= p38)) OR (1 <= p38))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))) AND G ((G ((1 <= p38)) OR (1 <= p38))))))
lola: processed formula length: 99
lola: 98 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52))))) OR (X ((1 <= p5)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34))))
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 (G ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))
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 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))
lola: processed formula length: 98
lola: 98 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 41
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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p5)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((1 <= p5)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34)))
lola: processed formula length: 60
lola: 98 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: 12 markings, 12 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: X (X (X (X ((X (F ((3 <= p3))) AND G (((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X ((X (F ((3 <= p3))) AND G (((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0))))))))
lola: processed formula length: 85
lola: 98 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5117417 markings, 7908713 edges, 1023483 markings/sec, 0 secs
lola: 10087416 markings, 15589625 edges, 994000 markings/sec, 5 secs
lola: 14960778 markings, 23121184 edges, 974672 markings/sec, 10 secs
lola: 19837540 markings, 30657996 edges, 975352 markings/sec, 15 secs
lola: 24647987 markings, 38092318 edges, 962089 markings/sec, 20 secs
lola: 29399624 markings, 45435767 edges, 950327 markings/sec, 25 secs
lola: 34264831 markings, 52954714 edges, 973041 markings/sec, 30 secs
lola: 39125253 markings, 60466270 edges, 972084 markings/sec, 35 secs
lola: 43854201 markings, 67774645 edges, 945790 markings/sec, 40 secs
lola: 48528780 markings, 74998998 edges, 934916 markings/sec, 45 secs
lola: 53142892 markings, 82129905 edges, 922822 markings/sec, 50 secs
lola: 57799269 markings, 89326122 edges, 931275 markings/sec, 55 secs
lola: 62382075 markings, 96408640 edges, 916561 markings/sec, 60 secs
lola: 66953809 markings, 103474046 edges, 914347 markings/sec, 65 secs
lola: 71496883 markings, 110495166 edges, 908615 markings/sec, 70 secs
lola: 73238784 markings, 113187650 edges, 348380 markings/sec, 75 secs
lola: 74679137 markings, 115413184 edges, 288071 markings/sec, 80 secs
lola: 76889711 markings, 118830944 edges, 442115 markings/sec, 85 secs
lola: 79400343 markings, 122712374 edges, 502126 markings/sec, 90 secs
lola: 82743609 markings, 127876468 edges, 668653 markings/sec, 95 secs
lola: 84968551 markings, 131315009 edges, 444988 markings/sec, 100 secs
lola: 88426550 markings, 136676825 edges, 691600 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p18 <= 0) R F ((p7 <= 0))) OR F (((1 <= p7) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p18 <= 0) R F ((p7 <= 0))) OR F (((1 <= p7) AND (1 <= p18))))))
lola: processed formula length: 72
lola: 98 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (G ((p53 <= 0))) R (X (((p12 <= 0) R (p53 <= 0))) AND (p52 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (G ((p53 <= 0))) R (X (((p12 <= 0) R (p53 <= 0))) AND (p52 <= 0))))))
lola: processed formula length: 81
lola: 98 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((p53 <= 0))) U (p53 <= 0)) AND X ((1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p23))
lola: processed formula length: 14
lola: 98 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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p42 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p42 <= 0)))
lola: processed formula length: 18
lola: 98 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) OR (p30 <= 0))) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) OR (p30 <= 0))) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))))
lola: processed formula length: 118
lola: 98 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: 5239281 markings, 8097052 edges, 1047856 markings/sec, 0 secs
lola: 10371167 markings, 16028155 edges, 1026377 markings/sec, 5 secs
lola: 15375253 markings, 23761729 edges, 1000817 markings/sec, 10 secs
lola: 20446157 markings, 31598587 edges, 1014181 markings/sec, 15 secs
lola: 25508290 markings, 39421877 edges, 1012427 markings/sec, 20 secs
lola: 30517513 markings, 47163407 edges, 1001845 markings/sec, 25 secs
lola: 35733910 markings, 55225113 edges, 1043279 markings/sec, 30 secs
lola: 40889117 markings, 63193231 edges, 1031041 markings/sec, 35 secs
lola: 45989757 markings, 71075052 edges, 1020128 markings/sec, 40 secs
lola: 50944659 markings, 78732630 edges, 990980 markings/sec, 45 secs
lola: 55804765 markings, 86243699 edges, 972021 markings/sec, 50 secs
lola: 60827552 markings, 94006192 edges, 1004557 markings/sec, 55 secs
lola: 65693852 markings, 101526848 edges, 973260 markings/sec, 60 secs
lola: 70491623 markings, 108941577 edges, 959554 markings/sec, 65 secs
lola: 72208517 markings, 111594969 edges, 343379 markings/sec, 70 secs
lola: 74962234 markings, 115863229 edges, 550743 markings/sec, 75 secs
lola: 78485416 markings, 121295620 edges, 704636 markings/sec, 80 secs
lola: 80500681 markings, 124410126 edges, 403053 markings/sec, 85 secs
lola: 80500681 markings, 124410126 edges, 0 markings/sec, 90 secs
lola: 81498113 markings, 125951601 edges, 199486 markings/sec, 95 secs
lola: 82645688 markings, 127725135 edges, 229515 markings/sec, 100 secs
lola: 86725748 markings, 134030681 edges, 816012 markings/sec, 105 secs
lola: 86831339 markings, 134193855 edges, 21118 markings/sec, 110 secs
lola: 87557243 markings, 135315715 edges, 145181 markings/sec, 115 secs
lola: 88783629 markings, 137211036 edges, 245277 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND X ((p13 <= 0)))) AND (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND X ((p13 <= 0)))) AND (1 <= p27))))
lola: processed formula length: 96
lola: 98 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: 5165602 markings, 7983179 edges, 1033120 markings/sec, 0 secs
lola: 10219244 markings, 15793350 edges, 1010728 markings/sec, 5 secs
lola: 15137338 markings, 23394046 edges, 983619 markings/sec, 10 secs
lola: 20053080 markings, 30991097 edges, 983148 markings/sec, 15 secs
lola: 24904104 markings, 38488141 edges, 970205 markings/sec, 20 secs
lola: 29779957 markings, 46023546 edges, 975171 markings/sec, 25 secs
lola: 34831841 markings, 53831004 edges, 1010377 markings/sec, 30 secs
lola: 39863353 markings, 61606975 edges, 1006302 markings/sec, 35 secs
lola: 44798926 markings, 69234681 edges, 987115 markings/sec, 40 secs
lola: 49609125 markings, 76668621 edges, 962040 markings/sec, 45 secs
lola: 54374104 markings, 84032687 edges, 952996 markings/sec, 50 secs
lola: 59176319 markings, 91454292 edges, 960443 markings/sec, 55 secs
lola: 63884306 markings, 98730268 edges, 941597 markings/sec, 60 secs
lola: 68555127 markings, 105948865 edges, 934164 markings/sec, 65 secs
lola: 71863862 markings, 111062311 edges, 661747 markings/sec, 70 secs
lola: 72589250 markings, 112183492 edges, 145078 markings/sec, 75 secs
lola: 76482861 markings, 118201436 edges, 778722 markings/sec, 80 secs
lola: 76566530 markings, 118330076 edges, 16734 markings/sec, 85 secs
lola: 76566530 markings, 118330076 edges, 0 markings/sec, 90 secs
lola: 76566530 markings, 118330076 edges, 0 markings/sec, 95 secs
lola: 76566530 markings, 118330076 edges, 0 markings/sec, 100 secs
lola: 76566530 markings, 118330076 edges, 0 markings/sec, 105 secs
lola: 76566530 markings, 118330076 edges, 0 markings/sec, 110 secs
lola: 79223721 markings, 122436633 edges, 531438 markings/sec, 115 secs
lola: 82692973 markings, 127798208 edges, 693850 markings/sec, 120 secs
lola: 86150964 markings, 133142376 edges, 691598 markings/sec, 125 secs
lola: 86276922 markings, 133337028 edges, 25192 markings/sec, 130 secs
lola: 86276922 markings, 133337028 edges, 0 markings/sec, 135 secs
lola: 86276922 markings, 133337028 edges, 0 markings/sec, 140 secs
lola: 86276922 markings, 133337028 edges, 0 markings/sec, 145 secs
lola: 88038343 markings, 136059236 edges, 352284 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p47) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR X (G (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p47) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR X (G (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))))
lola: processed formula length: 127
lola: 98 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: 135 markings, 196 edges
lola: ========================================
lola: subprocess 10 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p47 <= 0) OR (p35 <= 0))))
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 (((p47 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 98 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: 144 markings, 213 edges
lola: ========================================
lola: subprocess 11 will run for 1509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((F ((1 <= p8)) AND (p4 <= 4)) OR G ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((F ((1 <= p8)) AND (p4 <= 4)) OR G ((1 <= p20))))
lola: processed formula length: 53
lola: 98 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((1 <= p50))) AND ((p8 <= 0) R (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((1 <= p50))) AND ((p8 <= 0) R (p10 <= 0))))
lola: processed formula length: 53
lola: 98 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (X (X ((X (F ((3 <= p3))) AND G (((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X ((X (F ((3 <= p3))) AND G (((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0))))))))
lola: processed formula length: 85
lola: 98 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5179938 markings, 8005341 edges, 1035988 markings/sec, 0 secs
lola: 10252443 markings, 15844661 edges, 1014501 markings/sec, 5 secs
lola: 15161976 markings, 23432121 edges, 981907 markings/sec, 10 secs
lola: 20078900 markings, 31031003 edges, 983385 markings/sec, 15 secs
lola: 25125212 markings, 38829852 edges, 1009262 markings/sec, 20 secs
lola: 29943952 markings, 46276999 edges, 963748 markings/sec, 25 secs
lola: 34967207 markings, 54040210 edges, 1004651 markings/sec, 30 secs
lola: 39932159 markings, 61713311 edges, 992990 markings/sec, 35 secs
lola: 44772614 markings, 69194009 edges, 968091 markings/sec, 40 secs
lola: 49531834 markings, 76549167 edges, 951844 markings/sec, 45 secs
lola: 54246809 markings, 83835962 edges, 942995 markings/sec, 50 secs
lola: 58970055 markings, 91135518 edges, 944649 markings/sec, 55 secs
lola: 63648478 markings, 98365807 edges, 935685 markings/sec, 60 secs
lola: 68261345 markings, 105494780 edges, 922573 markings/sec, 65 secs
lola: 72304260 markings, 111743127 edges, 808583 markings/sec, 70 secs
lola: 76127968 markings, 117664325 edges, 764742 markings/sec, 75 secs
lola: 80047438 markings, 123745724 edges, 783894 markings/sec, 80 secs
lola: 80210739 markings, 123962031 edges, 32660 markings/sec, 85 secs
lola: 80210739 markings, 123962031 edges, 0 markings/sec, 90 secs
lola: 80210739 markings, 123962031 edges, 0 markings/sec, 95 secs
lola: 82201929 markings, 127039325 edges, 398238 markings/sec, 100 secs
lola: 84102993 markings, 129977333 edges, 380213 markings/sec, 105 secs
lola: 86152704 markings, 133145062 edges, 409942 markings/sec, 110 secs
lola: 86152704 markings, 133145062 edges, 0 markings/sec, 115 secs
lola: 86919719 markings, 134330446 edges, 153403 markings/sec, 120 secs
lola: 88518250 markings, 136800910 edges, 319706 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) OR (p30 <= 0))) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) OR (p30 <= 0))) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))))
lola: processed formula length: 118
lola: 98 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: 4955893 markings, 7659089 edges, 991179 markings/sec, 0 secs
lola: 9819209 markings, 15175116 edges, 972663 markings/sec, 5 secs
lola: 14618010 markings, 22591442 edges, 959760 markings/sec, 10 secs
lola: 19520796 markings, 30168473 edges, 980557 markings/sec, 15 secs
lola: 24445840 markings, 37779909 edges, 985009 markings/sec, 20 secs
lola: 29396496 markings, 45430935 edges, 990131 markings/sec, 25 secs
lola: 34443755 markings, 53231226 edges, 1009452 markings/sec, 30 secs
lola: 39540019 markings, 61107271 edges, 1019253 markings/sec, 35 secs
lola: 44420188 markings, 68649360 edges, 976034 markings/sec, 40 secs
lola: 49286138 markings, 76169466 edges, 973190 markings/sec, 45 secs
lola: 53998813 markings, 83452689 edges, 942535 markings/sec, 50 secs
lola: 58805394 markings, 90881040 edges, 961316 markings/sec, 55 secs
lola: 63540564 markings, 98199027 edges, 947034 markings/sec, 60 secs
lola: 68095797 markings, 105238937 edges, 911047 markings/sec, 65 secs
lola: 72155992 markings, 111514365 edges, 812039 markings/sec, 70 secs
lola: 74779763 markings, 115568700 edges, 524754 markings/sec, 75 secs
lola: 77338277 markings, 119522773 edges, 511703 markings/sec, 80 secs
lola: 80204868 markings, 123952956 edges, 573318 markings/sec, 85 secs
lola: 80281297 markings, 124071069 edges, 15286 markings/sec, 90 secs
lola: 80281297 markings, 124071069 edges, 0 markings/sec, 95 secs
lola: 80281297 markings, 124071069 edges, 0 markings/sec, 100 secs
lola: 82531361 markings, 127548449 edges, 450013 markings/sec, 105 secs
lola: 84277248 markings, 130246636 edges, 349177 markings/sec, 110 secs
lola: 84277248 markings, 130246636 edges, 0 markings/sec, 115 secs
lola: 84277248 markings, 130246636 edges, 0 markings/sec, 120 secs
lola: 84299768 markings, 130281432 edges, 4504 markings/sec, 125 secs
lola: 87851093 markings, 135769844 edges, 710265 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND X ((p13 <= 0)))) AND (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) AND X ((p13 <= 0)))) AND (1 <= p27))))
lola: processed formula length: 96
lola: 98 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: 5200043 markings, 8036402 edges, 1040009 markings/sec, 0 secs
lola: 10294353 markings, 15909430 edges, 1018862 markings/sec, 5 secs
lola: 15225150 markings, 23529753 edges, 986159 markings/sec, 10 secs
lola: 20102893 markings, 31068077 edges, 975549 markings/sec, 15 secs
lola: 24989395 markings, 38619947 edges, 977300 markings/sec, 20 secs
lola: 29762089 markings, 45995933 edges, 954539 markings/sec, 25 secs
lola: 34793303 markings, 53771448 edges, 1006243 markings/sec, 30 secs
lola: 39838089 markings, 61567928 edges, 1008957 markings/sec, 35 secs
lola: 44728917 markings, 69126478 edges, 978166 markings/sec, 40 secs
lola: 49570532 markings, 76608978 edges, 968323 markings/sec, 45 secs
lola: 54281104 markings, 83888961 edges, 942114 markings/sec, 50 secs
lola: 58995187 markings, 91174351 edges, 942817 markings/sec, 55 secs
lola: 63632525 markings, 98341153 edges, 927468 markings/sec, 60 secs
lola: 68203997 markings, 105406154 edges, 914294 markings/sec, 65 secs
lola: 72718050 markings, 112384599 edges, 902811 markings/sec, 70 secs
lola: 75542017 markings, 116747581 edges, 564793 markings/sec, 75 secs
lola: 79527556 markings, 122906367 edges, 797108 markings/sec, 80 secs
lola: 79683918 markings, 123147850 edges, 31272 markings/sec, 85 secs
lola: 79683918 markings, 123147850 edges, 0 markings/sec, 90 secs
lola: 79683918 markings, 123147850 edges, 0 markings/sec, 95 secs
lola: 79726444 markings, 123213577 edges, 8505 markings/sec, 100 secs
lola: 81766554 markings, 126366464 edges, 408022 markings/sec, 105 secs
lola: 81766554 markings, 126366464 edges, 0 markings/sec, 110 secs
lola: 81766554 markings, 126366464 edges, 0 markings/sec, 115 secs
lola: 81781673 markings, 126389836 edges, 3024 markings/sec, 120 secs
lola: 84840552 markings, 131117192 edges, 611776 markings/sec, 125 secs
lola: 87694651 markings, 135528068 edges, 570820 markings/sec, 130 secs
lola: 87824278 markings, 135728401 edges, 25925 markings/sec, 135 secs
lola: 87824278 markings, 135728401 edges, 0 markings/sec, 140 secs
lola: 87824278 markings, 135728401 edges, 0 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no unknown unknown no no
lola:
preliminary result: no no no unknown no no no no no unknown unknown no no
lola: memory consumption: 3088 KB
lola: time consumption: 1062 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-010011"
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-010011, 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-158987938400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 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 ;