Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-100101, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591228213419

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:50:15] [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-03 23:50:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:50:15] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2020-06-03 23:50:15] [INFO ] Transformed 504 places.
[2020-06-03 23:50:15] [INFO ] Transformed 403 transitions.
[2020-06-03 23:50:15] [INFO ] Parsed PT model containing 504 places and 403 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100010 steps, including 0 resets, run finished after 465 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:50:16] [INFO ] Computed 202 place invariants in 10 ms
[2020-06-03 23:50:16] [INFO ] [Real]Absence check using 202 positive place invariants in 168 ms returned sat
[2020-06-03 23:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:17] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2020-06-03 23:50:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 126 ms returned sat
[2020-06-03 23:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:18] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2020-06-03 23:50:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 39 ms.
[2020-06-03 23:50:19] [INFO ] Added : 81 causal constraints over 17 iterations in 466 ms. Result :sat
[2020-06-03 23:50:19] [INFO ] [Real]Absence check using 202 positive place invariants in 54 ms returned sat
[2020-06-03 23:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:19] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2020-06-03 23:50:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:20] [INFO ] [Nat]Absence check using 202 positive place invariants in 159 ms returned sat
[2020-06-03 23:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:21] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2020-06-03 23:50:21] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:22] [INFO ] Added : 187 causal constraints over 38 iterations in 927 ms. Result :sat
[2020-06-03 23:50:22] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:23] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-06-03 23:50:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:23] [INFO ] [Nat]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:23] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-06-03 23:50:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:50:24] [INFO ] Added : 160 causal constraints over 32 iterations in 1086 ms. Result :sat
[2020-06-03 23:50:24] [INFO ] [Real]Absence check using 202 positive place invariants in 104 ms returned sat
[2020-06-03 23:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:25] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2020-06-03 23:50:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 147 ms returned sat
[2020-06-03 23:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:26] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2020-06-03 23:50:26] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 39 ms.
[2020-06-03 23:50:27] [INFO ] Added : 194 causal constraints over 39 iterations in 1205 ms. Result :sat
[2020-06-03 23:50:28] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:28] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2020-06-03 23:50:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:29] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2020-06-03 23:50:29] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:50:31] [INFO ] Added : 266 causal constraints over 54 iterations in 1818 ms. Result :sat
[2020-06-03 23:50:31] [INFO ] [Real]Absence check using 202 positive place invariants in 67 ms returned sat
[2020-06-03 23:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:31] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2020-06-03 23:50:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 75 ms returned sat
[2020-06-03 23:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:32] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2020-06-03 23:50:32] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 23 ms.
[2020-06-03 23:50:33] [INFO ] Added : 152 causal constraints over 31 iterations in 861 ms. Result :sat
[2020-06-03 23:50:33] [INFO ] [Real]Absence check using 202 positive place invariants in 273 ms returned sat
[2020-06-03 23:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:34] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 23:50:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 70 ms returned sat
[2020-06-03 23:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:35] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-06-03 23:50:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 37 ms.
[2020-06-03 23:50:35] [INFO ] Added : 84 causal constraints over 17 iterations in 624 ms. Result :sat
[2020-06-03 23:50:35] [INFO ] [Real]Absence check using 202 positive place invariants in 227 ms returned sat
[2020-06-03 23:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:37] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2020-06-03 23:50:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 209 ms returned sat
[2020-06-03 23:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:38] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2020-06-03 23:50:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 38 ms.
[2020-06-03 23:50:39] [INFO ] Added : 180 causal constraints over 36 iterations in 1109 ms. Result :sat
[2020-06-03 23:50:40] [INFO ] [Real]Absence check using 202 positive place invariants in 290 ms returned sat
[2020-06-03 23:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:40] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2020-06-03 23:50:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:41] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-06-03 23:50:41] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 38 ms.
[2020-06-03 23:50:42] [INFO ] Added : 135 causal constraints over 27 iterations in 1041 ms. Result :sat
[2020-06-03 23:50:43] [INFO ] [Real]Absence check using 202 positive place invariants in 339 ms returned sat
[2020-06-03 23:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:43] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2020-06-03 23:50:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 103 ms returned sat
[2020-06-03 23:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:44] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2020-06-03 23:50:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2020-06-03 23:50:45] [INFO ] Added : 75 causal constraints over 15 iterations in 500 ms. Result :sat
[2020-06-03 23:50:45] [INFO ] [Real]Absence check using 202 positive place invariants in 183 ms returned sat
[2020-06-03 23:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:46] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2020-06-03 23:50:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 115 ms returned sat
[2020-06-03 23:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:46] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2020-06-03 23:50:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:47] [INFO ] Added : 87 causal constraints over 18 iterations in 412 ms. Result :sat
[2020-06-03 23:50:47] [INFO ] Flatten gal took : 77 ms
[2020-06-03 23:50:47] [INFO ] Flatten gal took : 25 ms
[2020-06-03 23:50:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 23:50:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-100101 @ 3570 seconds

FORMULA n0-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1950
rslt: Output for CTLFireability @ RefineWMG-PT-100101

{
"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": "Wed Jun 3 23:50:51 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "AX(EG(((p301 <= 0) OR (p302 <= 0) OR (p304 <= 0) OR (p468 <= 0))))",
"processed_size": 69,
"rewrites": 25
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 10401,
"markings": 10301,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EX(A((p163 <= 0) U ((1 <= p365) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))",
"processed_size": 81,
"rewrites": 25
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 10299,
"markings": 10200,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EF(AX(EG((1 <= p172))))",
"processed_size": 23,
"rewrites": 26
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 10402,
"markings": 10302,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((p482 <= 0)))",
"processed_size": 19,
"rewrites": 24
},
"result":
{
"edges": 101,
"markings": 102,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "A (G (((p205 <= 0) AND ((p286 <= 0) OR (p287 <= 0) OR (p289 <= 0)))))",
"processed_size": 71,
"rewrites": 25
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 517
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p113) AND (1 <= p405)) OR ((1 <= p295) AND (1 <= p96) AND (1 <= p97) AND (1 <= p99)))))",
"processed_size": 102,
"rewrites": 24
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 620
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p467 <= 0) OR ((p113 <= 0) AND (p460 <= 0) AND (p322 <= 0) AND ((p156 <= 0) OR (p157 <= 0) OR (p159 <= 0))))))",
"processed_size": 166,
"rewrites": 25
},
"result":
{
"edges": 99,
"markings": 100,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0)))))",
"processed_size": 87,
"rewrites": 25
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0)))))",
"processed_size": 87,
"rewrites": 25
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((p388 <= 0) OR ((1 <= p396) AND (1 <= p397) AND (1 <= p399)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154)) OR (p161 <= 0) OR (p162 <= 0) OR (p164 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))",
"processed_size": 206,
"rewrites": 26
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 81,
"problems": 9
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3848,
"runtime": 1620.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E(G(*)))) : E(F(**)) : E(F(**)) : A(G(**)) : (A(G(*)) OR A(F(**))) : E((** U **)) : A(G(*)) : E(G(E((** U **)))) : E(X(A((** U **)))) : A(G(*)) : E(F(A(X(E(G(**)))))) : E(G(E((** U **)))) : A(G(((E(X(**)) AND **) OR (E(F(**)) AND (** AND **))))) : E(F(*)) : E((E(X(*)) U A(G(**)))) : A(G(**))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "yes yes yes no no unknown no unknown no no yes unknown unknown yes unknown no ",
"value": "yes yes yes no no unknown no unknown no no yes unknown unknown yes unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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 (X (A (F (((1 <= p301) AND (1 <= p302) AND (1 <= p304) AND (1 <= p468))))))) : E (F (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))) : E (F ((((1 <= p113) AND (1 <= p405)) OR ((1 <= p295) AND (1 <= p96) AND (1 <= p97) AND (1 <= p99))))) : A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p467 <= 0) OR ((p113 <= 0) AND (p460 <= 0) AND (p322 <= 0) AND ((p156 <= 0) OR (p157 <= 0) OR (p159 <= 0)))))) : (NOT(E (F (((p342 <= 0) OR ((1 <= p453) AND (1 <= p341) AND (1 <= p342) AND (1 <= p344)))))) OR A (F (((1 <= p388) AND ((p396 <= 0) OR (p397 <= 0) OR (p399 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)) AND (1 <= p161) AND (1 <= p162) AND (1 <= p164) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))) : E (((p63 <= 0) U (p472 <= 0))) : NOT(E (F (((1 <= p116) AND (1 <= p117) AND (1 <= p119))))) : E (G (E (((p298 <= 0) U ((1 <= p291) AND (1 <= p292) AND (1 <= p294) AND (1 <= p483)))))) : E (X (A (((p163 <= 0) U ((1 <= p365) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49))))))) : NOT(E (F (((p107 <= 0) AND ((p437 <= 0) OR (p355 <= 0)))))) : E (F (A (X (E (G ((1 <= p172))))))) : E (G (E (((p18 <= 0) U (1 <= p190))))) : A (G (((E (X ((1 <= p177))) AND ((p113 <= 0) OR (p340 <= 0))) OR ((E (F ((1 <= p142))) AND (p278 <= 0)) AND ((1 <= p503) OR (1 <= p157)))))) : E ((((1 <= p192) AND ((1 <= p93) OR (1 <= p73) OR (1 <= p448) OR (1 <= p497))) U NOT(A (G ((1 <= p482)))))) : E ((NOT(A (X ((1 <= p72)))) U A (G ((1 <= p212))))) : A (G (A (G (((p205 <= 0) AND ((p286 <= 0) OR (p287 <= 0) OR (p289 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
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:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p301 <= 0) OR (p302 <= 0) OR (p304 <= 0) OR (p468 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p301 <= 0) OR (p302 <= 0) OR (p304 <= 0) OR (p468 <= 0))))
lola: processed formula length: 69
lola: 25 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: 10301 markings, 10401 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((p163 <= 0) U ((1 <= p365) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((p163 <= 0) U ((1 <= p365) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))
lola: processed formula length: 81
lola: 25 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10200 markings, 10299 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (E (G ((1 <= p172)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(EG((1 <= p172))))
lola: processed formula length: 23
lola: 26 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10302 markings, 10402 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((E (X ((1 <= p177))) AND ((p113 <= 0) OR (p340 <= 0))) OR (E (F ((1 <= p142))) AND ((p278 <= 0) AND ((1 <= p503) OR (1 <= p157)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((EX((1 <= p177)) AND ((p113 <= 0) OR (p340 <= 0))) OR (EF((1 <= p142)) AND ((p278 <= 0) AND ((1 <= p503) OR (1 <= p157))))))
lola: processed formula length: 130
lola: 26 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: 1212836 markings, 1825155 edges, 242567 markings/sec, 0 secs
lola: 2381030 markings, 3583246 edges, 233639 markings/sec, 5 secs
lola: 3555816 markings, 5351230 edges, 234957 markings/sec, 10 secs
lola: 4713767 markings, 7093882 edges, 231590 markings/sec, 15 secs
lola: 5865368 markings, 8827027 edges, 230320 markings/sec, 20 secs
lola: 6984364 markings, 10511045 edges, 223799 markings/sec, 25 secs
lola: 8112284 markings, 12208539 edges, 225584 markings/sec, 30 secs
lola: 9239475 markings, 13904861 edges, 225438 markings/sec, 35 secs
lola: 10421513 markings, 15683814 edges, 236408 markings/sec, 40 secs
lola: 11572624 markings, 17416111 edges, 230222 markings/sec, 45 secs
lola: 12719222 markings, 19141751 edges, 229320 markings/sec, 50 secs
lola: 13864009 markings, 20864546 edges, 228957 markings/sec, 55 secs
lola: 15002315 markings, 22577701 edges, 227661 markings/sec, 60 secs
lola: 15537336 markings, 23386540 edges, 107004 markings/sec, 65 secs
lola: 15891889 markings, 23916379 edges, 70911 markings/sec, 70 secs
lola: 16356384 markings, 24615537 edges, 92899 markings/sec, 75 secs
lola: 16732257 markings, 25181266 edges, 75175 markings/sec, 80 secs
lola: 17295066 markings, 26028273 edges, 112562 markings/sec, 85 secs
lola: 17449298 markings, 26260231 edges, 30846 markings/sec, 90 secs
lola: 17449298 markings, 26260231 edges, 0 markings/sec, 95 secs
lola: 17455081 markings, 26268974 edges, 1157 markings/sec, 100 secs
lola: 17956843 markings, 27024119 edges, 100352 markings/sec, 105 secs
lola: 18457160 markings, 27777042 edges, 100063 markings/sec, 110 secs
lola: 18457160 markings, 27777042 edges, 0 markings/sec, 115 secs
lola: 18469285 markings, 27795248 edges, 2425 markings/sec, 120 secs
lola: 19061561 markings, 28686685 edges, 118455 markings/sec, 125 secs
lola: 19361130 markings, 29137423 edges, 59914 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p72 <= 0))) U A (G ((1 <= p212)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p72 <= 0)) U AG((1 <= p212)))
lola: processed formula length: 35
lola: 26 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: 1061209 markings, 1597016 edges, 212242 markings/sec, 0 secs
lola: 1061209 markings, 1597016 edges, 0 markings/sec, 5 secs
lola: 2285404 markings, 3439390 edges, 244839 markings/sec, 10 secs
lola: 3726307 markings, 5607852 edges, 288181 markings/sec, 15 secs
lola: 5120579 markings, 7706152 edges, 278854 markings/sec, 20 secs
lola: 6512678 markings, 9801236 edges, 278420 markings/sec, 25 secs
lola: 7928997 markings, 11932675 edges, 283264 markings/sec, 30 secs
lola: 9323124 markings, 14030749 edges, 278825 markings/sec, 35 secs
lola: 10701221 markings, 16104766 edges, 275619 markings/sec, 40 secs
lola: 12062089 markings, 18152765 edges, 272174 markings/sec, 45 secs
lola: 13420245 markings, 20196711 edges, 271631 markings/sec, 50 secs
lola: 14788065 markings, 22255215 edges, 273564 markings/sec, 55 secs
lola: 16146110 markings, 24299003 edges, 271609 markings/sec, 60 secs
lola: 17493114 markings, 26326162 edges, 269401 markings/sec, 65 secs
lola: 18917301 markings, 28469556 edges, 284837 markings/sec, 70 secs
lola: 20338059 markings, 30607647 edges, 284152 markings/sec, 75 secs
lola: 21738022 markings, 32714573 edges, 279993 markings/sec, 80 secs
lola: 23100629 markings, 34765223 edges, 272521 markings/sec, 85 secs
lola: 24489263 markings, 36855018 edges, 277727 markings/sec, 90 secs
lola: 25864159 markings, 38924238 edges, 274979 markings/sec, 95 secs
lola: 26695379 markings, 40177815 edges, 166244 markings/sec, 100 secs
lola: 27100881 markings, 40785398 edges, 81100 markings/sec, 105 secs
lola: 27708089 markings, 41699238 edges, 121442 markings/sec, 110 secs
lola: 28995560 markings, 43636818 edges, 257494 markings/sec, 115 secs
lola: 29844470 markings, 44914358 edges, 169782 markings/sec, 120 secs
lola: 29850146 markings, 44922900 edges, 1135 markings/sec, 125 secs
lola: 30103217 markings, 45303766 edges, 50614 markings/sec, 130 secs
lola: 31049189 markings, 46727413 edges, 189194 markings/sec, 135 secs
lola: 31202736 markings, 46958439 edges, 30709 markings/sec, 140 secs
lola: 31202736 markings, 46958439 edges, 0 markings/sec, 145 secs
lola: 31944895 markings, 48075405 edges, 148432 markings/sec, 150 secs
lola: 32182847 markings, 48433519 edges, 47590 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p482 <= 0)))
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 ((p482 <= 0)))
lola: processed formula length: 19
lola: 24 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: (p482 <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p26) AND (1 <= p27) AND (1 <= p29))))
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 <= p26) AND (1 <= p27) AND (1 <= p29))))
lola: processed formula length: 50
lola: 24 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 <= p26) AND (1 <= p27) AND (1 <= p29))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 97 markings, 96 edges
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p107) OR ((1 <= p437) AND (1 <= p355)))))
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 (((1 <= p107) OR ((1 <= p437) AND (1 <= p355)))))
lola: processed formula length: 55
lola: 25 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: ((p107 <= 0) AND ((p437 <= 0) OR (p355 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 8 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p116 <= 0) OR (p117 <= 0) OR (p119 <= 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 (((p116 <= 0) OR (p117 <= 0) OR (p119 <= 0))))
lola: processed formula length: 53
lola: 25 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 <= p116) AND (1 <= p117) AND (1 <= p119))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p205 <= 0) AND ((p286 <= 0) OR (p287 <= 0) OR (p289 <= 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 (((p205 <= 0) AND ((p286 <= 0) OR (p287 <= 0) OR (p289 <= 0)))))
lola: processed formula length: 71
lola: 25 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 <= p205) OR ((1 <= p286) AND (1 <= p287) AND (1 <= p289)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p113) AND (1 <= p405)) OR ((1 <= p295) AND (1 <= p96) AND (1 <= p97) AND (1 <= p99)))))
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 <= p113) AND (1 <= p405)) OR ((1 <= p295) AND (1 <= p96) AND (1 <= p97) AND (1 <= p99)))))
lola: processed formula length: 102
lola: 24 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 <= p113) AND (1 <= p405)) OR ((1 <= p295) AND (1 <= p96) AND (1 <= p97) AND (1 <= p99)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
lola: ========================================
lola: subprocess 11 will run for 620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p467 <= 0) OR ((p113 <= 0) AND (p460 <= 0) AND (p322 <= 0) AND ((p156 <= 0) OR (p157 <= 0) OR (p159 <= 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 (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p467 <= 0) OR ((p113 <= 0) AND (p460 <= 0) AND (p322 <= 0) AND ((p156 <= 0) OR (p157 <= 0) OR (p159 <= 0))))))
lola: processed formula length: 166
lola: 25 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 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p467) AND ((1 <= p113) OR (1 <= p460) OR (1 <= p322) OR ((1 <= p156) AND (1 <= p157) AND (1 <= p159))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
lola: ========================================
lola: subprocess 12 will run for 775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p18 <= 0) U (1 <= p190)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808

