fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478000804
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVs-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.270 3600000.00 4228447.00 1000.20 F?TFF????FTF??TF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.2K May 14 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 49K May 12 20:42 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 ShieldRVs-PT-004B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591327527166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:25:28] [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-05 03:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:25:28] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-06-05 03:25:28] [INFO ] Transformed 163 places.
[2020-06-05 03:25:28] [INFO ] Transformed 183 transitions.
[2020-06-05 03:25:28] [INFO ] Found NUPN structural information;
[2020-06-05 03:25:28] [INFO ] Parsed PT model containing 163 places and 183 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 523 resets, run finished after 159 ms. (steps per millisecond=628 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 183 rows 163 cols
[2020-06-05 03:25:28] [INFO ] Computed 17 place invariants in 7 ms
[2020-06-05 03:25:28] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-06-05 03:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:25:29] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 27 places in 39 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 21 places in 28 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 21 places in 16 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 20 places in 16 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 16 places in 13 ms
[2020-06-05 03:25:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 451 ms
[2020-06-05 03:25:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:25:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2020-06-05 03:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:25:29] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 35 places in 45 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 19 places in 26 ms
[2020-06-05 03:25:29] [INFO ] Deduced a trap composed of 16 places in 31 ms
[2020-06-05 03:25:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2020-06-05 03:25:29] [INFO ] Computed and/alt/rep : 182/515/182 causal constraints in 15 ms.
[2020-06-05 03:25:31] [INFO ] Added : 177 causal constraints over 39 iterations in 1763 ms. Result :unsat
[2020-06-05 03:25:31] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned unsat
[2020-06-05 03:25:31] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 03:25:31] [INFO ] Flatten gal took : 61 ms
[2020-06-05 03:25:31] [INFO ] Flatten gal took : 21 ms
[2020-06-05 03:25:31] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-05 03:25:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVs-PT-004B @ 3570 seconds

FORMULA ShieldRVs-PT-004B-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ ShieldRVs-PT-004B

