fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r209-smll-155381375500112
Last Updated
Apr 15, 2019

About the Execution of LoLA for CloudOpsManagement-PT-10240by05120

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.320 701103.00 704817.00 2503.20 FTT?TFFFTFFFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r209-smll-155381375500112.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is CloudOpsManagement-PT-10240by05120, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-smll-155381375500112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 4.0K Mar 26 06:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 06:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 06:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Mar 26 06:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 06:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Mar 26 06:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 25 21:32 NewModel
-rw-r--r-- 1 mcc users 4.5K Mar 26 06:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 06:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 125 Mar 26 06:21 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 363 Mar 26 06:21 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K Mar 26 06:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 06:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 26 06:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 26 06:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 25 21:32 equiv_col

-rw-r--r-- 1 mcc users 13 Mar 25 21:32 instance
-rw-r--r-- 1 mcc users 6 Mar 25 21:32 iscolored
-rw-r--r-- 1 mcc users 17K Mar 25 21:32 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 CloudOpsManagement-PT-10240by05120-CTLCardinality-00
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-01
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-02
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-03
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-04
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-05
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-06
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-07
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-08
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-09
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-10
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-11
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-12
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-13
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-14
FORMULA_NAME CloudOpsManagement-PT-10240by05120-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1554051611036

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CloudOpsManagement-PT-10240by05120 @ 3570 seconds

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2869
rslt: Output for CTLCardinality @ CloudOpsManagement-PT-10240by05120

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 31 17:00:11 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((2 <= Bounder2)))",
"processed_size": 23,
"rewrites": 48
},
"result":
{
"edges": 10239,
"markings": 10240,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((ScStopped + 1 <= Bounder2) AND (OsContainer <= Wsr3NotDeployed))",
"processed_size": 66,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((3 <= Wsr3Deployed))",
"processed_size": 23,
"rewrites": 47
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(Wsr3NotDeployed <= Wsr1Started)",
"processed_size": 32,
"rewrites": 48
},
"result":
{
"edges": 102387,
"markings": 61435,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AG((2 <= OsNotInstalled)))",
"processed_size": 29,
"rewrites": 48
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 85311989,
"markings": 52500476,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((1 <= ContainerDown)))",
"processed_size": 28,
"rewrites": 48
},
"result":
{
"edges": 5120,
"markings": 5121,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((3 <= Bounder2)))",
"processed_size": 23,
"rewrites": 48
},
"result":
{
"edges": 10238,
"markings": 10239,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((Bounder1 <= OsRunning))))",
"processed_size": 33,
"rewrites": 47
},
"result":
{
"edges": 10240,
"markings": 10241,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 578
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((3 <= Wsr1Started) OR (Wsr2Deployed <= Bounder1))))",
"processed_size": 59,
"rewrites": 48
},
"result":
{
"edges": 10252,
"markings": 10249,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 694
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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 (((ScStopped + 1 <= Bounder2) AND (OsNotInstalled + 1 <= OsContainer) AND (Wsr2Deployed <= 2))))",
"processed_size": 101,
"rewrites": 47
},
"result":
{
"edges": 2561,
"markings": 2562,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 867
},
"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": "(3 <= Wsr1Started)",
"processed_size": 18,
"rewrites": 50
},
"result":
{
"edges": 476607,
"markings": 302275,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1582
},
"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 (((OsRunning <= 2) AND (OsNotInstalled <= 1))))",
"processed_size": 52,
"rewrites": 47
},
"result":
{
"edges": 5119,
"markings": 5120,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3164
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(Wsr2Started <= OsNotInstalled)",
"processed_size": 31,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer))))",
"processed_size": 74,
"rewrites": 47
},
"result":
{
"edges": 2560,
"markings": 2561,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20288,
"runtime": 701.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : E(F(**)) : E(F(*)) : A(G((E(F(**)) OR **))) : E(X(E(F(**)))) : A(G(**)) : E(X(A(G(**)))) : A(G(A(F(*)))) : (E(F(**)) OR E(F(E(G(**))))) : A(G(**)) : (A(G(**)) AND (A(X(**)) OR A(G(**)))) : (A(G(**)) OR (A(X(**)) AND **)) : TRUE : ((E(F(**)) AND **) OR E(F(**))) : FALSE : TRUE"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no yes yes unknown yes no no no yes no no no yes yes no yes ",
"value": "no yes yes unknown yes no no no yes no no no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (Wsr2Deployed <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (Wsr1Started <= ScWorking)
lola: LP says that atomic proposition is always true: (Wsr2Deployed <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (2 <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (ContainerUp <= Wsr2NotDeployed)
lola: LP says that atomic proposition is always true: (2 <= Wsr3NotDeployed)
lola: NOT(A (G (E (G ((Wsr2Deployed <= Wsr1NotDeployed)))))) : E (F (A (F (((Bounder1 <= OsRunning)))))) : NOT(A (G (((Bounder2 <= ScStopped) OR (OsContainer <= OsNotInstalled) OR (3 <= Wsr2Deployed))))) : A (G ((E (F ((WsRuntime3 <= Bounder1))) OR (((ServerContainer <= ContainerUp) OR (OsAvailable <= SwContainer)) AND (WSRuntime2 <= Wsr1Started))))) : E (F (E (X ((Wsr3NotDeployed <= Wsr1Started))))) : (E (((Wsr1NotDeployed <= Wsr2Started) U (Wsr2Deployed <= Wsr1NotDeployed))) AND E (G (A (G ((3 <= Bounder2)))))) : E (X ((A (G ((2 <= OsNotInstalled))) AND ()))) : NOT(E (F (E (G ((3 <= Wsr1Started)))))) : E (F ((((OsRunning <= 2) AND (OsNotInstalled <= 1)) OR E (G ((Bounder1 <= ContainerDown)))))) : NOT(NOT(A (G (((3 <= Wsr1Started) OR (Wsr2Deployed <= Bounder1)))))) : (E (G (A (G ((1 <= ContainerDown))))) AND (A (X ((Bounder2 <= Wsr1NotDeployed))) OR A (G (((1 <= Wsr1Deployed) OR (Wsr1Started <= Wsr3Started)))))) : (A (G ((2 <= Bounder2))) OR (A (X ((3 <= Wsr3Deployed))) AND ((ScStopped + 1 <= Bounder2) AND (OsContainer <= Wsr3NotDeployed)))) : A (G ((A (X ((3 <= ScWorking))) OR E (F ((0 <= 0)))))) : ((E (F (((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer)))) AND (Wsr2Started <= OsNotInstalled)) OR E (F (((Wsr1NotDeployed + 1 <= OsContainer) AND (ContainerDown <= 2))))) : NOT(A (G (()))) : A (G (A (((Container <= WSRuntime2) U (2 <= Wsr3NotDeployed)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 46 rewrites
lola: closed formula file CTLCardinality.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: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 46 rewrites
lola: closed formula file CTLCardinality.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: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= Bounder2))) OR (A (X ((3 <= Wsr3Deployed))) AND ((ScStopped + 1 <= Bounder2) AND (OsContainer <= Wsr3NotDeployed))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Bounder2)))
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 ((2 <= Bounder2)))
lola: processed formula length: 23
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: (Bounder2 <= 1)
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 CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10240 markings, 10239 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ScStopped + 1 <= Bounder2) AND (OsContainer <= Wsr3NotDeployed))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ScStopped + 1 <= Bounder2) AND (OsContainer <= Wsr3NotDeployed))
lola: processed formula length: 66
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= Wsr3Deployed)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((3 <= Wsr3Deployed))
lola: processed formula length: 23
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((Wsr3NotDeployed <= Wsr1Started)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (Wsr3NotDeployed <= Wsr1Started)
lola: processed formula length: 32
lola: 48 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Wsr3NotDeployed <= Wsr1Started)
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 CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 61435 markings, 102387 edges
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((2 <= OsNotInstalled)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((2 <= OsNotInstalled)))
lola: processed formula length: 29
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: 3310772 markings, 4966461 edges, 662154 markings/sec, 0 secs
lola: 6619684 markings, 9930262 edges, 661782 markings/sec, 5 secs
lola: 9884301 markings, 14828252 edges, 652923 markings/sec, 10 secs
lola: 13117700 markings, 19676550 edges, 646680 markings/sec, 15 secs
lola: 15550148 markings, 23325712 edges, 486490 markings/sec, 20 secs
lola: 18608228 markings, 27913499 edges, 611616 markings/sec, 25 secs
lola: 21592827 markings, 32391066 edges, 596920 markings/sec, 30 secs
lola: 24589906 markings, 36884898 edges, 599416 markings/sec, 35 secs
lola: 26675699 markings, 40118845 edges, 417159 markings/sec, 40 secs
lola: 29779083 markings, 45549700 edges, 620677 markings/sec, 45 secs
lola: 32639051 markings, 50555005 edges, 571994 markings/sec, 50 secs
lola: 35408964 markings, 55402586 edges, 553983 markings/sec, 55 secs
lola: 38154265 markings, 60206946 edges, 549060 markings/sec, 60 secs
lola: 40865064 markings, 64951424 edges, 542160 markings/sec, 65 secs
lola: 43559383 markings, 69666762 edges, 538864 markings/sec, 70 secs
lola: 46251097 markings, 74377048 edges, 538343 markings/sec, 75 secs
lola: 48928954 markings, 79063443 edges, 535571 markings/sec, 80 secs
lola: 51579274 markings, 83701680 edges, 530064 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52500476 markings, 85311989 edges
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= ContainerDown))) AND (A (X ((Bounder2 <= Wsr1NotDeployed))) OR A (G (((1 <= Wsr1Deployed) OR (Wsr1Started <= Wsr3Started))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Wsr1Deployed) OR (Wsr1Started <= Wsr3Started))))
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 (((1 <= Wsr1Deployed) OR (Wsr1Started <= Wsr3Started))))
lola: processed formula length: 62
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: ((Wsr1Deployed <= 0) AND (Wsr3Started + 1 <= Wsr1Started))
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
lola: The predicate is not invariant.
lola: 6 markings, 6 edges
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ContainerDown)))
lola: ========================================
lola: SUBTASK
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
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 ((1 <= ContainerDown)))
lola: processed formula length: 28
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: (ContainerDown <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5121 markings, 5120 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Bounder2)))
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 ((3 <= Bounder2)))
lola: processed formula length: 23
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: (Bounder2 <= 2)
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 CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10239 markings, 10238 edges
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Bounder1 <= OsRunning))))
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 (((Bounder1 <= OsRunning))))
lola: processed formula length: 33
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: ========================================
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: ((Bounder1 <= OsRunning))
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 CTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10241 markings, 10240 edges
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Wsr1Started) OR (Wsr2Deployed <= Bounder1))))
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 (((3 <= Wsr1Started) OR (Wsr2Deployed <= Bounder1))))
lola: processed formula length: 59
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: ((Wsr1Started <= 2) AND (Bounder1 + 1 <= Wsr2Deployed))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10249 markings, 10252 edges
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ScStopped + 1 <= Bounder2) AND (OsNotInstalled + 1 <= OsContainer) AND (Wsr2Deployed <= 2))))
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 (((ScStopped + 1 <= Bounder2) AND (OsNotInstalled + 1 <= OsContainer) AND (Wsr2Deployed <= 2))))
lola: processed formula length: 101
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: ((ScStopped + 1 <= Bounder2) AND (OsNotInstalled + 1 <= OsContainer) AND (Wsr2Deployed <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2562 markings, 2561 edges
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((Wsr1Started <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= Wsr1Started)
lola: processed formula length: 18
lola: 50 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Wsr1Started <= 2)
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 CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= Wsr1Started)
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 CTLCardinality-12-1.sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-12-1.sara.

sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 302275 markings, 476607 edges
lola: ========================================
lola: subprocess 13 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((WsRuntime3 <= Bounder1))) OR (((ServerContainer <= ContainerUp) OR (OsAvailable <= SwContainer)) AND (WSRuntime2 <= Wsr1Started)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((WsRuntime3 <= Bounder1)) OR (((ServerContainer <= ContainerUp) OR (OsAvailable <= SwContainer)) AND (WSRuntime2 <= Wsr1Started))))
lola: processed formula length: 139
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: 2293731 markings, 5735218 edges, 458746 markings/sec, 0 secs
lola: 4584201 markings, 11461919 edges, 458094 markings/sec, 5 secs
lola: 6829107 markings, 17074061 edges, 448981 markings/sec, 10 secs
lola: 9037557 markings, 22594919 edges, 441690 markings/sec, 15 secs
lola: 11240577 markings, 28102457 edges, 440604 markings/sec, 20 secs
lola: 13453999 markings, 33636866 edges, 442684 markings/sec, 25 secs
lola: 15713263 markings, 39288204 edges, 451853 markings/sec, 30 secs
lola: 17840372 markings, 44604517 edges, 425422 markings/sec, 35 secs
lola: 19867992 markings, 49673569 edges, 405524 markings/sec, 40 secs
lola: 21836638 markings, 54596418 edges, 393729 markings/sec, 45 secs
lola: 23755913 markings, 59391638 edges, 383855 markings/sec, 50 secs
lola: 25692088 markings, 64233121 edges, 387235 markings/sec, 55 secs
lola: 27578181 markings, 68947434 edges, 377219 markings/sec, 60 secs
lola: 29441390 markings, 73605737 edges, 372642 markings/sec, 65 secs
lola: 31304903 markings, 78264649 edges, 372703 markings/sec, 70 secs
lola: 33143606 markings, 82863700 edges, 367741 markings/sec, 75 secs
lola: 35015125 markings, 87538623 edges, 374304 markings/sec, 80 secs
lola: 36900356 markings, 92251211 edges, 377046 markings/sec, 85 secs
lola: 38745580 markings, 96864592 edges, 369045 markings/sec, 90 secs
lola: 40589135 markings, 101473613 edges, 368711 markings/sec, 95 secs
lola: 42390569 markings, 105976751 edges, 360287 markings/sec, 100 secs
lola: 44106742 markings, 110268638 edges, 343235 markings/sec, 105 secs
lola: 45895821 markings, 114741379 edges, 357816 markings/sec, 110 secs
lola: 47671688 markings, 119180378 edges, 355173 markings/sec, 115 secs
lola: 49391766 markings, 123480735 edges, 344016 markings/sec, 120 secs
lola: 51126891 markings, 127821428 edges, 347025 markings/sec, 125 secs
lola: 52829927 markings, 132077462 edges, 340607 markings/sec, 130 secs
lola: 54505060 markings, 136267449 edges, 335027 markings/sec, 135 secs
lola: 56299164 markings, 140749236 edges, 358821 markings/sec, 140 secs
lola: 58100065 markings, 145250775 edges, 360180 markings/sec, 145 secs
lola: 59843544 markings, 149610770 edges, 348696 markings/sec, 150 secs
lola: 61594263 markings, 153989067 edges, 350144 markings/sec, 155 secs
lola: 63319379 markings, 158299502 edges, 345023 markings/sec, 160 secs
lola: 64996348 markings, 162493161 edges, 335394 markings/sec, 165 secs
lola: 66737281 markings, 166845469 edges, 348187 markings/sec, 170 secs
lola: 68455411 markings, 171141932 edges, 343626 markings/sec, 175 secs
lola: 70137969 markings, 175346769 edges, 336512 markings/sec, 180 secs
lola: 71828033 markings, 179573542 edges, 338013 markings/sec, 185 secs
lola: 73472206 markings, 183684443 edges, 328835 markings/sec, 190 secs
lola: 75121163 markings, 187804213 edges, 329791 markings/sec, 195 secs
lola: 76822314 markings, 192057704 edges, 340230 markings/sec, 200 secs
lola: 78542898 markings, 196359255 edges, 344117 markings/sec, 205 secs
lola: 80247553 markings, 200623257 edges, 340931 markings/sec, 210 secs
lola: 81931892 markings, 204833142 edges, 336868 markings/sec, 215 secs
lola: 83602601 markings, 209008960 edges, 334142 markings/sec, 220 secs
lola: 85241542 markings, 213106542 edges, 327788 markings/sec, 225 secs
lola: 86883553 markings, 217213337 edges, 328402 markings/sec, 230 secs
lola: 88563093 markings, 221412233 edges, 335908 markings/sec, 235 secs
lola: 90200741 markings, 225505940 edges, 327530 markings/sec, 240 secs
lola: 91796434 markings, 229494258 edges, 319139 markings/sec, 245 secs
lola: 93443708 markings, 233611936 edges, 329455 markings/sec, 250 secs
lola: 95049045 markings, 237623851 edges, 321067 markings/sec, 255 secs
lola: 96628476 markings, 241573628 edges, 315886 markings/sec, 260 secs
lola: 98390618 markings, 245979370 edges, 352428 markings/sec, 265 secs
lola: 100146817 markings, 250367285 edges, 351240 markings/sec, 270 secs
lola: 101848548 markings, 254622516 edges, 340346 markings/sec, 275 secs
lola: 103565319 markings, 258913965 edges, 343354 markings/sec, 280 secs
lola: 105245617 markings, 263114282 edges, 336060 markings/sec, 285 secs
lola: 106062774 markings, 265158216 edges, 163431 markings/sec, 290 secs
lola: 106270153 markings, 265675381 edges, 41476 markings/sec, 295 secs
lola: 106374882 markings, 265938366 edges, 20946 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((OsRunning <= 2) AND (OsNotInstalled <= 1)))) OR E (F (E (G ((Bounder1 <= ContainerDown))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((OsRunning <= 2) AND (OsNotInstalled <= 1))))
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 (((OsRunning <= 2) AND (OsNotInstalled <= 1))))
lola: processed formula length: 52
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: ((OsRunning <= 2) AND (OsNotInstalled <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5120 markings, 5119 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer)))) AND (Wsr2Started <= OsNotInstalled)) OR E (F (((Wsr1NotDeployed + 1 <= OsContainer) AND (ContainerDown <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Wsr2Started <= OsNotInstalled)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Wsr2Started <= OsNotInstalled)
lola: processed formula length: 31
lola: 46 rewrites
lola: closed formula file CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer))))
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 (((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer))))
lola: processed formula length: 74
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: ((Bounder1 <= OsContainer) OR (ScUnavailable <= ServerContainer))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2561 markings, 2560 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((WsRuntime3 <= Bounder1))) OR (((ServerContainer <= ContainerUp) OR (OsAvailable <= SwContainer)) AND (WSRuntime2 <= Wsr1Started)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((WsRuntime3 <= Bounder1)) OR (((ServerContainer <= ContainerUp) OR (OsAvailable <= SwContainer)) AND (WSRuntime2 <= Wsr1Started))))
lola: processed formula length: 139
lola: 48 rewrites
lola: closed formula file CTLCardinality.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: 2424420 markings, 6062140 edges, 484884 markings/sec, 0 secs
lola: 4693938 markings, 11736320 edges, 453904 markings/sec, 5 secs
lola: 6931119 markings, 17328171 edges, 447436 markings/sec, 10 secs
lola: 9132618 markings, 22833218 edges, 440300 markings/sec, 15 secs
lola: 11325692 markings, 28315054 edges, 438615 markings/sec, 20 secs
lola: 13534801 markings, 33838310 edges, 441822 markings/sec, 25 secs
lola: 15783225 markings, 39458994 edges, 449685 markings/sec, 30 secs
lola: 17896548 markings, 44742326 edges, 422665 markings/sec, 35 secs
lola: 19925731 markings, 49816064 edges, 405837 markings/sec, 40 secs
lola: 21898522 markings, 54751350 edges, 394558 markings/sec, 45 secs
lola: 23837974 markings, 59596859 edges, 387890 markings/sec, 50 secs
lola: 25779057 markings, 64448022 edges, 388217 markings/sec, 55 secs
lola: 27678789 markings, 69199852 edges, 379946 markings/sec, 60 secs
lola: 29557407 markings, 73898057 edges, 375724 markings/sec, 65 secs
lola: 31418884 markings, 78550602 edges, 372295 markings/sec, 70 secs
lola: 33266193 markings, 83170317 edges, 369462 markings/sec, 75 secs
lola: 35149278 markings, 87878015 edges, 376617 markings/sec, 80 secs
lola: 37043048 markings, 92608278 edges, 378754 markings/sec, 85 secs
lola: 38886052 markings, 97215931 edges, 368601 markings/sec, 90 secs
lola: 40739570 markings, 101853232 edges, 370704 markings/sec, 95 secs
lola: 42551920 markings, 106380716 edges, 362470 markings/sec, 100 secs
lola: 44314407 markings, 110786374 edges, 352497 markings/sec, 105 secs
lola: 46173807 markings, 115437060 edges, 371880 markings/sec, 110 secs
lola: 47984171 markings, 119961900 edges, 362073 markings/sec, 115 secs
lola: 49728342 markings, 124323971 edges, 348834 markings/sec, 120 secs
lola: 51528151 markings, 128822234 edges, 359962 markings/sec, 125 secs
lola: 53273054 markings, 133186500 edges, 348981 markings/sec, 130 secs
lola: 54979959 markings, 137452779 edges, 341381 markings/sec, 135 secs
lola: 56848948 markings, 142122641 edges, 373798 markings/sec, 140 secs
lola: 58675536 markings, 146690452 edges, 365318 markings/sec, 145 secs
lola: 60450952 markings, 151128977 edges, 355083 markings/sec, 150 secs
lola: 62257314 markings, 155643701 edges, 361272 markings/sec, 155 secs
lola: 64009519 markings, 160027959 edges, 350441 markings/sec, 160 secs
lola: 65736962 markings, 164343047 edges, 345489 markings/sec, 165 secs
lola: 67551028 markings, 168882584 edges, 362813 markings/sec, 170 secs
lola: 69308582 markings, 173274773 edges, 351511 markings/sec, 175 secs
lola: 71024281 markings, 177561666 edges, 343140 markings/sec, 180 secs
lola: 72754424 markings, 181890463 edges, 346029 markings/sec, 185 secs
lola: 74446801 markings, 186119062 edges, 338475 markings/sec, 190 secs
lola: 76123955 markings, 190310805 edges, 335431 markings/sec, 195 secs
lola: 77948363 markings, 194872625 edges, 364882 markings/sec, 200 secs
lola: 79717517 markings, 199298418 edges, 353831 markings/sec, 205 secs
lola: 81443215 markings, 203610016 edges, 345140 markings/sec, 210 secs
lola: 83192098 markings, 207982262 edges, 349777 markings/sec, 215 secs
lola: 84887500 markings, 212218991 edges, 339080 markings/sec, 220 secs
lola: 86548301 markings, 216371428 edges, 332160 markings/sec, 225 secs
lola: 88306927 markings, 220768008 edges, 351725 markings/sec, 230 secs
lola: 90007335 markings, 225018785 edges, 340082 markings/sec, 235 secs
lola: 91655598 markings, 229143433 edges, 329653 markings/sec, 240 secs
lola: 93360613 markings, 233404783 edges, 341003 markings/sec, 245 secs
lola: 95018376 markings, 237549789 edges, 331553 markings/sec, 250 secs
lola: 96648262 markings, 241622744 edges, 325977 markings/sec, 255 secs
lola: 98457564 markings, 246148569 edges, 361860 markings/sec, 260 secs
lola: 100261288 markings, 250657182 edges, 360745 markings/sec, 265 secs
lola: 102008116 markings, 255021281 edges, 349366 markings/sec, 270 secs
lola: 103789762 markings, 259475495 edges, 356329 markings/sec, 275 secs
lola: 105514472 markings, 263787239 edges, 344942 markings/sec, 280 secs
lola: 106122789 markings, 265308967 edges, 121663 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes unknown yes no no no yes no no no yes yes no yes
lola:
preliminary result: no yes yes unknown yes no no no yes no no no yes yes no yes
lola: memory consumption: 20288 KB
lola: time consumption: 701 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1554052312139

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

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="CloudOpsManagement-PT-10240by05120"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-3957"
echo " Executing tool lola"
echo " Input is CloudOpsManagement-PT-10240by05120, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r209-smll-155381375500112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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