lola: processed formula: EG(E((p18 <= 0) U (1 <= p190)))
lola: processed formula length: 31
lola: 25 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).
sara: place or transition ordering is non-deterministic

lola: 1380402 markings, 2077333 edges, 276080 markings/sec, 0 secs
lola: 2682286 markings, 4036622 edges, 260377 markings/sec, 5 secs
lola: 3989823 markings, 6004439 edges, 261507 markings/sec, 10 secs
lola: 5301298 markings, 7978089 edges, 262295 markings/sec, 15 secs
lola: 6613995 markings, 9953659 edges, 262539 markings/sec, 20 secs
lola: 7931884 markings, 11937021 edges, 263578 markings/sec, 25 secs
lola: 9236090 markings, 13899799 edges, 260841 markings/sec, 30 secs
lola: 10566085 markings, 15901359 edges, 265999 markings/sec, 35 secs
lola: 11858287 markings, 17846060 edges, 258440 markings/sec, 40 secs
lola: 13201807 markings, 19867964 edges, 268704 markings/sec, 45 secs
lola: 14539101 markings, 21880567 edges, 267459 markings/sec, 50 secs
lola: 15803748 markings, 23783720 edges, 252929 markings/sec, 55 secs
lola: 17122531 markings, 25768532 edges, 263757 markings/sec, 60 secs
lola: 18461784 markings, 27784001 edges, 267851 markings/sec, 65 secs
lola: 19792867 markings, 29787207 edges, 266217 markings/sec, 70 secs
lola: 21099842 markings, 31754159 edges, 261395 markings/sec, 75 secs
lola: 22438733 markings, 33769068 edges, 267778 markings/sec, 80 secs
lola: 23796314 markings, 35812161 edges, 271516 markings/sec, 85 secs
lola: 25154958 markings, 37856891 edges, 271729 markings/sec, 90 secs
lola: 26450200 markings, 39806225 edges, 259048 markings/sec, 95 secs
lola: 27196270 markings, 40929203 edges, 149214 markings/sec, 100 secs
lola: 27856240 markings, 41922188 edges, 131994 markings/sec, 105 secs
lola: 27897269 markings, 41983918 edges, 8206 markings/sec, 110 secs
lola: 27897269 markings, 41983918 edges, 0 markings/sec, 115 secs
lola: 28927114 markings, 43533805 edges, 205969 markings/sec, 120 secs
lola: 28966043 markings, 43592363 edges, 7786 markings/sec, 125 secs
lola: 28966043 markings, 43592363 edges, 0 markings/sec, 130 secs
lola: 28966043 markings, 43592363 edges, 0 markings/sec, 135 secs
lola: 29757874 markings, 44784092 edges, 158366 markings/sec, 140 secs
lola: 29855746 markings, 44931348 edges, 19574 markings/sec, 145 secs
lola: 29855746 markings, 44931348 edges, 0 markings/sec, 150 secs
lola: 30779554 markings, 46321684 edges, 184762 markings/sec, 155 secs
lola: 31266209 markings, 47053986 edges, 97331 markings/sec, 160 secs
lola: 31312197 markings, 47123230 edges, 9198 markings/sec, 165 secs
lola: 31974048 markings, 48119252 edges, 132370 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 970 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p298 <= 0) U ((1 <= p291) AND (1 <= p292) AND (1 <= p294) AND (1 <= p483))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p298 <= 0) U ((1 <= p291) AND (1 <= p292) AND (1 <= p294) AND (1 <= p483))))
lola: processed formula length: 82
lola: 25 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: 1397364 markings, 2102893 edges, 279473 markings/sec, 0 secs
lola: 2776640 markings, 4178625 edges, 275855 markings/sec, 5 secs
lola: 4129248 markings, 6214218 edges, 270522 markings/sec, 10 secs
lola: 5489275 markings, 8261001 edges, 272005 markings/sec, 15 secs
lola: 6855564 markings, 10317179 edges, 273258 markings/sec, 20 secs
lola: 8196011 markings, 12334513 edges, 268089 markings/sec, 25 secs
lola: 9557434 markings, 14383361 edges, 272285 markings/sec, 30 secs
lola: 10908883 markings, 16417274 edges, 270290 markings/sec, 35 secs
lola: 12266766 markings, 18460778 edges, 271577 markings/sec, 40 secs
lola: 13641826 markings, 20530152 edges, 275012 markings/sec, 45 secs
lola: 15005651 markings, 22582722 edges, 272765 markings/sec, 50 secs
lola: 16358713 markings, 24618974 edges, 270612 markings/sec, 55 secs
lola: 17666979 markings, 26587866 edges, 261653 markings/sec, 60 secs
lola: 19011736 markings, 28611653 edges, 268951 markings/sec, 65 secs
lola: 20391754 markings, 30688486 edges, 276004 markings/sec, 70 secs
lola: 21738072 markings, 32714639 edges, 269264 markings/sec, 75 secs
lola: 23139508 markings, 34823783 edges, 280287 markings/sec, 80 secs
lola: 24514181 markings, 36892514 edges, 274935 markings/sec, 85 secs
lola: 25899548 markings, 38977429 edges, 277073 markings/sec, 90 secs
lola: 26335221 markings, 39633089 edges, 87135 markings/sec, 95 secs
lola: 26700930 markings, 40185832 edges, 73142 markings/sec, 100 secs
lola: 27009605 markings, 40648119 edges, 61735 markings/sec, 105 secs
lola: 27706111 markings, 41696229 edges, 139301 markings/sec, 110 secs
lola: 28663500 markings, 43137481 edges, 191478 markings/sec, 115 secs
lola: 29813308 markings, 44867477 edges, 229962 markings/sec, 120 secs
lola: 30992424 markings, 46641927 edges, 235823 markings/sec, 125 secs
lola: 31225642 markings, 46992953 edges, 46644 markings/sec, 130 secs
lola: 32239666 markings, 48518984 edges, 202805 markings/sec, 135 secs
lola: 32379800 markings, 48729893 edges, 28027 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p63 <= 0) U (p472 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p63 <= 0) U (p472 <= 0)))
lola: processed formula length: 30
lola: 26 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 /EU)
lola: state space: using reachability graph (EU 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: 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: (p472 <= 0)
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1407371 markings, 2117937 edges, 281474 markings/sec, 0 secs
lola: sara is running 5 secs || 2773212 markings, 4173467 edges, 273168 markings/sec, 5 secs
lola: sara is running 10 secs || 4113629 markings, 6190751 edges, 268083 markings/sec, 10 secs
lola: sara is running 15 secs || 5461810 markings, 8219612 edges, 269636 markings/sec, 15 secs
lola: sara is running 20 secs || 6779579 markings, 10202865 edges, 263554 markings/sec, 20 secs
lola: sara is running 25 secs || 8071049 markings, 12146487 edges, 258294 markings/sec, 25 secs
lola: sara is running 30 secs || 9458358 markings, 14234213 edges, 277462 markings/sec, 30 secs
lola: sara is running 35 secs || 10835166 markings, 16306297 edges, 275362 markings/sec, 35 secs
lola: sara is running 40 secs || 12168734 markings, 18313253 edges, 266714 markings/sec, 40 secs
lola: sara is running 45 secs || 13492338 markings, 20305205 edges, 264721 markings/sec, 45 secs
lola: sara is running 50 secs || 14849928 markings, 22348340 edges, 271518 markings/sec, 50 secs
lola: sara is running 55 secs || 16196564 markings, 24374934 edges, 269327 markings/sec, 55 secs
lola: sara is running 60 secs || 17544800 markings, 26403994 edges, 269647 markings/sec, 60 secs
lola: sara is running 65 secs || 18912347 markings, 28462074 edges, 273509 markings/sec, 65 secs
lola: sara is running 70 secs || 20292463 markings, 30539060 edges, 276023 markings/sec, 70 secs
lola: sara is running 75 secs || 21681633 markings, 32629700 edges, 277834 markings/sec, 75 secs
lola: sara is running 80 secs || 23079970 markings, 34734158 edges, 279667 markings/sec, 80 secs
lola: sara is running 85 secs || 24468900 markings, 36824373 edges, 277786 markings/sec, 85 secs
lola: sara is running 90 secs || 25830978 markings, 38874228 edges, 272416 markings/sec, 90 secs
lola: sara is running 95 secs || 27208928 markings, 40948009 edges, 275590 markings/sec, 95 secs
lola: sara is running 100 secs || 28584915 markings, 43018781 edges, 275197 markings/sec, 100 secs
lola: sara is running 105 secs || 29679191 markings, 44665639 edges, 218855 markings/sec, 105 secs
lola: sara is running 110 secs || 30555121 markings, 45983846 edges, 175186 markings/sec, 110 secs
lola: sara is running 115 secs || 31271391 markings, 47061823 edges, 143254 markings/sec, 115 secs
lola: sara is running 120 secs || 32380886 markings, 48731554 edges, 221899 markings/sec, 120 secs
lola: sara is running 125 secs || 33538383 markings, 50473532 edges, 231499 markings/sec, 125 secs
lola: sara is running 130 secs || 34777039 markings, 52337598 edges, 247731 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0))))) OR A (F (((1 <= p388) AND ((p396 <= 0) OR (p397 <= 0) OR (p399 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)) AND (1 <= p161) AND (1 <= p162) AND (1 <= p164) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 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 (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0)))))
lola: processed formula length: 87
lola: 25 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: ((p342 <= 0) OR ((1 <= p453) AND (1 <= p341) AND (1 <= p342) AND (1 <= p344)))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 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: A (G (((E (X ((1 <= p177))) AND ((p113 <= 0) OR (p340 <= 0))) OR (E (F ((1 <= p142))) AND ((p278 <= 0) AND ((1 <= p503) OR (1 <= p157)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((EX((1 <= p177)) AND ((p113 <= 0) OR (p340 <= 0))) OR (EF((1 <= p142)) AND ((p278 <= 0) AND ((1 <= p503) OR (1 <= p157))))))
lola: processed formula length: 130
lola: 26 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: 1271618 markings, 1913626 edges, 254324 markings/sec, 0 secs
lola: 2504450 markings, 3768988 edges, 246566 markings/sec, 5 secs
lola: 3727480 markings, 5609627 edges, 244606 markings/sec, 10 secs
lola: 4923504 markings, 7409535 edges, 239205 markings/sec, 15 secs
lola: 6129079 markings, 9223849 edges, 241115 markings/sec, 20 secs
lola: 7321830 markings, 11018895 edges, 238550 markings/sec, 25 secs
lola: 8527137 markings, 12832861 edges, 241061 markings/sec, 30 secs
lola: 9714692 markings, 14620065 edges, 237511 markings/sec, 35 secs
lola: 10891970 markings, 16391809 edges, 235456 markings/sec, 40 secs
lola: 12088994 markings, 18193274 edges, 239405 markings/sec, 45 secs
lola: 13263758 markings, 19961180 edges, 234953 markings/sec, 50 secs
lola: 14405166 markings, 21678958 edges, 228282 markings/sec, 55 secs
lola: 15544610 markings, 23393815 edges, 227889 markings/sec, 60 secs
lola: 16389739 markings, 24665687 edges, 169026 markings/sec, 65 secs
lola: 16834860 markings, 25335790 edges, 89024 markings/sec, 70 secs
lola: 17656025 markings, 26572781 edges, 164233 markings/sec, 75 secs
lola: 18322699 markings, 27574647 edges, 133335 markings/sec, 80 secs
lola: 19191521 markings, 28882234 edges, 173764 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p72 <= 0))) U A (G ((1 <= p212)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p72 <= 0)) U AG((1 <= p212)))
lola: processed formula length: 35
lola: 26 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: 1414687 markings, 2128969 edges, 282937 markings/sec, 0 secs
lola: 2718961 markings, 4091814 edges, 260855 markings/sec, 5 secs
lola: 4020067 markings, 6049948 edges, 260221 markings/sec, 10 secs
lola: 5341197 markings, 8038119 edges, 264226 markings/sec, 15 secs
lola: 6658675 markings, 10020915 edges, 263496 markings/sec, 20 secs
lola: 8000396 markings, 12040099 edges, 268344 markings/sec, 25 secs
lola: 9326308 markings, 14035546 edges, 265182 markings/sec, 30 secs
lola: 10709995 markings, 16117968 edges, 276737 markings/sec, 35 secs
lola: 12091298 markings, 18196752 edges, 276261 markings/sec, 40 secs
lola: 13462092 markings, 20259701 edges, 274159 markings/sec, 45 secs
lola: 14820375 markings, 22303885 edges, 271657 markings/sec, 50 secs
lola: 16195361 markings, 24373136 edges, 274997 markings/sec, 55 secs
lola: 17501602 markings, 26338984 edges, 261248 markings/sec, 60 secs
lola: 18838768 markings, 28351345 edges, 267433 markings/sec, 65 secs
lola: 20151697 markings, 30327183 edges, 262586 markings/sec, 70 secs
lola: 21469122 markings, 32309900 edges, 263485 markings/sec, 75 secs
lola: 22804270 markings, 34319217 edges, 267030 markings/sec, 80 secs
lola: 24125020 markings, 36306859 edges, 264150 markings/sec, 85 secs
lola: 25475729 markings, 38339664 edges, 270142 markings/sec, 90 secs
lola: 26789877 markings, 40317421 edges, 262830 markings/sec, 95 secs
lola: 27667742 markings, 41638718 edges, 175573 markings/sec, 100 secs
lola: 28819147 markings, 43371559 edges, 230281 markings/sec, 105 secs
lola: 29530198 markings, 44441570 edges, 142210 markings/sec, 110 secs
lola: 30756074 markings, 46286289 edges, 245175 markings/sec, 115 secs
lola: 31959719 markings, 48097737 edges, 240729 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (((p18 <= 0) U (1 <= p190)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p18 <= 0) U (1 <= p190)))
lola: processed formula length: 31
lola: 25 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: 1441009 markings, 2168565 edges, 288202 markings/sec, 0 secs
lola: 2838593 markings, 4271830 edges, 279517 markings/sec, 5 secs
lola: 4236653 markings, 6375901 edges, 279612 markings/sec, 10 secs
lola: 5641317 markings, 8489805 edges, 280933 markings/sec, 15 secs
lola: 7028271 markings, 10577110 edges, 277391 markings/sec, 20 secs
lola: 8408850 markings, 12654868 edges, 276116 markings/sec, 25 secs
lola: 9806734 markings, 14758553 edges, 279577 markings/sec, 30 secs
lola: 11167061 markings, 16805757 edges, 272065 markings/sec, 35 secs
lola: 12530565 markings, 18857810 edges, 272701 markings/sec, 40 secs
lola: 13919353 markings, 20947867 edges, 277758 markings/sec, 45 secs
lola: 15289933 markings, 23010509 edges, 274116 markings/sec, 50 secs
lola: 16680798 markings, 25103679 edges, 278173 markings/sec, 55 secs
lola: 18028542 markings, 27131941 edges, 269549 markings/sec, 60 secs
lola: 19390217 markings, 29181271 edges, 272335 markings/sec, 65 secs
lola: 20773085 markings, 31262383 edges, 276574 markings/sec, 70 secs
lola: 22145899 markings, 33328364 edges, 274563 markings/sec, 75 secs
lola: 23524010 markings, 35402379 edges, 275622 markings/sec, 80 secs
lola: 24906536 markings, 37483046 edges, 276505 markings/sec, 85 secs
lola: 26259598 markings, 39519398 edges, 270612 markings/sec, 90 secs
lola: 27196254 markings, 40929032 edges, 187331 markings/sec, 95 secs
lola: 28148294 markings, 42362164 edges, 190408 markings/sec, 100 secs
lola: 29344500 markings, 44161921 edges, 239241 markings/sec, 105 secs
lola: 30505282 markings, 45908851 edges, 232156 markings/sec, 110 secs
lola: 31717308 markings, 47732928 edges, 242405 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (((p298 <= 0) U ((1 <= p291) AND (1 <= p292) AND (1 <= p294) AND (1 <= p483))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p298 <= 0) U ((1 <= p291) AND (1 <= p292) AND (1 <= p294) AND (1 <= p483))))
lola: processed formula length: 82
lola: 25 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: 1465705 markings, 2205717 edges, 293141 markings/sec, 0 secs
lola: 2859650 markings, 4303540 edges, 278789 markings/sec, 5 secs
lola: 4229092 markings, 6364531 edges, 273888 markings/sec, 10 secs
lola: 5582229 markings, 8400895 edges, 270627 markings/sec, 15 secs
lola: 6940138 markings, 10444456 edges, 271582 markings/sec, 20 secs
lola: 8301692 markings, 12493574 edges, 272311 markings/sec, 25 secs
lola: 9657496 markings, 14533956 edges, 271161 markings/sec, 30 secs
lola: 11028631 markings, 16597509 edges, 274227 markings/sec, 35 secs
lola: 12385870 markings, 18640069 edges, 271448 markings/sec, 40 secs
lola: 13738261 markings, 20675281 edges, 270478 markings/sec, 45 secs
lola: 15086361 markings, 22704181 edges, 269620 markings/sec, 50 secs
lola: 16424156 markings, 24717431 edges, 267559 markings/sec, 55 secs
lola: 17763535 markings, 26733147 edges, 267876 markings/sec, 60 secs
lola: 19137196 markings, 28800469 edges, 274732 markings/sec, 65 secs
lola: 20521204 markings, 30883316 edges, 276802 markings/sec, 70 secs
lola: 21852789 markings, 32887254 edges, 266317 markings/sec, 75 secs
lola: 23165263 markings, 34862504 edges, 262495 markings/sec, 80 secs
lola: 24488930 markings, 36854534 edges, 264733 markings/sec, 85 secs
lola: 25766101 markings, 38776610 edges, 255434 markings/sec, 90 secs
lola: 26796034 markings, 40326649 edges, 205987 markings/sec, 95 secs
lola: 27478004 markings, 41352961 edges, 136394 markings/sec, 100 secs
lola: 27803875 markings, 41843360 edges, 65174 markings/sec, 105 secs
lola: 28008749 markings, 42151720 edges, 40975 markings/sec, 110 secs
lola: 29209710 markings, 43959189 edges, 240192 markings/sec, 115 secs
lola: 30149552 markings, 45373532 edges, 187968 markings/sec, 120 secs
lola: 31339366 markings, 47164108 edges, 237963 markings/sec, 125 secs
lola: 32324210 markings, 48646251 edges, 196969 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((p63 <= 0) U (p472 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p63 <= 0) U (p472 <= 0)))
lola: processed formula length: 30
lola: 26 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 /EU)
lola: state space: using reachability graph (EU 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: 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: (p472 <= 0)
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-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 || 1366048 markings, 2055729 edges, 273210 markings/sec, 0 secs
lola: sara is running 5 secs || 2669092 markings, 4016774 edges, 260609 markings/sec, 5 secs
lola: sara is running 10 secs || 3978829 markings, 5987896 edges, 261947 markings/sec, 10 secs
lola: sara is running 15 secs || 5290095 markings, 7961238 edges, 262253 markings/sec, 15 secs
lola: sara is running 20 secs || 6661571 markings, 10025276 edges, 274295 markings/sec, 20 secs
lola: sara is running 25 secs || 8034753 markings, 12091861 edges, 274636 markings/sec, 25 secs
lola: sara is running 30 secs || 9375569 markings, 14109643 edges, 268163 markings/sec, 30 secs
lola: sara is running 35 secs || 10743979 markings, 16169066 edges, 273682 markings/sec, 35 secs
lola: sara is running 40 secs || 12076414 markings, 18174318 edges, 266487 markings/sec, 40 secs
lola: sara is running 45 secs || 13393940 markings, 20157103 edges, 263505 markings/sec, 45 secs
lola: sara is running 50 secs || 14705963 markings, 22131699 edges, 262405 markings/sec, 50 secs
lola: sara is running 55 secs || 16010564 markings, 24094990 edges, 260920 markings/sec, 55 secs
lola: sara is running 60 secs || 17312397 markings, 26054242 edges, 260367 markings/sec, 60 secs
lola: sara is running 65 secs || 18626166 markings, 28031382 edges, 262754 markings/sec, 65 secs
lola: sara is running 70 secs || 19935353 markings, 30001631 edges, 261837 markings/sec, 70 secs
lola: sara is running 75 secs || 21258600 markings, 31993075 edges, 264649 markings/sec, 75 secs
lola: sara is running 80 secs || 22564789 markings, 33958768 edges, 261238 markings/sec, 80 secs
lola: sara is running 85 secs || 23872031 markings, 35926138 edges, 261448 markings/sec, 85 secs
lola: sara is running 90 secs || 25208840 markings, 37937954 edges, 267362 markings/sec, 90 secs
lola: sara is running 95 secs || 26536989 markings, 39936729 edges, 265630 markings/sec, 95 secs
lola: sara is running 100 secs || 27872061 markings, 41945969 edges, 267014 markings/sec, 100 secs
lola: sara is running 105 secs || 29056790 markings, 43728925 edges, 236946 markings/sec, 105 secs
lola: sara is running 110 secs || 29635765 markings, 44600280 edges, 115795 markings/sec, 110 secs
lola: sara is running 115 secs || 30681024 markings, 46173293 edges, 209052 markings/sec, 115 secs
lola: sara is running 120 secs || 31798631 markings, 47855290 edges, 223521 markings/sec, 120 secs
lola: sara is running 125 secs || 32981833 markings, 49635922 edges, 236640 markings/sec, 125 secs
lola: sara is running 130 secs || 34148293 markings, 51391411 edges, 233292 markings/sec, 130 secs
lola: sara is running 135 secs || 35289315 markings, 53108594 edges, 228204 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0))))) OR A (F (((1 <= p388) AND ((p396 <= 0) OR (p397 <= 0) OR (p399 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)) AND (1 <= p161) AND (1 <= p162) AND (1 <= p164) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 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 (((1 <= p342) AND ((p453 <= 0) OR (p341 <= 0) OR (p342 <= 0) OR (p344 <= 0)))))
lola: processed formula length: 87
lola: 25 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: ((p342 <= 0) OR ((1 <= p453) AND (1 <= p341) AND (1 <= p342) AND (1 <= p344)))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: state equation: write sara problem file to CTLFireability-21-0.sara
lola: state equation: calling and running sara
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (F (((1 <= p388) AND ((p396 <= 0) OR (p397 <= 0) OR (p399 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)) AND (1 <= p161) AND (1 <= p162) AND (1 <= p164) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))
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:787
lola: processed formula: ((p388 <= 0) OR ((1 <= p396) AND (1 <= p397) AND (1 <= p399)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154)) OR (p161 <= 0) OR (p162 <= 0) OR (p164 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))
lola: processed formula length: 206
lola: 26 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)
sara: try reading problem file CTLFireability-21-0.sara.
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: ((1 <= p388) AND ((p396 <= 0) OR (p397 <= 0) OR (p399 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)) AND (1 <= p161) AND (1 <= p162) AND (1 <= p164) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 81 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-22-0.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-22-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no unknown no unknown no no yes unknown unknown yes unknown no
lola:
preliminary result: yes yes yes no no unknown no unknown no no yes unknown unknown yes unknown no
lola: memory consumption: 3848 KB
lola: time consumption: 1620 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="RefineWMG-PT-100101"
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 RefineWMG-PT-100101, 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 r186-oct2-158987938500124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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