fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r228-oct2-159033547700484
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ViralEpidemic-PT-S02D1C1A12

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.380 3600000.00 3303734.00 466.80 ??FTT?FF??F?TTF? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 34M
-rw-r--r-- 1 mcc users 5.7K May 14 04:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 04:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 13 22:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 22:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 14 10:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.8K May 13 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 11 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 34M 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 ViralEpidemic-PT-S02D1C1A12-CTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591305505537

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 21:18:27] [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-04 21:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 21:18:28] [INFO ] Load time of PNML (sax parser for PT used): 779 ms
[2020-06-04 21:18:28] [INFO ] Transformed 32765 places.
[2020-06-04 21:18:28] [INFO ] Transformed 40955 transitions.
[2020-06-04 21:18:28] [INFO ] Parsed PT model containing 32765 places and 40955 transitions in 945 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 181 ms.
Interrupted random walk after 54443 steps, including 5173 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0]
// Phase 1: matrix 40955 rows 32765 cols
[2020-06-04 21:19:27] [INFO ] Invariants computation overflowed in 28168 ms
[2020-06-04 21:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:19:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:19:47] [INFO ] [Real]Absence check using state equation in 17715 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:20:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:20:07] [INFO ] [Real]Absence check using state equation in 18383 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:20:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:20:27] [INFO ] [Real]Absence check using state equation in 17472 ms returned unknown
[2020-06-04 21:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:20:47] [INFO ] [Real]Absence check using state equation in 18446 ms returned unknown
[2020-06-04 21:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:21:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:21:07] [INFO ] [Real]Absence check using state equation in 18438 ms returned (error "Failed to check-sat")
[2020-06-04 21:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:21:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:21:27] [INFO ] [Real]Absence check using state equation in 16466 ms returned unknown
[2020-06-04 21:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:21:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:21:47] [INFO ] [Real]Absence check using state equation in 18329 ms returned unknown
[2020-06-04 21:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:22:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:22:07] [INFO ] [Real]Absence check using state equation in 18446 ms returned (error "Failed to check-sat")
[2020-06-04 21:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:22:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:22:27] [INFO ] [Real]Absence check using state equation in 15475 ms returned unknown
[2020-06-04 21:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:22:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:22:47] [INFO ] [Real]Absence check using state equation in 15784 ms returned unknown
[2020-06-04 21:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:23:07] [INFO ] [Real]Absence check using state equation in 17798 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:23:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:23:27] [INFO ] [Real]Absence check using state equation in 18405 ms returned unknown
[2020-06-04 21:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:23:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:23:47] [INFO ] [Real]Absence check using state equation in 17953 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:24:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:24:07] [INFO ] [Real]Absence check using state equation in 16441 ms returned (error "Failed to check-sat")
[2020-06-04 21:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:24:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:24:27] [INFO ] [Real]Absence check using state equation in 18417 ms returned unknown
[2020-06-04 21:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:24:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:24:47] [INFO ] [Real]Absence check using state equation in 18000 ms returned unknown
[2020-06-04 21:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:25:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:25:07] [INFO ] [Real]Absence check using state equation in 18095 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:25:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:25:27] [INFO ] [Real]Absence check using state equation in 16710 ms returned unknown
[2020-06-04 21:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:25:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:25:47] [INFO ] [Real]Absence check using state equation in 18424 ms returned unknown
[2020-06-04 21:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:26:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:26:07] [INFO ] [Real]Absence check using state equation in 18033 ms returned unknown
[2020-06-04 21:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:26:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:26:27] [INFO ] [Real]Absence check using state equation in 18271 ms returned (error "Failed to check-sat")
[2020-06-04 21:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:26:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:26:47] [INFO ] [Real]Absence check using state equation in 17534 ms returned (error "Failed to check-sat")
[2020-06-04 21:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:27:07] [INFO ] [Real]Absence check using state equation in 15433 ms returned (error "Failed to check-sat")
[2020-06-04 21:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:27:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:27:27] [INFO ] [Real]Absence check using state equation in 15425 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:27:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:27:47] [INFO ] [Real]Absence check using state equation in 15353 ms returned unknown
[2020-06-04 21:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:28:07] [INFO ] [Real]Absence check using state equation in 16078 ms returned (error "Failed to check-sat")
[2020-06-04 21:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:28:27] [INFO ] [Real]Absence check using state equation in 18412 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 21:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:28:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:28:47] [INFO ] [Real]Absence check using state equation in 18092 ms returned (error "Failed to check-sat")
[2020-06-04 21:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:29:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 21:29:07] [INFO ] [Real]Absence check using state equation in 17944 ms returned unknown
[2020-06-04 21:29:09] [INFO ] Flatten gal took : 1407 ms
[2020-06-04 21:29:10] [INFO ] Flatten gal took : 1587 ms
[2020-06-04 21:29:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-04 21:29:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 211 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ViralEpidemic-PT-S02D1C1A12 @ 3570 seconds

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-09 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-00 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-01 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-15 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ViralEpidemic-PT-S02D1C1A12-CTLFireability-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1047
rslt: Output for CTLFireability @ ViralEpidemic-PT-S02D1C1A12

{
"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": "Thu Jun 4 21:29:11 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 78
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p28042) AND (1 <= p28103) AND ((p20695 <= 0) OR (p20714 <= 0)) AND (((1 <= p802) AND (1 <= p808)) OR ((1 <= p26011) AND (1 <= p26016))))",
"processed_size": 145,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 83
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EX(((1 <= p24336) AND (1 <= p24343) AND (1 <= p13153) AND (1 <= p13158))))",
"processed_size": 77,
"rewrites": 59
},
"net":
{
"conflict_clusters": 8192,
"singleton_clusters": 0
},
"result":
{
"edges": 267,
"markings": 268,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 89
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p4168) AND (1 <= p4179))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 13,
"markings": 14,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 97
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p24835) OR ((1 <= p23822) AND (1 <= p23948)) OR ((1 <= p17774) AND (1 <= p17819)))))",
"processed_size": 99,
"rewrites": 58
},
"result":
{
"edges": 7,
"markings": 8,
"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": 5,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 105
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 5,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G (((p1081 <= 0) OR (p1087 <= 0) OR (((p13633 <= 0) OR (p13637 <= 0)) AND ((p29963 <= 0) OR (p30023 <= 0))) OR (((p8505 <= 0) OR (p8511 <= 0) OR ((1 <= p18016) AND (1 <= p18024) AND (1 <= p28881))) AND ((p13747 <= 0) OR (p13764 <= 0) OR ((1 <= p12220) AND (1 <= p2690) AND (1 <= p2710)))))))",
"processed_size": 303,
"rewrites": 59
},
"result":
{
"edges": 31,
"markings": 32,
"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": 84,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 131
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p8154 <= 0) OR (p8162 <= 0)) AND ((p12865 <= 0) OR (p12869 <= 0))) OR ((1 <= p11803) AND (1 <= p11823)))",
"processed_size": 111,
"rewrites": 60
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "AF(EG(((1 <= p14334) OR ((1 <= p11584) AND (1 <= p11590)) OR ((1 <= p22767) AND (1 <= p22777) AND (1 <= p26000) AND (1 <= p26061)))))",
"processed_size": 135,
"rewrites": 59
},
"net":
{
"conflict_clusters": 8192,
"singleton_clusters": 0
},
"result":
{
"edges": 535,
"markings": 268,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 174
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 2,
"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 ((((p9908 <= 0) AND (1 <= p13133) AND (1 <= p13151)) R (((1 <= p30643) AND (1 <= p30647)) OR (p12787 <= 0) OR (p12791 <= 0))))",
"processed_size": 130,
"rewrites": 60
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "existential_release",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((1 <= p21612) U (p9 <= 0)))",
"processed_size": 31,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 9599324,
"runtime": 2523.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) OR A(G(*))) : (A(G(**)) OR A(F((A(F(**)) OR **)))) : A(F(*)) : E(F(**)) : E(F(**)) : E(F(A(G(**)))) : A(F(E(G(**)))) : A(G(**)) : (** OR (E(G(**)) AND A((** U **)))) : (E(G(**)) OR (A((** U **)) AND (** AND **))) : (A(F(E(X(**)))) OR **) : E(X(E(F(A(G(**)))))) : E((* R *)) : (E(G(**)) OR (E(X(E(G(**)))) AND (** AND (** AND (** AND (** AND (** AND (** AND (A((** U **)) AND **))))))))) : A(F(**)) : (E((* R *)) AND A(F(E(G(*)))))"
},
"net":
{
"arcs": 90101,
"conflict_clusters": 8192,
"places": 32765,
"places_significant": 32764,
"singleton_clusters": 0,
"transitions": 40955
},
"result":
{
"preliminary_value": " no yes yes unknown no no unknown no unknown yes yes no ",
"value": " no yes yes unknown no no unknown no unknown yes 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: 73720/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1048480
lola: finding significant places
lola: 32765 places, 40955 transitions, 32764 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (NOT(E (F (((1 <= p19063) AND (1 <= p7889) AND (1 <= p7894) AND ((p10703 <= 0) OR (p10713 <= 0)))))) OR NOT(E (F (((1 <= p9634) AND (1 <= p9653) AND (1 <= p20894) AND (1 <= p20902) AND (((1 <= p23462) AND (1 <= p23463)) OR ((1 <= p24976) AND (1 <= p25101)))))))) : (A (G ((((1 <= p9834) AND (1 <= p9838)) OR ((1 <= p16063) AND (1 <= p16108))))) OR A (F ((A (F (((1 <= p13609) AND (1 <= p13613)))) OR ((1 <= p3019) AND (1 <= p3061)))))) : NOT(E (G (((((p8154 <= 0) OR (p8162 <= 0)) AND ((p12865 <= 0) OR (p12869 <= 0))) OR ((1 <= p11803) AND (1 <= p11823)))))) : E (F (A (F (E (F (((1 <= p4168) AND (1 <= p4179)))))))) : E (F (A (F (((1 <= p24835) OR ((1 <= p23822) AND (1 <= p23948)) OR ((1 <= p17774) AND (1 <= p17819))))))) : E (F (E (G (A (G ((1 <= p14382))))))) : A (F (E (G (((1 <= p14334) OR ((1 <= p11584) AND (1 <= p11590)) OR ((1 <= p22767) AND (1 <= p22777) AND (1 <= p26000) AND (1 <= p26061))))))) : A (G (((p1081 <= 0) OR (p1087 <= 0) OR (((p13633 <= 0) OR (p13637 <= 0)) AND ((p29963 <= 0) OR (p30023 <= 0))) OR (((p8505 <= 0) OR (p8511 <= 0) OR ((1 <= p18016) AND (1 <= p18024) AND (1 <= p28881))) AND ((p13747 <= 0) OR (p13764 <= 0) OR ((1 <= p12220) AND (1 <= p2690) AND (1 <= p2710))))))) : (((1 <= p31178) AND (1 <= p31181)) OR (E (G ((((p22730 <= 0) OR (p22733 <= 0)) AND ((p25772 <= 0) OR (p25774 <= 0))))) AND A (((1 <= p21612) U (p9 <= 0))))) : (E (G (E (G (((p22130 <= 0) OR (p22150 <= 0)))))) OR ((A ((((1 <= p27753) AND (1 <= p27765) AND (1 <= p29711) AND (1 <= p29716)) U (p16789 <= 0))) AND (1 <= p25715)) AND (1 <= p25721))) : (A (F (E (X (((1 <= p24336) AND (1 <= p24343) AND (1 <= p13153) AND (1 <= p13158)))))) OR ((1 <= p28042) AND (1 <= p28103) AND ((p20695 <= 0) OR (p20714 <= 0)) AND (((1 <= p802) AND (1 <= p808)) OR ((1 <= p26011) AND (1 <= p26016))))) : E (F (E (X (A (G (((1 <= p21737) AND (1 <= p21828)))))))) : NOT(A ((((1 <= p9908) OR (p13133 <= 0) OR (p13151 <= 0)) U (((p30643 <= 0) OR (p30647 <= 0)) AND (1 <= p12787) AND (1 <= p12791))))) : (E (G ((p16739 <= 0))) OR ((((((((E (X (E (G (((1 <= p25122) AND (1 <= p25124)))))) AND (1 <= p8708)) AND (1 <= p8709)) AND (1 <= p20287)) AND (1 <= p20330)) AND (1 <= p23922)) AND (1 <= p23927)) AND A ((((1 <= p8194) AND (1 <= p8200)) U (1 <= p11287)))) AND ((p14973 <= 0) OR (p14997 <= 0) OR (p14346 <= 0) OR (p14367 <= 0)))) : A (F (((1 <= p27759) AND (1 <= p27763)))) : (NOT(A ((((1 <= p61) AND (1 <= p64)) U (((1 <= p13715) AND (1 <= p13718)) OR ((1 <= p12903) AND (1 <= p12909)))))) AND NOT(E (G (A (F (((1 <= p547) AND (1 <= p556))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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: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: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 78 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X (((1 <= p24336) AND (1 <= p24343) AND (1 <= p13153) AND (1 <= p13158)))))) OR ((1 <= p28042) AND (1 <= p28103) AND ((p20695 <= 0) OR (p20714 <= 0)) AND (((1 <= p802) AND (1 <= p808)) OR ((1 <= p26011) AND (1 <= p26016)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 78 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p28042) AND (1 <= p28103) AND ((p20695 <= 0) OR (p20714 <= 0)) AND (((1 <= p802) AND (1 <= p808)) OR ((1 <= p26011) AND (1 <= p26016))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p28042) AND (1 <= p28103) AND ((p20695 <= 0) OR (p20714 <= 0)) AND (((1 <= p802) AND (1 <= p808)) OR ((1 <= p26011) AND (1 <= p26016))))
lola: processed formula length: 145
lola: 57 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= p24336) AND (1 <= p24343) AND (1 <= p13153) AND (1 <= p13158))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((1 <= p24336) AND (1 <= p24343) AND (1 <= p13153) AND (1 <= p13158))))
lola: processed formula length: 77
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 268 markings, 267 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (A (G (((1 <= p21737) AND (1 <= p21828))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(AG(((1 <= p21737) AND (1 <= p21828)))))
lola: processed formula length: 45
lola: 60 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: 5653 markings, 32357 edges, 1131 markings/sec, 0 secs
lola: 10665 markings, 64875 edges, 1002 markings/sec, 5 secs
lola: 15271 markings, 97779 edges, 921 markings/sec, 10 secs
lola: 19418 markings, 130764 edges, 829 markings/sec, 15 secs
lola: 23960 markings, 163655 edges, 908 markings/sec, 20 secs
lola: 28608 markings, 196292 edges, 930 markings/sec, 25 secs
lola: 32846 markings, 228994 edges, 848 markings/sec, 30 secs
lola: 37357 markings, 261770 edges, 902 markings/sec, 35 secs
lola: 41888 markings, 294636 edges, 906 markings/sec, 40 secs
lola: 46210 markings, 327592 edges, 864 markings/sec, 45 secs
lola: 50701 markings, 360262 edges, 898 markings/sec, 50 secs
lola: 54763 markings, 393089 edges, 812 markings/sec, 55 secs
lola: 59160 markings, 425769 edges, 879 markings/sec, 60 secs
lola: 62461 markings, 458963 edges, 660 markings/sec, 65 secs
lola: 65592 markings, 492206 edges, 626 markings/sec, 70 secs
lola: 68851 markings, 525435 edges, 652 markings/sec, 75 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p16739 <= 0))) OR (E (X (E (G (((1 <= p25122) AND (1 <= p25124)))))) AND ((1 <= p8708) AND ((1 <= p8709) AND ((1 <= p20287) AND ((1 <= p20330) AND ((1 <= p23922) AND ((1 <= p23927) AND (A ((((1 <= p8194) AND (1 <= p8200)) U (1 <= p11287))) AND ((p14973 <= 0) OR (p14997 <= 0) OR (p14346 <= 0) OR (p14367 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p23927)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p23927)
lola: processed formula length: 13
lola: 57 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 89 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p16739 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p16739 <= 0)))
lola: processed formula length: 21
lola: 58 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 <= p16739)
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 / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 89 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p4168) AND (1 <= p4179))))
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 <= p4168) AND (1 <= p4179))))
lola: processed formula length: 39
lola: 58 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 <= p4168) AND (1 <= p4179))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p24835) OR ((1 <= p23822) AND (1 <= p23948)) OR ((1 <= p17774) AND (1 <= p17819)))))
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 <= p24835) OR ((1 <= p23822) AND (1 <= p23948)) OR ((1 <= p17774) AND (1 <= p17819)))))
lola: processed formula length: 99
lola: 58 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 <= p24835) OR ((1 <= p23822) AND (1 <= p23948)) OR ((1 <= p17774) AND (1 <= p17819)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 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 5 will run for 105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1081 <= 0) OR (p1087 <= 0) OR (((p13633 <= 0) OR (p13637 <= 0)) AND ((p29963 <= 0) OR (p30023 <= 0))) OR (((p8505 <= 0) OR (p8511 <= 0) OR ((1 <= p18016) AND (1 <= p18024) AND (1 <= p28881))) AND ((p13747 <= 0) OR (p13764 <= 0) OR ((1 <= p12220) AND (1 <= p2690) AND (1 <= p2710)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p1081 <= 0) OR (p1087 <= 0) OR (((p13633 <= 0) OR (p13637 <= 0)) AND ((p29963 <= 0) OR (p30023 <= 0))) OR (((p8505 <= 0) OR (p8511 <= 0) OR ((1 <= p18016) AND (1 <= p18024) AND (1 <= p28881))) AND ((p13747 <= 0) OR (p13764 <= 0) OR ((1 <= p12220) AND (1 <= p2690) AND (1 <= p2710)))))))
lola: processed formula length: 303
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1081) AND (1 <= p1087) AND (((1 <= p13633) AND (1 <= p13637)) OR ((1 <= p29963) AND (1 <= p30023))) AND (((1 <= p8505) AND (1 <= p8511) AND ((p18016 <= 0) OR (p18024 <= 0) OR (p28881 <= 0))) OR ((1 <= p13747) AND (1 <= p13764) AND ((p12220 <= 0) OR (p2690 <= 0) OR (p2710 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 84 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 6 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p14382)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p14382 <= 0)
lola: processed formula length: 13
lola: 61 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p14382)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p14382 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 6199 markings, 29538 edges, 1240 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 11740 markings, 61932 edges, 1108 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 17151 markings, 94248 edges, 1082 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 22162 markings, 126716 edges, 1002 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 27237 markings, 159209 edges, 1015 markings/sec, 20 secs
sara: error: :49162: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
sara: error: :49162: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 25 secs || sara is running 25 secs || 31686 markings, 190110 edges, 890 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 37090 markings, 222523 edges, 1081 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 42140 markings, 255002 edges, 1010 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 46958 markings, 287544 edges, 964 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 52412 markings, 319868 edges, 1091 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 57405 markings, 352349 edges, 999 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 61234 markings, 385110 edges, 766 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 64805 markings, 417923 edges, 714 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 68181 markings, 450815 edges, 675 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 72728 markings, 483416 edges, 909 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 78326 markings, 515735 edges, 1120 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 84222 markings, 548060 edges, 1179 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 89046 markings, 580607 edges, 965 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 93713 markings, 613145 edges, 933 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 97605 markings, 645970 edges, 778 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 102352 markings, 678585 edges, 949 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 108111 markings, 710872 edges, 1152 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 112814 markings, 743387 edges, 941 markings/sec, 110 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes yes unknown unknown no unknown unknown no unknown unknown yes unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p27759) AND (1 <= p27763))))
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: ((p27759 <= 0) OR (p27763 <= 0))
lola: processed formula length: 33
lola: 60 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 <= p27759) AND (1 <= p27763))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p8154) AND (1 <= p8162)) OR ((1 <= p12865) AND (1 <= p12869))) AND ((p11803 <= 0) OR (p11823 <= 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:788
lola: processed formula: ((((p8154 <= 0) OR (p8162 <= 0)) AND ((p12865 <= 0) OR (p12869 <= 0))) OR ((1 <= p11803) AND (1 <= p11823)))
lola: processed formula length: 111
lola: 60 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 <= p8154) AND (1 <= p8162)) OR ((1 <= p12865) AND (1 <= p12869))) AND ((p11803 <= 0) OR (p11823 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p14334) OR ((1 <= p11584) AND (1 <= p11590)) OR ((1 <= p22767) AND (1 <= p22777) AND (1 <= p26000) AND (1 <= p26061)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p14334) OR ((1 <= p11584) AND (1 <= p11590)) OR ((1 <= p22767) AND (1 <= p22777) AND (1 <= p26000) AND (1 <= p26061)))))
lola: processed formula length: 135
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 268 markings, 535 edges
lola: ========================================
lola: subprocess 10 will run for 174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p9908 <= 0) AND (1 <= p13133) AND (1 <= p13151)) R (((1 <= p30643) AND (1 <= p30647)) OR (p12787 <= 0) OR (p12791 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p9908 <= 0) AND (1 <= p13133) AND (1 <= p13151)) R (((1 <= p30643) AND (1 <= p30647)) OR (p12787 <= 0) OR (p12791 <= 0))))
lola: processed formula length: 130
lola: 60 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p30643 <= 0) OR (p30647 <= 0)) AND (1 <= p12787) AND (1 <= p12791))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p31178) AND (1 <= p31181)) OR (E (G ((((p22730 <= 0) OR (p22733 <= 0)) AND ((p25772 <= 0) OR (p25774 <= 0))))) AND A (((1 <= p21612) U (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p31178) AND (1 <= p31181))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p31178) AND (1 <= p31181))
lola: processed formula length: 33
lola: 57 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p21612) U (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p21612) U (p9 <= 0)))
lola: processed formula length: 31
lola: 62 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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 <= p21612)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Cannot launch process for handling subproblem
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: no yes yes unknown no no unknown no unknown yes yes no
lola:
preliminary result: no yes yes unknown no no unknown no unknown yes yes no
lola: memory consumption: 9599324 KB
lola: time consumption: 2523 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S02D1C1A12"
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 ViralEpidemic-PT-S02D1C1A12, 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 r228-oct2-159033547700484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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