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.r176-tajo-158987871600260.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 Planning-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.0K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:37 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 unfinite

--------------------
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 Planning-PT-none-CTLFireability-00
FORMULA_NAME Planning-PT-none-CTLFireability-01
FORMULA_NAME Planning-PT-none-CTLFireability-02
FORMULA_NAME Planning-PT-none-CTLFireability-03
FORMULA_NAME Planning-PT-none-CTLFireability-04
FORMULA_NAME Planning-PT-none-CTLFireability-05
FORMULA_NAME Planning-PT-none-CTLFireability-06
FORMULA_NAME Planning-PT-none-CTLFireability-07
FORMULA_NAME Planning-PT-none-CTLFireability-08
FORMULA_NAME Planning-PT-none-CTLFireability-09
FORMULA_NAME Planning-PT-none-CTLFireability-10
FORMULA_NAME Planning-PT-none-CTLFireability-11
FORMULA_NAME Planning-PT-none-CTLFireability-12
FORMULA_NAME Planning-PT-none-CTLFireability-13
FORMULA_NAME Planning-PT-none-CTLFireability-14
FORMULA_NAME Planning-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591138764823

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:59:26] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-06-02 22:59:26] [INFO ] Transformed 126 places.
[2020-06-02 22:59:26] [INFO ] Transformed 128 transitions.
[2020-06-02 22:59:26] [INFO ] Parsed PT model containing 126 places and 128 transitions in 87 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 434 ms. (steps per millisecond=230 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 22:59:27] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 124 cols
[2020-06-02 22:59:27] [INFO ] Computed 42 place invariants in 5 ms
[2020-06-02 22:59:27] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-02 22:59:27] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-02 22:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:27] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-06-02 22:59:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2020-06-02 22:59:27] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2020-06-02 22:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2020-06-02 22:59:27] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-02 22:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:27] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2020-06-02 22:59:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2020-06-02 22:59:27] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints in 9 ms.
[2020-06-02 22:59:27] [INFO ] Added : 49 causal constraints over 10 iterations in 138 ms. Result :sat
[2020-06-02 22:59:28] [INFO ] Flatten gal took : 51 ms
[2020-06-02 22:59:28] [INFO ] Flatten gal took : 22 ms
[2020-06-02 22:59:28] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-02 22:59:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Planning-PT-none @ 3570 seconds

