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.r170-oct2-155297750500319.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 TokenRing-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750500319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 68K Feb 12 19:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 237K Feb 12 19:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K Feb 9 02:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 9 02:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:06 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:06 GlobalProperties.xml
-rw-r--r-- 1 mcc users 15K Feb 5 01:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 5 01:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 172K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 483K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Feb 4 21:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Feb 4 21:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 342K Feb 1 21:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 964K Feb 1 21:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 802K 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 TokenRing-PT-010-CTLCardinality-00
FORMULA_NAME TokenRing-PT-010-CTLCardinality-01
FORMULA_NAME TokenRing-PT-010-CTLCardinality-02
FORMULA_NAME TokenRing-PT-010-CTLCardinality-03
FORMULA_NAME TokenRing-PT-010-CTLCardinality-04
FORMULA_NAME TokenRing-PT-010-CTLCardinality-05
FORMULA_NAME TokenRing-PT-010-CTLCardinality-06
FORMULA_NAME TokenRing-PT-010-CTLCardinality-07
FORMULA_NAME TokenRing-PT-010-CTLCardinality-08
FORMULA_NAME TokenRing-PT-010-CTLCardinality-09
FORMULA_NAME TokenRing-PT-010-CTLCardinality-10
FORMULA_NAME TokenRing-PT-010-CTLCardinality-11
FORMULA_NAME TokenRing-PT-010-CTLCardinality-12
FORMULA_NAME TokenRing-PT-010-CTLCardinality-13
FORMULA_NAME TokenRing-PT-010-CTLCardinality-14
FORMULA_NAME TokenRing-PT-010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553117547167

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ TokenRing-PT-010 @ 3570 seconds

FORMULA TokenRing-PT-010-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3534
rslt: Output for CTLCardinality @ TokenRing-PT-010

