Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038006000162.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is Angiogenesis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006000162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 26 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K May 5 16:51 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 Angiogenesis-PT-05-00
FORMULA_NAME Angiogenesis-PT-05-01
FORMULA_NAME Angiogenesis-PT-05-02
FORMULA_NAME Angiogenesis-PT-05-03
FORMULA_NAME Angiogenesis-PT-05-04
FORMULA_NAME Angiogenesis-PT-05-05
FORMULA_NAME Angiogenesis-PT-05-06
FORMULA_NAME Angiogenesis-PT-05-07
FORMULA_NAME Angiogenesis-PT-05-08
FORMULA_NAME Angiogenesis-PT-05-09
FORMULA_NAME Angiogenesis-PT-05-10
FORMULA_NAME Angiogenesis-PT-05-11
FORMULA_NAME Angiogenesis-PT-05-12
FORMULA_NAME Angiogenesis-PT-05-13
FORMULA_NAME Angiogenesis-PT-05-14
FORMULA_NAME Angiogenesis-PT-05-15

=== Now, execution of the tool begins

BK_START 1620430806071

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 23:40:07] [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]
[2021-05-07 23:40:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 23:40:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-07 23:40:07] [INFO ] Transformed 39 places.
[2021-05-07 23:40:07] [INFO ] Transformed 64 transitions.
[2021-05-07 23:40:07] [INFO ] Parsed PT model containing 39 places and 64 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 3 resets, run finished after 130 ms. (steps per millisecond=769 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 64 rows 39 cols
[2021-05-07 23:40:08] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2021-05-07 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 16 ms.
[2021-05-07 23:40:08] [INFO ] Added : 51 causal constraints over 11 iterations in 81 ms. Result :sat
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2021-05-07 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:40:08] [INFO ] Added : 59 causal constraints over 13 iterations in 75 ms. Result :sat
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2021-05-07 23:40:08] [INFO ] Added : 58 causal constraints over 12 iterations in 65 ms. Result :sat
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 3 ms.
[2021-05-07 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:40:08] [INFO ] Added : 51 causal constraints over 11 iterations in 56 ms. Result :sat
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-07 23:40:08] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 3 ms.
[2021-05-07 23:40:09] [INFO ] Added : 59 causal constraints over 13 iterations in 70 ms. Result :sat
[2021-05-07 23:40:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-07 23:40:09] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2021-05-07 23:40:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-07 23:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-07 23:40:09] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 4 ms.
[2021-05-07 23:40:09] [INFO ] Added : 51 causal constraints over 11 iterations in 74 ms. Result :sat
[2021-05-07 23:40:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-07 23:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-07 23:40:09] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2021-05-07 23:40:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:40:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-07 23:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:40:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-07 23:40:09] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 3 ms.
[2021-05-07 23:40:09] [INFO ] Added : 52 causal constraints over 11 iterations in 83 ms. Result :sat
[2021-05-07 23:40:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-07 23:40:09] [INFO ] Flatten gal took : 33 ms
FORMULA Angiogenesis-PT-05-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-05-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-05-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 23:40:09] [INFO ] Flatten gal took : 8 ms
[2021-05-07 23:40:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-07 23:40:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Angiogenesis-PT-05 @ 3570 seconds

FORMULA Angiogenesis-PT-05-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ Angiogenesis-PT-05

{
"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": "Fri May 7 23:40:10 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((((1 <= p20) AND (1 <= p31)) U ((1 <= p32) AND (1 <= p36)))) AND F (G ((1 <= p17)))))",
"processed_size": 92,
"rewrites": 31
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"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": "G ((((1 <= p15) AND (1 <= p33)) OR (p12 <= 0)))",
"processed_size": 48,
"rewrites": 31
},
"result":
{
"edges": 95,
"markings": 57,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (((((1 <= p17) AND (1 <= p0) AND (1 <= p32)) U ((1 <= p0) AND (1 <= p32))) OR X (F ((1 <= p37))))))",
"processed_size": 104,
"rewrites": 31
},
"result":
{
"edges": 5,
"markings": 5,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p23 <= 0)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 47018,
"markings": 23306,
"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"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p17 <= 0) U G ((X (G (((1 <= p31) AND (1 <= p35)))) AND ((1 <= p27) AND (1 <= p17)))))",
"processed_size": 88,
"rewrites": 31
},
"result":
{
"edges": 18,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F ((1 <= p16))) OR ((1 <= p10) OR (F ((1 <= p23)) AND (1 <= p16)))))",
"processed_size": 75,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X (X (((1 <= p6) AND (1 <= p32)))) OR (1 <= p15)) U G ((F ((p23 <= 0)) AND (((p14 <= 0) OR (p32 <= 0)) OR (p23 <= 0))))))",
"processed_size": 127,
"rewrites": 31
},
"result":
{
"edges": 46979,
"markings": 23290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((X (((p28 <= 0) OR (p16 <= 0))) OR ((1 <= p15) AND (1 <= p34))))) U ((1 <= p15) AND (1 <= p34))))",
"processed_size": 108,
"rewrites": 31
},
"result":
{
"edges": 3952,
"markings": 1983,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1)))))",
"processed_size": 88,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "G (((1 <= p37) AND F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1))))))",
"processed_size": 105,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p22 <= 0)) OR (p12 <= 0)))",
"processed_size": 34,
"rewrites": 31
},
"result":
{
"edges": 2985,
"markings": 1808,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((1 <= p22) OR (F (((1 <= p3) AND (1 <= p5))) AND G ((1 <= p25)))))",
"processed_size": 70,
"rewrites": 31
},
"result":
{
"edges": 2,
"markings": 2,
"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": 28552,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X((** U **)) AND F(G(**)))) : (G(**) OR F((X(F(**)) OR **))) : X(G((X((X(G(**)) AND (** AND **))) AND (** AND **)))) : G((F(**) OR **)) : X(X(((** U **) OR X(F(**))))) : X(G(*)) : ((** U G((X(G(**)) AND (** AND **)))) OR G(*)) : X((X(F(**)) OR (** OR (F(**) AND **)))) : (** U (F(((** U **) OR X(**))) AND F(*))) : X(((X(X(**)) OR **) U G((F(**) AND (** OR **))))) : X((X(G((X(**) OR **))) U **)) : F((** OR (F(**) AND G(**)))) : (G(F((X(**) OR G(**)))) OR G((** AND F((X(**) OR G(**))))))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X ((X ((((1 <= p20) AND (1 <= p31)) U ((1 <= p32) AND (1 <= p36)))) AND G (F (G ((1 <= p17)))))) : (G ((((1 <= p15) AND (1 <= p33)) OR (p12 <= 0))) OR F ((F (X (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p5))))) : G (X (((X (((X (G (((1 <= p24) AND (1 <= p31)))) AND (1 <= p20)) AND (1 <= p31))) AND (1 <= p24)) AND (1 <= p31)))) : G ((F ((((p7 <= 0) OR (p11 <= 0)) U (p22 <= 0))) OR (p12 <= 0))) : X (X (((((1 <= p17) AND (1 <= p0) AND (1 <= p32)) U ((1 <= p0) AND (1 <= p32))) OR F (X ((1 <= p37)))))) : NOT(F (X (((1 <= p36) U (1 <= p23))))) : (((p17 <= 0) U G (((X (G (((1 <= p31) AND (1 <= p35)))) AND (1 <= p27)) AND (1 <= p17)))) OR NOT(F (((1 <= p18) AND (1 <= p31))))) : X (((F (X ((X ((1 <= p10)) U F ((1 <= p16))))) OR (1 <= p10)) OR (F ((1 <= p23)) AND (1 <= p16)))) : ((1 <= p12) U (F (((((1 <= p9) AND (1 <= p11)) U (1 <= p17)) OR X ((1 <= p1)))) AND NOT(G (((1 <= p9) AND (1 <= p11)))))) : X (((X (X (((1 <= p6) AND (1 <= p32)))) OR (1 <= p15)) U G ((((p14 <= 0) OR (p32 <= 0)) U (p23 <= 0))))) : (X (X (G ((X (((p28 <= 0) OR (p16 <= 0))) OR ((1 <= p15) AND (1 <= p34)))))) U X (((1 <= p15) AND (1 <= p34)))) : (F ((X (((1 <= p3) AND (1 <= p5))) U F ((1 <= p22)))) OR F ((F (((1 <= p3) AND (1 <= p5))) AND G ((1 <= p25))))) : (G ((1 <= p37)) U F (G (F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((1 <= p20) AND (1 <= p31)) U ((1 <= p32) AND (1 <= p36)))) AND F (G ((1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((1 <= p20) AND (1 <= p31)) U ((1 <= p32) AND (1 <= p36)))) AND F (G ((1 <= p17)))))
lola: processed formula length: 92
lola: 31 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: add low 53
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p15) AND (1 <= p33)) OR (p12 <= 0))) OR F ((X (F (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p5)))))
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: G ((((1 <= p15) AND (1 <= p33)) OR (p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p15) AND (1 <= p33)) OR (p12 <= 0)))
lola: processed formula length: 48
lola: 31 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: 57 markings, 95 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 68
lola: 31 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: 3 markings, 3 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 (G ((X ((X (G (((1 <= p24) AND (1 <= p31)))) AND ((1 <= p20) AND (1 <= p31)))) AND ((1 <= p24) AND (1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((X (G (((1 <= p24) AND (1 <= p31)))) AND ((1 <= p20) AND (1 <= p31)))) AND ((1 <= p24) AND (1 <= p31)))))
lola: processed formula length: 115
lola: 31 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((((1 <= p17) AND (1 <= p0) AND (1 <= p32)) U ((1 <= p0) AND (1 <= p32))) OR X (F ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((((1 <= p17) AND (1 <= p0) AND (1 <= p32)) U ((1 <= p0) AND (1 <= p32))) OR X (F ((1 <= p37))))))
lola: processed formula length: 104
lola: 31 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p23 <= 0)))
lola: processed formula length: 18
lola: 31 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: 23306 markings, 47018 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p17 <= 0) U G ((X (G (((1 <= p31) AND (1 <= p35)))) AND ((1 <= p27) AND (1 <= p17))))) OR G (((p18 <= 0) OR (p31 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p18 <= 0) OR (p31 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p18 <= 0) OR (p31 <= 0)))
lola: processed formula length: 31
lola: 31 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: 195 markings, 345 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p17 <= 0) U G ((X (G (((1 <= p31) AND (1 <= p35)))) AND ((1 <= p27) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p17 <= 0) U G ((X (G (((1 <= p31) AND (1 <= p35)))) AND ((1 <= p27) AND (1 <= p17)))))
lola: processed formula length: 88
lola: 31 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: 13 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p16))) OR ((1 <= p10) OR (F ((1 <= p23)) AND (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p16))) OR ((1 <= p10) OR (F ((1 <= p23)) AND (1 <= p16)))))
lola: processed formula length: 75
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) U (F (((((1 <= p9) AND (1 <= p11)) U (1 <= p17)) OR X ((1 <= p1)))) AND F (((p9 <= 0) OR (p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p12) U (F (((((1 <= p9) AND (1 <= p11)) U (1 <= p17)) OR X ((1 <= p1)))) AND F (((p9 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 116
lola: 31 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (X (((1 <= p6) AND (1 <= p32)))) OR (1 <= p15)) U G ((F ((p23 <= 0)) AND (((p14 <= 0) OR (p32 <= 0)) OR (p23 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (X (((1 <= p6) AND (1 <= p32)))) OR (1 <= p15)) U G ((F ((p23 <= 0)) AND (((p14 <= 0) OR (p32 <= 0)) OR (p23 <= 0))))))
lola: processed formula length: 127
lola: 31 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 23290 markings, 46979 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((X (((p28 <= 0) OR (p16 <= 0))) OR ((1 <= p15) AND (1 <= p34))))) U ((1 <= p15) AND (1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((X (((p28 <= 0) OR (p16 <= 0))) OR ((1 <= p15) AND (1 <= p34))))) U ((1 <= p15) AND (1 <= p34))))
lola: processed formula length: 108
lola: 31 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: 1983 markings, 3952 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1))))) OR G (((1 <= p37) AND F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1)))))
lola: processed formula length: 88
lola: 31 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 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p37) AND F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p37) AND F ((X (((1 <= p14) AND (1 <= p33) AND (1 <= p10) AND (1 <= p11))) OR G ((1 <= p1))))))
lola: processed formula length: 105
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p22 <= 0)) OR (p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p22 <= 0)) OR (p12 <= 0)))
lola: processed formula length: 34
lola: 31 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: 1808 markings, 2985 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p22) OR (F (((1 <= p3) AND (1 <= p5))) AND G ((1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p22) OR (F (((1 <= p3) AND (1 <= p5))) AND G ((1 <= p25)))))
lola: processed formula length: 70
lola: 31 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: 2 markings, 2 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no
lola: memory consumption: 28552 KB
lola: time consumption: 3 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="Angiogenesis-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is Angiogenesis-PT-05, 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 r011-tall-162038006000162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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