{
"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": "Fri Jun 5 03:25:32 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p64))",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p12))",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 63,
"markings": 64,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((1 <= p25))))",
"processed_size": 20,
"rewrites": 54
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX(((1 <= p135) AND (1 <= p140) AND (1 <= p149) AND (1 <= p106)))",
"processed_size": 65,
"rewrites": 54
},
"net":
{
"conflict_clusters": 115,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p145))",
"processed_size": 13,
"rewrites": 56
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space /EXEF",
"value": false
},
"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": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((1 <= p79))))",
"processed_size": 20,
"rewrites": 54
},
"result":
{
"edges": 70,
"markings": 71,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 278
},
"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 <= p18) AND (1 <= p23) AND (1 <= p32))))",
"processed_size": 50,
"rewrites": 54
},
"result":
{
"edges": 67,
"markings": 68,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p146 <= 0) OR (p157 <= 0)) AND ((p6 <= 0) OR (p18 <= 0) OR (p43 <= 0)))))",
"processed_size": 85,
"rewrites": 55
},
"result":
{
"edges": 47,
"markings": 48,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p94 <= 0))",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 192,
"markings": 192,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p68 <= 0) OR (p82 <= 0) OR (p105 <= 0))",
"processed_size": 43,
"rewrites": 56
},
"result":
{
"edges": 337,
"markings": 337,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 418
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E(AF((((1 <= p74)) OR ((1 <= p149) AND (1 <= p160)))) U A(((1 <= p96) AND (1 <= p101) AND (1 <= p109)) U ((1 <= p60))))",
"processed_size": 120,
"rewrites": 56
},
"net":
{
"conflict_clusters": 115,
"singleton_clusters": 0
},
"result":
{
"edges": 58271072,
"markings": 10011303,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 484
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p54 <= 0))",
"processed_size": 12,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 605
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 54532,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(*)) : ((E((** U **)) OR (** AND E(F(*)))) AND (** OR (E(G(*)) OR (** OR (** OR **))))) : E(F(**)) : A(F(**)) : A(F(**)) : E(F((** AND (E(X(**)) AND **)))) : A(F((** AND E(F(*))))) : (A(F((E(F(**)) AND E(F(**))))) OR (E((* R *)) AND (** AND (** AND (** AND (** AND (** AND **))))))) : E((** U (** AND E(F(**))))) : (A(X(A(G(**)))) AND A(F(**))) : E((A(F(**)) U A((** U **)))) : (A(X(A(G(*)))) OR (E(F(**)) AND (E(G(**)) OR A(X(**))))) : E(G(E(F(**)))) : E(F((A(G(**)) AND **))) : E(F(**)) : (DEADLOCK AND (** OR A(F(*))))"
},
"net":
{
"arcs": 576,
"conflict_clusters": 115,
"places": 163,
"places_significant": 146,
"singleton_clusters": 0,
"transitions": 183
},
"result":
{
"interim_value": "no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no ",
"preliminary_value": "no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes 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: 346/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 183 transitions, 146 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: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: E (G (NOT(E (F ((((1 <= p146) AND (1 <= p157)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p43)))))))) : ((E ((((1 <= p16)) U ((1 <= p33)))) OR (((p130 <= 0)) AND NOT(A (G (((1 <= p10))))))) AND (((((((1 <= p5)) OR ((1 <= p159))) OR NOT(A (F (((1 <= p113)))))) OR ((1 <= p52) AND (1 <= p96) AND (1 <= p120))) OR ((1 <= p18) AND (1 <= p23) AND (1 <= p31))) OR ((1 <= p126) AND ((p134 <= 0) OR (p140 <= 0) OR (p148 <= 0) OR (p78 <= 0))))) : E (F (((1 <= p18) AND (1 <= p23) AND (1 <= p32)))) : A ((((1 <= p30)) U A (F (((1 <= p68) AND (1 <= p82) AND (1 <= p105)))))) : A (F ((E (X ((1 <= 0))) OR A ((((1 <= p48)) U ((1 <= p94))))))) : E (F (((((1 <= p5)) AND E (X (((1 <= p151))))) AND (((1 <= p129) AND (1 <= p52) AND (1 <= p93) AND (1 <= p120)) OR ((1 <= p91) AND (1 <= p135) AND (1 <= p159) AND (1 <= p99)))))) : A (F ((((1 <= p149) AND (1 <= p160)) AND NOT(A (G (((1 <= p17) AND (1 <= p23) AND (1 <= p32)))))))) : (A (F ((E (F (((1 <= p158)))) AND E (F (((1 <= p52) AND (1 <= p96) AND (1 <= p121))))))) OR ((((((NOT(A ((((1 <= p38)) U ((1 <= p119))))) AND ((1 <= p56))) AND ((1 <= p62))) AND ((1 <= p70))) AND ((1 <= p29))) AND ((1 <= p43))) AND ((1 <= p66)))) : E ((((p157 <= 0) OR ((1 <= p155)) OR ((1 <= p36) AND ((p20 <= 0)) AND (1 <= p49))) U (((1 <= p29)) AND E (F (((1 <= p21))))))) : (A (X (A (G (((p12 <= 0)))))) AND A (F (A (F (((p64 <= 0))))))) : E ((A (F ((((1 <= p74)) OR ((1 <= p149) AND (1 <= p160))))) U A ((((1 <= p96) AND (1 <= p101) AND (1 <= p109)) U ((1 <= p60)))))) : (A (X (NOT(E (F (((1 <= p145))))))) OR (E (F (((1 <= p25)))) AND (E (G (((p138 <= 0)))) OR A (X (((1 <= p135) AND (1 <= p140) AND (1 <= p149) AND (1 <= p106))))))) : E (G (E (F ((((1 <= p137)) OR ((1 <= p68) AND (1 <= p82) AND (1 <= p105)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p42) AND (1 <= p87))))))) : E (F ((A (G (((1 <= p72) AND (1 <= p6) AND (1 <= p15) AND (1 <= p43)))) AND ((p13 <= 0) OR (p54 <= 0) OR (p81 <= 0) OR ((1 <= p83) AND (1 <= p85)))))) : E (F (((1 <= p79)))) : (A (X ((1 <= 0))) AND (((p54 <= 0)) OR NOT(E (G (((1 <= p1)))))))
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:440
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5)) AND (E (X (((1 <= p151)))) AND (((1 <= p129) AND (1 <= p52) AND (1 <= p93) AND (1 <= p120)) OR ((1 <= p91) AND (1 <= p135) AND (1 <= p159) AND (1 <= p99)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p5)) AND (EX(((1 <= p151))) AND (((1 <= p129) AND (1 <= p52) AND (1 <= p93) AND (1 <= p120)) OR ((1 <= p91) AND (1 <= p135) AND (1 <= p159) AND (1 <= p99))))))
lola: processed formula length: 171
lola: 55 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: 570107 markings, 3725966 edges, 114021 markings/sec, 0 secs
lola: 1155097 markings, 7763871 edges, 116998 markings/sec, 5 secs
lola: 1664536 markings, 11628979 edges, 101888 markings/sec, 10 secs
lola: 2179119 markings, 15511307 edges, 102917 markings/sec, 15 secs
lola: 2623855 markings, 19130092 edges, 88947 markings/sec, 20 secs
lola: 3058054 markings, 22545495 edges, 86840 markings/sec, 25 secs
lola: 3497509 markings, 26000465 edges, 87891 markings/sec, 30 secs
lola: 3880542 markings, 29499383 edges, 76607 markings/sec, 35 secs
lola: 4354441 markings, 33397414 edges, 94780 markings/sec, 40 secs
lola: 4834208 markings, 36857990 edges, 95953 markings/sec, 45 secs
lola: 5317780 markings, 40377572 edges, 96714 markings/sec, 50 secs
lola: 5759149 markings, 43991471 edges, 88274 markings/sec, 55 secs
lola: 6222417 markings, 47777945 edges, 92654 markings/sec, 60 secs
lola: 6633552 markings, 51051208 edges, 82227 markings/sec, 65 secs
lola: 6997475 markings, 54326108 edges, 72785 markings/sec, 70 secs
lola: 7365627 markings, 57688293 edges, 73630 markings/sec, 75 secs
lola: 7943861 markings, 61747979 edges, 115647 markings/sec, 80 secs
lola: 8383795 markings, 65226434 edges, 87987 markings/sec, 85 secs
lola: 8827832 markings, 68706135 edges, 88807 markings/sec, 90 secs
lola: 9257922 markings, 72126207 edges, 86018 markings/sec, 95 secs
lola: 9665398 markings, 75465392 edges, 81495 markings/sec, 100 secs
lola: 10159203 markings, 79024732 edges, 98761 markings/sec, 105 secs
lola: 10614044 markings, 82526182 edges, 90968 markings/sec, 110 secs
lola: 11080738 markings, 86275684 edges, 93339 markings/sec, 115 secs
lola: 11506613 markings, 89691124 edges, 85175 markings/sec, 120 secs
lola: 11962177 markings, 93283049 edges, 91113 markings/sec, 125 secs
lola: 12382264 markings, 96854663 edges, 84017 markings/sec, 130 secs
lola: 12881345 markings, 100785345 edges, 99816 markings/sec, 135 secs
lola: 13352587 markings, 104724985 edges, 94248 markings/sec, 140 secs
lola: 13757862 markings, 108440981 edges, 81055 markings/sec, 145 secs
lola: 14156162 markings, 112043657 edges, 79660 markings/sec, 150 secs
lola: 14601862 markings, 115615990 edges, 89140 markings/sec, 155 secs
lola: 15052790 markings, 119440432 edges, 90186 markings/sec, 160 secs
lola: 15520912 markings, 123242219 edges, 93624 markings/sec, 165 secs
lola: 15977040 markings, 126970162 edges, 91226 markings/sec, 170 secs
lola: 16428343 markings, 130851935 edges, 90261 markings/sec, 175 secs
lola: 16849233 markings, 134498816 edges, 84178 markings/sec, 180 secs
lola: 17285499 markings, 138348938 edges, 87253 markings/sec, 185 secs
lola: 17704933 markings, 142167329 edges, 83887 markings/sec, 190 secs
lola: 18133436 markings, 145998360 edges, 85701 markings/sec, 195 secs
lola: 18531647 markings, 149769667 edges, 79642 markings/sec, 200 secs
lola: 18976905 markings, 153675332 edges, 89052 markings/sec, 205 secs
lola: 19333952 markings, 157081996 edges, 71409 markings/sec, 210 secs
lola: 19690091 markings, 160434894 edges, 71228 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1612280 KB
lola: time consumption: 225 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((p12 <= 0)))))) AND A (F (((p64 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p64 <= 0))))
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: ((1 <= p64))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p64 <= 0))
lola: state equation task get result unparse finished id 0
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p12))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 64 markings, 63 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((p145 <= 0)))))) OR (E (F (((1 <= p25)))) AND (E (G (((p138 <= 0)))) OR A (X (((1 <= p135) AND (1 <= p140) AND (1 <= p149) AND (1 <= p106)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p138 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p138 <= 0))))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p138))
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 845758 markings, 1171513 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p25))))
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 <= p25))))
lola: processed formula length: 20
lola: 54 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 <= p25))
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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p135) AND (1 <= p140) AND (1 <= p149) AND (1 <= p106))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p135) AND (1 <= p140) AND (1 <= p149) AND (1 <= p106)))
lola: processed formula length: 65
lola: 54 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p145 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p145))
lola: processed formula length: 13
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p145))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 41 markings, 40 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p79))))
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 <= p79))))
lola: processed formula length: 20
lola: 54 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 <= p79))
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: 71 markings, 70 edges
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p18) AND (1 <= p23) AND (1 <= p32))))
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 <= p18) AND (1 <= p23) AND (1 <= p32))))
lola: processed formula length: 50
lola: 54 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 <= p18) AND (1 <= p23) AND (1 <= p32))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68 markings, 67 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p146 <= 0) OR (p157 <= 0)) AND ((p6 <= 0) OR (p18 <= 0) OR (p43 <= 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 ((((p146 <= 0) OR (p157 <= 0)) AND ((p6 <= 0) OR (p18 <= 0) OR (p43 <= 0)))))
lola: processed formula length: 85
lola: 55 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 <= p146) AND (1 <= p157)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p43)))
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: 48 markings, 47 edges
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p94))))
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: ((p94 <= 0))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p94))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 192 markings, 192 edges
lola: ========================================
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p68) AND (1 <= p82) AND (1 <= p105))))
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: ((p68 <= 0) OR (p82 <= 0) OR (p105 <= 0))
lola: processed formula length: 43
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p68) AND (1 <= p82) AND (1 <= p105))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 337 markings, 337 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p149) AND (1 <= p160)) AND E (F (((p17 <= 0) OR (p23 <= 0) OR (p32 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p149) AND (1 <= p160)) AND EF(((p17 <= 0) OR (p23 <= 0) OR (p32 <= 0)))))
lola: processed formula length: 86
lola: 55 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: 509902 markings, 3440336 edges, 101980 markings/sec, 0 secs
lola: 1014725 markings, 7261879 edges, 100965 markings/sec, 5 secs
lola: 1465955 markings, 10991532 edges, 90246 markings/sec, 10 secs
lola: 1949165 markings, 14746184 edges, 96642 markings/sec, 15 secs
lola: 2383508 markings, 18227111 edges, 86869 markings/sec, 20 secs
lola: 2818035 markings, 21785459 edges, 86905 markings/sec, 25 secs
lola: 3244394 markings, 25074625 edges, 85272 markings/sec, 30 secs
lola: 3704518 markings, 28403960 edges, 92025 markings/sec, 35 secs
lola: 4076972 markings, 31530282 edges, 74491 markings/sec, 40 secs
lola: 4450782 markings, 34703816 edges, 74762 markings/sec, 45 secs
lola: 4771395 markings, 37693804 edges, 64123 markings/sec, 50 secs
lola: 5129934 markings, 40770434 edges, 71708 markings/sec, 55 secs
lola: 5455772 markings, 43784655 edges, 65168 markings/sec, 60 secs
lola: 5794038 markings, 46721771 edges, 67653 markings/sec, 65 secs
lola: 6128664 markings, 49760807 edges, 66925 markings/sec, 70 secs
lola: 6489424 markings, 52933857 edges, 72152 markings/sec, 75 secs
lola: 6913894 markings, 56231410 edges, 84894 markings/sec, 80 secs
lola: 7316740 markings, 59455787 edges, 80569 markings/sec, 85 secs
lola: 7709790 markings, 62800281 edges, 78610 markings/sec, 90 secs
lola: 8058654 markings, 65959707 edges, 69773 markings/sec, 95 secs
lola: 8435030 markings, 69280057 edges, 75275 markings/sec, 100 secs
lola: 8796605 markings, 72572825 edges, 72315 markings/sec, 105 secs
lola: 9162489 markings, 75774359 edges, 73177 markings/sec, 110 secs
lola: 9528874 markings, 79122647 edges, 73277 markings/sec, 115 secs
lola: 9930097 markings, 82610013 edges, 80245 markings/sec, 120 secs
lola: 10395631 markings, 86177627 edges, 93107 markings/sec, 125 secs
lola: 10813120 markings, 89632861 edges, 83498 markings/sec, 130 secs
lola: 11184238 markings, 92778200 edges, 74224 markings/sec, 135 secs
lola: 11528189 markings, 95984261 edges, 68790 markings/sec, 140 secs
lola: 11919140 markings, 99344597 edges, 78190 markings/sec, 145 secs
lola: 12271477 markings, 102646777 edges, 70467 markings/sec, 150 secs
lola: 12681654 markings, 106135013 edges, 82035 markings/sec, 155 secs
lola: 13043541 markings, 109500579 edges, 72377 markings/sec, 160 secs
lola: 13474384 markings, 113097032 edges, 86169 markings/sec, 165 secs
lola: 13964984 markings, 116802135 edges, 98120 markings/sec, 170 secs
lola: 14376287 markings, 120301475 edges, 82261 markings/sec, 175 secs
lola: 14756047 markings, 123689890 edges, 75952 markings/sec, 180 secs
lola: 15134377 markings, 127058894 edges, 75666 markings/sec, 185 secs
lola: 15505596 markings, 130388289 edges, 74244 markings/sec, 190 secs
lola: 15888117 markings, 133781274 edges, 76504 markings/sec, 195 secs
lola: 16257793 markings, 137139277 edges, 73935 markings/sec, 200 secs
lola: 16651294 markings, 140599014 edges, 78700 markings/sec, 205 secs
lola: 17082582 markings, 144091677 edges, 86258 markings/sec, 210 secs
lola: 17441069 markings, 147318709 edges, 71697 markings/sec, 215 secs
lola: 17778755 markings, 150501049 edges, 67537 markings/sec, 220 secs
lola: 18100457 markings, 153649265 edges, 64340 markings/sec, 225 secs
lola: 18410929 markings, 156761210 edges, 62094 markings/sec, 230 secs
lola: 18733286 markings, 159867041 edges, 64471 markings/sec, 235 secs
lola: 19026710 markings, 162947497 edges, 58685 markings/sec, 240 secs
lola: 19366450 markings, 166140099 edges, 67948 markings/sec, 245 secs
lola: 19674090 markings, 169281591 edges, 61528 markings/sec, 250 secs
lola: 20012514 markings, 172538447 edges, 67685 markings/sec, 255 secs
lola: 20406256 markings, 175943385 edges, 78748 markings/sec, 260 secs
lola: 20765178 markings, 179126189 edges, 71784 markings/sec, 265 secs
lola: 21101477 markings, 182277488 edges, 67260 markings/sec, 270 secs
lola: 21422199 markings, 185376935 edges, 64144 markings/sec, 275 secs
lola: 21722788 markings, 188483397 edges, 60118 markings/sec, 280 secs
lola: 22046066 markings, 191560726 edges, 64656 markings/sec, 285 secs
lola: 22347152 markings, 194639633 edges, 60217 markings/sec, 290 secs
lola: 22673740 markings, 197777627 edges, 65318 markings/sec, 295 secs
lola: 22988374 markings, 200919931 edges, 62927 markings/sec, 300 secs
lola: 23314594 markings, 204118985 edges, 65244 markings/sec, 305 secs
lola: 23696009 markings, 207501640 edges, 76283 markings/sec, 310 secs
lola: 24067780 markings, 210722679 edges, 74354 markings/sec, 315 secs
lola: 24374681 markings, 213630631 edges, 61380 markings/sec, 320 secs
lola: 24677499 markings, 216503212 edges, 60564 markings/sec, 325 secs
lola: 24962043 markings, 219404788 edges, 56909 markings/sec, 330 secs
lola: 25285298 markings, 222525418 edges, 64651 markings/sec, 335 secs
lola: 25598380 markings, 225630871 edges, 62616 markings/sec, 340 secs
lola: 25918844 markings, 228802556 edges, 64093 markings/sec, 345 secs
lola: 26249348 markings, 232001052 edges, 66101 markings/sec, 350 secs
lola: 26559984 markings, 235183715 edges, 62127 markings/sec, 355 secs
lola: 26914089 markings, 238514964 edges, 70821 markings/sec, 360 secs
lola: 27333490 markings, 241740173 edges, 83880 markings/sec, 365 secs
lola: 27691183 markings, 244740145 edges, 71539 markings/sec, 370 secs
lola: 28043035 markings, 247711241 edges, 70370 markings/sec, 375 secs
lola: 28373711 markings, 250773718 edges, 66135 markings/sec, 380 secs
lola: 28706372 markings, 253662183 edges, 66532 markings/sec, 385 secs
lola: 29031684 markings, 256612263 edges, 65062 markings/sec, 390 secs
lola: 29364036 markings, 259534174 edges, 66470 markings/sec, 395 secs
lola: 29693305 markings, 262491628 edges, 65854 markings/sec, 400 secs
lola: 30023706 markings, 265447487 edges, 66080 markings/sec, 405 secs
lola: 30405159 markings, 268571961 edges, 76291 markings/sec, 410 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no unknown no unknown unknown yes unknown
lola: memory consumption: 2307896 KB
lola: time consumption: 645 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((1 <= p72) AND (1 <= p6) AND (1 <= p15) AND (1 <= p43)))) AND ((p13 <= 0) OR (p54 <= 0) OR (p81 <= 0) OR ((1 <= p83) AND (1 <= p85))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG(((1 <= p72) AND (1 <= p6) AND (1 <= p15) AND (1 <= p43))) AND ((p13 <= 0) OR (p54 <= 0) OR (p81 <= 0) OR ((1 <= p83) AND (1 <= p85)))))
lola: processed formula length: 145
lola: 55 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: 476315 markings, 3522366 edges, 95263 markings/sec, 0 secs
lola: 925401 markings, 7076456 edges, 89817 markings/sec, 5 secs
lola: 1345994 markings, 10542465 edges, 84119 markings/sec, 10 secs
lola: 1765581 markings, 14112549 edges, 83917 markings/sec, 15 secs
lola: 2216523 markings, 18015859 edges, 90188 markings/sec, 20 secs
lola: 2615681 markings, 21690453 edges, 79832 markings/sec, 25 secs
lola: 3065956 markings, 25665593 edges, 90055 markings/sec, 30 secs
lola: 3484023 markings, 29367913 edges, 83613 markings/sec, 35 secs
lola: 3819892 markings, 32753724 edges, 67174 markings/sec, 40 secs
lola: 4149976 markings, 36123839 edges, 66017 markings/sec, 45 secs
lola: 4577913 markings, 39575361 edges, 85587 markings/sec, 50 secs
lola: 5035084 markings, 43352587 edges, 91434 markings/sec, 55 secs
lola: 5436843 markings, 46779457 edges, 80352 markings/sec, 60 secs
lola: 5812408 markings, 50237249 edges, 75113 markings/sec, 65 secs
lola: 6186430 markings, 53650955 edges, 74804 markings/sec, 70 secs
lola: 6557179 markings, 56993780 edges, 74150 markings/sec, 75 secs
lola: 6900773 markings, 60291332 edges, 68719 markings/sec, 80 secs
lola: 7203820 markings, 63498800 edges, 60609 markings/sec, 85 secs
lola: 7635523 markings, 67167531 edges, 86341 markings/sec, 90 secs
lola: 8071216 markings, 70833641 edges, 87139 markings/sec, 95 secs
lola: 8487250 markings, 74563875 edges, 83207 markings/sec, 100 secs
lola: 8891551 markings, 78070118 edges, 80860 markings/sec, 105 secs
lola: 9271019 markings, 81495345 edges, 75894 markings/sec, 110 secs
lola: 9649679 markings, 85009856 edges, 75732 markings/sec, 115 secs
lola: 10132633 markings, 88954606 edges, 96591 markings/sec, 120 secs
lola: 10584873 markings, 92877700 edges, 90448 markings/sec, 125 secs
lola: 11020280 markings, 96813057 edges, 87081 markings/sec, 130 secs
lola: 11458001 markings, 100769753 edges, 87544 markings/sec, 135 secs
lola: 11914345 markings, 104798725 edges, 91269 markings/sec, 140 secs
lola: 12335189 markings, 108789612 edges, 84169 markings/sec, 145 secs
lola: 12766680 markings, 112603435 edges, 86298 markings/sec, 150 secs
lola: 13158269 markings, 116250181 edges, 78318 markings/sec, 155 secs
lola: 13527985 markings, 119853913 edges, 73943 markings/sec, 160 secs
lola: 13887695 markings, 123517189 edges, 71942 markings/sec, 165 secs
lola: 14294036 markings, 127377382 edges, 81268 markings/sec, 170 secs
lola: 14720118 markings, 131359295 edges, 85216 markings/sec, 175 secs
lola: 15151546 markings, 135330457 edges, 86286 markings/sec, 180 secs
lola: 15559594 markings, 139134990 edges, 81610 markings/sec, 185 secs
lola: 15973421 markings, 142913586 edges, 82765 markings/sec, 190 secs
lola: 16378401 markings, 146838877 edges, 80996 markings/sec, 195 secs
lola: 16784429 markings, 150771546 edges, 81206 markings/sec, 200 secs
lola: 17184761 markings, 154660058 edges, 80066 markings/sec, 205 secs
lola: 17577944 markings, 158566707 edges, 78637 markings/sec, 210 secs
lola: 17963644 markings, 162404375 edges, 77140 markings/sec, 215 secs
lola: 18337929 markings, 166250620 edges, 74857 markings/sec, 220 secs
lola: 18718968 markings, 170134930 edges, 76208 markings/sec, 225 secs
lola: 19115047 markings, 174078079 edges, 79216 markings/sec, 230 secs
lola: 19480924 markings, 177968402 edges, 73175 markings/sec, 235 secs
lola: 19857639 markings, 181816630 edges, 75343 markings/sec, 240 secs
lola: 20228405 markings, 185629941 edges, 74153 markings/sec, 245 secs
lola: 20616444 markings, 189511486 edges, 77608 markings/sec, 250 secs
lola: 21085408 markings, 193539117 edges, 93793 markings/sec, 255 secs
lola: 21553184 markings, 197518743 edges, 93555 markings/sec, 260 secs
lola: 22002011 markings, 201457121 edges, 89765 markings/sec, 265 secs
lola: 22453610 markings, 205300556 edges, 90320 markings/sec, 270 secs
lola: 22854147 markings, 208967607 edges, 80107 markings/sec, 275 secs
lola: 23221933 markings, 212334753 edges, 73557 markings/sec, 280 secs
lola: 23556309 markings, 215515458 edges, 66875 markings/sec, 285 secs
lola: 23891666 markings, 218966214 edges, 67071 markings/sec, 290 secs
lola: 24315195 markings, 222773858 edges, 84706 markings/sec, 295 secs
lola: 24771621 markings, 226690421 edges, 91285 markings/sec, 300 secs
lola: 25199559 markings, 230562925 edges, 85588 markings/sec, 305 secs
lola: 25618534 markings, 234436269 edges, 83795 markings/sec, 310 secs
lola: 26022548 markings, 238236508 edges, 80803 markings/sec, 315 secs
lola: 26374058 markings, 241875063 edges, 70302 markings/sec, 320 secs
lola: 26749902 markings, 245274232 edges, 75169 markings/sec, 325 secs
lola: 27133259 markings, 248790698 edges, 76671 markings/sec, 330 secs
lola: 27533834 markings, 252512105 edges, 80115 markings/sec, 335 secs
lola: 27918453 markings, 256393205 edges, 76924 markings/sec, 340 secs
lola: 28312401 markings, 260249771 edges, 78790 markings/sec, 345 secs
lola: 28761743 markings, 264080046 edges, 89868 markings/sec, 350 secs
lola: 29143513 markings, 267747819 edges, 76354 markings/sec, 355 secs
lola: 29549777 markings, 271537282 edges, 81253 markings/sec, 360 secs
lola: 29972438 markings, 275440419 edges, 84532 markings/sec, 365 secs
lola: 30387574 markings, 279368064 edges, 83027 markings/sec, 370 secs
lola: 30818254 markings, 283277792 edges, 86136 markings/sec, 375 secs
lola: 31233243 markings, 287184296 edges, 82998 markings/sec, 380 secs
lola: 31625429 markings, 291102095 edges, 78437 markings/sec, 385 secs
lola: 32001700 markings, 294883778 edges, 75254 markings/sec, 390 secs
lola: 32403589 markings, 298674489 edges, 80378 markings/sec, 395 secs
lola: 32772840 markings, 302140772 edges, 73850 markings/sec, 400 secs
lola: 33141804 markings, 305535556 edges, 73793 markings/sec, 405 secs
lola: 33523814 markings, 309030986 edges, 76402 markings/sec, 410 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no unknown no unknown unknown yes unknown
lola: memory consumption: 2594256 KB
lola: time consumption: 1062 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((((1 <= p74)) OR ((1 <= p149) AND (1 <= p160))))) U A ((((1 <= p96) AND (1 <= p101) AND (1 <= p109)) U ((1 <= p60))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((((1 <= p74)) OR ((1 <= p149) AND (1 <= p160)))) U A(((1 <= p96) AND (1 <= p101) AND (1 <= p109)) U ((1 <= p60))))
lola: processed formula length: 120
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 715230 markings, 3530044 edges, 143046 markings/sec, 0 secs
lola: 1318375 markings, 6722131 edges, 120629 markings/sec, 5 secs
lola: 1880364 markings, 9983433 edges, 112398 markings/sec, 10 secs
lola: 2500429 markings, 13445339 edges, 124013 markings/sec, 15 secs
lola: 3103219 markings, 17021871 edges, 120558 markings/sec, 20 secs
lola: 3666132 markings, 20451621 edges, 112583 markings/sec, 25 secs
lola: 4123253 markings, 23426195 edges, 91424 markings/sec, 30 secs
lola: 4719733 markings, 26845109 edges, 119296 markings/sec, 35 secs
lola: 5273184 markings, 30080300 edges, 110690 markings/sec, 40 secs
lola: 5777496 markings, 33199204 edges, 100862 markings/sec, 45 secs
lola: 6248886 markings, 36249325 edges, 94278 markings/sec, 50 secs
lola: 6842891 markings, 39652517 edges, 118801 markings/sec, 55 secs
lola: 7394046 markings, 42893142 edges, 110231 markings/sec, 60 secs
lola: 7901395 markings, 46013523 edges, 101470 markings/sec, 65 secs
lola: 8363414 markings, 49015089 edges, 92404 markings/sec, 70 secs
lola: 8976963 markings, 52519158 edges, 122710 markings/sec, 75 secs
lola: 9594352 markings, 56128050 edges, 123478 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10011303 markings, 58271072 edges
lola: ========================================
lola: subprocess 11 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (((p54 <= 0)) OR A (F (((p1 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p54 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p54 <= 0))
lola: processed formula length: 12
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p157 <= 0) OR ((1 <= p155)) OR ((1 <= p36) AND ((p20 <= 0)) AND (1 <= p49))) U (((1 <= p29)) AND E (F (((1 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p157) AND ((p155 <= 0)) AND ((p36 <= 0) OR ((1 <= p20)) OR (p49 <= 0))) R (((p29 <= 0)) OR G (((p21 <= 0)))))
lola: processed formula length: 119
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 602465 markings, 3864507 edges, 120493 markings/sec, 0 secs
lola: 1128751 markings, 7500313 edges, 105257 markings/sec, 5 secs
lola: 1648078 markings, 11299529 edges, 103865 markings/sec, 10 secs
lola: 2163870 markings, 15150938 edges, 103158 markings/sec, 15 secs
lola: 2648242 markings, 18866464 edges, 96874 markings/sec, 20 secs
lola: 3148762 markings, 22731027 edges, 100104 markings/sec, 25 secs
lola: 3622182 markings, 26515727 edges, 94684 markings/sec, 30 secs
lola: 4107313 markings, 30265256 edges, 97026 markings/sec, 35 secs
lola: 4564956 markings, 33970372 edges, 91529 markings/sec, 40 secs
lola: 5032028 markings, 37733172 edges, 93414 markings/sec, 45 secs
lola: 5484650 markings, 41455291 edges, 90524 markings/sec, 50 secs
lola: 5932569 markings, 45214754 edges, 89584 markings/sec, 55 secs
lola: 6358943 markings, 48798999 edges, 85275 markings/sec, 60 secs
lola: 6792536 markings, 52071930 edges, 86719 markings/sec, 65 secs
lola: 7171414 markings, 55334431 edges, 75776 markings/sec, 70 secs
lola: 7608057 markings, 58931758 edges, 87329 markings/sec, 75 secs
lola: 8066141 markings, 62734491 edges, 91617 markings/sec, 80 secs
lola: 8513962 markings, 66464051 edges, 89564 markings/sec, 85 secs
lola: 8976674 markings, 70161587 edges, 92542 markings/sec, 90 secs
lola: 9446628 markings, 73861442 edges, 93991 markings/sec, 95 secs
lola: 9871770 markings, 77500608 edges, 85028 markings/sec, 100 secs
lola: 10278954 markings, 81001183 edges, 81437 markings/sec, 105 secs
lola: 10693178 markings, 84567486 edges, 82845 markings/sec, 110 secs
lola: 11074072 markings, 87984932 edges, 76179 markings/sec, 115 secs
lola: 11509364 markings, 91571524 edges, 87058 markings/sec, 120 secs
lola: 12013755 markings, 95263296 edges, 100878 markings/sec, 125 secs
lola: 12417846 markings, 98904362 edges, 80818 markings/sec, 130 secs
lola: 12860504 markings, 102575968 edges, 88532 markings/sec, 135 secs
lola: 13281974 markings, 106208700 edges, 84294 markings/sec, 140 secs
lola: 13696134 markings, 109797968 edges, 82832 markings/sec, 145 secs
lola: 14136691 markings, 113370580 edges, 88111 markings/sec, 150 secs
lola: 14530707 markings, 116907754 edges, 78803 markings/sec, 155 secs
lola: 14905281 markings, 120261618 edges, 74915 markings/sec, 160 secs
lola: 15338799 markings, 123898583 edges, 86704 markings/sec, 165 secs
lola: 15771583 markings, 127495326 edges, 86557 markings/sec, 170 secs
lola: 16214565 markings, 131150491 edges, 88596 markings/sec, 175 secs
lola: 16609573 markings, 134779906 edges, 79002 markings/sec, 180 secs
lola: 17003986 markings, 138393834 edges, 78883 markings/sec, 185 secs
lola: 17400224 markings, 141967263 edges, 79248 markings/sec, 190 secs
lola: 17801777 markings, 145589266 edges, 80311 markings/sec, 195 secs
lola: 18218181 markings, 149227297 edges, 83281 markings/sec, 200 secs
lola: 18632417 markings, 152739593 edges, 82847 markings/sec, 205 secs
lola: 19022327 markings, 156286772 edges, 77982 markings/sec, 210 secs
lola: 19420393 markings, 159815433 edges, 79613 markings/sec, 215 secs
lola: 19821786 markings, 163314300 edges, 80279 markings/sec, 220 secs
lola: 20226471 markings, 166840645 edges, 80937 markings/sec, 225 secs
lola: 20648163 markings, 170385753 edges, 84338 markings/sec, 230 secs
lola: 21057671 markings, 173960986 edges, 81902 markings/sec, 235 secs
lola: 21468034 markings, 177467862 edges, 82073 markings/sec, 240 secs
lola: 21865842 markings, 180881642 edges, 79562 markings/sec, 245 secs
lola: 22272386 markings, 184507210 edges, 81309 markings/sec, 250 secs
lola: 22663858 markings, 187959916 edges, 78294 markings/sec, 255 secs
lola: 23057258 markings, 191424061 edges, 78680 markings/sec, 260 secs
lola: 23448674 markings, 194852842 edges, 78283 markings/sec, 265 secs
lola: 23827224 markings, 198259912 edges, 75710 markings/sec, 270 secs
lola: 24190676 markings, 201603498 edges, 72690 markings/sec, 275 secs
lola: 24559203 markings, 205003408 edges, 73705 markings/sec, 280 secs
lola: 24915907 markings, 208400740 edges, 71341 markings/sec, 285 secs
lola: 25292707 markings, 211850088 edges, 75360 markings/sec, 290 secs
lola: 25674916 markings, 215360801 edges, 76442 markings/sec, 295 secs
lola: 26026547 markings, 218834338 edges, 70326 markings/sec, 300 secs
lola: 26381537 markings, 222338417 edges, 70998 markings/sec, 305 secs
lola: 26746498 markings, 225901856 edges, 72992 markings/sec, 310 secs
lola: 27092770 markings, 229369722 edges, 69254 markings/sec, 315 secs
lola: 27487663 markings, 232836714 edges, 78979 markings/sec, 320 secs
lola: 28031635 markings, 236612461 edges, 108794 markings/sec, 325 secs
lola: 28518141 markings, 240334596 edges, 97301 markings/sec, 330 secs
lola: 29024805 markings, 244183187 edges, 101333 markings/sec, 335 secs
lola: 29455409 markings, 247893969 edges, 86121 markings/sec, 340 secs
lola: 29904388 markings, 251584378 edges, 89796 markings/sec, 345 secs
lola: 30316373 markings, 255287116 edges, 82397 markings/sec, 350 secs
lola: 30763409 markings, 258930485 edges, 89407 markings/sec, 355 secs
lola: 31222955 markings, 262552469 edges, 91909 markings/sec, 360 secs
lola: 31657071 markings, 266366723 edges, 86823 markings/sec, 365 secs
lola: 32106977 markings, 270060551 edges, 89981 markings/sec, 370 secs
lola: 32526767 markings, 273671926 edges, 83958 markings/sec, 375 secs
lola: 32910543 markings, 277204736 edges, 76755 markings/sec, 380 secs
lola: 33297987 markings, 280970534 edges, 77489 markings/sec, 385 secs
lola: 33772074 markings, 284577683 edges, 94817 markings/sec, 390 secs
lola: 34277576 markings, 288301178 edges, 101100 markings/sec, 395 secs
lola: 34751064 markings, 291789652 edges, 94698 markings/sec, 400 secs
lola: 35224738 markings, 295519015 edges, 94735 markings/sec, 405 secs
lola: 35647657 markings, 299013123 edges, 84584 markings/sec, 410 secs
lola: 36119663 markings, 302612511 edges, 94401 markings/sec, 415 secs
lola: 36625362 markings, 306314859 edges, 101140 markings/sec, 420 secs
lola: 37120915 markings, 310050031 edges, 99111 markings/sec, 425 secs
lola: 37556626 markings, 313671447 edges, 87142 markings/sec, 430 secs
lola: 37999847 markings, 317415565 edges, 88644 markings/sec, 435 secs
lola: 38448424 markings, 321118307 edges, 89715 markings/sec, 440 secs
lola: 38952926 markings, 324837667 edges, 100900 markings/sec, 445 secs
lola: 39429786 markings, 328633720 edges, 95372 markings/sec, 450 secs
lola: 39808664 markings, 332087805 edges, 75776 markings/sec, 455 secs
lola: 40284205 markings, 335867121 edges, 95108 markings/sec, 460 secs
lola: 40765384 markings, 339534037 edges, 96236 markings/sec, 465 secs
lola: 41175880 markings, 343156925 edges, 82099 markings/sec, 470 secs
lola: 41637766 markings, 346792470 edges, 92377 markings/sec, 475 secs
lola: 42072643 markings, 350557063 edges, 86975 markings/sec, 480 secs
lola: 42478201 markings, 354173655 edges, 81112 markings/sec, 485 secs
lola: 42839935 markings, 357579865 edges, 72347 markings/sec, 490 secs
lola: 43241793 markings, 361261778 edges, 80372 markings/sec, 495 secs
lola: 43679126 markings, 365024466 edges, 87467 markings/sec, 500 secs
lola: 44126857 markings, 368811833 edges, 89546 markings/sec, 505 secs
lola: 44562201 markings, 372520429 edges, 87069 markings/sec, 510 secs
lola: 45022063 markings, 376203464 edges, 91972 markings/sec, 515 secs
lola: 45426243 markings, 379784412 edges, 80836 markings/sec, 520 secs
lola: 45837478 markings, 383181225 edges, 82247 markings/sec, 525 secs
lola: 46244094 markings, 386732509 edges, 81323 markings/sec, 530 secs
lola: 46607901 markings, 390217794 edges, 72761 markings/sec, 535 secs
lola: 47003847 markings, 393710002 edges, 79189 markings/sec, 540 secs
lola: 47443711 markings, 397460339 edges, 87973 markings/sec, 545 secs
lola: 47808007 markings, 400763920 edges, 72859 markings/sec, 550 secs
lola: 48172291 markings, 404292490 edges, 72857 markings/sec, 555 secs
lola: 48525785 markings, 407724188 edges, 70699 markings/sec, 560 secs
lola: 48871273 markings, 411255790 edges, 69098 markings/sec, 565 secs
lola: 49241218 markings, 414892161 edges, 73989 markings/sec, 570 secs
lola: 49658642 markings, 418565459 edges, 83485 markings/sec, 575 secs
lola: 50099200 markings, 422199087 edges, 88112 markings/sec, 580 secs
lola: 50489683 markings, 425559507 edges, 78097 markings/sec, 585 secs
lola: 50923280 markings, 429199919 edges, 86719 markings/sec, 590 secs
lola: 51350260 markings, 432718133 edges, 85396 markings/sec, 595 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no
lola: memory consumption: 7462392 KB
lola: time consumption: 1755 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((1 <= p137)) OR ((1 <= p68) AND (1 <= p82) AND (1 <= p105)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p42) AND (1 <= p87)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((1 <= p137)) OR ((1 <= p68) AND (1 <= p82) AND (1 <= p105)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p42) AND (1 <= p87)))
lola: processed formula length: 124
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result started, id 1
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: state equation task get result rewrite finished id 1
lola: formula 0: (((p137 <= 0)) AND ((p68 <= 0) OR (p82 <= 0) OR (p105 <= 0)) AND ((p6 <= 0) OR (p18 <= 0) OR (p42 <= 0) OR (p87 <= 0)))
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished id 0
lola: formula 1: (((1 <= p137)) OR ((1 <= p68) AND (1 <= p82) AND (1 <= p105)) OR ((1 <= p6) AND (1 <= p18) AND (1 <= p42) AND (1 <= p87)))
lola: state equation: Generated DNF with 36 literals and 12 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-13-0.sara
sara: try reading problem file CTLFireability-13-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: warning, failure of lp_solve (at job 482)
lola: sara is running 0 secs || sara is running 0 secs || 581517 markings, 3806085 edges, 116303 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1193858 markings, 8050204 edges, 122468 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1738076 markings, 12159924 edges, 108844 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2277548 markings, 16278328 edges, 107894 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2788038 markings, 20427504 edges, 102098 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3316495 markings, 24521061 edges, 105691 markings/sec, 25 secs
sara: warning, failure of lp_solve (at job 146)
lola: sara is running 30 secs || sara is running 30 secs || 3778112 markings, 28537597 edges, 92323 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4247511 markings, 32677329 edges, 93880 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4830171 markings, 36828885 edges, 116532 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5398300 markings, 41002108 edges, 113626 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5895390 markings, 45131632 edges, 99418 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6399898 markings, 49215876 edges, 100902 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6884489 markings, 53241230 edges, 96918 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7311707 markings, 57285121 edges, 85444 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7916015 markings, 61535761 edges, 120862 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8439775 markings, 65690264 edges, 104752 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8963226 markings, 69751901 edges, 104690 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9434781 markings, 73674225 edges, 94311 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9994702 markings, 77785080 edges, 111984 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 10539243 markings, 81917960 edges, 108908 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 11051303 markings, 86036206 edges, 102412 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 11569979 markings, 90181526 edges, 103735 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 12088197 markings, 94400080 edges, 103644 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 12606169 markings, 98568580 edges, 103594 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 13117867 markings, 102745486 edges, 102340 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 13592809 markings, 106908197 edges, 94988 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 14024621 markings, 110913888 edges, 86362 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 14537217 markings, 115073518 edges, 102519 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 15022518 markings, 119213456 edges, 97060 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 15461526 markings, 122751643 edges, 87802 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 15884197 markings, 126207828 edges, 84534 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 16310723 markings, 129849393 edges, 85305 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 16779550 markings, 133947008 edges, 93765 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 17247064 markings, 138024424 edges, 93503 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 17693139 markings, 142058836 edges, 89215 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 18144859 markings, 146106452 edges, 90344 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 18563930 markings, 150069825 edges, 83814 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 19005837 markings, 153944117 edges, 88381 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 19430912 markings, 158029197 edges, 85015 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 19867874 markings, 162057729 edges, 87392 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 20300799 markings, 166066709 edges, 86585 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 20801264 markings, 170202706 edges, 100093 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 21330737 markings, 174408792 edges, 105895 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 21875925 markings, 178510985 edges, 109038 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 22414697 markings, 182556155 edges, 107754 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 22906822 markings, 186561879 edges, 98425 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 23394489 markings, 190509320 edges, 97533 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 23820934 markings, 194422872 edges, 85289 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 24328949 markings, 198545393 edges, 101603 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 24861802 markings, 202642243 edges, 106571 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 25364294 markings, 206665400 edges, 100498 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 25852003 markings, 210714194 edges, 97542 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 26291720 markings, 214664438 edges, 87943 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 26773075 markings, 218721073 edges, 96271 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 27276646 markings, 222806833 edges, 100714 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 27752069 markings, 226903758 edges, 95085 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 28189298 markings, 230928054 edges, 87446 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 28705410 markings, 234885327 edges, 103222 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 29175882 markings, 238901782 edges, 94094 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 29663989 markings, 242938647 edges, 97621 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 30166763 markings, 247039046 edges, 100555 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 30645607 markings, 251125940 edges, 95769 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 31147909 markings, 255231804 edges, 100460 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 31608413 markings, 259323956 edges, 92101 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 32054061 markings, 263291692 edges, 89130 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 32525714 markings, 267330332 edges, 94331 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 33020553 markings, 271346934 edges, 98968 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 33502992 markings, 275331026 edges, 96488 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 33962055 markings, 279354169 edges, 91813 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 34411679 markings, 283370926 edges, 89925 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 34839724 markings, 287326621 edges, 85609 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 35266181 markings, 291264314 edges, 85291 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 35687506 markings, 295253549 edges, 84265 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 36113991 markings, 299234398 edges, 85297 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 36527436 markings, 303165428 edges, 82689 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 36906246 markings, 306640541 edges, 75762 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 37352383 markings, 310150836 edges, 89227 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 37788743 markings, 313611969 edges, 87272 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 38272588 markings, 317423167 edges, 96769 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 38776317 markings, 321463071 edges, 100746 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 39188609 markings, 324991221 edges, 82458 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 39580736 markings, 328469775 edges, 78425 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 40000132 markings, 332069576 edges, 83879 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 40453573 markings, 336017139 edges, 90688 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 40836549 markings, 339496955 edges, 76595 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 41195806 markings, 342964278 edges, 71851 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 41600132 markings, 346405373 edges, 80865 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 42080001 markings, 350311546 edges, 95974 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 42501186 markings, 353927921 edges, 84237 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 42908267 markings, 357368945 edges, 81416 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 43324765 markings, 360998554 edges, 83300 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 43711418 markings, 364467380 edges, 77331 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 44075936 markings, 367876344 edges, 72904 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 44471277 markings, 371567451 edges, 79068 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 44896695 markings, 375542069 edges, 85084 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 45336585 markings, 379247840 edges, 87978 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 45724861 markings, 382863253 edges, 77655 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 46252924 markings, 386939043 edges, 105613 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 46695408 markings, 390505432 edges, 88497 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 47113020 markings, 394088284 edges, 83522 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 47510735 markings, 397568097 edges, 79543 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 47958820 markings, 401397830 edges, 89617 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 48433745 markings, 405528539 edges, 94985 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 48856386 markings, 409569701 edges, 84528 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 49342451 markings, 413634342 edges, 97213 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 49833247 markings, 417755617 edges, 98159 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 50290583 markings, 421812949 edges, 91467 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 50734022 markings, 425880805 edges, 88688 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 51157790 markings, 429953592 edges, 84754 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 51565056 markings, 433954374 edges, 81453 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 51969105 markings, 437740193 edges, 80810 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 52390914 markings, 441295451 edges, 84362 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 52769008 markings, 444757248 edges, 75619 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 53168132 markings, 448438753 edges, 79825 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 53596310 markings, 452444927 edges, 85636 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 54060264 markings, 456399619 edges, 92791 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 54471765 markings, 459913288 edges, 82300 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 54881555 markings, 463547317 edges, 81958 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 55237199 markings, 466753727 edges, 71129 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 55642954 markings, 470182176 edges, 81151 markings/sec, 595 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no
lola: memory consumption: 2518720 KB
lola: time consumption: 2360 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes no unknown unknown yes no
lola: memory consumption: 54532 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 7623340 kB
After kill :
MemTotal: 16427456 kB
MemFree: 7620880 kB

--------------------
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="ShieldRVs-PT-004B"
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 ShieldRVs-PT-004B, 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 r211-tajo-159033478000804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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