Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r104-oct2-155272226200589.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is PhaseVariation-PT-D02CS100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226200589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.5K Feb 12 04:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 04:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 8 03:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 03:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 00:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 1 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 61K Mar 10 17:31 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 PhaseVariation-PT-D02CS100-CTLCardinality-00
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-01
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-02
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-03
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-04
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-05
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-06
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-07
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-08
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-09
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-10
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-11
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-12
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-13
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-14
FORMULA_NAME PhaseVariation-PT-D02CS100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552809461123

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PhaseVariation-PT-D02CS100 @ 3570 seconds

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2379
rslt: Output for CTLCardinality @ PhaseVariation-PT-D02CS100

{
"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 17 07:57:41 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": "TRUE",
"processed_size": 4,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((2 <= pool__1_1_)))",
"processed_size": 25,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((cell___2_2__A_ <= cell___2_1__A_)))",
"processed_size": 42,
"rewrites": 62
},
"result":
{
"edges": 104,
"markings": 105,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 28
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((cell___1_2__B_ <= cell___1_1__A_)))",
"processed_size": 42,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"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 <= size_dot))",
"processed_size": 19,
"rewrites": 62
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EX((3 <= cell___1_2__A_)))",
"processed_size": 29,
"rewrites": 63
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 104,
"markings": 105,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((pool__1_2_ <= cell___1_2__B_)))",
"processed_size": 38,
"rewrites": 62
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G (((size_dot <= pool__2_1_) AND (1 <= pool__2_1_) AND (cell___2_2__A_ + 1 <= cell___2_1__A_))))",
"processed_size": 99,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": 6,
"visible_transitions": 0
},
"processed": "A (G (((cell___2_1__A_ + 1 <= pool__1_2_) OR (cell___2_2__A_ + 1 <= pool__2_1_) OR (cell___2_1__A_ + 1 <= cell___2_2__B_) OR (cell___1_2__A_ <= 2))))",
"processed_size": 152,
"rewrites": 63
},
"result":
{
"edges": 29,
"markings": 30,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((size_dot + 1 <= pool__1_1_)))",
"processed_size": 36,
"rewrites": 62
},
"result":
{
"edges": 86512608,
"markings": 2583984,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((cell___1_2__B_ <= 2))",
"processed_size": 23,
"rewrites": 65
},
"result":
{
"edges": 3057469,
"markings": 113780,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 639
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "E ((((3 <= pool__2_1_) AND (3 <= pool__2_1_)) U (cell___2_1__B_ + 1 <= cell___2_2__A_)))",
"processed_size": 88,
"rewrites": 64
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 799
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((cell___1_2__A_ <= 2) OR (cell___1_1__B_ <= 2))",
"processed_size": 49,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1066
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((pool__1_1_ <= 2) OR (pool__1_2_ + 1 <= cell___2_2__B_))",
"processed_size": 58,
"rewrites": 65
},
"result":
{
"edges": 104,
"markings": 105,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1599
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "((cell___1_1__B_ <= cell___1_2__B_) OR (cell___1_2__B_ <= run_dot))",
"processed_size": 68,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3198
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EG((3 <= cell___2_1__B_)))",
"processed_size": 29,
"rewrites": 63
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 209,
"markings": 105,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))",
"processed_size": 42,
"rewrites": 62
},
"result":
{
"edges": 102,
"markings": 103,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(cell___1_2__B_ <= 1)",
"processed_size": 21,
"rewrites": 64
},
"result":
{
"edges": 104,
"markings": 105,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22852,
"runtime": 1166.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : E(G(**)) : E(G(E(X(**)))) : (A(F(**)) AND (** OR E(G(*)))) : FALSE : E(F(**)) : (NODEADLOCK AND (A(X(**)) OR (E(G(**)) AND E(F(**))))) : A(G(**)) : (** AND A(F(E(G(**))))) : TRUE : (A(F(**)) AND **) : A(F(A(G(**)))) : ((E(F(**)) AND (A(X(**)) AND E(F(*)))) OR A(F(E(X(**))))) : A(G(**)) : A(F(A(G(**)))) : E((** U **))"
},
"net":
{
"arcs": 443,
"conflict_clusters": 1,
"places": 14,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 65
},
"result":
{
"preliminary_value": "yes no unknown no no yes yes no no yes no no no no no yes ",
"value": "yes no unknown no no yes yes no no yes no no no no 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: 79/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 65 transitions, 9 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: LP says that atomic proposition is always false: (size_dot <= cell___1_1__B_)
lola: LP says that atomic proposition is always false: (2 <= run_dot)
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: LP says that atomic proposition is always false: (size_dot <= cell___1_1__B_)
lola: LP says that atomic proposition is always true: (run_dot <= cell___1_1__A_)
lola: A (G (A (((1 <= size_dot) U (1 <= cell___1_1__A_))))) : NOT(NOT(E (G ((size_dot + 1 <= pool__1_1_))))) : E (G (E (X ((cell___2_1__A_ <= 1))))) : (NOT(NOT(A (F ((2 <= cell___1_2__B_))))) AND ((((2 <= cell___2_2__A_) AND (pool__2_2_ <= cell___1_2__B_) AND (pool__1_1_ <= 0)) OR (pool__1_1_ <= cell___2_1__B_)) OR NOT(A (F ((pool__2_2_ <= cell___2_2__B_)))))) : E (((0 <= 0) U (size_dot <= cell___1_1__B_))) : E (F (A (F ((pool__1_2_ <= cell___1_2__B_))))) : (E (X (())) AND (A (X (((cell___1_2__B_ <= pool__1_2_) AND (pool__1_1_ <= cell___2_2__B_)))) OR (E (G ((cell___2_2__A_ <= cell___2_1__A_))) AND E (F ((2 <= pool__1_1_)))))) : A (G (((cell___2_1__A_ + 1 <= pool__1_2_) OR (cell___2_2__A_ + 1 <= pool__2_1_) OR (cell___2_1__A_ + 1 <= cell___2_2__B_) OR (cell___1_2__A_ <= 2)))) : (((cell___1_1__B_ <= cell___1_2__B_) OR (cell___1_2__B_ <= run_dot)) AND A (F (E (G ((3 <= cell___2_1__B_)))))) : ((A (F (((pool__1_1_ <= cell___2_1__B_) OR (2 <= cell___1_2__B_)))) OR E (G (()))) OR (E (G ((run_dot <= cell___2_2__A_))) OR A (G ((pool__2_1_ <= 2))))) : NOT(NOT((A (F ((pool__1_2_ <= cell___1_1__A_))) AND ((cell___1_2__A_ <= 2) OR (cell___1_1__B_ <= 2))))) : A (F (A (G (((3 <= pool__1_1_) AND (cell___2_2__B_ <= pool__1_2_)))))) : (((E (F ((cell___1_2__B_ <= cell___1_1__A_))) AND A (X ((3 <= size_dot)))) AND NOT(A (G ((pool__2_2_ <= cell___1_1__A_))))) OR A (F (E (X ((3 <= cell___1_2__A_)))))) : (A (G (((size_dot <= pool__2_1_) AND (1 <= pool__2_1_) AND (cell___2_2__A_ + 1 <= cell___2_1__A_)))) OR E (F ((size_dot <= cell___1_1__B_)))) : A (F (A (G (((3 <= cell___1_2__B_)))))) : ((E (G ((run_dot <= cell___1_1__A_))) OR NOT(E (F ((1 <= cell___2_2__A_))))) AND E ((((3 <= pool__2_1_) AND (3 <= pool__2_1_)) U (cell___2_1__B_ + 1 <= cell___2_2__A_))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:123
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 61 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 1 will run for 237 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: 61 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 2 will run for 254 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: 61 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND (A (X (((cell___1_2__B_ <= pool__1_2_) AND (pool__1_1_ <= cell___2_2__B_)))) OR (E (G ((cell___2_2__A_ <= cell___2_1__A_))) AND E (F ((2 <= pool__1_1_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pool__1_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 ((2 <= pool__1_1_)))
lola: processed formula length: 25
lola: 62 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: (2 <= pool__1_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-3-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 61 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((cell___2_2__A_ <= cell___2_1__A_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((cell___2_2__A_ <= cell___2_1__A_)))
lola: processed formula length: 42
lola: 62 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 / 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 105 markings, 104 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((cell___2_1__A_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((cell___2_1__A_ <= 1)))
lola: processed formula length: 29
lola: 63 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: 558807 markings, 12877312 edges, 111761 markings/sec, 0 secs
lola: 1041808 markings, 23509673 edges, 96600 markings/sec, 5 secs
lola: 1536382 markings, 34482690 edges, 98915 markings/sec, 10 secs
lola: 2008063 markings, 45009491 edges, 94336 markings/sec, 15 secs
lola: 2496814 markings, 55875156 edges, 97750 markings/sec, 20 secs
lola: 2990394 markings, 66815863 edges, 98716 markings/sec, 25 secs
lola: 3489702 markings, 77890090 edges, 99862 markings/sec, 30 secs
lola: 3981760 markings, 88803246 edges, 98412 markings/sec, 35 secs
lola: 4471118 markings, 99661764 edges, 97872 markings/sec, 40 secs
lola: 4964106 markings, 110604940 edges, 98598 markings/sec, 45 secs
lola: 5455327 markings, 121575407 edges, 98244 markings/sec, 50 secs
lola: 5954810 markings, 132683545 edges, 99897 markings/sec, 55 secs
lola: 6451362 markings, 143693647 edges, 99310 markings/sec, 60 secs
lola: 6965659 markings, 156235114 edges, 102859 markings/sec, 65 secs
lola: 7358052 markings, 170751348 edges, 78479 markings/sec, 70 secs
lola: 7729077 markings, 184862202 edges, 74205 markings/sec, 75 secs
lola: 8105495 markings, 199194437 edges, 75284 markings/sec, 80 secs
lola: 8469758 markings, 213240646 edges, 72853 markings/sec, 85 secs
lola: 8827424 markings, 227033722 edges, 71533 markings/sec, 90 secs
lola: 9178621 markings, 240787913 edges, 70239 markings/sec, 95 secs
lola: 9538582 markings, 254676833 edges, 71992 markings/sec, 100 secs
lola: 9902156 markings, 268718583 edges, 72715 markings/sec, 105 secs
lola: 10273734 markings, 282571370 edges, 74316 markings/sec, 110 secs
lola: 10773413 markings, 295555027 edges, 99936 markings/sec, 115 secs
lola: 11226061 markings, 305450177 edges, 90530 markings/sec, 120 secs
lola: 11674408 markings, 315352330 edges, 89669 markings/sec, 125 secs
lola: 12115811 markings, 325229121 edges, 88281 markings/sec, 130 secs
lola: 12556714 markings, 334971292 edges, 88181 markings/sec, 135 secs
lola: 13001031 markings, 344815703 edges, 88863 markings/sec, 140 secs
lola: 13440836 markings, 354655065 edges, 87961 markings/sec, 145 secs
lola: 13890576 markings, 364602902 edges, 89948 markings/sec, 150 secs
lola: 14333730 markings, 374411878 edges, 88631 markings/sec, 155 secs
lola: 14767938 markings, 384129903 edges, 86842 markings/sec, 160 secs
lola: 15214258 markings, 393997609 edges, 89264 markings/sec, 165 secs
lola: 15659406 markings, 403853503 edges, 89030 markings/sec, 170 secs
lola: 16104844 markings, 413820575 edges, 89088 markings/sec, 175 secs
lola: 16551316 markings, 423694556 edges, 89294 markings/sec, 180 secs
lola: 17007857 markings, 433556778 edges, 91308 markings/sec, 185 secs
lola: 17437397 markings, 445654301 edges, 85908 markings/sec, 190 secs
lola: 17792291 markings, 458900051 edges, 70979 markings/sec, 195 secs
lola: 18129778 markings, 471674697 edges, 67497 markings/sec, 200 secs
lola: 18463347 markings, 484510500 edges, 66714 markings/sec, 205 secs
lola: 18792397 markings, 497163927 edges, 65810 markings/sec, 210 secs
lola: 19117718 markings, 509671792 edges, 65064 markings/sec, 215 secs
lola: 19447036 markings, 522341537 edges, 65864 markings/sec, 220 secs
lola: 19775519 markings, 535191018 edges, 65697 markings/sec, 225 secs
lola: 20110184 markings, 548071416 edges, 66933 markings/sec, 230 secs
lola: 20438761 markings, 560925264 edges, 65715 markings/sec, 235 secs
lola: 20816153 markings, 574176962 edges, 75478 markings/sec, 240 secs
lola: 21205804 markings, 587198842 edges, 77930 markings/sec, 245 secs
lola: 21548366 markings, 597413930 edges, 68512 markings/sec, 250 secs
lola: 21891396 markings, 607730274 edges, 68606 markings/sec, 255 secs
lola: 22240056 markings, 618239692 edges, 69732 markings/sec, 260 secs
lola: 22582818 markings, 628416323 edges, 68552 markings/sec, 265 secs
lola: 22920072 markings, 638562197 edges, 67451 markings/sec, 270 secs
lola: 23260967 markings, 648830481 edges, 68179 markings/sec, 275 secs
lola: 23605301 markings, 659089059 edges, 68867 markings/sec, 280 secs
lola: 23950353 markings, 669444843 edges, 69010 markings/sec, 285 secs
lola: 24296592 markings, 679876540 edges, 69248 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown no unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6398376 KB
lola: time consumption: 301 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown no unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6461800 KB
lola: time consumption: 304 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((cell___1_2__B_ <= cell___1_1__A_))) AND (A (X ((3 <= size_dot))) AND E (F ((cell___1_1__A_ + 1 <= pool__2_2_))))) OR A (F (E (X ((3 <= cell___1_2__A_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cell___1_1__A_ + 1 <= pool__2_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 ((cell___1_1__A_ + 1 <= pool__2_2_)))
lola: processed formula length: 42
lola: 62 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
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: (cell___1_1__A_ + 1 <= pool__2_2_)
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cell___1_2__B_ <= cell___1_1__A_)))
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 ((cell___1_2__B_ <= cell___1_1__A_)))
lola: processed formula length: 42
lola: 62 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: (cell___1_2__B_ <= cell___1_1__A_)
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= size_dot)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((3 <= size_dot))
lola: processed formula length: 19
lola: 62 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: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= cell___1_2__A_)))))
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((3 <= cell___1_2__A_)))
lola: processed formula length: 29
lola: 63 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 105 markings, 104 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pool__1_2_ <= cell___1_2__B_)))
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 ((pool__1_2_ <= cell___1_2__B_)))
lola: processed formula length: 38
lola: 62 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: (pool__1_2_ <= cell___1_2__B_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((size_dot <= pool__2_1_) AND (1 <= pool__2_1_) AND (cell___2_2__A_ + 1 <= cell___2_1__A_))))
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 (((size_dot <= pool__2_1_) AND (1 <= pool__2_1_) AND (cell___2_2__A_ + 1 <= cell___2_1__A_))))
lola: processed formula length: 99
lola: 63 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((pool__2_1_ + 1 <= size_dot) OR (pool__2_1_ <= 0) OR (cell___2_1__A_ <= cell___2_2__A_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___2_1__A_ + 1 <= pool__1_2_) OR (cell___2_2__A_ + 1 <= pool__2_1_) OR (cell___2_1__A_ + 1 <= cell___2_2__B_) OR (cell___1_2__A_ <= 2))))
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 (((cell___2_1__A_ + 1 <= pool__1_2_) OR (cell___2_2__A_ + 1 <= pool__2_1_) OR (cell___2_1__A_ + 1 <= cell___2_2__B_) OR (cell___1_2__A_ <= 2))))
lola: processed formula length: 152
lola: 63 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: ((pool__1_2_ <= cell___2_1__A_) AND (pool__2_1_ <= cell___2_2__A_) AND (cell___2_2__B_ <= cell___2_1__A_) AND (3 <= cell___1_2__A_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((size_dot + 1 <= pool__1_1_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((size_dot + 1 <= pool__1_1_)))
lola: processed formula length: 36
lola: 62 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 / 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: (pool__1_1_ <= size_dot)
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: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 310536 markings, 9392900 edges, 62107 markings/sec, 0 secs || sara is running 0 secs
lola: 590984 markings, 18972129 edges, 56090 markings/sec, 5 secs || sara is running 5 secs
lola: 860068 markings, 28515109 edges, 53817 markings/sec, 10 secs || sara is running 10 secs
lola: 1126600 markings, 38205090 edges, 53306 markings/sec, 15 secs || sara is running 15 secs
lola: 1384142 markings, 48030466 edges, 51508 markings/sec, 20 secs || sara is running 20 secs
lola: 1679841 markings, 57434082 edges, 59140 markings/sec, 25 secs || sara is running 25 secs
lola: 1967606 markings, 67002388 edges, 57553 markings/sec, 30 secs || sara is running 30 secs
lola: 2240892 markings, 76285212 edges, 54657 markings/sec, 35 secs || sara is running 35 secs
lola: 2552274 markings, 85648632 edges, 62276 markings/sec, 40 secs || sara is running 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 2583984 markings, 86512608 edges
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= cell___1_2__B_))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((cell___1_2__B_ <= 2))
lola: processed formula length: 23
lola: 65 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: ((cell___1_2__B_ <= 2))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result 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: ((3 <= cell___1_2__B_))
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-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-1.sara.
sara: place or transition ordering is non-deterministic

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

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 113780 markings, 3057469 edges
lola: ========================================
lola: subprocess 11 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= pool__2_1_) AND (3 <= pool__2_1_)) U (cell___2_1__B_ + 1 <= cell___2_2__A_)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((3 <= pool__2_1_) AND (3 <= pool__2_1_)) U (cell___2_1__B_ + 1 <= cell___2_2__A_)))
lola: processed formula length: 88
lola: 64 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 2 markings, 1 edges
lola: formula 0: (cell___2_1__B_ + 1 <= cell___2_2__A_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((pool__1_2_ <= cell___1_1__A_))) AND ((cell___1_2__A_ <= 2) OR (cell___1_1__B_ <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cell___1_2__A_ <= 2) OR (cell___1_1__B_ <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cell___1_2__A_ <= 2) OR (cell___1_1__B_ <= 2))
lola: processed formula length: 49
lola: 61 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 13 will run for 1066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pool__1_2_ <= cell___1_1__A_)))
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: (cell___1_1__A_ + 1 <= pool__1_2_)
lola: processed formula length: 34
lola: 64 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 / 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: (pool__1_2_ <= cell___1_1__A_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= pool__1_1_) AND (cell___2_2__B_ <= pool__1_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((pool__1_1_ <= 2) OR (pool__1_2_ + 1 <= cell___2_2__B_))
lola: processed formula length: 58
lola: 65 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= pool__1_1_) AND (cell___2_2__B_ <= pool__1_2_))
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 /EGEF
lola: The predicate is not eventually invariant.
lola: 105 markings, 104 edges
lola: ========================================
lola: subprocess 14 will run for 1599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((cell___1_1__B_ <= cell___1_2__B_) OR (cell___1_2__B_ <= run_dot)) AND A (F (E (G ((3 <= cell___2_1__B_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cell___1_1__B_ <= cell___1_2__B_) OR (cell___1_2__B_ <= run_dot))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cell___1_1__B_ <= cell___1_2__B_) OR (cell___1_2__B_ <= run_dot))
lola: processed formula length: 68
lola: 61 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 15 will run for 3198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((3 <= cell___2_1__B_)))))
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((3 <= cell___2_1__B_)))
lola: processed formula length: 29
lola: 63 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 105 markings, 209 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= cell___1_2__B_))) AND ((((2 <= cell___2_2__A_) AND (pool__2_2_ <= cell___1_2__B_) AND (pool__1_1_ <= 0)) OR (pool__1_1_ <= cell___2_1__B_)) OR E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))
lola: processed formula length: 42
lola: 62 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 / 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pool__2_2_ <= cell___2_2__B_)
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: 103 markings, 102 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((cell___2_1__A_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((cell___2_1__A_ <= 1)))
lola: processed formula length: 29
lola: 63 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: 572335 markings, 13180094 edges, 114467 markings/sec, 0 secs
lola: 1068797 markings, 24119280 edges, 99292 markings/sec, 5 secs
lola: 1570106 markings, 35233849 edges, 100262 markings/sec, 10 secs
lola: 2057490 markings, 46054415 edges, 97477 markings/sec, 15 secs
lola: 2549928 markings, 57006764 edges, 98488 markings/sec, 20 secs
lola: 3042322 markings, 67997286 edges, 98479 markings/sec, 25 secs
lola: 3543778 markings, 79121525 edges, 100291 markings/sec, 30 secs
lola: 4035410 markings, 90016795 edges, 98326 markings/sec, 35 secs
lola: 4527781 markings, 100937533 edges, 98474 markings/sec, 40 secs
lola: 5023314 markings, 111931165 edges, 99107 markings/sec, 45 secs
lola: 5522216 markings, 123003251 edges, 99780 markings/sec, 50 secs
lola: 6020884 markings, 134077041 edges, 99734 markings/sec, 55 secs
lola: 6510440 markings, 145019153 edges, 97911 markings/sec, 60 secs
lola: 7023721 markings, 158326736 edges, 102656 markings/sec, 65 secs
lola: 7419897 markings, 173181994 edges, 79235 markings/sec, 70 secs
lola: 7809178 markings, 187840367 edges, 77856 markings/sec, 75 secs
lola: 8182898 markings, 202261885 edges, 74744 markings/sec, 80 secs
lola: 8550951 markings, 216468221 edges, 73611 markings/sec, 85 secs
lola: 8912453 markings, 230415692 edges, 72300 markings/sec, 90 secs
lola: 9280376 markings, 244621684 edges, 73585 markings/sec, 95 secs
lola: 9648214 markings, 259010138 edges, 73568 markings/sec, 100 secs
lola: 10013454 markings, 273137789 edges, 73048 markings/sec, 105 secs
lola: 10439113 markings, 287673908 edges, 85132 markings/sec, 110 secs
lola: 10944479 markings, 299246867 edges, 101073 markings/sec, 115 secs
lola: 11390684 markings, 309057086 edges, 89241 markings/sec, 120 secs
lola: 11836966 markings, 319030502 edges, 89256 markings/sec, 125 secs
lola: 12280562 markings, 328835096 edges, 88719 markings/sec, 130 secs
lola: 12722986 markings, 338635222 edges, 88485 markings/sec, 135 secs
lola: 13167832 markings, 348583883 edges, 88969 markings/sec, 140 secs
lola: 13618354 markings, 358549384 edges, 90104 markings/sec, 145 secs
lola: 14074780 markings, 368659239 edges, 91285 markings/sec, 150 secs
lola: 14507112 markings, 378341410 edges, 86466 markings/sec, 155 secs
lola: 14953658 markings, 388214325 edges, 89309 markings/sec, 160 secs
lola: 15406804 markings, 398248471 edges, 90629 markings/sec, 165 secs
lola: 15858658 markings, 408304245 edges, 90371 markings/sec, 170 secs
lola: 16312660 markings, 418413210 edges, 90800 markings/sec, 175 secs
lola: 16766558 markings, 428457155 edges, 90780 markings/sec, 180 secs
lola: 17258426 markings, 439202675 edges, 98374 markings/sec, 185 secs
lola: 17640181 markings, 453072133 edges, 76351 markings/sec, 190 secs
lola: 17992987 markings, 466448295 edges, 70561 markings/sec, 195 secs
lola: 18345787 markings, 479843815 edges, 70560 markings/sec, 200 secs
lola: 18688713 markings, 493037484 edges, 68585 markings/sec, 205 secs
lola: 19032913 markings, 506298766 edges, 68840 markings/sec, 210 secs
lola: 19365078 markings, 519296315 edges, 66433 markings/sec, 215 secs
lola: 19712278 markings, 532677762 edges, 69440 markings/sec, 220 secs
lola: 20063694 markings, 546233806 edges, 70283 markings/sec, 225 secs
lola: 20401244 markings, 559432546 edges, 67510 markings/sec, 230 secs
lola: 20782030 markings, 572928772 edges, 76157 markings/sec, 235 secs
lola: 21177125 markings, 586445315 edges, 79019 markings/sec, 240 secs
lola: 21529210 markings, 596830655 edges, 70417 markings/sec, 245 secs
lola: 21879342 markings, 607354320 edges, 70026 markings/sec, 250 secs
lola: 22233526 markings, 618035555 edges, 70837 markings/sec, 255 secs
lola: 22581985 markings, 628393230 edges, 69692 markings/sec, 260 secs
lola: 22925152 markings, 638719965 edges, 68633 markings/sec, 265 secs
lola: 23272256 markings, 649172846 edges, 69421 markings/sec, 270 secs
lola: 23623362 markings, 659626818 edges, 70221 markings/sec, 275 secs
lola: 23973000 markings, 670141369 edges, 69928 markings/sec, 280 secs
lola: 24325798 markings, 680771142 edges, 70560 markings/sec, 285 secs
lola: 24673490 markings, 691126815 edges, 69538 markings/sec, 290 secs
lola: 25016472 markings, 701425656 edges, 68596 markings/sec, 295 secs
lola: 25361909 markings, 711825897 edges, 69087 markings/sec, 300 secs
lola: 25709386 markings, 722243854 edges, 69495 markings/sec, 305 secs
lola: 26060826 markings, 732741787 edges, 70288 markings/sec, 310 secs
lola: 26412102 markings, 743320085 edges, 70255 markings/sec, 315 secs
lola: 26760424 markings, 753794608 edges, 69664 markings/sec, 320 secs
lola: 27113090 markings, 764295023 edges, 70533 markings/sec, 325 secs
lola: 27484597 markings, 774794276 edges, 74301 markings/sec, 330 secs
lola: 27815187 markings, 788681171 edges, 66118 markings/sec, 335 secs
lola: 28095328 markings, 802905545 edges, 56028 markings/sec, 340 secs
lola: 28367107 markings, 816863077 edges, 54356 markings/sec, 345 secs
lola: 28639086 markings, 830968870 edges, 54396 markings/sec, 350 secs
lola: 28910970 markings, 845077394 edges, 54377 markings/sec, 355 secs
lola: 29171461 markings, 858797835 edges, 52098 markings/sec, 360 secs
lola: 29435863 markings, 872500703 edges, 52880 markings/sec, 365 secs
lola: 29690513 markings, 885917181 edges, 50930 markings/sec, 370 secs
lola: 29954745 markings, 899840703 edges, 52846 markings/sec, 375 secs
lola: 30223941 markings, 913801382 edges, 53839 markings/sec, 380 secs
lola: 30484850 markings, 927543695 edges, 52182 markings/sec, 385 secs
lola: 30743192 markings, 941154990 edges, 51668 markings/sec, 390 secs
lola: 31024873 markings, 955193902 edges, 56336 markings/sec, 395 secs
lola: 31466596 markings, 968713805 edges, 88345 markings/sec, 400 secs
lola: 31936045 markings, 978968986 edges, 93890 markings/sec, 405 secs
lola: 32387798 markings, 988980651 edges, 90351 markings/sec, 410 secs
lola: 32839299 markings, 999047862 edges, 90300 markings/sec, 415 secs
lola: 33288184 markings, 1008974550 edges, 89777 markings/sec, 420 secs
lola: 33747297 markings, 1019154264 edges, 91823 markings/sec, 425 secs
lola: 34197606 markings, 1029230691 edges, 90062 markings/sec, 430 secs
lola: 34664090 markings, 1039558069 edges, 93297 markings/sec, 435 secs
lola: 35123688 markings, 1049734311 edges, 91920 markings/sec, 440 secs
lola: 35575133 markings, 1059766473 edges, 90289 markings/sec, 445 secs
lola: 36018714 markings, 1069655497 edges, 88716 markings/sec, 450 secs
lola: 36466852 markings, 1079573197 edges, 89628 markings/sec, 455 secs
lola: 36924394 markings, 1089716215 edges, 91508 markings/sec, 460 secs
lola: 37368954 markings, 1099650529 edges, 88912 markings/sec, 465 secs
lola: 37839917 markings, 1109653163 edges, 94193 markings/sec, 470 secs
lola: 38241499 markings, 1121685137 edges, 80316 markings/sec, 475 secs
lola: 38581654 markings, 1134530079 edges, 68031 markings/sec, 480 secs
lola: 38927844 markings, 1147669474 edges, 69238 markings/sec, 485 secs
lola: 39275132 markings, 1160839935 edges, 69458 markings/sec, 490 secs
lola: 39616576 markings, 1173987884 edges, 68289 markings/sec, 495 secs
lola: 39937779 markings, 1186544414 edges, 64241 markings/sec, 500 secs
lola: 40270267 markings, 1199336367 edges, 66498 markings/sec, 505 secs
lola: 40600788 markings, 1212063724 edges, 66104 markings/sec, 510 secs
lola: 40915001 markings, 1224333598 edges, 62843 markings/sec, 515 secs
lola: 41232519 markings, 1236753000 edges, 63504 markings/sec, 520 secs
lola: 41594009 markings, 1249389512 edges, 72298 markings/sec, 525 secs
lola: 41933495 markings, 1260896788 edges, 67897 markings/sec, 530 secs
lola: 42258348 markings, 1270485851 edges, 64971 markings/sec, 535 secs
lola: 42580674 markings, 1280144206 edges, 64465 markings/sec, 540 secs
lola: 42905154 markings, 1289900927 edges, 64896 markings/sec, 545 secs
lola: 43227998 markings, 1299614908 edges, 64569 markings/sec, 550 secs
lola: 43549141 markings, 1309263339 edges, 64229 markings/sec, 555 secs
lola: 43870423 markings, 1318818784 edges, 64256 markings/sec, 560 secs
lola: 44195034 markings, 1328571820 edges, 64922 markings/sec, 565 secs
lola: 44518126 markings, 1338293240 edges, 64618 markings/sec, 570 secs
lola: 44835618 markings, 1347840431 edges, 63498 markings/sec, 575 secs
lola: 45163622 markings, 1357616859 edges, 65601 markings/sec, 580 secs
lola: 45478078 markings, 1367036817 edges, 62891 markings/sec, 585 secs
lola: 45793108 markings, 1376499575 edges, 63006 markings/sec, 590 secs
lola: 46111268 markings, 1386077053 edges, 63632 markings/sec, 595 secs
lola: 46429804 markings, 1395656224 edges, 63707 markings/sec, 600 secs
lola: 46752054 markings, 1405261879 edges, 64450 markings/sec, 605 secs
lola: 47074476 markings, 1414922095 edges, 64484 markings/sec, 610 secs
lola: 47398924 markings, 1424669150 edges, 64890 markings/sec, 615 secs
lola: 47716848 markings, 1434239221 edges, 63585 markings/sec, 620 secs
lola: 48037058 markings, 1443870919 edges, 64042 markings/sec, 625 secs
lola: 48398172 markings, 1454360870 edges, 72223 markings/sec, 630 secs
lola: 48671215 markings, 1467941148 edges, 54609 markings/sec, 635 secs
lola: 48929490 markings, 1481086266 edges, 51655 markings/sec, 640 secs
lola: 49179930 markings, 1494036064 edges, 50088 markings/sec, 645 secs
lola: 49429878 markings, 1506966877 edges, 49990 markings/sec, 650 secs
lola: 49680918 markings, 1519955956 edges, 50208 markings/sec, 655 secs
lola: 49922277 markings, 1532652053 edges, 48272 markings/sec, 660 secs
lola: 50171232 markings, 1545530615 edges, 49791 markings/sec, 665 secs
lola: 50410577 markings, 1558120741 edges, 47869 markings/sec, 670 secs
lola: 50650559 markings, 1570750176 edges, 47996 markings/sec, 675 secs
lola: 50897046 markings, 1583723055 edges, 49297 markings/sec, 680 secs
lola: 51143485 markings, 1596694631 edges, 49288 markings/sec, 685 secs
lola: 51386290 markings, 1609467542 edges, 48561 markings/sec, 690 secs
lola: 51635927 markings, 1622612416 edges, 49927 markings/sec, 695 secs
lola: 51917890 markings, 1635678138 edges, 56393 markings/sec, 700 secs
lola: 52304805 markings, 1649208665 edges, 77383 markings/sec, 705 secs
lola: 52660714 markings, 1659771632 edges, 71182 markings/sec, 710 secs
lola: 53013772 markings, 1670401381 edges, 70612 markings/sec, 715 secs
lola: 53371136 markings, 1681173001 edges, 71473 markings/sec, 720 secs
lola: 53722100 markings, 1691604990 edges, 70193 markings/sec, 725 secs
lola: 54067164 markings, 1701985545 edges, 69013 markings/sec, 730 secs
lola: 54415702 markings, 1712491562 edges, 69708 markings/sec, 735 secs
lola: 54769156 markings, 1723009263 edges, 70691 markings/sec, 740 secs
lola: 55121682 markings, 1733614156 edges, 70505 markings/sec, 745 secs
lola: 55477972 markings, 1744352680 edges, 71258 markings/sec, 750 secs
lola: 55829536 markings, 1754811747 edges, 70313 markings/sec, 755 secs
lola: 56173780 markings, 1765163793 edges, 68849 markings/sec, 760 secs
lola: 56521338 markings, 1775633201 edges, 69512 markings/sec, 765 secs
lola: 56873099 markings, 1786115575 edges, 70352 markings/sec, 770 secs
lola: 57225234 markings, 1796691058 edges, 70427 markings/sec, 775 secs
lola: 57578297 markings, 1807329522 edges, 70613 markings/sec, 780 secs
lola: 57807010 markings, 1814173154 edges, 45743 markings/sec, 785 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= cell___1_2__B_))) AND ((((2 <= cell___2_2__A_) AND (pool__2_2_ <= cell___1_2__B_) AND (pool__1_1_ <= 0)) OR (pool__1_1_ <= cell___2_1__B_)) OR E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((cell___2_2__B_ + 1 <= pool__2_2_)))
lola: processed formula length: 42
lola: 62 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 / 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:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 103 markings, 102 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pool__2_2_ <= cell___2_2__B_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= cell___1_2__B_)))
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: (cell___1_2__B_ <= 1)
lola: processed formula length: 21
lola: 64 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 / 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: (2 <= cell___1_2__B_)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 105 markings, 104 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no no yes yes no no yes no no no no no yes
lola:
preliminary result: yes no unknown no no yes yes no no yes no no no no no yes

lola: memory consumption: 22852 KB
lola: time consumption: 1166 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552810652141

--------------------
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="PhaseVariation-PT-D02CS100"
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-3954"
echo " Executing tool lola"
echo " Input is PhaseVariation-PT-D02CS100, 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 r104-oct2-155272226200589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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