Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900106.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DNAwalker-PT-04track28LL, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 20:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 06:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 108K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DNAwalker-PT-04track28LL-00
FORMULA_NAME DNAwalker-PT-04track28LL-01
FORMULA_NAME DNAwalker-PT-04track28LL-02
FORMULA_NAME DNAwalker-PT-04track28LL-03
FORMULA_NAME DNAwalker-PT-04track28LL-04
FORMULA_NAME DNAwalker-PT-04track28LL-05
FORMULA_NAME DNAwalker-PT-04track28LL-06
FORMULA_NAME DNAwalker-PT-04track28LL-07
FORMULA_NAME DNAwalker-PT-04track28LL-08
FORMULA_NAME DNAwalker-PT-04track28LL-09
FORMULA_NAME DNAwalker-PT-04track28LL-10
FORMULA_NAME DNAwalker-PT-04track28LL-11
FORMULA_NAME DNAwalker-PT-04track28LL-12
FORMULA_NAME DNAwalker-PT-04track28LL-13
FORMULA_NAME DNAwalker-PT-04track28LL-14
FORMULA_NAME DNAwalker-PT-04track28LL-15

=== Now, execution of the tool begins

BK_START 1591203165382

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:52:47] [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 16:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:52:47] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-03 16:52:47] [INFO ] Transformed 34 places.
[2020-06-03 16:52:47] [INFO ] Transformed 250 transitions.
[2020-06-03 16:52:47] [INFO ] Parsed PT model containing 34 places and 250 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6379 resets, run finished after 402 ms. (steps per millisecond=248 ) properties seen :[1, 0, 1, 1, 1, 0, 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, 0, 1, 1]
[2020-06-03 16:52:48] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2020-06-03 16:52:48] [INFO ] Computed 0 place invariants in 7 ms
[2020-06-03 16:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-06-03 16:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Nat]Absence check using state equation in 185 ms returned unsat
[2020-06-03 16:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Real]Absence check using state equation in 88 ms returned unsat
[2020-06-03 16:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 16:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Nat]Absence check using state equation in 173 ms returned unsat
[2020-06-03 16:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-03 16:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:49] [INFO ] [Nat]Absence check using state equation in 145 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 16:52:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 16:52:49] [INFO ] Flatten gal took : 51 ms
FORMULA DNAwalker-PT-04track28LL-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:52:49] [INFO ] Flatten gal took : 15 ms
[2020-06-03 16:52:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-03 16:52:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DNAwalker-PT-04track28LL @ 3570 seconds

FORMULA DNAwalker-PT-04track28LL-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2366
rslt: Output for LTLFireability @ DNAwalker-PT-04track28LL

{
"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 16:52:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G (((1 <= p10) AND (2 <= p26))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((X (X (((p14 <= 0) OR (p21 <= 1)))) U G (((1 <= p14) AND (2 <= p21)))) OR (X (F (((p21 <= 1)))) AND (2 <= p21))))",
"processed_size": 118,
"rewrites": 63
},
"result":
{
"edges": 121,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((2 <= p2) AND (1 <= p12))))",
"processed_size": 34,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 289
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F (((2 <= p15) AND (1 <= p16))) U G (((p26 <= 1))))",
"processed_size": 52,
"rewrites": 63
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"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": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((1 <= p4) AND (2 <= p6)))",
"processed_size": 29,
"rewrites": 63
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 289
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (X (G (((2 <= p29) AND (1 <= p31))))) OR (G (((1 <= p5) AND (2 <= p14))) OR F (((1 <= p5) AND (2 <= p14))))))",
"processed_size": 115,
"rewrites": 63
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F ((F (((1 <= p7) AND (2 <= p14))) OR ((2 <= p5) AND (1 <= p19)))) AND G (((p5 <= 0) OR (p21 <= 1)))))",
"processed_size": 107,
"rewrites": 63
},
"result":
{
"edges": 14341578,
"markings": 2176906,
"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": 361
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p21 <= 1))",
"processed_size": 12,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 412
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((p33 <= 1) R X (((p21 <= 1)))) AND (((2 <= p12) AND (1 <= p13)) OR (1 <= p9))))",
"processed_size": 85,
"rewrites": 63
},
"result":
{
"edges": 245,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 412
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (X (G (((1 <= p13) AND (2 <= p26)))))",
"processed_size": 39,
"rewrites": 63
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "X (F ((((2 <= p26) AND (1 <= p31) AND ((p4 <= 0) OR (p10 <= 1))) OR (p4 <= 0) OR (p10 <= 1))))",
"processed_size": 97,
"rewrites": 63
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 577
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p2) AND (1 <= p3))))",
"processed_size": 33,
"rewrites": 63
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 722
},
"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 (((p13 <= 0) OR (p24 <= 1))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 222373694,
"markings": 62495245,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 788
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 6,
"G": 3,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 3,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6))))))) AND (F ((1 <= p20)) OR (F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6)))))))))",
"processed_size": 267,
"rewrites": 63
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((2 <= p25) AND (1 <= p31)) U (((2 <= p6) AND (1 <= p14)) OR (G (((p13 <= 1) OR (p31 <= 0))) AND F (((2 <= p6) AND (1 <= p14))))))",
"processed_size": 132,
"rewrites": 63
},
"result":
{
"edges": 124,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 2366
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((F (((2 <= p26) AND (1 <= p31))) AND (F (((1 <= p4) AND (2 <= p6))) AND ((2 <= p12) AND (1 <= p25))))))",
"processed_size": 109,
"rewrites": 63
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 41408,
"runtime": 1204.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : X(((X(X(*)) U G(**)) OR (X(F(**)) AND **))) : G(F(*)) : G((F((F(**) OR (** OR (G(**) AND F(**))))) AND (F(**) OR (F(**) OR (** OR (G(**) AND F(**))))))) : ((F(**) U G(**)) OR (G(F(**)) OR X(**))) : F((X(X(G(**))) OR (G(**) OR F(**)))) : X((F((F(**) OR **)) AND G(*))) : (X(((* R X(*)) AND *)) AND **) : X(X(G(**))) : F(G(**)) : G(F((F(**) AND (F(**) AND (** AND **))))) : (** U (** OR (G(*) AND F(**)))) : X(F(*))"
},
"net":
{
"arcs": 728,
"conflict_clusters": 7,
"places": 34,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 250
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no no yes ",
"value": "no no yes no no no no no no no no no yes "
},
"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: 284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1088
lola: finding significant places
lola: 34 places, 250 transitions, 34 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: G (X (((1 <= p10) AND (2 <= p26)))) : X (((X (NOT(X (((1 <= p14) AND (2 <= p21))))) U G (((1 <= p14) AND (2 <= p21)))) OR (X (F (((p21 <= 1)))) AND (2 <= p21)))) : X (G ((((p1 <= 0) OR (p4 <= 1)) U NOT(F (G (((1 <= p13) AND (2 <= p24)))))))) : G ((F ((1 <= p20)) U (F (((2 <= p3) AND (1 <= p6))) OR (G ((1 <= p20)) U ((2 <= p3) AND (1 <= p6)))))) : (((F (((2 <= p15) AND (1 <= p16))) U G (((p26 <= 1)))) OR (((2 <= p2) AND (1 <= p12)) U G (F (((2 <= p2) AND (1 <= p12)))))) OR X (((1 <= p4) AND (2 <= p6)))) : F (((X (G (X (((2 <= p29) AND (1 <= p31))))) OR G (((1 <= p5) AND (2 <= p14)))) OR F (((1 <= p5) AND (2 <= p14))))) : (X (F ((F (((1 <= p7) AND (2 <= p14))) OR ((2 <= p5) AND (1 <= p19))))) AND G (NOT(F (X (((1 <= p5) AND (2 <= p21))))))) : (NOT(X ((((2 <= p33) U X (((2 <= p21)))) OR (((p12 <= 1) OR (p13 <= 0)) AND (p9 <= 0))))) AND ((p21 <= 1))) : G (X (X (G (((1 <= p13) AND (2 <= p26)))))) : F (G (NOT(F (NOT(X (X (((2 <= p2) AND (1 <= p3))))))))) : G (F (X ((((F (((2 <= p26) AND (1 <= p31))) AND F (((1 <= p4) AND (2 <= p6)))) AND (2 <= p12)) AND (1 <= p25))))) : (((2 <= p25) AND (1 <= p31)) U (G (NOT(F (((2 <= p13) AND (1 <= p31))))) U ((2 <= p6) AND (1 <= p14)))) : NOT(G (X ((((p26 <= 1) OR (p31 <= 0) OR ((1 <= p4) AND (2 <= p10))) AND (1 <= p4) AND (2 <= p10)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p10) AND (2 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p10) AND (2 <= p26))))
lola: processed formula length: 35
lola: 63 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (X (((p14 <= 0) OR (p21 <= 1)))) U G (((1 <= p14) AND (2 <= p21)))) OR (X (F (((p21 <= 1)))) AND (2 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (X (((p14 <= 0) OR (p21 <= 1)))) U G (((1 <= p14) AND (2 <= p21)))) OR (X (F (((p21 <= 1)))) AND (2 <= p21))))
lola: processed formula length: 118
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 119 markings, 121 edges
lola: ========================================
lola: subprocess 2 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((2 <= p15) AND (1 <= p16))) U G (((p26 <= 1)))) OR (G (F (((2 <= p2) AND (1 <= p12)))) OR X (((1 <= p4) AND (2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((2 <= p2) AND (1 <= p12))))
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 (((2 <= p2) AND (1 <= p12))))
lola: processed formula length: 34
lola: 63 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((2 <= p15) AND (1 <= p16))) U G (((p26 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((2 <= p15) AND (1 <= p16))) U G (((p26 <= 1))))
lola: processed formula length: 52
lola: 63 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p4) AND (2 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p4) AND (2 <= p6)))
lola: processed formula length: 29
lola: 63 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (G (((2 <= p29) AND (1 <= p31))))) OR (G (((1 <= p5) AND (2 <= p14))) OR F (((1 <= p5) AND (2 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G (((2 <= p29) AND (1 <= p31))))) OR (G (((1 <= p5) AND (2 <= p14))) OR F (((1 <= p5) AND (2 <= p14))))))
lola: processed formula length: 115
lola: 63 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((F (((1 <= p7) AND (2 <= p14))) OR ((2 <= p5) AND (1 <= p19)))) AND G (((p5 <= 0) OR (p21 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((F (((1 <= p7) AND (2 <= p14))) OR ((2 <= p5) AND (1 <= p19)))) AND G (((p5 <= 0) OR (p21 <= 1)))))
lola: processed formula length: 107
lola: 63 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: 1241177 markings, 8106675 edges, 248235 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2176906 markings, 14341578 edges
lola: ========================================
lola: subprocess 5 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p33 <= 1) R X (((p21 <= 1)))) AND (((2 <= p12) AND (1 <= p13)) OR (1 <= p9)))) AND ((p21 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p21 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p21 <= 1))
lola: processed formula length: 12
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p33 <= 1) R X (((p21 <= 1)))) AND (((2 <= p12) AND (1 <= p13)) OR (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p33 <= 1) R X (((p21 <= 1)))) AND (((2 <= p12) AND (1 <= p13)) OR (1 <= p9))))
lola: processed formula length: 85
lola: 63 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: 165 markings, 245 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p13) AND (2 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p13) AND (2 <= p26)))))
lola: processed formula length: 39
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((2 <= p26) AND (1 <= p31) AND ((p4 <= 0) OR (p10 <= 1))) OR (p4 <= 0) OR (p10 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((2 <= p26) AND (1 <= p31) AND ((p4 <= 0) OR (p10 <= 1))) OR (p4 <= 0) OR (p10 <= 1))))
lola: processed formula length: 97
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p2) AND (1 <= p3))))
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 (((2 <= p2) AND (1 <= p3))))
lola: processed formula length: 33
lola: 63 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: 11 markings, 12 edges
lola: subprocess 9 will run for 722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p13 <= 0) OR (p24 <= 1))))
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 (((p13 <= 0) OR (p24 <= 1))))
lola: processed formula length: 35
lola: 63 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: ========================================
lola: 1007541 markings, 2657880 edges, 201508 markings/sec, 0 secs
lola: 1846131 markings, 4942669 edges, 167718 markings/sec, 5 secs
lola: 2696123 markings, 7460871 edges, 169998 markings/sec, 10 secs
lola: 3592269 markings, 10137129 edges, 179229 markings/sec, 15 secs
lola: 4494197 markings, 12808825 edges, 180386 markings/sec, 20 secs
lola: 5263473 markings, 15137799 edges, 153855 markings/sec, 25 secs
lola: 6038974 markings, 17623882 edges, 155100 markings/sec, 30 secs
lola: 6822912 markings, 20305044 edges, 156788 markings/sec, 35 secs
lola: 7647023 markings, 22719211 edges, 164822 markings/sec, 40 secs
lola: 8450215 markings, 25312805 edges, 160638 markings/sec, 45 secs
lola: 9139949 markings, 27429135 edges, 137947 markings/sec, 50 secs
lola: 9765024 markings, 29431014 edges, 125015 markings/sec, 55 secs
lola: 10424082 markings, 31511014 edges, 131812 markings/sec, 60 secs
lola: 11044700 markings, 33529756 edges, 124124 markings/sec, 65 secs
lola: 11668275 markings, 35607436 edges, 124715 markings/sec, 70 secs
lola: 12301721 markings, 37701940 edges, 126689 markings/sec, 75 secs
lola: 12899454 markings, 39779123 edges, 119547 markings/sec, 80 secs
lola: 13552729 markings, 42039914 edges, 130655 markings/sec, 85 secs
lola: 14142350 markings, 44142511 edges, 117924 markings/sec, 90 secs
lola: 14817748 markings, 46429588 edges, 135080 markings/sec, 95 secs
lola: 15561301 markings, 48892244 edges, 148711 markings/sec, 100 secs
lola: 16261742 markings, 51460281 edges, 140088 markings/sec, 105 secs
lola: 16907727 markings, 53643066 edges, 129197 markings/sec, 110 secs
lola: 17494683 markings, 55807155 edges, 117391 markings/sec, 115 secs
lola: 18073150 markings, 57962635 edges, 115693 markings/sec, 120 secs
lola: 18631884 markings, 59890856 edges, 111747 markings/sec, 125 secs
lola: 19148318 markings, 61771799 edges, 103287 markings/sec, 130 secs
lola: 19694077 markings, 63877049 edges, 109152 markings/sec, 135 secs
lola: 20301173 markings, 66066099 edges, 121419 markings/sec, 140 secs
lola: 20887109 markings, 68236679 edges, 117187 markings/sec, 145 secs
lola: 21432178 markings, 70390169 edges, 109014 markings/sec, 150 secs
lola: 22031989 markings, 72679618 edges, 119962 markings/sec, 155 secs
lola: 22619516 markings, 74924064 edges, 117505 markings/sec, 160 secs
lola: 23170688 markings, 77143087 edges, 110234 markings/sec, 165 secs
lola: 24006897 markings, 79673391 edges, 167242 markings/sec, 170 secs
lola: 24763181 markings, 81915253 edges, 151257 markings/sec, 175 secs
lola: 25435693 markings, 83941289 edges, 134502 markings/sec, 180 secs
lola: 26105895 markings, 86038806 edges, 134040 markings/sec, 185 secs
lola: 26737876 markings, 88111506 edges, 126396 markings/sec, 190 secs
lola: 27456154 markings, 90568060 edges, 143656 markings/sec, 195 secs
lola: 28357556 markings, 93316994 edges, 180280 markings/sec, 200 secs
lola: 29062993 markings, 95571383 edges, 141087 markings/sec, 205 secs
lola: 29731981 markings, 97771923 edges, 133798 markings/sec, 210 secs
lola: 30362600 markings, 99933108 edges, 126124 markings/sec, 215 secs
lola: 31067876 markings, 102295269 edges, 141055 markings/sec, 220 secs
lola: 31717827 markings, 104653030 edges, 129990 markings/sec, 225 secs
lola: 32356686 markings, 106919123 edges, 127772 markings/sec, 230 secs
lola: 33020124 markings, 108973612 edges, 132688 markings/sec, 235 secs
lola: 33661674 markings, 111026632 edges, 128310 markings/sec, 240 secs
lola: 34277954 markings, 113033179 edges, 123256 markings/sec, 245 secs
lola: 34874386 markings, 114997370 edges, 119286 markings/sec, 250 secs
lola: 35500484 markings, 117357251 edges, 125220 markings/sec, 255 secs
lola: 35950675 markings, 119022193 edges, 90038 markings/sec, 260 secs
lola: 36521396 markings, 120964252 edges, 114144 markings/sec, 265 secs
lola: 37117610 markings, 123024700 edges, 119243 markings/sec, 270 secs
lola: 37682414 markings, 125069378 edges, 112961 markings/sec, 275 secs
lola: 38181459 markings, 126899022 edges, 99809 markings/sec, 280 secs
lola: 38629914 markings, 128565192 edges, 89691 markings/sec, 285 secs
lola: 39236830 markings, 130632811 edges, 121383 markings/sec, 290 secs
lola: 39822052 markings, 132720816 edges, 117044 markings/sec, 295 secs
lola: 40366885 markings, 134741558 edges, 108967 markings/sec, 300 secs
lola: 40846197 markings, 136528362 edges, 95862 markings/sec, 305 secs
lola: 41322734 markings, 138283280 edges, 95307 markings/sec, 310 secs
lola: 41904803 markings, 140366109 edges, 116414 markings/sec, 315 secs
lola: 42478014 markings, 142496857 edges, 114642 markings/sec, 320 secs
lola: 43015758 markings, 144545890 edges, 107549 markings/sec, 325 secs
lola: 43483985 markings, 146320385 edges, 93645 markings/sec, 330 secs
lola: 43942594 markings, 148048038 edges, 91722 markings/sec, 335 secs
lola: 44534977 markings, 150266964 edges, 118477 markings/sec, 340 secs
lola: 45094365 markings, 152420191 edges, 111878 markings/sec, 345 secs
lola: 45604062 markings, 154422418 edges, 101939 markings/sec, 350 secs
lola: 46131571 markings, 156507264 edges, 105502 markings/sec, 355 secs
lola: 46729828 markings, 158597248 edges, 119651 markings/sec, 360 secs
lola: 47252931 markings, 160519308 edges, 104621 markings/sec, 365 secs
lola: 47829450 markings, 162637569 edges, 115304 markings/sec, 370 secs
lola: 48427440 markings, 164855975 edges, 119598 markings/sec, 375 secs
lola: 48924694 markings, 166776947 edges, 99451 markings/sec, 380 secs
lola: 49544208 markings, 169243930 edges, 123903 markings/sec, 385 secs
lola: 49966380 markings, 171098609 edges, 84434 markings/sec, 390 secs
lola: 50432985 markings, 173055024 edges, 93321 markings/sec, 395 secs
lola: 51012761 markings, 175181907 edges, 115955 markings/sec, 400 secs
lola: 51562810 markings, 177324029 edges, 110010 markings/sec, 405 secs
lola: 52105911 markings, 179501951 edges, 108620 markings/sec, 410 secs
lola: 52623824 markings, 181599187 edges, 103583 markings/sec, 415 secs
lola: 53020171 markings, 183347135 edges, 79269 markings/sec, 420 secs
lola: 53425426 markings, 185132994 edges, 81051 markings/sec, 425 secs
lola: 54003627 markings, 187279348 edges, 115640 markings/sec, 430 secs
lola: 54542173 markings, 189380336 edges, 107709 markings/sec, 435 secs
lola: 55110662 markings, 191566277 edges, 113698 markings/sec, 440 secs
lola: 55601324 markings, 193604789 edges, 98132 markings/sec, 445 secs
lola: 56047660 markings, 195515363 edges, 89267 markings/sec, 450 secs
lola: 56450001 markings, 197283947 edges, 80468 markings/sec, 455 secs
lola: 56922763 markings, 199237532 edges, 94552 markings/sec, 460 secs
lola: 57500812 markings, 201470517 edges, 115610 markings/sec, 465 secs
lola: 58031834 markings, 203602478 edges, 106204 markings/sec, 470 secs
lola: 58548025 markings, 205759324 edges, 103238 markings/sec, 475 secs
lola: 59059611 markings, 207875749 edges, 102317 markings/sec, 480 secs
lola: 59450380 markings, 209613427 edges, 78154 markings/sec, 485 secs
lola: 59847782 markings, 211363329 edges, 79480 markings/sec, 490 secs
lola: 60386043 markings, 213547460 edges, 107652 markings/sec, 495 secs
lola: 60949578 markings, 215830786 edges, 112707 markings/sec, 500 secs
lola: 61480812 markings, 218038190 edges, 106247 markings/sec, 505 secs
lola: 61915567 markings, 219910522 edges, 86951 markings/sec, 510 secs
lola: 62362340 markings, 221806044 edges, 89355 markings/sec, 515 secs
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: 62495245 markings, 222373694 edges
lola: ========================================
lola: subprocess 10 will run for 788 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6))))))) AND (F ((1 <= p20)) OR (F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6))))))) AND (F ((1 <= p20)) OR (F (((2 <= p3) AND (1 <= p6))) OR (((2 <= p3) AND (1 <= p6)) OR (G ((1 <= p20)) AND F (((2 <= p3) AND (1 <= p6)))))))))
lola: processed formula length: 267
lola: 63 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p25) AND (1 <= p31)) U (((2 <= p6) AND (1 <= p14)) OR (G (((p13 <= 1) OR (p31 <= 0))) AND F (((2 <= p6) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((2 <= p25) AND (1 <= p31)) U (((2 <= p6) AND (1 <= p14)) OR (G (((p13 <= 1) OR (p31 <= 0))) AND F (((2 <= p6) AND (1 <= p14))))))
lola: processed formula length: 132
lola: 63 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: 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: 67 markings, 124 edges
lola: ========================================
lola: subprocess 12 will run for 2366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((2 <= p26) AND (1 <= p31))) AND (F (((1 <= p4) AND (2 <= p6))) AND ((2 <= p12) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((2 <= p26) AND (1 <= p31))) AND (F (((1 <= p4) AND (2 <= p6))) AND ((2 <= p12) AND (1 <= p25))))))
lola: processed formula length: 109
lola: 63 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: 9 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no no yes
lola:
preliminary result: no no yes no no no no no no no no no yes
lola: memory consumption: 41408 KB
lola: time consumption: 1204 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="DNAwalker-PT-04track28LL"
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 DNAwalker-PT-04track28LL, 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 r178-tajo-158987881900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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