FORMULA Planning-PT-none-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 212
rslt: Output for CTLFireability @ Planning-PT-none

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:59:28 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))",
"processed_size": 105,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p2) AND (p67 <= 0))",
"processed_size": 26,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 243
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p47 <= 0) OR (p64 <= 0) OR (p114 <= 0)) AND ((p71 <= 0) OR (p81 <= 0) OR (p92 <= 0) OR (p113 <= 0) OR (1 <= p55)))",
"processed_size": 123,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31))))",
"processed_size": 145,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 13,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p67) AND (1 <= p80) AND (1 <= p81) AND (1 <= p96))",
"processed_size": 57,
"rewrites": 33
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))",
"processed_size": 74,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103))))",
"processed_size": 66,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EX(((1 <= p60) AND (1 <= p66))))",
"processed_size": 35,
"rewrites": 33
},
"net":
{
"conflict_clusters": 74,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p65 <= 0)))",
"processed_size": 18,
"rewrites": 33
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 978
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p101 <= 0) AND ((p37 <= 0) OR (p67 <= 0) OR (p81 <= 0) OR (p96 <= 0))) OR (p119 <= 0) OR (p2 <= 0))))",
"processed_size": 115,
"rewrites": 33
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 978
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))",
"processed_size": 107,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1957
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p6)",
"processed_size": 9,
"rewrites": 35
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1957
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p67) AND (1 <= p80) AND (1 <= p120)) OR ((1 <= p11) AND (1 <= p58) AND (1 <= p65)) OR (p67 <= 0) OR (p80 <= 0) OR (p118 <= 0))",
"processed_size": 138,
"rewrites": 34
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))",
"processed_size": 105,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p2) AND (p67 <= 0))",
"processed_size": 26,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))",
"processed_size": 74,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p67) AND (1 <= p80) AND (1 <= p120)) OR ((1 <= p11) AND (1 <= p58) AND (1 <= p65)) OR (p67 <= 0) OR (p80 <= 0) OR (p118 <= 0))",
"processed_size": 138,
"rewrites": 34
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 26,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 26,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3772,
"runtime": 3358.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(A(F(*)))) AND (** AND **)) : E(F((A(X(**)) AND (** AND (** AND **))))) : E(F(A(G(**)))) : (A(G(**)) OR A(G(*))) : E(F(A(G(**)))) : (A(X((A(G(**)) OR E(F(**))))) OR **) : E((E(F(**)) U (E(F(**)) AND A(X(**))))) : (E(G((** AND E(F(**))))) OR (** AND (A(F(**)) AND E(G(E(X(**))))))) : (A(X(**)) OR (E(F(**)) AND (** AND **))) : E(((E(F(**)) OR **) U **)) : (A(G(E(F(**)))) OR A(F(*))) : E((E(F(*)) U **)) : E(X(E(F(**)))) : E(X(E((** U **)))) : (E(G(E(F(**)))) AND E(X(E(G(**))))) : (E(F(**)) AND A(F(E(X(**)))))"
},
"net":
{
"arcs": 612,
"conflict_clusters": 74,
"places": 124,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "no unknown unknown no unknown unknown unknown unknown yes unknown unknown unknown yes unknown unknown yes ",
"value": "no unknown unknown no unknown unknown unknown unknown yes unknown unknown unknown yes unknown unknown 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: 252/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3968
lola: finding significant places
lola: 124 places, 128 transitions, 82 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 CTLFireability.xml
lola: ((NOT(E (F (E (G ((1 <= p6)))))) AND ((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0))) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0))) : E (F ((((A (X (((p70 <= 0) OR (p81 <= 0) OR (p93 <= 0) OR (p102 <= 0)))) AND (1 <= p11)) AND (1 <= p58)) AND (1 <= p65)))) : E (F (A (G ((((1 <= p0) AND (1 <= p104)) OR ((1 <= p0) AND (1 <= p103)) OR ((1 <= p47) AND (1 <= p64) AND (1 <= p82) AND (1 <= p103))))))) : (A (G ((((p101 <= 0) AND ((p37 <= 0) OR (p67 <= 0) OR (p81 <= 0) OR (p96 <= 0))) OR (p119 <= 0) OR (p2 <= 0)))) OR NOT(E (F (E (F ((1 <= p65))))))) : NOT(A (G (NOT(A (G ((1 <= p64))))))) : (A (X ((A (G ((1 <= p52))) OR E (F ((1 <= p121)))))) OR ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))) : E ((E (F (((1 <= p13) AND (1 <= p35) AND (1 <= p65) AND (1 <= p1) AND (1 <= p88)))) U (E (F (((1 <= p0) AND (1 <= p103)))) AND A (X (((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100))))))) : (E (G ((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND E (F ((1 <= p9)))))) OR ((((1 <= p2) AND (p67 <= 0)) AND A (F (((1 <= p67) AND (1 <= p80) AND (1 <= p120))))) AND E (G (E (X (((1 <= p1) AND (1 <= p85)))))))) : (A (X ((1 <= p72))) OR ((E (F (((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31)))) AND ((p47 <= 0) OR (p64 <= 0) OR (p114 <= 0))) AND ((p71 <= 0) OR (p81 <= 0) OR (p92 <= 0) OR (p113 <= 0) OR (1 <= p55)))) : E (((E (F ((1 <= p75))) OR ((1 <= p71) AND (1 <= p82) AND (1 <= p92) AND (1 <= p113) AND (1 <= p35) AND (1 <= p65) AND (1 <= p100) AND ((1 <= p31) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p99))))) U ((1 <= p36) AND (1 <= p66) AND (1 <= p82) AND (1 <= p99)))) : (A (G (E (F (((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100))))))) OR NOT(E (G ((((1 <= p67) AND (1 <= p80) AND (1 <= p120)) OR ((1 <= p11) AND (1 <= p58) AND (1 <= p65)) OR (p67 <= 0) OR (p80 <= 0) OR (p118 <= 0)))))) : E ((NOT(A (G ((1 <= p54)))) U ((1 <= p71) AND (1 <= p113) AND (1 <= p116) AND ((p31 <= 0) OR ((1 <= p45) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))) AND (((1 <= p38) AND (1 <= p63) AND (1 <= p81) AND (1 <= p104)) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p81) AND (1 <= p99)))))) : E (F (E (X (((1 <= p67) AND (1 <= p80) AND (1 <= p81) AND (1 <= p96)))))) : E (X (E ((((1 <= p4) OR (1 <= p68)) U ((1 <= p3) AND (1 <= p121)))))) : (E (G (E (F (((1 <= p13) AND (1 <= p58) AND (1 <= p65)))))) AND E (X (E (G (((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))))))) : (E ((A (G ((1 <= p122))) U E (F (((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103)))))) AND A (F (E (X (((1 <= p60) AND (1 <= p66)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((p70 <= 0) OR (p81 <= 0) OR (p93 <= 0) OR (p102 <= 0)))) AND ((1 <= p11) AND ((1 <= p58) AND (1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((p70 <= 0) OR (p81 <= 0) OR (p93 <= 0) OR (p102 <= 0))) AND ((1 <= p11) AND ((1 <= p58) AND (1 <= p65)))))
lola: processed formula length: 117
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1203615 markings, 1203614 edges, 240723 markings/sec, 0 secs
lola: 2477502 markings, 2477502 edges, 254777 markings/sec, 5 secs
lola: 3743911 markings, 3743910 edges, 253282 markings/sec, 10 secs
lola: 5007643 markings, 5007642 edges, 252746 markings/sec, 15 secs
lola: 6254166 markings, 6254165 edges, 249305 markings/sec, 20 secs
lola: 7515863 markings, 7515862 edges, 252339 markings/sec, 25 secs
lola: 8775398 markings, 8775397 edges, 251907 markings/sec, 30 secs
lola: 10047848 markings, 10047847 edges, 254490 markings/sec, 35 secs
lola: 11311431 markings, 11311431 edges, 252717 markings/sec, 40 secs
lola: 12562005 markings, 12562004 edges, 250115 markings/sec, 45 secs
lola: 13819425 markings, 13819425 edges, 251484 markings/sec, 50 secs
lola: 15074721 markings, 15074720 edges, 251059 markings/sec, 55 secs
lola: 16325768 markings, 16325770 edges, 250209 markings/sec, 60 secs
lola: 17580387 markings, 17580386 edges, 250924 markings/sec, 65 secs
lola: 18833742 markings, 18833742 edges, 250671 markings/sec, 70 secs
lola: 20083172 markings, 20083171 edges, 249886 markings/sec, 75 secs
lola: 21332013 markings, 21332012 edges, 249768 markings/sec, 80 secs
lola: 22580003 markings, 22580002 edges, 249598 markings/sec, 85 secs
lola: 23828286 markings, 23828285 edges, 249657 markings/sec, 90 secs
lola: 25074076 markings, 25074075 edges, 249158 markings/sec, 95 secs
lola: 26321288 markings, 26321287 edges, 249442 markings/sec, 100 secs
lola: 27566073 markings, 27566072 edges, 248957 markings/sec, 105 secs
lola: 28812450 markings, 28812449 edges, 249275 markings/sec, 110 secs
lola: 30058869 markings, 30058869 edges, 249284 markings/sec, 115 secs
lola: 31302193 markings, 31302193 edges, 248665 markings/sec, 120 secs
lola: 32475781 markings, 32475780 edges, 234718 markings/sec, 125 secs
lola: 33613913 markings, 33613915 edges, 227626 markings/sec, 130 secs
lola: 34857900 markings, 34857899 edges, 248797 markings/sec, 135 secs
lola: 36097729 markings, 36097728 edges, 247966 markings/sec, 140 secs
lola: 37335449 markings, 37335448 edges, 247544 markings/sec, 145 secs
lola: 38571344 markings, 38571343 edges, 247179 markings/sec, 150 secs
lola: 39807176 markings, 39807175 edges, 247166 markings/sec, 155 secs
lola: 40998482 markings, 40998523 edges, 238261 markings/sec, 160 secs
lola: 41811217 markings, 41811538 edges, 162547 markings/sec, 165 secs
lola: 42558273 markings, 42558334 edges, 149411 markings/sec, 170 secs
lola: 43300921 markings, 43300921 edges, 148530 markings/sec, 175 secs
lola: 44207423 markings, 44207507 edges, 181300 markings/sec, 180 secs
lola: 45211514 markings, 45211515 edges, 200818 markings/sec, 185 secs
lola: 46113157 markings, 46113158 edges, 180329 markings/sec, 190 secs
lola: 47273483 markings, 47273484 edges, 232065 markings/sec, 195 secs
lola: 48276765 markings, 48276764 edges, 200656 markings/sec, 200 secs
lola: 49211427 markings, 49211426 edges, 186932 markings/sec, 205 secs
lola: 50139791 markings, 50139961 edges, 185673 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((A (G ((1 <= p52))) OR E (F ((1 <= p121)))))) OR ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))
lola: processed formula length: 105
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((1 <= p52))) OR E (F ((1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AG((1 <= p52)) OR EF((1 <= p121))))
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3306616 markings, 3306620 edges, 661323 markings/sec, 0 secs
lola: 6583668 markings, 6583668 edges, 655410 markings/sec, 5 secs
lola: 9865185 markings, 9865185 edges, 656303 markings/sec, 10 secs
lola: 13353407 markings, 13353407 edges, 697644 markings/sec, 15 secs
lola: 16820300 markings, 16820300 edges, 693379 markings/sec, 20 secs
lola: 19952535 markings, 19952535 edges, 626447 markings/sec, 25 secs
lola: 23206565 markings, 23206565 edges, 650806 markings/sec, 30 secs
lola: 26599929 markings, 26599929 edges, 678673 markings/sec, 35 secs
lola: 29855982 markings, 29855982 edges, 651211 markings/sec, 40 secs
lola: 33088855 markings, 33088855 edges, 646575 markings/sec, 45 secs
lola: 36356066 markings, 36356066 edges, 653442 markings/sec, 50 secs
lola: 39697222 markings, 39697222 edges, 668231 markings/sec, 55 secs
lola: 42733350 markings, 42733350 edges, 607226 markings/sec, 60 secs
lola: 45969801 markings, 45969801 edges, 647290 markings/sec, 65 secs
lola: 49345300 markings, 49345299 edges, 675100 markings/sec, 70 secs
lola: 52768579 markings, 52768579 edges, 684656 markings/sec, 75 secs
lola: 56096934 markings, 56096934 edges, 665671 markings/sec, 80 secs
lola: 59473454 markings, 59473454 edges, 675304 markings/sec, 85 secs
lola: 62816151 markings, 62816151 edges, 668539 markings/sec, 90 secs
lola: 65226411 markings, 65226410 edges, 482052 markings/sec, 95 secs
lola: 66398467 markings, 66398740 edges, 234411 markings/sec, 100 secs
lola: 68643358 markings, 68644114 edges, 448978 markings/sec, 105 secs
lola: 70443831 markings, 70443830 edges, 360095 markings/sec, 110 secs
lola: 71980405 markings, 71980406 edges, 307315 markings/sec, 115 secs
lola: 73304712 markings, 73304711 edges, 264861 markings/sec, 120 secs
lola: 74732002 markings, 74732002 edges, 285458 markings/sec, 125 secs
lola: 76053471 markings, 76053470 edges, 264294 markings/sec, 130 secs
lola: 78184622 markings, 78184621 edges, 426230 markings/sec, 135 secs
lola: 78895479 markings, 78895478 edges, 142171 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((1 <= p13) AND (1 <= p35) AND (1 <= p65) AND (1 <= p1) AND (1 <= p88)))) U (E (F (((1 <= p0) AND (1 <= p103)))) AND A (X (((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((1 <= p13) AND (1 <= p35) AND (1 <= p65) AND (1 <= p1) AND (1 <= p88))) U (EF(((1 <= p0) AND (1 <= p103))) AND AX(((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))))
lola: processed formula length: 181
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3011317 markings, 3011318 edges, 602263 markings/sec, 0 secs
lola: 6289892 markings, 6289893 edges, 655715 markings/sec, 5 secs
lola: 9819774 markings, 9819775 edges, 705976 markings/sec, 10 secs
lola: 13437473 markings, 13437474 edges, 723540 markings/sec, 15 secs
lola: 17027758 markings, 17027759 edges, 718057 markings/sec, 20 secs
lola: 20567127 markings, 20567127 edges, 707874 markings/sec, 25 secs
lola: 24116564 markings, 24116564 edges, 709887 markings/sec, 30 secs
lola: 27597576 markings, 27597577 edges, 696202 markings/sec, 35 secs
lola: 31052207 markings, 31052208 edges, 690926 markings/sec, 40 secs
lola: 34243653 markings, 34243653 edges, 638289 markings/sec, 45 secs
lola: 37327233 markings, 37327233 edges, 616716 markings/sec, 50 secs
lola: 40454825 markings, 40454826 edges, 625518 markings/sec, 55 secs
lola: 43625417 markings, 43625418 edges, 634118 markings/sec, 60 secs
lola: 46791351 markings, 46791352 edges, 633187 markings/sec, 65 secs
lola: 49947252 markings, 49947253 edges, 631180 markings/sec, 70 secs
lola: 53184153 markings, 53184154 edges, 647380 markings/sec, 75 secs
lola: 56649477 markings, 56649478 edges, 693065 markings/sec, 80 secs
lola: 60084651 markings, 60084652 edges, 687035 markings/sec, 85 secs
lola: 63424116 markings, 63424292 edges, 667893 markings/sec, 90 secs
lola: 65454085 markings, 65454085 edges, 405994 markings/sec, 95 secs
lola: 66948589 markings, 66948887 edges, 298901 markings/sec, 100 secs
lola: 68772847 markings, 68773930 edges, 364852 markings/sec, 105 secs
lola: 70443454 markings, 70443455 edges, 334121 markings/sec, 110 secs
lola: 72752202 markings, 72752202 edges, 461750 markings/sec, 115 secs
lola: 74594680 markings, 74594681 edges, 368496 markings/sec, 120 secs
lola: 77418051 markings, 77418052 edges, 564674 markings/sec, 125 secs
lola: 78995458 markings, 78995459 edges, 315481 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND E (F ((1 <= p9)))))) OR (((1 <= p2) AND (p67 <= 0)) AND (A (F (((1 <= p67) AND (1 <= p80) AND (1 <= p120)))) AND E (G (E (X (((1 <= p1) AND (1 <= p85)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (p67 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (p67 <= 0))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND E (F ((1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND EF((1 <= p9))))
lola: processed formula length: 68
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3145103 markings, 3145104 edges, 629021 markings/sec, 0 secs
lola: 6682996 markings, 6682997 edges, 707579 markings/sec, 5 secs
lola: 9824787 markings, 9824788 edges, 628358 markings/sec, 10 secs
lola: 13027745 markings, 13027746 edges, 640592 markings/sec, 15 secs
lola: 16392317 markings, 16392318 edges, 672914 markings/sec, 20 secs
lola: 19697363 markings, 19697363 edges, 661009 markings/sec, 25 secs
lola: 22857684 markings, 22857685 edges, 632064 markings/sec, 30 secs
lola: 26090957 markings, 26090957 edges, 646655 markings/sec, 35 secs
lola: 29232931 markings, 29232932 edges, 628395 markings/sec, 40 secs
lola: 32411141 markings, 32411142 edges, 635642 markings/sec, 45 secs
lola: 35597065 markings, 35597066 edges, 637185 markings/sec, 50 secs
lola: 38916643 markings, 38916644 edges, 663916 markings/sec, 55 secs
lola: 42316668 markings, 42316669 edges, 680005 markings/sec, 60 secs
lola: 45767645 markings, 45767646 edges, 690195 markings/sec, 65 secs
lola: 49222289 markings, 49222290 edges, 690929 markings/sec, 70 secs
lola: 52689572 markings, 52689573 edges, 693457 markings/sec, 75 secs
lola: 56149890 markings, 56149891 edges, 692064 markings/sec, 80 secs
lola: 59385039 markings, 59385040 edges, 647030 markings/sec, 85 secs
lola: 62428929 markings, 62428929 edges, 608778 markings/sec, 90 secs
lola: 64725774 markings, 64726066 edges, 459369 markings/sec, 95 secs
lola: 67445257 markings, 67445288 edges, 543897 markings/sec, 100 secs
lola: 69298694 markings, 69298695 edges, 370687 markings/sec, 105 secs
lola: 71566108 markings, 71566386 edges, 453483 markings/sec, 110 secs
lola: 73921372 markings, 73921373 edges, 471053 markings/sec, 115 secs
lola: 76172044 markings, 76172047 edges, 450134 markings/sec, 120 secs
lola: 78925169 markings, 78925171 edges, 550625 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= p72))) OR (E (F (((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31)))) AND (((p47 <= 0) OR (p64 <= 0) OR (p114 <= 0)) AND ((p71 <= 0) OR (p81 <= 0) OR (p92 <= 0) OR (p113 <= 0) OR (1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p47 <= 0) OR (p64 <= 0) OR (p114 <= 0)) AND ((p71 <= 0) OR (p81 <= 0) OR (p92 <= 0) OR (p113 <= 0) OR (1 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p47 <= 0) OR (p64 <= 0) OR (p114 <= 0)) AND ((p71 <= 0) OR (p81 <= 0) OR (p92 <= 0) OR (p113 <= 0) OR (1 <= p55)))
lola: processed formula length: 123
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 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 5 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31))))
lola: processed formula length: 145
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p68) AND (1 <= p82) AND (1 <= p91) AND (1 <= p95)) OR (1 <= p57)) AND (1 <= p37) AND (1 <= p67) AND (1 <= p120) AND (1 <= p31))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p67) AND (1 <= p80) AND (1 <= p81) AND (1 <= p96))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p67) AND (1 <= p80) AND (1 <= p81) AND (1 <= p96))
lola: processed formula length: 57
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p67) AND (1 <= p80) AND (1 <= p81) AND (1 <= p96))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E ((((1 <= p4) OR (1 <= p68)) U ((1 <= p3) AND (1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E ((((1 <= p4) OR (1 <= p68)) U ((1 <= p3) AND (1 <= p121))))))
lola: processed formula length: 70
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p121))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3190509 markings, 3190509 edges, 638102 markings/sec, 0 secs
lola: sara is running 5 secs || 6555528 markings, 6555527 edges, 673004 markings/sec, 5 secs
lola: sara is running 10 secs || 9758048 markings, 9758047 edges, 640504 markings/sec, 10 secs
lola: sara is running 15 secs || 12442205 markings, 12442205 edges, 536831 markings/sec, 15 secs
lola: sara is running 20 secs || 15411024 markings, 15411024 edges, 593764 markings/sec, 20 secs
lola: sara is running 25 secs || 18294998 markings, 18294997 edges, 576795 markings/sec, 25 secs
lola: sara is running 30 secs || 21189463 markings, 21189464 edges, 578893 markings/sec, 30 secs
lola: sara is running 35 secs || 24530494 markings, 24530494 edges, 668206 markings/sec, 35 secs
lola: sara is running 40 secs || 27862174 markings, 27862173 edges, 666336 markings/sec, 40 secs
lola: sara is running 45 secs || 30776746 markings, 30776745 edges, 582914 markings/sec, 45 secs
lola: sara is running 50 secs || 33760212 markings, 33760211 edges, 596693 markings/sec, 50 secs
lola: sara is running 55 secs || 36910561 markings, 36910567 edges, 630070 markings/sec, 55 secs
lola: sara is running 60 secs || 39729688 markings, 39729688 edges, 563825 markings/sec, 60 secs
lola: sara is running 65 secs || 42577602 markings, 42577602 edges, 569583 markings/sec, 65 secs
lola: sara is running 70 secs || 45422691 markings, 45422691 edges, 569018 markings/sec, 70 secs
lola: sara is running 75 secs || 48041011 markings, 48041010 edges, 523664 markings/sec, 75 secs
lola: sara is running 80 secs || 51277014 markings, 51277014 edges, 647201 markings/sec, 80 secs
lola: sara is running 85 secs || 54536628 markings, 54536628 edges, 651923 markings/sec, 85 secs
lola: sara is running 90 secs || 57852703 markings, 57852703 edges, 663215 markings/sec, 90 secs
lola: sara is running 95 secs || 61118257 markings, 61118256 edges, 653111 markings/sec, 95 secs
lola: sara is running 100 secs || 64404353 markings, 64404353 edges, 657219 markings/sec, 100 secs
lola: sara is running 105 secs || 67688866 markings, 67688866 edges, 656903 markings/sec, 105 secs
lola: sara is running 110 secs || 71007839 markings, 71007839 edges, 663795 markings/sec, 110 secs
lola: sara is running 115 secs || 74316553 markings, 74316552 edges, 661743 markings/sec, 115 secs
lola: sara is running 120 secs || 77219533 markings, 77219533 edges, 580596 markings/sec, 120 secs
lola: sara is running 125 secs || 80523955 markings, 80523957 edges, 660884 markings/sec, 125 secs
lola: sara is running 130 secs || 82847126 markings, 82847131 edges, 464634 markings/sec, 130 secs
lola: sara is running 135 secs || 84380391 markings, 84380391 edges, 306653 markings/sec, 135 secs
lola: sara is running 140 secs || 86739467 markings, 86739467 edges, 471815 markings/sec, 140 secs
lola: sara is running 145 secs || 88986450 markings, 88986450 edges, 449397 markings/sec, 145 secs
lola: sara is running 150 secs || 90301812 markings, 90301812 edges, 263072 markings/sec, 150 secs
lola: sara is running 155 secs || 92754600 markings, 92754600 edges, 490558 markings/sec, 155 secs
lola: sara is running 160 secs || 94756101 markings, 94756101 edges, 400300 markings/sec, 160 secs
lola: sara is running 165 secs || 97157761 markings, 97157761 edges, 480332 markings/sec, 165 secs
lola: sara is running 170 secs || 98889951 markings, 98889951 edges, 346438 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((1 <= p13) AND (1 <= p58) AND (1 <= p65)))))) AND E (X (E (G (((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p13) AND (1 <= p58) AND (1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p13) AND (1 <= p58) AND (1 <= p65))
lola: processed formula length: 42
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p13) AND (1 <= p58) AND (1 <= p65))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3742125 markings, 3742125 edges, 748425 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7594880 markings, 7594879 edges, 770551 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11387596 markings, 11387596 edges, 758543 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15147381 markings, 15147380 edges, 751957 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18921309 markings, 18921309 edges, 754786 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22669948 markings, 22669948 edges, 749728 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26379253 markings, 26379252 edges, 741861 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 30100219 markings, 30100219 edges, 744193 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33777458 markings, 33777458 edges, 735448 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 37441957 markings, 37441956 edges, 732900 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 41072753 markings, 41072752 edges, 726159 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 44733224 markings, 44733224 edges, 732094 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 48262863 markings, 48262863 edges, 705928 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 51604368 markings, 51604367 edges, 668301 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 54812571 markings, 54812570 edges, 641641 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 58075983 markings, 58075982 edges, 652682 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 61414460 markings, 61414460 edges, 667695 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 65040399 markings, 65040399 edges, 725188 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 68690010 markings, 68690010 edges, 729922 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 72259913 markings, 72259913 edges, 713981 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74466739 markings, 74466743 edges, 441365 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 76634091 markings, 76634091 edges, 433470 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 78883287 markings, 78883294 edges, 449839 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 81148309 markings, 81148313 edges, 453004 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 83161857 markings, 83161856 edges, 402710 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 85623119 markings, 85623121 edges, 492252 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 88060231 markings, 88060231 edges, 487422 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))
lola: processed formula length: 74
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 4 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-8-0.sara.
lola: ...considering subproblem: (E (F (((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103)))) AND A (F (E (X (((1 <= p60) AND (1 <= p66)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103))))
lola: processed formula length: 66
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p34) AND (1 <= p64) AND (1 <= p81) AND (1 <= p103))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-8-0.sara.
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= p60) AND (1 <= p66))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((1 <= p60) AND (1 <= p66))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p64 <= 0)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
sara: place or transition ordering is non-deterministiclola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task


lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p64)
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p64 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
lola: state equation 1: solution produced
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3395612 markings, 3395612 edges, 679122 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7012133 markings, 7012132 edges, 723304 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10840010 markings, 10840009 edges, 765575 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14621926 markings, 14621926 edges, 756383 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18160896 markings, 18160896 edges, 707794 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21866687 markings, 21866687 edges, 741158 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25537910 markings, 25537910 edges, 734245 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29216661 markings, 29216661 edges, 735750 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32886094 markings, 32886094 edges, 733887 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 36485191 markings, 36485191 edges, 719819 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40047232 markings, 40047231 edges, 712408 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 43658737 markings, 43658737 edges, 722301 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 47092473 markings, 47092473 edges, 686747 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 50147722 markings, 50147723 edges, 611050 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 53428657 markings, 53428665 edges, 656187 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 56755204 markings, 56755204 edges, 665309 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 60384663 markings, 60384662 edges, 725892 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 64021308 markings, 64021308 edges, 727329 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 67667136 markings, 67667136 edges, 729166 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 71114563 markings, 71114563 edges, 689485 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74525176 markings, 74525175 edges, 682123 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 76715876 markings, 76715878 edges, 438140 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 79059781 markings, 79059781 edges, 468781 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 81631798 markings, 81631798 edges, 514403 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 83787405 markings, 83787408 edges, 431121 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 86569366 markings, 86569365 edges, 556392 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 88837293 markings, 88837297 edges, 453585 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p0) AND (1 <= p104)) OR ((1 <= p0) AND (1 <= p103)) OR ((1 <= p47) AND (1 <= p64) AND (1 <= p82) AND (1 <= p103)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p104 <= 0)) AND ((p0 <= 0) OR (p103 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: processed formula length: 124
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: (((p0 <= 0) OR (p104 <= 0)) AND ((p0 <= 0) OR (p103 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: formula 0: (((1 <= p0) AND (1 <= p104)) OR ((1 <= p0) AND (1 <= p103)) OR ((1 <= p47) AND (1 <= p64) AND (1 <= p82) AND (1 <= p103)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: write sara problem file to CTLFireability-10-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-1.sara.
sara: try reading problem file CTLFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3499449 markings, 3499449 edges, 699890 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7170459 markings, 7170458 edges, 734202 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10792655 markings, 10792655 edges, 724439 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14538470 markings, 14538470 edges, 749163 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18244933 markings, 18244933 edges, 741293 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21968460 markings, 21968460 edges, 744705 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25588486 markings, 25588486 edges, 724005 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29278904 markings, 29278904 edges, 738084 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32950912 markings, 32950912 edges, 734402 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 36574055 markings, 36574055 edges, 724629 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40186486 markings, 40186486 edges, 722486 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 43812836 markings, 43812836 edges, 725270 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 47437498 markings, 47437497 edges, 724932 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 50939672 markings, 50939671 edges, 700435 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 54559872 markings, 54559871 edges, 724040 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 58164714 markings, 58164714 edges, 720968 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 61767025 markings, 61767025 edges, 720462 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 65377687 markings, 65377687 edges, 722132 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 69010963 markings, 69010963 edges, 726655 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 72637661 markings, 72637660 edges, 725340 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 75983529 markings, 75983531 edges, 669174 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 78695004 markings, 78695006 edges, 542295 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 81457243 markings, 81457243 edges, 552448 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 83877312 markings, 83877314 edges, 484014 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 86829277 markings, 86834630 edges, 590393 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 89285751 markings, 89285751 edges, 491295 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (F ((1 <= p75))) OR ((1 <= p71) AND (1 <= p82) AND (1 <= p92) AND (1 <= p113) AND (1 <= p35) AND (1 <= p65) AND (1 <= p100) AND ((1 <= p31) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p99))))) U ((1 <= p36) AND (1 <= p66) AND (1 <= p82) AND (1 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF((1 <= p75)) OR ((1 <= p71) AND (1 <= p82) AND (1 <= p92) AND (1 <= p113) AND (1 <= p35) AND (1 <= p65) AND (1 <= p100) AND ((1 <= p31) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p99))))) U ((1 <= p36) AND (1 <= p66) AND (1 <= p82) AND (1 <= p99)))
lola: processed formula length: 251
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2008819 markings, 4017636 edges, 401764 markings/sec, 0 secs
lola: 4055852 markings, 8111704 edges, 409407 markings/sec, 5 secs
lola: 6103649 markings, 12207297 edges, 409559 markings/sec, 10 secs
lola: 8138771 markings, 16277562 edges, 407024 markings/sec, 15 secs
lola: 10145319 markings, 20290638 edges, 401310 markings/sec, 20 secs
lola: 12005620 markings, 24011240 edges, 372060 markings/sec, 25 secs
lola: 13937493 markings, 27874985 edges, 386375 markings/sec, 30 secs
lola: 15716277 markings, 31432554 edges, 355757 markings/sec, 35 secs
lola: 17483211 markings, 34966421 edges, 353387 markings/sec, 40 secs
lola: 19259515 markings, 38519029 edges, 355261 markings/sec, 45 secs
lola: 21079051 markings, 42158102 edges, 363907 markings/sec, 50 secs
lola: 23024565 markings, 46049129 edges, 389103 markings/sec, 55 secs
lola: 24862262 markings, 49724523 edges, 367539 markings/sec, 60 secs
lola: 26829577 markings, 53659154 edges, 393463 markings/sec, 65 secs
lola: 28658619 markings, 57317238 edges, 365808 markings/sec, 70 secs
lola: 30612771 markings, 61225541 edges, 390830 markings/sec, 75 secs
lola: 32501418 markings, 65002835 edges, 377729 markings/sec, 80 secs
lola: 34294074 markings, 68588147 edges, 358531 markings/sec, 85 secs
lola: 35886845 markings, 71773690 edges, 318554 markings/sec, 90 secs
lola: 37686727 markings, 75373454 edges, 359976 markings/sec, 95 secs
lola: 39612242 markings, 79224482 edges, 385103 markings/sec, 100 secs
lola: 41524923 markings, 83049845 edges, 382536 markings/sec, 105 secs
lola: 43404589 markings, 86809177 edges, 375933 markings/sec, 110 secs
lola: 45310089 markings, 90620178 edges, 381100 markings/sec, 115 secs
lola: 47104809 markings, 94209617 edges, 358944 markings/sec, 120 secs
lola: 49006556 markings, 98013111 edges, 380349 markings/sec, 125 secs
lola: 50776791 markings, 101553581 edges, 354047 markings/sec, 130 secs
lola: 52534745 markings, 105069499 edges, 351591 markings/sec, 135 secs
lola: 54226005 markings, 108452010 edges, 338252 markings/sec, 140 secs
lola: 55986751 markings, 111973502 edges, 352149 markings/sec, 145 secs
lola: 57897098 markings, 115794195 edges, 382069 markings/sec, 150 secs
lola: 59808624 markings, 119617248 edges, 382305 markings/sec, 155 secs
lola: 61720785 markings, 123441569 edges, 382432 markings/sec, 160 secs
lola: 63605500 markings, 127211125 edges, 376943 markings/sec, 165 secs
lola: 64791317 markings, 129583658 edges, 237163 markings/sec, 170 secs
lola: 66252034 markings, 132504702 edges, 292143 markings/sec, 175 secs
lola: 67476625 markings, 134953250 edges, 244918 markings/sec, 180 secs
lola: 68961939 markings, 137923881 edges, 297063 markings/sec, 185 secs
lola: 70320894 markings, 140641787 edges, 271791 markings/sec, 190 secs
lola: 71813633 markings, 143627265 edges, 298548 markings/sec, 195 secs
lola: 73285590 markings, 146571179 edges, 294391 markings/sec, 200 secs
lola: 74695933 markings, 149391865 edges, 282069 markings/sec, 205 secs
lola: 75953535 markings, 151907069 edges, 251520 markings/sec, 210 secs
lola: 77342783 markings, 154685567 edges, 277850 markings/sec, 215 secs
lola: 78527687 markings, 157055372 edges, 236981 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p54 <= 0))) U ((1 <= p71) AND (1 <= p113) AND (1 <= p116) AND ((p31 <= 0) OR ((1 <= p45) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))) AND (((1 <= p38) AND (1 <= p63) AND (1 <= p81) AND (1 <= p104)) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p81) AND (1 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p54 <= 0)) U ((1 <= p71) AND (1 <= p113) AND (1 <= p116) AND ((p31 <= 0) OR ((1 <= p45) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))) AND (((1 <= p38) AND (1 <= p63) AND (1 <= p81) AND (1 <= p104)) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p81) AND (1 <= p99)))))
lola: processed formula length: 271
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3441767 markings, 3441768 edges, 688353 markings/sec, 0 secs
lola: 7022031 markings, 7022031 edges, 716053 markings/sec, 5 secs
lola: 10511823 markings, 10511823 edges, 697958 markings/sec, 10 secs
lola: 14007743 markings, 14007743 edges, 699184 markings/sec, 15 secs
lola: 17484537 markings, 17484538 edges, 695359 markings/sec, 20 secs
lola: 20881253 markings, 20881254 edges, 679343 markings/sec, 25 secs
lola: 24302571 markings, 24302572 edges, 684264 markings/sec, 30 secs
lola: 27572617 markings, 27572617 edges, 654009 markings/sec, 35 secs
lola: 31018469 markings, 31018470 edges, 689170 markings/sec, 40 secs
lola: 34421218 markings, 34421219 edges, 680550 markings/sec, 45 secs
lola: 37844819 markings, 37844820 edges, 684720 markings/sec, 50 secs
lola: 41246349 markings, 41246350 edges, 680306 markings/sec, 55 secs
lola: 44671077 markings, 44671077 edges, 684946 markings/sec, 60 secs
lola: 48085627 markings, 48085628 edges, 682910 markings/sec, 65 secs
lola: 51491564 markings, 51491565 edges, 681187 markings/sec, 70 secs
lola: 54929519 markings, 54929520 edges, 687591 markings/sec, 75 secs
lola: 58375730 markings, 58375731 edges, 689242 markings/sec, 80 secs
lola: 61815910 markings, 61815910 edges, 688036 markings/sec, 85 secs
lola: 64760684 markings, 64766849 edges, 588955 markings/sec, 90 secs
lola: 66515209 markings, 66515456 edges, 350905 markings/sec, 95 secs
lola: 68584504 markings, 68584504 edges, 413859 markings/sec, 100 secs
lola: 70534018 markings, 70534019 edges, 389903 markings/sec, 105 secs
lola: 72609515 markings, 72609516 edges, 415099 markings/sec, 110 secs
lola: 75044844 markings, 75044845 edges, 487066 markings/sec, 115 secs
lola: 77172502 markings, 77172502 edges, 425532 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p101 <= 0) AND ((p37 <= 0) OR (p67 <= 0) OR (p81 <= 0) OR (p96 <= 0))) OR (p119 <= 0) OR (p2 <= 0)))) OR A (G ((p65 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p65 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p65 <= 0)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p65)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 978 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p101 <= 0) AND ((p37 <= 0) OR (p67 <= 0) OR (p81 <= 0) OR (p96 <= 0))) OR (p119 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p101 <= 0) AND ((p37 <= 0) OR (p67 <= 0) OR (p81 <= 0) OR (p96 <= 0))) OR (p119 <= 0) OR (p2 <= 0))))
lola: processed formula length: 115
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p101) OR ((1 <= p37) AND (1 <= p67) AND (1 <= p81) AND (1 <= p96))) AND (1 <= p119) AND (1 <= p2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 978 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p6 <= 0))))) AND (((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 978 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: processed formula length: 107
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 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 15 will run for 1957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p6)
lola: processed formula length: 9
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p6)
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 7 markings, 7 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 1957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100))))))) OR A (F ((((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p67) AND (1 <= p80) AND (1 <= p120)) OR ((1 <= p11) AND (1 <= p58) AND (1 <= p65)) OR (p67 <= 0) OR (p80 <= 0) OR (p118 <= 0))
lola: processed formula length: 138
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: (((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: 4 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((p70 <= 0) OR (p81 <= 0) OR (p93 <= 0) OR (p102 <= 0)))) AND ((1 <= p11) AND ((1 <= p58) AND (1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((p70 <= 0) OR (p81 <= 0) OR (p93 <= 0) OR (p102 <= 0))) AND ((1 <= p11) AND ((1 <= p58) AND (1 <= p65)))))
lola: processed formula length: 117
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1082641 markings, 1082640 edges, 216528 markings/sec, 0 secs
lola: 2283921 markings, 2283920 edges, 240256 markings/sec, 5 secs
lola: 3383692 markings, 3383691 edges, 219954 markings/sec, 10 secs
lola: 4529189 markings, 4529189 edges, 229099 markings/sec, 15 secs
lola: 5675566 markings, 5675565 edges, 229275 markings/sec, 20 secs
lola: 6908885 markings, 6908885 edges, 246664 markings/sec, 25 secs
lola: 8156782 markings, 8156781 edges, 249579 markings/sec, 30 secs
lola: 9413109 markings, 9413108 edges, 251265 markings/sec, 35 secs
lola: 10668422 markings, 10668421 edges, 251063 markings/sec, 40 secs
lola: 11812132 markings, 11812131 edges, 228742 markings/sec, 45 secs
lola: 12937273 markings, 12937272 edges, 225028 markings/sec, 50 secs
lola: 14086631 markings, 14086631 edges, 229872 markings/sec, 55 secs
lola: 15206266 markings, 15206265 edges, 223927 markings/sec, 60 secs
lola: 16331868 markings, 16331868 edges, 225120 markings/sec, 65 secs
lola: 17546126 markings, 17546126 edges, 242852 markings/sec, 70 secs
lola: 18769260 markings, 18769259 edges, 244627 markings/sec, 75 secs
lola: 20014089 markings, 20014088 edges, 248966 markings/sec, 80 secs
lola: 21256347 markings, 21256346 edges, 248452 markings/sec, 85 secs
lola: 22507546 markings, 22507545 edges, 250240 markings/sec, 90 secs
lola: 23749788 markings, 23749787 edges, 248448 markings/sec, 95 secs
lola: 24990913 markings, 24990912 edges, 248225 markings/sec, 100 secs
lola: 26226993 markings, 26226992 edges, 247216 markings/sec, 105 secs
lola: 27477023 markings, 27477022 edges, 250006 markings/sec, 110 secs
lola: 28721711 markings, 28721711 edges, 248938 markings/sec, 115 secs
lola: 29974922 markings, 29974921 edges, 250642 markings/sec, 120 secs
lola: 31204678 markings, 31204678 edges, 245951 markings/sec, 125 secs
lola: 32453465 markings, 32453464 edges, 249757 markings/sec, 130 secs
lola: 33699962 markings, 33699961 edges, 249299 markings/sec, 135 secs
lola: 34949425 markings, 34949424 edges, 249893 markings/sec, 140 secs
lola: 36191462 markings, 36191461 edges, 248407 markings/sec, 145 secs
lola: 37436377 markings, 37436377 edges, 248983 markings/sec, 150 secs
lola: 38681750 markings, 38681749 edges, 249075 markings/sec, 155 secs
lola: 39919445 markings, 39919444 edges, 247539 markings/sec, 160 secs
lola: 41051075 markings, 41051092 edges, 226326 markings/sec, 165 secs
lola: 42091373 markings, 42091473 edges, 208060 markings/sec, 170 secs
lola: 42923786 markings, 42923923 edges, 166483 markings/sec, 175 secs
lola: 43893541 markings, 43893540 edges, 193951 markings/sec, 180 secs
lola: 45021621 markings, 45021620 edges, 225616 markings/sec, 185 secs
lola: 45937497 markings, 45937497 edges, 183175 markings/sec, 190 secs
lola: 46858432 markings, 46858433 edges, 184187 markings/sec, 195 secs
lola: 47721453 markings, 47721453 edges, 172604 markings/sec, 200 secs
lola: 48696634 markings, 48696634 edges, 195036 markings/sec, 205 secs
lola: 49620815 markings, 49620814 edges, 184836 markings/sec, 210 secs
lola: 50553634 markings, 50553633 edges, 186564 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (X ((A (G ((1 <= p52))) OR E (F ((1 <= p121)))))) OR ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p39) AND (1 <= p68) AND (1 <= p82) AND (1 <= p95) AND ((p70 <= 0) OR (p93 <= 0) OR (p102 <= 0)))
lola: processed formula length: 105
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((1 <= p52))) OR E (F ((1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AG((1 <= p52)) OR EF((1 <= p121))))
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3438776 markings, 3438776 edges, 687755 markings/sec, 0 secs
lola: 7022594 markings, 7022593 edges, 716764 markings/sec, 5 secs
lola: 10514858 markings, 10514857 edges, 698453 markings/sec, 10 secs
lola: 14038910 markings, 14038909 edges, 704810 markings/sec, 15 secs
lola: 17127749 markings, 17127749 edges, 617768 markings/sec, 20 secs
lola: 20399288 markings, 20399288 edges, 654308 markings/sec, 25 secs
lola: 23898647 markings, 23898647 edges, 699872 markings/sec, 30 secs
lola: 27393579 markings, 27393578 edges, 698986 markings/sec, 35 secs
lola: 30860741 markings, 30860741 edges, 693432 markings/sec, 40 secs
lola: 34343454 markings, 34343454 edges, 696543 markings/sec, 45 secs
lola: 37756486 markings, 37756486 edges, 682606 markings/sec, 50 secs
lola: 41188424 markings, 41188424 edges, 686388 markings/sec, 55 secs
lola: 44606170 markings, 44606170 edges, 683549 markings/sec, 60 secs
lola: 47960438 markings, 47960438 edges, 670854 markings/sec, 65 secs
lola: 51329981 markings, 51329980 edges, 673909 markings/sec, 70 secs
lola: 54765830 markings, 54765830 edges, 687170 markings/sec, 75 secs
lola: 58207377 markings, 58207377 edges, 688309 markings/sec, 80 secs
lola: 61636610 markings, 61636609 edges, 685847 markings/sec, 85 secs
lola: 64420493 markings, 64421060 edges, 556777 markings/sec, 90 secs
lola: 66877720 markings, 66882175 edges, 491445 markings/sec, 95 secs
lola: 69220875 markings, 69222271 edges, 468631 markings/sec, 100 secs
lola: 71631636 markings, 71632471 edges, 482152 markings/sec, 105 secs
lola: 73801163 markings, 73801162 edges, 433905 markings/sec, 110 secs
lola: 75848139 markings, 75848139 edges, 409395 markings/sec, 115 secs
lola: 77747373 markings, 77747373 edges, 379847 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (F (((1 <= p13) AND (1 <= p35) AND (1 <= p65) AND (1 <= p1) AND (1 <= p88)))) U (E (F (((1 <= p0) AND (1 <= p103)))) AND A (X (((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((1 <= p13) AND (1 <= p35) AND (1 <= p65) AND (1 <= p1) AND (1 <= p88))) U (EF(((1 <= p0) AND (1 <= p103))) AND AX(((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))))
lola: processed formula length: 181
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3248057 markings, 3248058 edges, 649611 markings/sec, 0 secs
lola: 6784324 markings, 6784325 edges, 707253 markings/sec, 5 secs
lola: 10287134 markings, 10287169 edges, 700562 markings/sec, 10 secs
lola: 13776806 markings, 13776807 edges, 697934 markings/sec, 15 secs
lola: 17238383 markings, 17238384 edges, 692315 markings/sec, 20 secs
lola: 20677154 markings, 20677155 edges, 687754 markings/sec, 25 secs
lola: 24118512 markings, 24118512 edges, 688272 markings/sec, 30 secs
lola: 27505124 markings, 27505124 edges, 677322 markings/sec, 35 secs
lola: 30908224 markings, 30908225 edges, 680620 markings/sec, 40 secs
lola: 34283007 markings, 34283008 edges, 674957 markings/sec, 45 secs
lola: 37228535 markings, 37228536 edges, 589106 markings/sec, 50 secs
lola: 40085529 markings, 40085530 edges, 571399 markings/sec, 55 secs
lola: 43065478 markings, 43065479 edges, 595990 markings/sec, 60 secs
lola: 46307805 markings, 46307806 edges, 648465 markings/sec, 65 secs
lola: 49654180 markings, 49654181 edges, 669275 markings/sec, 70 secs
lola: 53080319 markings, 53080319 edges, 685228 markings/sec, 75 secs
lola: 56506974 markings, 56506975 edges, 685331 markings/sec, 80 secs
lola: 59939486 markings, 59939487 edges, 686502 markings/sec, 85 secs
lola: 63361880 markings, 63362296 edges, 684479 markings/sec, 90 secs
lola: 65248241 markings, 65248443 edges, 377272 markings/sec, 95 secs
lola: 66939019 markings, 66939472 edges, 338156 markings/sec, 100 secs
lola: 68830717 markings, 68831167 edges, 378340 markings/sec, 105 secs
lola: 70998919 markings, 70998920 edges, 433640 markings/sec, 110 secs
lola: 73230654 markings, 73230655 edges, 446347 markings/sec, 115 secs
lola: 75244803 markings, 75244804 edges, 402830 markings/sec, 120 secs
lola: 77368193 markings, 77368193 edges, 424678 markings/sec, 125 secs
lola: 78924055 markings, 78924056 edges, 311172 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G ((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND E (F ((1 <= p9)))))) OR (((1 <= p2) AND (p67 <= 0)) AND (A (F (((1 <= p67) AND (1 <= p80) AND (1 <= p120)))) AND E (G (E (X (((1 <= p1) AND (1 <= p85)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (p67 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (p67 <= 0))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (G ((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND E (F ((1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p71 <= 0) OR (p113 <= 0) OR (p116 <= 0)) AND EF((1 <= p9))))
lola: processed formula length: 68
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: ========================================
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2829603 markings, 2829604 edges, 565921 markings/sec, 0 secs
lola: 6018371 markings, 6018372 edges, 637754 markings/sec, 5 secs
lola: 9556118 markings, 9556119 edges, 707549 markings/sec, 10 secs
lola: 13113338 markings, 13113338 edges, 711444 markings/sec, 15 secs
lola: 16604812 markings, 16604812 edges, 698295 markings/sec, 20 secs
lola: 20100212 markings, 20100213 edges, 699080 markings/sec, 25 secs
lola: 23443211 markings, 23443212 edges, 668600 markings/sec, 30 secs
lola: 26555410 markings, 26555411 edges, 622440 markings/sec, 35 secs
lola: 29964552 markings, 29964552 edges, 681828 markings/sec, 40 secs
lola: 33376318 markings, 33376322 edges, 682353 markings/sec, 45 secs
lola: 36791304 markings, 36791305 edges, 682997 markings/sec, 50 secs
lola: 40182824 markings, 40182824 edges, 678304 markings/sec, 55 secs
lola: 43598163 markings, 43598164 edges, 683068 markings/sec, 60 secs
lola: 47001782 markings, 47001783 edges, 680724 markings/sec, 65 secs
lola: 50403906 markings, 50403907 edges, 680425 markings/sec, 70 secs
lola: 53856407 markings, 53856407 edges, 690500 markings/sec, 75 secs
lola: 57293676 markings, 57293677 edges, 687454 markings/sec, 80 secs
lola: 60731575 markings, 60731576 edges, 687580 markings/sec, 85 secs
lola: 63904233 markings, 63904283 edges, 634532 markings/sec, 90 secs
lola: 66009374 markings, 66009374 edges, 421028 markings/sec, 95 secs
lola: 68048902 markings, 68049863 edges, 407906 markings/sec, 100 secs
lola: 70200103 markings, 70200104 edges, 430240 markings/sec, 105 secs
lola: 71864999 markings, 71865004 edges, 332979 markings/sec, 110 secs
lola: 74032913 markings, 74032913 edges, 433583 markings/sec, 115 secs
lola: 75926135 markings, 75926135 edges, 378644 markings/sec, 120 secs
lola: 77982838 markings, 77982839 edges, 411341 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (E ((((1 <= p4) OR (1 <= p68)) U ((1 <= p3) AND (1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E ((((1 <= p4) OR (1 <= p68)) U ((1 <= p3) AND (1 <= p121))))))
lola: processed formula length: 70
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p121))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3356713 markings, 3356713 edges, 671343 markings/sec, 0 secs
lola: sara is running 5 secs || 6737707 markings, 6737707 edges, 676199 markings/sec, 5 secs
lola: sara is running 10 secs || 10135392 markings, 10135392 edges, 679537 markings/sec, 10 secs
lola: sara is running 15 secs || 13493869 markings, 13493869 edges, 671695 markings/sec, 15 secs
lola: sara is running 20 secs || 16757209 markings, 16757209 edges, 652668 markings/sec, 20 secs
lola: sara is running 25 secs || 19611346 markings, 19611346 edges, 570827 markings/sec, 25 secs
lola: sara is running 30 secs || 22468404 markings, 22468403 edges, 571412 markings/sec, 30 secs
lola: sara is running 35 secs || 25391467 markings, 25391466 edges, 584613 markings/sec, 35 secs
lola: sara is running 40 secs || 28568587 markings, 28568586 edges, 635424 markings/sec, 40 secs
lola: sara is running 45 secs || 31848978 markings, 31848987 edges, 656078 markings/sec, 45 secs
lola: sara is running 50 secs || 35062914 markings, 35062913 edges, 642787 markings/sec, 50 secs
lola: sara is running 55 secs || 37892304 markings, 37892303 edges, 565878 markings/sec, 55 secs
lola: sara is running 60 secs || 40833280 markings, 40833280 edges, 588195 markings/sec, 60 secs
lola: sara is running 65 secs || 44054454 markings, 44054453 edges, 644235 markings/sec, 65 secs
lola: sara is running 70 secs || 47307451 markings, 47307451 edges, 650599 markings/sec, 70 secs
lola: sara is running 75 secs || 50547470 markings, 50547469 edges, 648004 markings/sec, 75 secs
lola: sara is running 80 secs || 53793060 markings, 53793060 edges, 649118 markings/sec, 80 secs
lola: sara is running 85 secs || 57010591 markings, 57010591 edges, 643506 markings/sec, 85 secs
lola: sara is running 90 secs || 60266729 markings, 60266728 edges, 651228 markings/sec, 90 secs
lola: sara is running 95 secs || 63300123 markings, 63300122 edges, 606679 markings/sec, 95 secs
lola: sara is running 100 secs || 66103651 markings, 66103651 edges, 560706 markings/sec, 100 secs
lola: sara is running 105 secs || 68944560 markings, 68944560 edges, 568182 markings/sec, 105 secs
lola: sara is running 110 secs || 71866813 markings, 71866813 edges, 584451 markings/sec, 110 secs
lola: sara is running 115 secs || 74684537 markings, 74684536 edges, 563545 markings/sec, 115 secs
lola: sara is running 120 secs || 77580312 markings, 77580311 edges, 579155 markings/sec, 120 secs
lola: sara is running 125 secs || 80536170 markings, 80536170 edges, 591172 markings/sec, 125 secs
lola: sara is running 130 secs || 82783182 markings, 82783182 edges, 449402 markings/sec, 130 secs
lola: sara is running 135 secs || 85043664 markings, 85043664 edges, 452096 markings/sec, 135 secs
lola: sara is running 140 secs || 87071564 markings, 87071564 edges, 405580 markings/sec, 140 secs
lola: sara is running 145 secs || 89338242 markings, 89338241 edges, 453336 markings/sec, 145 secs
lola: sara is running 150 secs || 91387258 markings, 91387258 edges, 409803 markings/sec, 150 secs
lola: sara is running 155 secs || 94112129 markings, 94112129 edges, 544974 markings/sec, 155 secs
lola: sara is running 160 secs || 96377528 markings, 96377528 edges, 453080 markings/sec, 160 secs
lola: sara is running 165 secs || 99309265 markings, 99309266 edges, 586347 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((1 <= p13) AND (1 <= p58) AND (1 <= p65)))))) AND E (X (E (G (((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p13) AND (1 <= p58) AND (1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p13) AND (1 <= p58) AND (1 <= p65))
lola: processed formula length: 42
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p13) AND (1 <= p58) AND (1 <= p65))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: formula 0: ((p13 <= 0) OR (p58 <= 0) OR (p65 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-21-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-21-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-21-0.sara.
sara: try reading problem file CTLFireability-21-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3466991 markings, 3466991 edges, 693398 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7244560 markings, 7244560 edges, 755514 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10923271 markings, 10923271 edges, 735742 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14473952 markings, 14473952 edges, 710136 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18199128 markings, 18199128 edges, 745035 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21931689 markings, 21931689 edges, 746512 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25635713 markings, 25635712 edges, 740805 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29365348 markings, 29365348 edges, 745927 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33081295 markings, 33081295 edges, 743189 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 36746549 markings, 36746549 edges, 733051 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40445132 markings, 40445132 edges, 739717 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 44104053 markings, 44104053 edges, 731784 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 47690776 markings, 47690776 edges, 717345 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 51328268 markings, 51328268 edges, 727498 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 54982003 markings, 54982003 edges, 730747 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 58627168 markings, 58627177 edges, 729033 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 62299918 markings, 62299918 edges, 734550 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 65952711 markings, 65952711 edges, 730559 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 69643432 markings, 69643433 edges, 738144 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 73027111 markings, 73027114 edges, 676736 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 75918907 markings, 75918910 edges, 578359 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 77890571 markings, 77890571 edges, 394333 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 79545943 markings, 79545943 edges, 331074 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 81916638 markings, 81916638 edges, 474139 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 84288785 markings, 84288785 edges, 474429 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 87118136 markings, 87118136 edges, 565870 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 89581121 markings, 89581120 edges, 492597 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))
lola: processed formula length: 74
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p45) OR ((1 <= p40) AND (1 <= p70) AND (1 <= p82) AND (1 <= p93)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 4 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
sara: try reading problem file CTLFireability-22-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p64 <= 0)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p64 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p64)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-22-1.sara
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-22-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-22-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3718587 markings, 3718587 edges, 743717 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7503916 markings, 7503916 edges, 757066 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11213295 markings, 11213295 edges, 741876 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14724505 markings, 14724504 edges, 702242 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18202100 markings, 18202099 edges, 695519 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21646807 markings, 21646806 edges, 688941 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25056849 markings, 25056849 edges, 682008 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 28738789 markings, 28738788 edges, 736388 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32369610 markings, 32369610 edges, 726164 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 35957678 markings, 35957678 edges, 717614 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 39494977 markings, 39494977 edges, 707460 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 43073522 markings, 43073522 edges, 715709 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 46646893 markings, 46646893 edges, 714674 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 50143867 markings, 50143867 edges, 699395 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 53660510 markings, 53660510 edges, 703329 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 57187229 markings, 57187228 edges, 705344 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 60730214 markings, 60730214 edges, 708597 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 64305634 markings, 64305634 edges, 715084 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 67889286 markings, 67889286 edges, 716730 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 71496148 markings, 71496147 edges, 721372 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74415273 markings, 74415300 edges, 583825 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 76337385 markings, 76337413 edges, 384422 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 78491278 markings, 78491277 edges, 430779 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 81342391 markings, 81342418 edges, 570223 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 83956006 markings, 83956005 edges, 522723 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 86106913 markings, 86106912 edges, 430181 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 88321162 markings, 88321161 edges, 442850 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 90792064 markings, 90792063 edges, 494180 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p0) AND (1 <= p104)) OR ((1 <= p0) AND (1 <= p103)) OR ((1 <= p47) AND (1 <= p64) AND (1 <= p82) AND (1 <= p103)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p104 <= 0)) AND ((p0 <= 0) OR (p103 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: processed formula length: 124
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p0 <= 0) OR (p104 <= 0)) AND ((p0 <= 0) OR (p103 <= 0)) AND ((p47 <= 0) OR (p64 <= 0) OR (p82 <= 0) OR (p103 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p0) AND (1 <= p104)) OR ((1 <= p0) AND (1 <= p103)) OR ((1 <= p47) AND (1 <= p64) AND (1 <= p82) AND (1 <= p103)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-23-1.sara
lola: state equation: write sara problem file to CTLFireability-23-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-23-1.sara.sara:
try reading problem file CTLFireability-23-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3301674 markings, 3301674 edges, 660335 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7120181 markings, 7120181 edges, 763701 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10816932 markings, 10816932 edges, 739350 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14135282 markings, 14135282 edges, 663670 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 17382558 markings, 17382558 edges, 649455 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 20713531 markings, 20713531 edges, 666195 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 24384299 markings, 24384298 edges, 734154 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 28028077 markings, 28028077 edges, 728756 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 31700862 markings, 31700862 edges, 734557 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 35359804 markings, 35359804 edges, 731788 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 38696692 markings, 38696691 edges, 667378 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 42221610 markings, 42221610 edges, 704984 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 45392077 markings, 45392077 edges, 634093 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 48600258 markings, 48600258 edges, 641636 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 51910216 markings, 51910215 edges, 661992 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 55371929 markings, 55371929 edges, 692343 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 58825950 markings, 58825950 edges, 690804 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 62226596 markings, 62226595 edges, 680129 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 65740774 markings, 65740774 edges, 702836 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 69291167 markings, 69291167 edges, 710079 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 72698973 markings, 72698972 edges, 681561 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 75740312 markings, 75740311 edges, 608268 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 77638290 markings, 77638290 edges, 379596 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 79662243 markings, 79662243 edges, 404791 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 81486632 markings, 81486633 edges, 364878 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 84137539 markings, 84137539 edges, 530181 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 86998837 markings, 86998838 edges, 572260 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 89379863 markings, 89379862 edges, 476205 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 91426766 markings, 91426765 edges, 409381 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((E (F ((1 <= p75))) OR ((1 <= p71) AND (1 <= p82) AND (1 <= p92) AND (1 <= p113) AND (1 <= p35) AND (1 <= p65) AND (1 <= p100) AND ((1 <= p31) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p99))))) U ((1 <= p36) AND (1 <= p66) AND (1 <= p82) AND (1 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF((1 <= p75)) OR ((1 <= p71) AND (1 <= p82) AND (1 <= p92) AND (1 <= p113) AND (1 <= p35) AND (1 <= p65) AND (1 <= p100) AND ((1 <= p31) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p99))))) U ((1 <= p36) AND (1 <= p66) AND (1 <= p82) AND (1 <= p99)))
lola: processed formula length: 251
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1977778 markings, 3955555 edges, 395556 markings/sec, 0 secs
lola: 4003173 markings, 8006346 edges, 405079 markings/sec, 5 secs
lola: 5920873 markings, 11841746 edges, 383540 markings/sec, 10 secs
lola: 7726021 markings, 15452053 edges, 361030 markings/sec, 15 secs
lola: 9723553 markings, 19447106 edges, 399506 markings/sec, 20 secs
lola: 11690682 markings, 23381363 edges, 393426 markings/sec, 25 secs
lola: 13671989 markings, 27343978 edges, 396261 markings/sec, 30 secs
lola: 15547493 markings, 31094985 edges, 375101 markings/sec, 35 secs
lola: 17531835 markings, 35063670 edges, 396868 markings/sec, 40 secs
lola: 19479798 markings, 38959595 edges, 389593 markings/sec, 45 secs
lola: 21240002 markings, 42480003 edges, 352041 markings/sec, 50 secs
lola: 23174893 markings, 46349785 edges, 386978 markings/sec, 55 secs
lola: 25110000 markings, 50220014 edges, 387021 markings/sec, 60 secs
lola: 26904447 markings, 53808894 edges, 358889 markings/sec, 65 secs
lola: 28780925 markings, 57561849 edges, 375296 markings/sec, 70 secs
lola: 30734007 markings, 61468013 edges, 390616 markings/sec, 75 secs
lola: 32657063 markings, 65314125 edges, 384611 markings/sec, 80 secs
lola: 34585323 markings, 69170644 edges, 385652 markings/sec, 85 secs
lola: 36513899 markings, 73027798 edges, 385715 markings/sec, 90 secs
lola: 38199273 markings, 76398545 edges, 337075 markings/sec, 95 secs
lola: 39889534 markings, 79779067 edges, 338052 markings/sec, 100 secs
lola: 41790328 markings, 83580655 edges, 380159 markings/sec, 105 secs
lola: 43684200 markings, 87368400 edges, 378774 markings/sec, 110 secs
lola: 45450940 markings, 90901879 edges, 353348 markings/sec, 115 secs
lola: 47170160 markings, 94340320 edges, 343844 markings/sec, 120 secs
lola: 49048468 markings, 98096935 edges, 375662 markings/sec, 125 secs
lola: 50931703 markings, 101863406 edges, 376647 markings/sec, 130 secs
lola: 52857729 markings, 105715457 edges, 385205 markings/sec, 135 secs
lola: 54774863 markings, 109549725 edges, 383427 markings/sec, 140 secs
lola: 56691201 markings, 113382401 edges, 383268 markings/sec, 145 secs
lola: 58601578 markings, 117203156 edges, 382075 markings/sec, 150 secs
lola: 60523246 markings, 121046492 edges, 384334 markings/sec, 155 secs
lola: 62264995 markings, 124529989 edges, 348350 markings/sec, 160 secs
lola: 63894652 markings, 127789562 edges, 325931 markings/sec, 165 secs
lola: 65374232 markings, 130748961 edges, 295916 markings/sec, 170 secs
lola: 66134875 markings, 132269761 edges, 152129 markings/sec, 175 secs
lola: 67761589 markings, 135523178 edges, 325343 markings/sec, 180 secs
lola: 68659918 markings, 137319837 edges, 179666 markings/sec, 185 secs
lola: 69883354 markings, 139766708 edges, 244687 markings/sec, 190 secs
lola: 71228995 markings, 142457990 edges, 269128 markings/sec, 195 secs
lola: 72675983 markings, 145351977 edges, 289398 markings/sec, 200 secs
lola: 74005782 markings, 148011563 edges, 265960 markings/sec, 205 secs
lola: 75420100 markings, 150840200 edges, 282864 markings/sec, 210 secs
lola: 76890389 markings, 153780778 edges, 294058 markings/sec, 215 secs
lola: 78411885 markings, 156823770 edges, 304299 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p54 <= 0))) U ((1 <= p71) AND (1 <= p113) AND (1 <= p116) AND ((p31 <= 0) OR ((1 <= p45) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))) AND (((1 <= p38) AND (1 <= p63) AND (1 <= p81) AND (1 <= p104)) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p81) AND (1 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p54 <= 0)) U ((1 <= p71) AND (1 <= p113) AND (1 <= p116) AND ((p31 <= 0) OR ((1 <= p45) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))) AND (((1 <= p38) AND (1 <= p63) AND (1 <= p81) AND (1 <= p104)) OR ((1 <= p36) AND (1 <= p66) AND (1 <= p81) AND (1 <= p99)))))
lola: processed formula length: 271
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3154068 markings, 3154069 edges, 630814 markings/sec, 0 secs
lola: 6487199 markings, 6487200 edges, 666626 markings/sec, 5 secs
lola: 9803413 markings, 9803413 edges, 663243 markings/sec, 10 secs
lola: 13322484 markings, 13322485 edges, 703814 markings/sec, 15 secs
lola: 16334368 markings, 16334369 edges, 602377 markings/sec, 20 secs
lola: 19818124 markings, 19818125 edges, 696751 markings/sec, 25 secs
lola: 23228477 markings, 23228478 edges, 682071 markings/sec, 30 secs
lola: 26629572 markings, 26629573 edges, 680219 markings/sec, 35 secs
lola: 30070972 markings, 30070972 edges, 688280 markings/sec, 40 secs
lola: 33457332 markings, 33457333 edges, 677272 markings/sec, 45 secs
lola: 36859985 markings, 36859985 edges, 680531 markings/sec, 50 secs
lola: 40285895 markings, 40285896 edges, 685182 markings/sec, 55 secs
lola: 43693488 markings, 43693489 edges, 681519 markings/sec, 60 secs
lola: 47096817 markings, 47096817 edges, 680666 markings/sec, 65 secs
lola: 50456046 markings, 50456047 edges, 671846 markings/sec, 70 secs
lola: 53895535 markings, 53895535 edges, 687898 markings/sec, 75 secs
lola: 57340645 markings, 57340646 edges, 689022 markings/sec, 80 secs
lola: 60781650 markings, 60781650 edges, 688201 markings/sec, 85 secs
lola: 64095236 markings, 64096131 edges, 662717 markings/sec, 90 secs
lola: 66302486 markings, 66303104 edges, 441450 markings/sec, 95 secs
lola: 68116483 markings, 68116484 edges, 362799 markings/sec, 100 secs
lola: 70210451 markings, 70210452 edges, 418794 markings/sec, 105 secs
lola: 72192641 markings, 72192642 edges, 396438 markings/sec, 110 secs
lola: 74296852 markings, 74296853 edges, 420842 markings/sec, 115 secs
lola: 76282596 markings, 76282596 edges, 397149 markings/sec, 120 secs
lola: 78446196 markings, 78446197 edges, 432720 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100))))))) OR A (F ((((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p67) AND (1 <= p80) AND (1 <= p120)) OR ((1 <= p11) AND (1 <= p58) AND (1 <= p65)) OR (p67 <= 0) OR (p80 <= 0) OR (p118 <= 0))
lola: processed formula length: 138
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p67 <= 0) OR (p80 <= 0) OR (p120 <= 0)) AND ((p11 <= 0) OR (p58 <= 0) OR (p65 <= 0)) AND (1 <= p67) AND (1 <= p80) AND (1 <= p118))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-26-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))
lola: processed formula length: 75
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((p52 <= 0) AND ((p35 <= 0) OR (p65 <= 0) OR (p82 <= 0) OR (p100 <= 0)))
lola: formula 1: ((1 <= p52) OR ((1 <= p35) AND (1 <= p65) AND (1 <= p82) AND (1 <= p100)))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-27-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-27-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-27-0.sara.
sara: try reading problem file CTLFireability-27-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3067829 markings, 3067829 edges, 613566 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6261381 markings, 6261381 edges, 638710 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9774219 markings, 9774219 edges, 702568 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 13445515 markings, 13445514 edges, 734259 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 16843582 markings, 16843582 edges, 679613 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 20233170 markings, 20233170 edges, 677918 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 23827005 markings, 23827005 edges, 718767 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 27380670 markings, 27380669 edges, 710733 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 30967908 markings, 30967908 edges, 717448 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 34541490 markings, 34541490 edges, 714716 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 37940501 markings, 37940501 edges, 679802 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 41589019 markings, 41589019 edges, 729704 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 45202599 markings, 45202599 edges, 722716 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 48810764 markings, 48810764 edges, 721633 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 52438120 markings, 52438120 edges, 725471 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 56060109 markings, 56060109 edges, 724398 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 59631891 markings, 59631891 edges, 714356 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 63260106 markings, 63260106 edges, 725643 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 66885956 markings, 66885956 edges, 725170 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 70557680 markings, 70557679 edges, 734345 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74076012 markings, 74076012 edges, 703666 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 75940917 markings, 75940919 edges, 372981 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 77837981 markings, 77838059 edges, 379413 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 80075517 markings, 80075516 edges, 447507 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 82395629 markings, 82395629 edges, 464022 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 85600402 markings, 85600401 edges, 640955 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 88686095 markings, 88686095 edges, 617139 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 90968367 markings, 90968366 edges, 456454 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown unknown no unknown unknown unknown unknown yes unknown unknown unknown yes unknown unknown yes
lola:
preliminary result: no unknown unknown no unknown unknown unknown unknown yes unknown unknown unknown yes unknown unknown yes
lola: memory consumption: 3772 KB
lola: time consumption: 3358 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="Planning-PT-none"
export BK_EXAMINATION="CTLFireability"
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 Planning-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871600260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Planning-PT-none.tgz
mv Planning-PT-none execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;