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.r049-oct2-155234405500679.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 DNAwalker-PT-10ringRL, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405500679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.5K Feb 10 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 10 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 6 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 15:42 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 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 3 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 30 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 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 112K 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 DNAwalker-PT-10ringRL-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-10ringRL-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552474359240

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DNAwalker-PT-10ringRL @ 3570 seconds

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1691
rslt: Output for CTLCardinality @ DNAwalker-PT-10ringRL

{
"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": "Wed Mar 13 10:52:39 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 191
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX((EG((A19 <= A1)) AND (B15 <= A20)))",
"processed_size": 38,
"rewrites": 25
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 14579,
"markings": 12392,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 216
},
"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 ((3 <= A18)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 121767654,
"markings": 22052181,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"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": 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": "(A4 + 1 <= B12)",
"processed_size": 15,
"rewrites": 26
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((A5 <= A9) AND (A20 <= A1))",
"processed_size": 28,
"rewrites": 26
},
"result":
{
"edges": 143,
"markings": 138,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 75
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G ((((A11 + 1 <= A2) AND (B12 + 1 <= A16)) OR (B5 <= A19))))",
"processed_size": 64,
"rewrites": 24
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 95
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(E((3 <= A18) U (2 <= B5)))",
"processed_size": 29,
"rewrites": 25
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 32,
"markings": 16,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(((2 <= A1) AND (2 <= A7))))",
"processed_size": 33,
"rewrites": 25
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 32,
"markings": 16,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG(A((3 <= A18) U (A20 <= A10)))",
"processed_size": 32,
"rewrites": 25
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 38,
"markings": 19,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E(((A17 <= A9) OR (B15 <= A4) OR (A6 <= 1)) U AG((1 <= B12)))",
"processed_size": 63,
"rewrites": 25
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 273082793,
"markings": 27933761,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 752
},
"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 ((3 <= B13)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 752
},
"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": "(A19 + 1 <= B15)",
"processed_size": 16,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1129
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((2 <= A6) OR (2 <= A1))",
"processed_size": 25,
"rewrites": 26
},
"result":
{
"edges": 190,
"markings": 191,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 57
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1129
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((A11 + 1 <= A21) AND (1 <= A16))",
"processed_size": 33,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2258
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((A12 <= 0)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2258
},
"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": "(A4 + 1 <= A1)",
"processed_size": 14,
"rewrites": 26
},
"result":
{
"edges": 126,
"markings": 127,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))",
"processed_size": 81,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "A (G ((A7 <= 2)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 230723196,
"markings": 27950651,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((B15 <= A7))",
"processed_size": 15,
"rewrites": 24
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))",
"processed_size": 70,
"rewrites": 24
},
"result":
{
"edges": 199057127,
"markings": 27930649,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(A4 + 1 <= A1)",
"processed_size": 14,
"rewrites": 26
},
"result":
{
"edges": 126,
"markings": 127,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "E (F (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))))",
"processed_size": 52,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))",
"processed_size": 81,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 34668,
"runtime": 1855.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(E((** U **)))) : E(X((E(G(**)) AND **))) : (E(F(**)) OR **) : E(F(**)) : A(F(**)) : (A(F(**)) AND (** AND E(F(**)))) : E(F(E(G(**)))) : E((** U A(G(**)))) : (A(F(**)) AND A(F(**))) : E(G(**)) : ((A(G(*)) OR A(F(**))) AND E(X(**))) : A(F(E(G(**)))) : (A(F(*)) AND A(X(A(F(**))))) : E(G(A((** U **)))) : (E(X(**)) AND E(F(**))) : (E(G(**)) OR (E(G(*)) OR *))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no no no no yes yes no yes yes yes no no yes no yes ",
"value": "no no no no no yes yes no yes yes yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: A (F (E (((3 <= A18) U (2 <= B5))))) : E (X ((E (G ((A19 <= A1))) AND (B15 <= A20)))) : (NOT(NOT(E (F ((3 <= B13))))) OR (3 <= A3)) : E (F (E (((1 <= A11) U (3 <= A18))))) : A (F ((B12 <= A4))) : ((A (F ((A1 <= A4))) AND (((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))) AND E (F (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))))) : E (F (E (G (((A5 <= A9) AND (A20 <= A1)))))) : E ((((A17 <= A9) OR (B15 <= A4) OR (A6 <= 1)) U A (G ((1 <= B12))))) : (A (F (((A6 <= 1) AND (A1 <= 1)))) AND A (F ((B15 <= A19)))) : E (G ((((A11 + 1 <= A2) AND (B12 + 1 <= A16)) OR (B5 <= A19)))) : ((NOT(E (F ((3 <= A7)))) OR A (F ((A8 + 1 <= B4)))) AND E (X ((B15 <= A7)))) : A (F (E (G (((2 <= A1) AND (2 <= A7)))))) : (NOT(E (G ((B14 <= 1)))) AND A (X (A (F ((B14 <= A6)))))) : E (G (A (((3 <= A18) U (A20 <= A10))))) : (E (X (((2 <= A20) AND (A18 <= 1)))) AND E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))) : ((A (((A20 <= A7) U (1 <= A17))) AND E (G ((A17 <= 1)))) OR NOT((A (F ((1 <= A12))) AND ((A21 <= A11) OR (A16 <= 0)))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G ((A19 <= A1))) AND (B15 <= A20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EG((A19 <= A1)) AND (B15 <= A20)))
lola: processed formula length: 38
lola: 25 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: 12392 markings, 14579 edges
lola: ========================================
lola: subprocess 1 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((A7 <= 2))) OR A (F ((A8 + 1 <= B4)))) AND E (X ((B15 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A7 <= 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:788
lola: processed formula: A (G ((A7 <= 2)))
lola: processed formula length: 17
lola: 25 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= A7)
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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 584893 markings, 3485237 edges, 116979 markings/sec, 0 secs
lola: sara is running 5 secs || 1121550 markings, 7094940 edges, 107331 markings/sec, 5 secs
lola: sara is running 10 secs || 1644285 markings, 11130963 edges, 104547 markings/sec, 10 secs
lola: sara is running 15 secs || 2160468 markings, 15145401 edges, 103237 markings/sec, 15 secs
lola: sara is running 20 secs || 2672840 markings, 19027298 edges, 102474 markings/sec, 20 secs
lola: sara is running 25 secs || 3221945 markings, 22526097 edges, 109821 markings/sec, 25 secs
lola: sara is running 30 secs || 3747363 markings, 26237588 edges, 105084 markings/sec, 30 secs
lola: sara is running 35 secs || 4244467 markings, 30106879 edges, 99421 markings/sec, 35 secs
lola: sara is running 40 secs || 4701236 markings, 33994764 edges, 91354 markings/sec, 40 secs
lola: sara is running 45 secs || 5186050 markings, 37904192 edges, 96963 markings/sec, 45 secs
lola: sara is running 50 secs || 5617353 markings, 42024868 edges, 86261 markings/sec, 50 secs
lola: sara is running 55 secs || 6154048 markings, 45712923 edges, 107339 markings/sec, 55 secs
lola: sara is running 60 secs || 6641595 markings, 49807805 edges, 97509 markings/sec, 60 secs
lola: sara is running 65 secs || 7125607 markings, 53904536 edges, 96802 markings/sec, 65 secs
lola: sara is running 70 secs || 7627270 markings, 57983237 edges, 100333 markings/sec, 70 secs
lola: sara is running 75 secs || 8117526 markings, 62030477 edges, 98051 markings/sec, 75 secs
lola: sara is running 80 secs || 8603523 markings, 66148742 edges, 97199 markings/sec, 80 secs
lola: sara is running 85 secs || 9119717 markings, 69923309 edges, 103239 markings/sec, 85 secs
lola: sara is running 90 secs || 9618277 markings, 73777227 edges, 99712 markings/sec, 90 secs
lola: sara is running 95 secs || 10077386 markings, 77658200 edges, 91822 markings/sec, 95 secs
lola: sara is running 100 secs || 10516482 markings, 81765921 edges, 87819 markings/sec, 100 secs
lola: sara is running 105 secs || 11014537 markings, 85827330 edges, 99611 markings/sec, 105 secs
lola: sara is running 110 secs || 11492314 markings, 90083434 edges, 95555 markings/sec, 110 secs
lola: sara is running 115 secs || 11978549 markings, 94310163 edges, 97247 markings/sec, 115 secs
lola: sara is running 120 secs || 12442895 markings, 98443541 edges, 92869 markings/sec, 120 secs
lola: sara is running 125 secs || 13012452 markings, 102121498 edges, 113911 markings/sec, 125 secs
lola: sara is running 130 secs || 13538828 markings, 105856299 edges, 105275 markings/sec, 130 secs
lola: sara is running 135 secs || 14068645 markings, 109473912 edges, 105963 markings/sec, 135 secs
lola: sara is running 140 secs || 14577248 markings, 113177298 edges, 101721 markings/sec, 140 secs
lola: sara is running 145 secs || 15061775 markings, 117040640 edges, 96905 markings/sec, 145 secs
lola: sara is running 150 secs || 15568359 markings, 120747630 edges, 101317 markings/sec, 150 secs
lola: sara is running 155 secs || 16041786 markings, 124564139 edges, 94685 markings/sec, 155 secs
lola: sara is running 160 secs || 16490810 markings, 128531298 edges, 89805 markings/sec, 160 secs
lola: sara is running 165 secs || 16940517 markings, 132751656 edges, 89941 markings/sec, 165 secs
lola: sara is running 170 secs || 17423405 markings, 137022626 edges, 96578 markings/sec, 170 secs
lola: sara is running 175 secs || 17896592 markings, 141209760 edges, 94637 markings/sec, 175 secs
lola: sara is running 180 secs || 18364608 markings, 145428634 edges, 93603 markings/sec, 180 secs
lola: sara is running 185 secs || 18810073 markings, 149574003 edges, 89093 markings/sec, 185 secs
lola: sara is running 190 secs || 19309689 markings, 153518183 edges, 99923 markings/sec, 190 secs
lola: sara is running 195 secs || 19822241 markings, 157316724 edges, 102510 markings/sec, 195 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 718916 KB
lola: time consumption: 708 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: memory consumption: 718916 KB
lola: time consumption: 708 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: memory consumption: 718784 KB
lola: time consumption: 708 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: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 34392 KB
lola: time consumption: 709 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 2 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= B14))) AND A (X (A (F ((B14 <= A6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= B14)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (B14 <= 1)
lola: processed formula length: 10
lola: 26 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 <= B14)
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: 9 markings, 9 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((2 <= A20) AND (A18 <= 1)))) AND E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))
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 (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))
lola: processed formula length: 70
lola: 24 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: ((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 722549 markings, 3168658 edges, 144510 markings/sec, 0 secs
lola: sara is running 5 secs || 1454617 markings, 6506183 edges, 146414 markings/sec, 5 secs
lola: sara is running 10 secs || 2141699 markings, 9899623 edges, 137416 markings/sec, 10 secs
lola: sara is running 15 secs || 2812493 markings, 13358835 edges, 134159 markings/sec, 15 secs
lola: sara is running 20 secs || 3488808 markings, 16927208 edges, 135263 markings/sec, 20 secs
lola: sara is running 25 secs || 4152056 markings, 20545361 edges, 132650 markings/sec, 25 secs
lola: sara is running 30 secs || 4781245 markings, 24335801 edges, 125838 markings/sec, 30 secs
lola: sara is running 35 secs || 5378287 markings, 28051644 edges, 119408 markings/sec, 35 secs
lola: sara is running 40 secs || 5992614 markings, 31546658 edges, 122865 markings/sec, 40 secs
lola: sara is running 45 secs || 6601124 markings, 35201538 edges, 121702 markings/sec, 45 secs
lola: sara is running 50 secs || 7178733 markings, 39031962 edges, 115522 markings/sec, 50 secs
lola: sara is running 55 secs || 7778602 markings, 42511105 edges, 119974 markings/sec, 55 secs
lola: sara is running 60 secs || 8405637 markings, 45896510 edges, 125407 markings/sec, 60 secs
lola: sara is running 65 secs || 8979742 markings, 49451860 edges, 114821 markings/sec, 65 secs
lola: sara is running 70 secs || 9572476 markings, 52996967 edges, 118547 markings/sec, 70 secs
lola: sara is running 75 secs || 10188632 markings, 56660229 edges, 123231 markings/sec, 75 secs
lola: sara is running 80 secs || 10705290 markings, 60562235 edges, 103332 markings/sec, 80 secs
lola: sara is running 85 secs || 11296207 markings, 64347103 edges, 118183 markings/sec, 85 secs
lola: sara is running 90 secs || 11872841 markings, 68265504 edges, 115327 markings/sec, 90 secs
lola: sara is running 95 secs || 12439859 markings, 72223064 edges, 113404 markings/sec, 95 secs
lola: sara is running 100 secs || 12992029 markings, 76283905 edges, 110434 markings/sec, 100 secs
lola: sara is running 105 secs || 13599816 markings, 80438320 edges, 121557 markings/sec, 105 secs
lola: sara is running 110 secs || 14128517 markings, 84626957 edges, 105740 markings/sec, 110 secs
lola: sara is running 115 secs || 14632573 markings, 88887597 edges, 100811 markings/sec, 115 secs
lola: sara is running 120 secs || 15153427 markings, 93245636 edges, 104171 markings/sec, 120 secs
lola: sara is running 125 secs || 15689574 markings, 97000649 edges, 107229 markings/sec, 125 secs
lola: sara is running 130 secs || 16199798 markings, 100705703 edges, 102045 markings/sec, 130 secs
lola: sara is running 135 secs || 16712310 markings, 104569978 edges, 102502 markings/sec, 135 secs
lola: sara is running 140 secs || 17212131 markings, 108445416 edges, 99964 markings/sec, 140 secs
lola: sara is running 145 secs || 17737976 markings, 112461463 edges, 105169 markings/sec, 145 secs
lola: sara is running 150 secs || 18196786 markings, 116518032 edges, 91762 markings/sec, 150 secs
lola: sara is running 155 secs || 18642474 markings, 120470858 edges, 89138 markings/sec, 155 secs
lola: sara is running 160 secs || 19188357 markings, 124399713 edges, 109177 markings/sec, 160 secs
lola: sara is running 165 secs || 19855053 markings, 128176375 edges, 133339 markings/sec, 165 secs
lola: sara is running 170 secs || 20479517 markings, 132148086 edges, 124893 markings/sec, 170 secs
lola: sara is running 175 secs || 21022735 markings, 136040286 edges, 108644 markings/sec, 175 secs
lola: sara is running 180 secs || 21529864 markings, 140124676 edges, 101426 markings/sec, 180 secs
lola: sara is running 185 secs || 22044051 markings, 144054242 edges, 102837 markings/sec, 185 secs
lola: sara is running 190 secs || 22521571 markings, 148170495 edges, 95504 markings/sec, 190 secs
lola: sara is running 195 secs || 22978749 markings, 152296710 edges, 91436 markings/sec, 195 secs
lola: sara is running 200 secs || 23433773 markings, 155945203 edges, 91005 markings/sec, 200 secs
lola: sara is running 205 secs || 23878887 markings, 159643491 edges, 89023 markings/sec, 205 secs
lola: sara is running 210 secs || 24307284 markings, 163560944 edges, 85679 markings/sec, 210 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown
lola: memory consumption: 875116 KB
lola: time consumption: 950 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: memory consumption: 875136 KB
lola: time consumption: 950 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: memory consumption: 875552 KB
lola: time consumption: 950 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: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown
lola: memory consumption: 881164 KB
lola: time consumption: 952 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 4 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= A18)))
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 ((3 <= A18)))
lola: processed formula length: 18
lola: 24 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: (3 <= A18)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 842102 markings, 3477018 edges, 168420 markings/sec, 0 secs
lola: sara is running 5 secs || 1649633 markings, 7035998 edges, 161506 markings/sec, 5 secs
lola: sara is running 10 secs || 2365245 markings, 10857146 edges, 143122 markings/sec, 10 secs
lola: sara is running 15 secs || 3122466 markings, 14470737 edges, 151444 markings/sec, 15 secs
lola: sara is running 20 secs || 3914164 markings, 18035705 edges, 158340 markings/sec, 20 secs
lola: sara is running 25 secs || 4683466 markings, 21782986 edges, 153860 markings/sec, 25 secs
lola: sara is running 30 secs || 5467871 markings, 25583803 edges, 156881 markings/sec, 30 secs
lola: sara is running 35 secs || 6215880 markings, 29391984 edges, 149602 markings/sec, 35 secs
lola: sara is running 40 secs || 6928236 markings, 33373249 edges, 142471 markings/sec, 40 secs
lola: sara is running 45 secs || 7743315 markings, 37156395 edges, 163016 markings/sec, 45 secs
lola: sara is running 50 secs || 8544100 markings, 40961297 edges, 160157 markings/sec, 50 secs
lola: sara is running 55 secs || 9273992 markings, 44990504 edges, 145978 markings/sec, 55 secs
lola: sara is running 60 secs || 9993076 markings, 49092466 edges, 143817 markings/sec, 60 secs
lola: sara is running 65 secs || 10733153 markings, 53145134 edges, 148015 markings/sec, 65 secs
lola: sara is running 70 secs || 11413292 markings, 57276934 edges, 136028 markings/sec, 70 secs
lola: sara is running 75 secs || 12226562 markings, 61234725 edges, 162654 markings/sec, 75 secs
lola: sara is running 80 secs || 12946527 markings, 65407800 edges, 143993 markings/sec, 80 secs
lola: sara is running 85 secs || 13613895 markings, 69629714 edges, 133474 markings/sec, 85 secs
lola: sara is running 90 secs || 14238614 markings, 73920998 edges, 124944 markings/sec, 90 secs
lola: sara is running 95 secs || 14941052 markings, 78124393 edges, 140488 markings/sec, 95 secs
lola: sara is running 100 secs || 15658280 markings, 82128081 edges, 143446 markings/sec, 100 secs
lola: sara is running 105 secs || 16346937 markings, 85807279 edges, 137731 markings/sec, 105 secs
lola: sara is running 110 secs || 17030763 markings, 89482888 edges, 136765 markings/sec, 110 secs
lola: sara is running 115 secs || 17665966 markings, 93441770 edges, 127041 markings/sec, 115 secs
lola: sara is running 120 secs || 18334287 markings, 97541595 edges, 133664 markings/sec, 120 secs
lola: sara is running 125 secs || 18985467 markings, 101689287 edges, 130236 markings/sec, 125 secs
lola: sara is running 130 secs || 19702889 markings, 105784640 edges, 143484 markings/sec, 130 secs
lola: sara is running 135 secs || 20341587 markings, 109952526 edges, 127740 markings/sec, 135 secs
lola: sara is running 140 secs || 20951964 markings, 114111252 edges, 122075 markings/sec, 140 secs
lola: sara is running 145 secs || 21536946 markings, 118312752 edges, 116996 markings/sec, 145 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 22052181 markings, 121767654 edges
lola: ========================================
lola: subprocess 5 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((B12 <= A4)))
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: (A4 + 1 <= B12)
lola: processed formula length: 15
lola: 26 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: (B12 <= A4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 15 markings, 15 edges
lola: subprocess 6 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((A5 <= A9) AND (A20 <= A1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((A5 <= A9) AND (A20 <= A1))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((A5 <= A9) AND (A20 <= A1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result started, id 0
lola: The predicate is possibly preserved from a reachable marking.
lola: 138 markings, 143 edges
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: ((A9 + 1 <= A5) OR (A1 + 1 <= A20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((A11 + 1 <= A2) AND (B12 + 1 <= A16)) OR (B5 <= A19))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((A11 + 1 <= A2) AND (B12 + 1 <= A16)) OR (B5 <= A19))))
lola: processed formula length: 64
lola: 24 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: (((A2 <= A11) OR (A16 <= B12)) AND (A19 + 1 <= B5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((3 <= A18) U (2 <= B5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((3 <= A18) U (2 <= B5)))
lola: processed formula length: 29
lola: 25 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: 16 markings, 32 edges
lola: ========================================
lola: subprocess 9 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((2 <= A1) AND (2 <= A7))))))
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(((2 <= A1) AND (2 <= A7))))
lola: processed formula length: 33
lola: 25 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: 16 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= A18) U (A20 <= A10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A((3 <= A18) U (A20 <= A10)))
lola: processed formula length: 32
lola: 25 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19 markings, 38 edges
lola: ========================================
lola: subprocess 11 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((A17 <= A9) OR (B15 <= A4) OR (A6 <= 1)) U A (G ((1 <= B12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((A17 <= A9) OR (B15 <= A4) OR (A6 <= 1)) U AG((1 <= B12)))
lola: processed formula length: 63
lola: 25 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: 1195552 markings, 8271453 edges, 239110 markings/sec, 0 secs
lola: 2139377 markings, 15896725 edges, 188765 markings/sec, 5 secs
lola: 3087743 markings, 23652145 edges, 189673 markings/sec, 10 secs
lola: 4057281 markings, 31524709 edges, 193908 markings/sec, 15 secs
lola: 4892153 markings, 39362154 edges, 166974 markings/sec, 20 secs
lola: 5626068 markings, 46743354 edges, 146783 markings/sec, 25 secs
lola: 6461170 markings, 54406453 edges, 167020 markings/sec, 30 secs
lola: 7242376 markings, 61942182 edges, 156241 markings/sec, 35 secs
lola: 7966660 markings, 69386220 edges, 144857 markings/sec, 40 secs
lola: 8646305 markings, 76684188 edges, 135929 markings/sec, 45 secs
lola: 9455396 markings, 84310286 edges, 161818 markings/sec, 50 secs
lola: 10199067 markings, 91618024 edges, 148734 markings/sec, 55 secs
lola: 10865217 markings, 98924481 edges, 133230 markings/sec, 60 secs
lola: 11519097 markings, 106305522 edges, 130776 markings/sec, 65 secs
lola: 12143235 markings, 113545925 edges, 124828 markings/sec, 70 secs
lola: 12900256 markings, 120945245 edges, 151404 markings/sec, 75 secs
lola: 13805466 markings, 128703478 edges, 181042 markings/sec, 80 secs
lola: 14731581 markings, 136603563 edges, 185223 markings/sec, 85 secs
lola: 15560283 markings, 144129704 edges, 165740 markings/sec, 90 secs
lola: 16320216 markings, 151721292 edges, 151987 markings/sec, 95 secs
lola: 17034178 markings, 159093704 edges, 142792 markings/sec, 100 secs
lola: 17783057 markings, 166671241 edges, 149776 markings/sec, 105 secs
lola: 18449832 markings, 173997283 edges, 133355 markings/sec, 110 secs
lola: 19141291 markings, 181425555 edges, 138292 markings/sec, 115 secs
lola: 19941742 markings, 189074377 edges, 160090 markings/sec, 120 secs
lola: 20755198 markings, 196804683 edges, 162691 markings/sec, 125 secs
lola: 21530355 markings, 204239380 edges, 155031 markings/sec, 130 secs
lola: 22175641 markings, 211296975 edges, 129057 markings/sec, 135 secs
lola: 22915729 markings, 218764835 edges, 148018 markings/sec, 140 secs
lola: 23706463 markings, 226447303 edges, 158147 markings/sec, 145 secs
lola: 24349194 markings, 233744676 edges, 128546 markings/sec, 150 secs
lola: 25045535 markings, 241031829 edges, 139268 markings/sec, 155 secs
lola: 25736885 markings, 248131638 edges, 138270 markings/sec, 160 secs
lola: 26301097 markings, 254836039 edges, 112842 markings/sec, 165 secs
lola: 26913786 markings, 261554688 edges, 122538 markings/sec, 170 secs
lola: 27504503 markings, 268195015 edges, 118143 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27933761 markings, 273082793 edges
lola: ========================================
lola: subprocess 12 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= B13))) OR (3 <= A3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= A3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= A3)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= B13)))
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 ((3 <= B13)))
lola: processed formula length: 18
lola: 24 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: (3 <= B13)
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
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((A6 <= 1) AND (A1 <= 1)))) AND A (F ((B15 <= A19))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((B15 <= A19)))
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: (A19 + 1 <= B15)
lola: processed formula length: 16
lola: 26 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: (B15 <= A19)
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 eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-13-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((A6 <= 1) AND (A1 <= 1))))
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: ((2 <= A6) OR (2 <= A1))
lola: processed formula length: 25
lola: 26 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: ((A6 <= 1) AND (A1 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 191 markings, 190 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((A17 <= 1))) OR (E (G ((A12 <= 0))) OR ((A11 + 1 <= A21) AND (1 <= A16))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=0)
sara: try reading problem file CTLCardinality-14-0.sara.
lola: ========================================
lola: ...considering subproblem: ((A11 + 1 <= A21) AND (1 <= A16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A11 + 1 <= A21) AND (1 <= A16))
lola: processed formula length: 33
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
sara: error: lola: :457 : error near ' TRANSITION ' : syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA0 markings, 0 edges

sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: subprocess 15 will run for 2258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((A12 <= 0)))
lola: processed formula length: 18
lola: 24 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: (1 <= A12)
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: 9 markings, 9 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((A1 <= A4))) AND ((((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9))) AND E (F (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A1 <= A4)))
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: (A4 + 1 <= A1)
lola: processed formula length: 14
lola: 26 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: (A1 <= A4)
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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 127 markings, 126 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))
lola: processed formula length: 81
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((A7 <= 2))) OR A (F ((A8 + 1 <= B4)))) AND E (X ((B15 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: lola: RUNNING
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((A7 <= 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:788
lola: processed formula: A (G ((A7 <= 2)))
lola: processed formula length: 17
lola: 25 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= A7)
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-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 603961 markings, 3598810 edges, 120792 markings/sec, 0 secs
lola: sara is running 5 secs || 1152209 markings, 7361013 edges, 109650 markings/sec, 5 secs
lola: sara is running 10 secs || 1695423 markings, 11506488 edges, 108643 markings/sec, 10 secs
lola: sara is running 15 secs || 2219705 markings, 15607443 edges, 104856 markings/sec, 15 secs
lola: sara is running 20 secs || 2751073 markings, 19476738 edges, 106274 markings/sec, 20 secs
lola: sara is running 25 secs || 3297881 markings, 22997001 edges, 109362 markings/sec, 25 secs
lola: sara is running 30 secs || 3804163 markings, 26762006 edges, 101256 markings/sec, 30 secs
lola: sara is running 35 secs || 4300437 markings, 30581676 edges, 99255 markings/sec, 35 secs
lola: sara is running 40 secs || 4752560 markings, 34364579 edges, 90425 markings/sec, 40 secs
lola: sara is running 45 secs || 5230568 markings, 38361249 edges, 95602 markings/sec, 45 secs
lola: sara is running 50 secs || 5683808 markings, 42501732 edges, 90648 markings/sec, 50 secs
lola: sara is running 55 secs || 6222215 markings, 46247955 edges, 107681 markings/sec, 55 secs
lola: sara is running 60 secs || 6715620 markings, 50470091 edges, 98681 markings/sec, 60 secs
lola: sara is running 65 secs || 7210168 markings, 54523876 edges, 98910 markings/sec, 65 secs
lola: sara is running 70 secs || 7708238 markings, 58657421 edges, 99614 markings/sec, 70 secs
lola: sara is running 75 secs || 8201023 markings, 62734194 edges, 98557 markings/sec, 75 secs
lola: sara is running 80 secs || 8687509 markings, 66850237 edges, 97297 markings/sec, 80 secs
lola: sara is running 85 secs || 9209899 markings, 70561972 edges, 104478 markings/sec, 85 secs
lola: sara is running 90 secs || 9701476 markings, 74432489 edges, 98315 markings/sec, 90 secs
lola: sara is running 95 secs || 10159538 markings, 78363653 edges, 91612 markings/sec, 95 secs
lola: sara is running 100 secs || 10596826 markings, 82442692 edges, 87458 markings/sec, 100 secs
lola: sara is running 105 secs || 11101001 markings, 86571607 edges, 100835 markings/sec, 105 secs
lola: sara is running 110 secs || 11587126 markings, 90817353 edges, 97225 markings/sec, 110 secs
lola: sara is running 115 secs || 12067690 markings, 95095965 edges, 96113 markings/sec, 115 secs
lola: sara is running 120 secs || 12562775 markings, 99168139 edges, 99017 markings/sec, 120 secs
lola: sara is running 125 secs || 13123654 markings, 102965491 edges, 112176 markings/sec, 125 secs
lola: sara is running 130 secs || 13664878 markings, 106687244 edges, 108245 markings/sec, 130 secs
lola: sara is running 135 secs || 14202034 markings, 110450364 edges, 107431 markings/sec, 135 secs
lola: sara is running 140 secs || 14725305 markings, 114276926 edges, 104654 markings/sec, 140 secs
lola: sara is running 145 secs || 15212492 markings, 118304362 edges, 97437 markings/sec, 145 secs
lola: sara is running 150 secs || 15734779 markings, 122064661 edges, 104457 markings/sec, 150 secs
lola: sara is running 155 secs || 16208864 markings, 126008206 edges, 94817 markings/sec, 155 secs
lola: sara is running 160 secs || 16652371 markings, 130137844 edges, 88701 markings/sec, 160 secs
lola: sara is running 165 secs || 17140523 markings, 134470192 edges, 97630 markings/sec, 165 secs
lola: sara is running 170 secs || 17617191 markings, 138706600 edges, 95334 markings/sec, 170 secs
lola: sara is running 175 secs || 18094205 markings, 142954435 edges, 95403 markings/sec, 175 secs
lola: sara is running 180 secs || 18555363 markings, 147190371 edges, 92232 markings/sec, 180 secs
lola: sara is running 185 secs || 19004499 markings, 151324143 edges, 89827 markings/sec, 185 secs
lola: sara is running 190 secs || 19528189 markings, 155111737 edges, 104738 markings/sec, 190 secs
lola: sara is running 195 secs || 20034489 markings, 158889602 edges, 101260 markings/sec, 195 secs
lola: sara is running 200 secs || 20490439 markings, 163110807 edges, 91190 markings/sec, 200 secs
lola: sara is running 205 secs || 20977878 markings, 167316525 edges, 97488 markings/sec, 205 secs
lola: sara is running 210 secs || 21439414 markings, 171445758 edges, 92307 markings/sec, 210 secs
lola: sara is running 215 secs || 21906926 markings, 175596258 edges, 93502 markings/sec, 215 secs
lola: sara is running 220 secs || 22345484 markings, 179645241 edges, 87712 markings/sec, 220 secs
lola: sara is running 225 secs || 22813406 markings, 183638368 edges, 93584 markings/sec, 225 secs
lola: sara is running 230 secs || 23280916 markings, 187776623 edges, 93502 markings/sec, 230 secs
lola: sara is running 235 secs || 23766328 markings, 191735892 edges, 97082 markings/sec, 235 secs
lola: sara is running 240 secs || 24214592 markings, 195853185 edges, 89653 markings/sec, 240 secs
lola: sara is running 245 secs || 24685551 markings, 199962218 edges, 94192 markings/sec, 245 secs
lola: sara is running 250 secs || 25133830 markings, 204082438 edges, 89656 markings/sec, 250 secs
lola: sara is running 255 secs || 25588871 markings, 208118970 edges, 91008 markings/sec, 255 secs
lola: sara is running 260 secs || 26058734 markings, 212186919 edges, 93973 markings/sec, 260 secs
lola: sara is running 265 secs || 26539778 markings, 216413643 edges, 96209 markings/sec, 265 secs
lola: sara is running 270 secs || 26969503 markings, 220575771 edges, 85945 markings/sec, 270 secs
lola: sara is running 275 secs || 27399525 markings, 224830517 edges, 86004 markings/sec, 275 secs
lola: sara is running 280 secs || 27812505 markings, 229195633 edges, 82596 markings/sec, 280 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 27950651 markings, 230723196 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X ((B15 <= A7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((B15 <= A7))
lola: processed formula length: 15
lola: 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (X (((2 <= A20) AND (A18 <= 1)))) AND E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))
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 (((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))))
lola: processed formula length: 70
lola: 24 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: ((3 <= A10) AND (A11 <= A15) AND ((A20 <= A10) OR (3 <= A7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 727414 markings, 3190571 edges, 145483 markings/sec, 0 secs
lola: sara is running 5 secs || 1453028 markings, 6497189 edges, 145123 markings/sec, 5 secs
lola: sara is running 10 secs || 2142058 markings, 9901576 edges, 137806 markings/sec, 10 secs
lola: sara is running 15 secs || 2818170 markings, 13385969 edges, 135222 markings/sec, 15 secs
lola: sara is running 20 secs || 3494218 markings, 16958802 edges, 135210 markings/sec, 20 secs
lola: sara is running 25 secs || 4161854 markings, 20599938 edges, 133527 markings/sec, 25 secs
lola: sara is running 30 secs || 4795349 markings, 24411869 edges, 126699 markings/sec, 30 secs
lola: sara is running 35 secs || 5402459 markings, 28183724 edges, 121422 markings/sec, 35 secs
lola: sara is running 40 secs || 6029180 markings, 31758473 edges, 125344 markings/sec, 40 secs
lola: sara is running 45 secs || 6643705 markings, 35470205 edges, 122905 markings/sec, 45 secs
lola: sara is running 50 secs || 7222977 markings, 39365146 edges, 115854 markings/sec, 50 secs
lola: sara is running 55 secs || 7826291 markings, 42735616 edges, 120663 markings/sec, 55 secs
lola: sara is running 60 secs || 8449743 markings, 46139526 edges, 124690 markings/sec, 60 secs
lola: sara is running 65 secs || 9033488 markings, 49741497 edges, 116749 markings/sec, 65 secs
lola: sara is running 70 secs || 9638245 markings, 53391519 edges, 120951 markings/sec, 70 secs
lola: sara is running 75 secs || 10254593 markings, 57177914 edges, 123270 markings/sec, 75 secs
lola: sara is running 80 secs || 10782051 markings, 61136454 edges, 105492 markings/sec, 80 secs
lola: sara is running 85 secs || 11378440 markings, 64928318 edges, 119278 markings/sec, 85 secs
lola: sara is running 90 secs || 11955322 markings, 68869307 edges, 115376 markings/sec, 90 secs
lola: sara is running 95 secs || 12516078 markings, 72838701 edges, 112151 markings/sec, 95 secs
lola: sara is running 100 secs || 13064964 markings, 76808814 edges, 109777 markings/sec, 100 secs
lola: sara is running 105 secs || 13659989 markings, 80894947 edges, 119005 markings/sec, 105 secs
lola: sara is running 110 secs || 14178842 markings, 85025157 edges, 103771 markings/sec, 110 secs
lola: sara is running 115 secs || 14674725 markings, 89288050 edges, 99177 markings/sec, 115 secs
lola: sara is running 120 secs || 15190370 markings, 93574830 edges, 103129 markings/sec, 120 secs
lola: sara is running 125 secs || 15720413 markings, 97245212 edges, 106009 markings/sec, 125 secs
lola: sara is running 130 secs || 16223901 markings, 100913730 edges, 100698 markings/sec, 130 secs
lola: sara is running 135 secs || 16728211 markings, 104707535 edges, 100862 markings/sec, 135 secs
lola: sara is running 140 secs || 17223289 markings, 108529686 edges, 99016 markings/sec, 140 secs
lola: sara is running 145 secs || 17742069 markings, 112494905 edges, 103756 markings/sec, 145 secs
lola: sara is running 150 secs || 18197494 markings, 116525775 edges, 91085 markings/sec, 150 secs
lola: sara is running 155 secs || 18646544 markings, 120511184 edges, 89810 markings/sec, 155 secs
lola: sara is running 160 secs || 19200050 markings, 124453363 edges, 110701 markings/sec, 160 secs
lola: sara is running 165 secs || 19870136 markings, 128266717 edges, 134017 markings/sec, 165 secs
lola: sara is running 170 secs || 20499897 markings, 132257327 edges, 125952 markings/sec, 170 secs
lola: sara is running 175 secs || 21056711 markings, 136282010 edges, 111363 markings/sec, 175 secs
lola: sara is running 180 secs || 21570096 markings, 140480583 edges, 102677 markings/sec, 180 secs
lola: sara is running 185 secs || 22102961 markings, 144500625 edges, 106573 markings/sec, 185 secs
lola: sara is running 190 secs || 22585536 markings, 148744616 edges, 96515 markings/sec, 190 secs
lola: sara is running 195 secs || 23054537 markings, 152851301 edges, 93800 markings/sec, 195 secs
lola: sara is running 200 secs || 23525012 markings, 156731945 edges, 94095 markings/sec, 200 secs
lola: sara is running 205 secs || 23973722 markings, 160511003 edges, 89742 markings/sec, 205 secs
lola: sara is running 210 secs || 24429055 markings, 164605963 edges, 91067 markings/sec, 210 secs
lola: sara is running 215 secs || 24886174 markings, 168675209 edges, 91424 markings/sec, 215 secs
lola: sara is running 220 secs || 25319483 markings, 172777073 edges, 86662 markings/sec, 220 secs
lola: sara is running 225 secs || 25786022 markings, 177096768 edges, 93308 markings/sec, 225 secs
lola: sara is running 230 secs || 26187400 markings, 181443663 edges, 80276 markings/sec, 230 secs
lola: sara is running 235 secs || 26622585 markings, 185546444 edges, 87037 markings/sec, 235 secs
lola: sara is running 240 secs || 27035533 markings, 189591790 edges, 82590 markings/sec, 240 secs
lola: sara is running 245 secs || 27455846 markings, 193743073 edges, 84063 markings/sec, 245 secs
lola: sara is running 250 secs || 27824736 markings, 197909696 edges, 73778 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 27930649 markings, 199057127 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((A1 <= A4))) AND ((((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9))) AND E (F (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((A1 <= A4)))
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: (A4 + 1 <= A1)
lola: processed formula length: 14
lola: 26 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: (A1 <= A4)
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 eventually occurs.
lola: 127 markings, 126 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 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 (((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))))
lola: processed formula length: 52
lola: 24 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((A21 <= A9) OR (B14 <= B5) OR (B14 <= 2))
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= A5) AND (2 <= B5) AND (A17 + 1 <= B13)) OR ((B15 <= 2) AND (B12 <= A9)))
lola: processed formula length: 81
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no yes yes yes no no yes no yes
lola:
preliminary result: no no no no no yes yes no yes yes yes no no yes no yes
lola: ========================================
lola: memory consumption: 34668 KB
lola: time consumption: 1855 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552476238765

--------------------
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="DNAwalker-PT-10ringRL"
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 DNAwalker-PT-10ringRL, 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 r049-oct2-155234405500679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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