{
"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 20 21:32:27 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": "(State_8_6 + 1 <= State_10_10)",
"processed_size": 30,
"rewrites": 80
},
"result":
{
"edges": 50262,
"markings": 11790,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((State_1_6 + 1 <= State_0_3) AND (State_5_10 + 1 <= State_5_7)))",
"processed_size": 66,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(State_5_0 + 1 <= State_10_8)",
"processed_size": 29,
"rewrites": 81
},
"result":
{
"edges": 137616,
"markings": 37254,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG((((State_3_10 + 1 <= State_2_1) AND (State_7_5 + 1 <= State_3_10)) OR EG((State_1_5 <= State_4_4))))",
"processed_size": 103,
"rewrites": 79
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 293980,
"markings": 58835,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"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": "(State_2_7 <= State_10_7)",
"processed_size": 25,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(State_5_7 + 1 <= State_8_2)",
"processed_size": 28,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((State_4_5 <= State_1_10))",
"processed_size": 27,
"rewrites": 80
},
"result":
{
"edges": 291033,
"markings": 58834,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"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": "(State_2_7 <= State_10_7)",
"processed_size": 25,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(State_5_7 + 1 <= State_8_2)",
"processed_size": 28,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((State_3_8 + 1 <= State_9_10)))",
"processed_size": 37,
"rewrites": 78
},
"result":
{
"edges": 145,
"markings": 146,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 40128,
"runtime": 12.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : FALSE : FALSE : FALSE : NODEADLOCK : TRUE : TRUE : NODEADLOCK : A(X(A(F(**)))) : E(G((** OR E(G(**))))) : TRUE : FALSE : (E(G(**)) OR A(F(**))) : (E(X(**)) OR (** OR E(F(A(G(**)))))) : A(F(*)) : (** OR (* AND E(F(*))))"
},
"net":
{
"arcs": 4444,
"conflict_clusters": 1,
"places": 121,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 1111
},
"result":
{
"preliminary_value": "yes no no no yes yes yes yes yes no yes no yes no yes yes ",
"value": "yes no no no yes yes yes yes yes no yes no yes no yes 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: 1232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3872
lola: finding significant places
lola: 121 places, 1111 transitions, 110 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: place invariant simplifies atomic proposition
lola: before: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_0_9 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_5_10 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_3_9 + State_10_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_4_9 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_10_8 + State_10_7 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_7_0 + State_7_1 + State_7_2 + State_7_3 + State_7_4 + State_7_5 + State_7_6 + State_7_7 + State_7_8 + State_7_9 + State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_10_6 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_5 + State_10_4 + State_10_3 + State_10_2 + State_10_1 + State_10_0 + State_6_10 + State_7_10 + State_8_10 + State_9_10 + State_0_10 + State_1_10 + State_2_10 + State_3_10 + State_4_10 + State_5_9 + State_10_9)
lola: after: (0 <= 8)
lola: LP says that atomic proposition is always false: (2 <= State_1_3)
lola: LP says that atomic proposition is always false: (2 <= State_10_0)
lola: LP says that atomic proposition is always false: (2 <= State_3_10)
lola: LP says that atomic proposition is always false: (3 <= State_4_8)
lola: LP says that atomic proposition is always false: (3 <= State_5_6)
lola: LP says that atomic proposition is always false: (2 <= State_9_5)
lola: LP says that atomic proposition is always false: (2 <= State_8_0)
lola: LP says that atomic proposition is always false: (2 <= State_8_3)
lola: LP says that atomic proposition is always false: (2 <= State_2_9)
lola: (E (G (())) OR ((A (G ((0 <= 9))) AND ()) AND ())) : A ((E (X ((0 <= 10))) U ())) : NOT(A (G (()))) : NOT((E (G ((0 <= 0))) OR E (G ((1 <= 0))))) : E (X (A (G ((0 <= 8))))) : (E (G (A (G ((0 <= 0))))) AND NOT(E (F ((1 <= 0))))) : E (G ((0 <= 0))) : E (X ((A (G ((0 <= 8))) AND ()))) : A (X ((() AND A (F ((State_10_10 <= State_8_6)))))) : E (G ((((State_3_10 + 1 <= State_2_1) AND (State_7_5 + 1 <= State_3_10)) OR E (G ((State_1_5 <= State_4_4)))))) : (A ((() U ())) OR E (G (()))) : E (G (A (((State_3_8 <= State_5_3) U (2 <= State_9_5))))) : (E (G (((State_6_9 <= State_6_2) OR (State_1_1 <= 0)))) OR A (F (((State_1_10 + 1 <= State_4_5))))) : ((E (X (((1 <= State_4_6)))) OR (((State_1_6 + 1 <= State_0_3) AND (State_5_10 + 1 <= State_5_7)))) OR E (F (A (G ((State_10_8 <= State_5_0)))))) : A (F (NOT(E (G ((State_7_2 <= State_8_3)))))) : ((State_5_7 + 1 <= State_8_2) OR NOT(((State_10_7 + 1 <= State_2_7) OR A (G ((State_9_10 <= State_3_8))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:208
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:392
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((State_10_10 <= State_8_6)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (State_8_6 + 1 <= State_10_10)
lola: processed formula length: 30
lola: 80 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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: (State_10_10 <= State_8_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 11790 markings, 50262 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= State_4_6)))) OR ((((State_1_6 + 1 <= State_0_3) AND (State_5_10 + 1 <= State_5_7))) OR E (F (A (G ((State_10_8 <= State_5_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((State_1_6 + 1 <= State_0_3) AND (State_5_10 + 1 <= State_5_7)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((State_1_6 + 1 <= State_0_3) AND (State_5_10 + 1 <= State_5_7)))
lola: processed formula length: 66
lola: 77 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.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((State_10_8 <= State_5_0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (State_5_0 + 1 <= State_10_8)
lola: processed formula length: 29
lola: 81 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (State_5_0 + 1 <= State_10_8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (State_10_8 <= State_5_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
sara: try reading problem file CTLCardinality-12-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 37254 markings, 137616 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= State_4_6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= State_4_6)))
lola: processed formula length: 22
lola: 78 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((State_8_3 + 1 <= State_7_2)))
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: (State_7_2 <= State_8_3)
lola: processed formula length: 24
lola: 80 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: (State_8_3 + 1 <= State_7_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 55148 markings, 271551 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((State_3_10 + 1 <= State_2_1) AND (State_7_5 + 1 <= State_3_10)) OR E (G ((State_1_5 <= State_4_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((State_3_10 + 1 <= State_2_1) AND (State_7_5 + 1 <= State_3_10)) OR EG((State_1_5 <= State_4_4))))
lola: processed formula length: 103
lola: 79 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: 58835 markings, 293980 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((State_5_7 + 1 <= State_8_2) OR ((State_2_7 <= State_10_7) AND E (F ((State_3_8 + 1 <= State_9_10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (State_2_7 <= State_10_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_2_7 <= State_10_7)
lola: processed formula length: 25
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (State_5_7 + 1 <= State_8_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_5_7 + 1 <= State_8_2)
lola: processed formula length: 28
lola: 77 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((State_6_9 <= State_6_2) OR (State_1_1 <= 0)))) OR A (F (((State_1_10 + 1 <= State_4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((State_1_10 + 1 <= State_4_5))))
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: ((State_4_5 <= State_1_10))
lola: processed formula length: 27
lola: 80 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: ((State_1_10 + 1 <= State_4_5))
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: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 58834 markings, 291033 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((State_5_7 + 1 <= State_8_2) OR ((State_2_7 <= State_10_7) AND E (F ((State_3_8 + 1 <= State_9_10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (State_2_7 <= State_10_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_2_7 <= State_10_7)
lola: processed formula length: 25
lola: 77 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (State_5_7 + 1 <= State_8_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (State_5_7 + 1 <= State_8_2)
lola: processed formula length: 28
lola: 77 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: ========================================
lola: ...considering subproblem: E (F ((State_3_8 + 1 <= State_9_10)))
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 ((State_3_8 + 1 <= State_9_10)))
lola: processed formula length: 37
lola: 78 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: (State_3_8 + 1 <= State_9_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 146 markings, 145 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes yes yes no yes no yes no yes yes
lola:
preliminary result: yes no no no yes yes yes yes yes no yes no yes no yes yes
lola: memory consumption: 40128 KB
lola: time consumption: 12 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1553117583303

--------------------
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="TokenRing-PT-010"
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 TokenRing-PT-010, 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 r170-oct2-155297750500319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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