Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550300958.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 JoinFreeModules-PT-0200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550300958
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.1K Feb 11 06:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 11 06:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 05:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 05:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 12:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 12:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 07:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 07:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 JoinFreeModules-PT-0200-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552686642946

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0200 @ 3570 seconds

FORMULA JoinFreeModules-PT-0200-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2185
rslt: Output for CTLCardinality @ JoinFreeModules-PT-0200

{
"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": "Fri Mar 15 21:50:43 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 204
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX(((p185 <= p878) OR (p153 <= p323)))",
"processed_size": 39,
"rewrites": 18
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EX((p373 <= p94)))",
"processed_size": 21,
"rewrites": 19
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p208 <= 1) OR (p925 + 1 <= p937) OR (p6 <= 2))",
"processed_size": 50,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p206 + 1 <= p260)))",
"processed_size": 26,
"rewrites": 18
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"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": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((p595 <= 1))",
"processed_size": 15,
"rewrites": 18
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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(AX((p470 + 1 <= p965)))",
"processed_size": 26,
"rewrites": 19
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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": "EX(A((1 <= p436) U (p226 <= p744)))",
"processed_size": 35,
"rewrites": 19
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 241194,
"markings": 240794,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EG((EX((2 <= p296)) OR ((2 <= p492) AND (p751 <= p185) AND ((p393 <= p158) OR (1 <= p524)))))",
"processed_size": 94,
"rewrites": 19
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 327
},
"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": "((p127 <= 1) OR (p504 <= 2))",
"processed_size": 29,
"rewrites": 21
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 471
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p3 <= 0) AND ((p275 <= 2) OR (p613 <= 0) OR (p731 <= p290)))",
"processed_size": 64,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 565
},
"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": "(p887 <= p383)",
"processed_size": 14,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((((p749 <= p75) OR (p80 <= p721)) U ((2 <= p773) AND (p108 <= p945))))",
"processed_size": 74,
"rewrites": 22
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 942
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p89 <= p478)))",
"processed_size": 21,
"rewrites": 19
},
"result":
{
"edges": 201,
"markings": 202,
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1357
},
"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": "(p841 <= p471)",
"processed_size": 14,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2714
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p208) OR (1 <= p181) OR (p61 + 1 <= p254))))",
"processed_size": 59,
"rewrites": 19
},
"result":
{
"edges": 201,
"markings": 202,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2714
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p798 + 1 <= p240) OR (p881 + 1 <= p80))",
"processed_size": 42,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p88 <= p47) OR (p485 <= p172))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 2,
"markings": 3,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p398 + 1 <= p265) OR (p891 <= 0))))",
"processed_size": 44,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))",
"processed_size": 97,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 21,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p88 <= p47) OR (p485 <= p172))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 96472,
"runtime": 1384.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) OR ((** AND E(G(**))) OR **)) : A(G(A(F(**)))) : A((* R *)) : (A(F(E(X(**)))) AND A(X(**))) : E((A(F(**)) U **)) : (A(X(*)) AND (* AND E(F(*)))) : (** OR E(F(**))) : (E(G(**)) OR A(G(**))) : (** AND A((** U **))) : E(X(A(X(**)))) : ((** OR E(G(**))) AND A(G(**))) : E(X(A((** U **)))) : E((A(F(**)) U A(G(**)))) : E(G((E(X(**)) OR **))) : (E((** U **)) OR E(G(**))) : E(F(**))"
},
"net":
{
"arcs": 4602,
"conflict_clusters": 801,
"places": 1001,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1601
},
"result":
{
"preliminary_value": "no no unknown no unknown yes yes no no no no no unknown yes unknown yes ",
"value": "no no unknown no unknown yes yes no no no no no unknown yes unknown 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: 2602/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32032
lola: finding significant places
lola: 1001 places, 1601 transitions, 800 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: (p <= p215)
lola: after: (1 <= p215)
lola: ((A (G (((p88 <= p47) OR (p485 <= p172)))) OR (((p798 + 1 <= p240) OR (p881 + 1 <= p80)) AND E (G ((p666 <= p696))))) OR (((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))) : A (G (A (F (((2 <= p127) AND (3 <= p504)))))) : NOT(E (((p702 <= 2) U ((p829 <= p88) AND (2 <= p875))))) : (A (F (E (X ((p373 <= p94))))) AND A (X (((p185 <= p878) OR (p153 <= p323))))) : E ((A (F ((1 <= p323))) U ((3 <= p37) AND (2 <= p114) AND (2 <= p196)))) : (NOT((E (X ((2 <= p595))) OR ((2 <= p208) AND (p937 <= p925) AND (3 <= p6)))) AND NOT(A (G ((p260 <= p206))))) : (((p3 <= 0) AND ((p275 <= 2) OR (p613 <= 0) OR (p731 <= p290))) OR E (F ((p723 + 1 <= p726)))) : (E (G (E (G ((3 <= p679))))) OR A (G (E (G ((p89 <= p478)))))) : ((p887 <= p383) AND A ((((p749 <= p75) OR (p80 <= p721)) U ((2 <= p773) AND (p108 <= p945))))) : E (X (A (X ((p470 + 1 <= p965))))) : (((p841 <= p471) OR E (G ((p402 + 1 <= p59)))) AND A (G (((3 <= p208) OR (1 <= p181) OR (p61 + 1 <= p254))))) : E (X (A (((1 <= p436) U (p226 <= p744))))) : E ((A (F ((1 <= p215))) U A (G ((2 <= p921))))) : E (G ((E (X ((2 <= p296))) OR ((2 <= p492) AND (p751 <= p185) AND ((p393 <= p158) OR (1 <= p524)))))) : (E (((p424 <= p375) U (p338 + 1 <= p209))) OR E (G (((p398 + 1 <= p265) OR (p891 <= 0))))) : E (F (E (((p787 <= p650) U (2 <= p640)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X ((p373 <= p94))))) AND A (X (((p185 <= p878) OR (p153 <= p323)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p185 <= p878) OR (p153 <= p323))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p185 <= p878) OR (p153 <= p323)))
lola: processed formula length: 39
lola: 18 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: subprocess 1 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p373 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX((p373 <= p94)))
lola: processed formula length: 21
lola: 19 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: 602 markings, 602 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p595 <= 1))) AND (((p208 <= 1) OR (p925 + 1 <= p937) OR (p6 <= 2)) AND E (F ((p206 + 1 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p208 <= 1) OR (p925 + 1 <= p937) OR (p6 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p208 <= 1) OR (p925 + 1 <= p937) OR (p6 <= 2))
lola: processed formula length: 50
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p206 + 1 <= p260)))
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 ((p206 + 1 <= p260)))
lola: processed formula length: 26
lola: 18 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: (p206 + 1 <= p260)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p595 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p595 <= 1))
lola: processed formula length: 15
lola: 18 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: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((p470 + 1 <= p965)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX((p470 + 1 <= p965)))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((1 <= p436) U (p226 <= p744)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((1 <= p436) U (p226 <= p744)))
lola: processed formula length: 35
lola: 19 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: 240794 markings, 241194 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((2 <= p296))) OR ((2 <= p492) AND (p751 <= p185) AND ((p393 <= p158) OR (1 <= p524))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX((2 <= p296)) OR ((2 <= p492) AND (p751 <= p185) AND ((p393 <= p158) OR (1 <= p524)))))
lola: processed formula length: 94
lola: 19 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p640)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p640)))
lola: processed formula length: 19
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p640)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= p127) AND (3 <= p504))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p127 <= 1) OR (p504 <= 2))
lola: processed formula length: 29
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p127) AND (3 <= p504))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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: ((p127 <= 1) OR (p504 <= 2))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= p323))) U ((3 <= p37) AND (2 <= p114) AND (2 <= p196))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= p323)) U ((3 <= p37) AND (2 <= p114) AND (2 <= p196)))
lola: processed formula length: 65
lola: 19 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: 215277 markings, 522308 edges, 43055 markings/sec, 0 secs
lola: 438828 markings, 1064684 edges, 44710 markings/sec, 5 secs
lola: 666632 markings, 1617374 edges, 45561 markings/sec, 10 secs
lola: 895947 markings, 2173643 edges, 45863 markings/sec, 15 secs
lola: 1125334 markings, 2730063 edges, 45877 markings/sec, 20 secs
lola: 1354237 markings, 3285511 edges, 45781 markings/sec, 25 secs
lola: 1581471 markings, 3836983 edges, 45447 markings/sec, 30 secs
lola: 1816658 markings, 4407449 edges, 47037 markings/sec, 35 secs
lola: 2056567 markings, 4989625 edges, 47982 markings/sec, 40 secs
lola: 2294414 markings, 5566608 edges, 47569 markings/sec, 45 secs
lola: 2531074 markings, 6141036 edges, 47332 markings/sec, 50 secs
lola: 2769298 markings, 6718875 edges, 47645 markings/sec, 55 secs
lola: 3006871 markings, 7295350 edges, 47515 markings/sec, 60 secs
lola: 3244698 markings, 7872459 edges, 47565 markings/sec, 65 secs
lola: 3482463 markings, 8449231 edges, 47553 markings/sec, 70 secs
lola: 3720098 markings, 9025877 edges, 47527 markings/sec, 75 secs
lola: 3960115 markings, 9608223 edges, 48003 markings/sec, 80 secs
lola: 4199631 markings, 10189569 edges, 47903 markings/sec, 85 secs
lola: 4438914 markings, 10769943 edges, 47857 markings/sec, 90 secs
lola: 4676741 markings, 11347136 edges, 47565 markings/sec, 95 secs
lola: 4916421 markings, 11928639 edges, 47936 markings/sec, 100 secs
lola: 5156555 markings, 12511250 edges, 48027 markings/sec, 105 secs
lola: 5394649 markings, 13089118 edges, 47619 markings/sec, 110 secs
lola: 5633719 markings, 13669169 edges, 47814 markings/sec, 115 secs
lola: 5863414 markings, 14226320 edges, 45939 markings/sec, 120 secs
lola: 6085567 markings, 14765323 edges, 44431 markings/sec, 125 secs
lola: 6300504 markings, 15286896 edges, 42987 markings/sec, 130 secs
lola: 6515177 markings, 15807876 edges, 42935 markings/sec, 135 secs
lola: 6745610 markings, 16367018 edges, 46087 markings/sec, 140 secs
lola: 6992924 markings, 16967141 edges, 49463 markings/sec, 145 secs
lola: 7236255 markings, 17557397 edges, 48666 markings/sec, 150 secs
lola: 7481979 markings, 18153612 edges, 49145 markings/sec, 155 secs
lola: 7726707 markings, 18747498 edges, 48946 markings/sec, 160 secs
lola: 7965390 markings, 19326583 edges, 47737 markings/sec, 165 secs
lola: 8029464 markings, 19482207 edges, 12815 markings/sec, 170 secs
lola: 8029552 markings, 19482382 edges, 18 markings/sec, 175 secs
lola: 8031437 markings, 19486763 edges, 377 markings/sec, 180 secs
lola: 8031536 markings, 19487033 edges, 20 markings/sec, 185 secs
lola: 8031628 markings, 19487286 edges, 18 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= p215))) U A (G ((2 <= p921)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= p215)) U AG((2 <= p921)))
lola: processed formula length: 36
lola: 20 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 352453 markings, 502452 edges, 70491 markings/sec, 0 secs
lola: 703415 markings, 1003093 edges, 70192 markings/sec, 5 secs
lola: 1061260 markings, 1513597 edges, 71569 markings/sec, 10 secs
lola: 1422677 markings, 2029007 edges, 72283 markings/sec, 15 secs
lola: 1780218 markings, 2539003 edges, 71508 markings/sec, 20 secs
lola: 2136293 markings, 3046865 edges, 71215 markings/sec, 25 secs
lola: 2486986 markings, 3547040 edges, 70139 markings/sec, 30 secs
lola: 2818645 markings, 4019887 edges, 66332 markings/sec, 35 secs
lola: 3151106 markings, 4494145 edges, 66492 markings/sec, 40 secs
lola: 3480459 markings, 4964094 edges, 65871 markings/sec, 45 secs
lola: 3809093 markings, 5432933 edges, 65727 markings/sec, 50 secs
lola: 4148835 markings, 5917368 edges, 67948 markings/sec, 55 secs
lola: 4510249 markings, 6432970 edges, 72283 markings/sec, 60 secs
lola: 4872116 markings, 6949089 edges, 72373 markings/sec, 65 secs
lola: 5232981 markings, 7463808 edges, 72173 markings/sec, 70 secs
lola: 5600369 markings, 7987936 edges, 73478 markings/sec, 75 secs
lola: 5960697 markings, 8501821 edges, 72066 markings/sec, 80 secs
lola: 6315520 markings, 9007892 edges, 70965 markings/sec, 85 secs
lola: 6649087 markings, 9483755 edges, 66713 markings/sec, 90 secs
lola: 6969927 markings, 9941249 edges, 64168 markings/sec, 95 secs
lola: 7294831 markings, 10404746 edges, 64981 markings/sec, 100 secs
lola: 7640863 markings, 10898245 edges, 69206 markings/sec, 105 secs
lola: 7982364 markings, 11385539 edges, 68300 markings/sec, 110 secs
lola: 8030321 markings, 11453819 edges, 9591 markings/sec, 115 secs
lola: 8030504 markings, 11454140 edges, 37 markings/sec, 120 secs
lola: 8032144 markings, 11456564 edges, 328 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p702) R ((p88 + 1 <= p829) OR (p875 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((3 <= p702) R ((p88 + 1 <= p829) OR (p875 <= 1))))
lola: processed formula length: 55
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((p829 <= p88) AND (2 <= p875))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 341396 markings, 486687 edges, 68279 markings/sec, 0 secs
lola: sara is running 5 secs || 688178 markings, 981346 edges, 69356 markings/sec, 5 secs
lola: sara is running 10 secs || 1034303 markings, 1474911 edges, 69225 markings/sec, 10 secs
lola: sara is running 15 secs || 1379579 markings, 1967443 edges, 69055 markings/sec, 15 secs
lola: sara is running 20 secs || 1722436 markings, 2456551 edges, 68571 markings/sec, 20 secs
lola: sara is running 25 secs || 2084918 markings, 2973492 edges, 72496 markings/sec, 25 secs
lola: sara is running 30 secs || 2436160 markings, 3474443 edges, 70248 markings/sec, 30 secs
lola: sara is running 35 secs || 2785306 markings, 3972434 edges, 69829 markings/sec, 35 secs
lola: sara is running 40 secs || 3151187 markings, 4494224 edges, 73176 markings/sec, 40 secs
lola: sara is running 45 secs || 3532702 markings, 5038558 edges, 76303 markings/sec, 45 secs
lola: sara is running 50 secs || 3914650 markings, 5583285 edges, 76390 markings/sec, 50 secs
lola: sara is running 55 secs || 4295634 markings, 6126703 edges, 76197 markings/sec, 55 secs
lola: sara is running 60 secs || 4676199 markings, 6669560 edges, 76113 markings/sec, 60 secs
lola: sara is running 65 secs || 5049825 markings, 7202672 edges, 74725 markings/sec, 65 secs
lola: sara is running 70 secs || 5426367 markings, 7739698 edges, 75308 markings/sec, 70 secs
lola: sara is running 75 secs || 5804372 markings, 8278802 edges, 75601 markings/sec, 75 secs
lola: sara is running 80 secs || 6181617 markings, 8816902 edges, 75449 markings/sec, 80 secs
lola: sara is running 85 secs || 6557586 markings, 9353074 edges, 75194 markings/sec, 85 secs
lola: sara is running 90 secs || 6935169 markings, 9891783 edges, 75517 markings/sec, 90 secs
lola: sara is running 95 secs || 7310879 markings, 10427543 edges, 75142 markings/sec, 95 secs
lola: sara is running 100 secs || 7686172 markings, 10962950 edges, 75059 markings/sec, 100 secs
lola: sara is running 105 secs || 8067050 markings, 11506210 edges, 76176 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0) AND ((p275 <= 2) OR (p613 <= 0) OR (p731 <= p290))) OR E (F ((p723 + 1 <= p726))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3 <= 0) AND ((p275 <= 2) OR (p613 <= 0) OR (p731 <= p290)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 <= 0) AND ((p275 <= 2) OR (p613 <= 0) OR (p731 <= p290)))
lola: processed formula length: 64
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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 11 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p723 + 1 <= p726)))
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 ((p723 + 1 <= p726)))
lola: processed formula length: 26
lola: 18 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: (p723 + 1 <= p726)
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: 200 markings, 199 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p887 <= p383) AND A ((((p749 <= p75) OR (p80 <= p721)) U ((2 <= p773) AND (p108 <= p945)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p887 <= p383)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p887 <= p383)
lola: processed formula length: 14
lola: 17 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 12 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p749 <= p75) OR (p80 <= p721)) U ((2 <= p773) AND (p108 <= p945))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p749 <= p75) OR (p80 <= p721)) U ((2 <= p773) AND (p108 <= p945))))
lola: processed formula length: 74
lola: 22 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p749 <= p75) OR (p80 <= p721))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((3 <= p679))) OR A (G ((p89 <= p478))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p679)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((3 <= p679)))
lola: processed formula length: 19
lola: 18 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: (p679 <= 2)
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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p89 <= p478)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p89 <= p478)))
lola: processed formula length: 21
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p478 + 1 <= p89)
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 not invariant.
lola: 202 markings, 201 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p424 <= p375) U (p338 + 1 <= p209))) OR E (G (((p398 + 1 <= p265) OR (p891 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p398 + 1 <= p265) OR (p891 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p398 + 1 <= p265) OR (p891 <= 0))))
lola: processed formula length: 44
lola: 18 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: ((p265 <= p398) AND (1 <= p891))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p424 <= p375) U (p338 + 1 <= p209)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p424 <= p375) U (p338 + 1 <= p209)))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p338 + 1 <= p209)
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 345838 markings, 493064 edges, 69168 markings/sec, 0 secs
lola: sara is running 5 secs || 713457 markings, 1017538 edges, 73524 markings/sec, 5 secs
lola: sara is running 10 secs || 1072320 markings, 1529361 edges, 71773 markings/sec, 10 secs
lola: sara is running 15 secs || 1414073 markings, 2016628 edges, 68351 markings/sec, 15 secs
lola: sara is running 20 secs || 1754401 markings, 2502047 edges, 68066 markings/sec, 20 secs
lola: sara is running 25 secs || 2103750 markings, 3000241 edges, 69870 markings/sec, 25 secs
lola: sara is running 30 secs || 2476869 markings, 3532535 edges, 74624 markings/sec, 30 secs
lola: sara is running 35 secs || 2864652 markings, 4085611 edges, 77557 markings/sec, 35 secs
lola: sara is running 40 secs || 3239776 markings, 4620589 edges, 75025 markings/sec, 40 secs
lola: sara is running 45 secs || 3619212 markings, 5161839 edges, 75887 markings/sec, 45 secs
lola: sara is running 50 secs || 4000868 markings, 5706459 edges, 76331 markings/sec, 50 secs
lola: sara is running 55 secs || 4380077 markings, 6247232 edges, 75842 markings/sec, 55 secs
lola: sara is running 60 secs || 4759261 markings, 6788022 edges, 75837 markings/sec, 60 secs
lola: sara is running 65 secs || 5141210 markings, 7332879 edges, 76390 markings/sec, 65 secs
lola: sara is running 70 secs || 5517190 markings, 7869169 edges, 75196 markings/sec, 70 secs
lola: sara is running 75 secs || 5898839 markings, 8413496 edges, 76330 markings/sec, 75 secs
lola: sara is running 80 secs || 6285661 markings, 8965155 edges, 77364 markings/sec, 80 secs
lola: sara is running 85 secs || 6658165 markings, 9496534 edges, 74501 markings/sec, 85 secs
lola: sara is running 90 secs || 7030992 markings, 10028330 edges, 74565 markings/sec, 90 secs
lola: sara is running 95 secs || 7399003 markings, 10553338 edges, 73602 markings/sec, 95 secs
lola: sara is running 100 secs || 7776854 markings, 11092476 edges, 75570 markings/sec, 100 secs
lola: sara is running 105 secs || 8166954 markings, 11648705 edges, 78020 markings/sec, 105 secs
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 14 will run for 1357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p841 <= p471) OR E (G ((p402 + 1 <= p59)))) AND A (G (((3 <= p208) OR (1 <= p181) OR (p61 + 1 <= p254)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p841 <= p471)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p841 <= p471)
lola: processed formula length: 14
lola: 17 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 2714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p208) OR (1 <= p181) OR (p61 + 1 <= p254))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((3 <= p208) OR (1 <= p181) OR (p61 + 1 <= p254))))
lola: processed formula length: 59
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p208 <= 2) AND (p181 <= 0) AND (p254 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 202 markings, 201 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p88 <= p47) OR (p485 <= p172)))) OR ((((p798 + 1 <= p240) OR (p881 + 1 <= p80)) AND E (G ((p666 <= p696)))) OR (((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p798 + 1 <= p240) OR (p881 + 1 <= p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p798 + 1 <= p240) OR (p881 + 1 <= p80))
lola: processed formula length: 42
lola: 17 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: 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: A (G (((p88 <= p47) OR (p485 <= p172))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p88 <= p47) OR (p485 <= p172))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p47 + 1 <= p88) AND (p172 + 1 <= p485))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= p323))) U ((3 <= p37) AND (2 <= p114) AND (2 <= p196))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= p323)) U ((3 <= p37) AND (2 <= p114) AND (2 <= p196)))
lola: processed formula length: 65
lola: 19 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: 241274 markings, 585307 edges, 48255 markings/sec, 0 secs
lola: 479901 markings, 1164236 edges, 47725 markings/sec, 5 secs
lola: 719729 markings, 1746011 edges, 47966 markings/sec, 10 secs
lola: 961595 markings, 2332948 edges, 48373 markings/sec, 15 secs
lola: 1202319 markings, 2916971 edges, 48145 markings/sec, 20 secs
lola: 1444432 markings, 3504358 edges, 48423 markings/sec, 25 secs
lola: 1670784 markings, 4053565 edges, 45270 markings/sec, 30 secs
lola: 1877210 markings, 4554446 edges, 41285 markings/sec, 35 secs
lola: 2086431 markings, 5062126 edges, 41844 markings/sec, 40 secs
lola: 2298976 markings, 5577813 edges, 42509 markings/sec, 45 secs
lola: 2509387 markings, 6088241 edges, 42082 markings/sec, 50 secs
lola: 2733299 markings, 6631496 edges, 44782 markings/sec, 55 secs
lola: 2950805 markings, 7159321 edges, 43501 markings/sec, 60 secs
lola: 3167558 markings, 7685215 edges, 43351 markings/sec, 65 secs
lola: 3382136 markings, 8205862 edges, 42916 markings/sec, 70 secs
lola: 3589800 markings, 8709837 edges, 41533 markings/sec, 75 secs
lola: 3807869 markings, 9238988 edges, 43614 markings/sec, 80 secs
lola: 4037627 markings, 9796356 edges, 45952 markings/sec, 85 secs
lola: 4265303 markings, 10348752 edges, 45535 markings/sec, 90 secs
lola: 4489444 markings, 10892781 edges, 44828 markings/sec, 95 secs
lola: 4713254 markings, 11435761 edges, 44762 markings/sec, 100 secs
lola: 4930909 markings, 11963951 edges, 43531 markings/sec, 105 secs
lola: 5148861 markings, 12492710 edges, 43590 markings/sec, 110 secs
lola: 5376876 markings, 13046031 edges, 45603 markings/sec, 115 secs
lola: 5616574 markings, 13627504 edges, 47940 markings/sec, 120 secs
lola: 5850939 markings, 14196036 edges, 46873 markings/sec, 125 secs
lola: 6084037 markings, 14761577 edges, 46620 markings/sec, 130 secs
lola: 6305290 markings, 15298554 edges, 44251 markings/sec, 135 secs
lola: 6520553 markings, 15820874 edges, 43053 markings/sec, 140 secs
lola: 6736510 markings, 16344937 edges, 43191 markings/sec, 145 secs
lola: 6958300 markings, 16883098 edges, 44358 markings/sec, 150 secs
lola: 7196486 markings, 17460835 edges, 47637 markings/sec, 155 secs
lola: 7413441 markings, 17987357 edges, 43391 markings/sec, 160 secs
lola: 7630831 markings, 18514894 edges, 43478 markings/sec, 165 secs
lola: 7846194 markings, 19037444 edges, 43073 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= p215))) U A (G ((2 <= p921)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= p215)) U AG((2 <= p921)))
lola: processed formula length: 36
lola: 20 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 356779 markings, 508635 edges, 71356 markings/sec, 0 secs
lola: 712113 markings, 1015632 edges, 71067 markings/sec, 5 secs
lola: 1074889 markings, 1532979 edges, 72555 markings/sec, 10 secs
lola: 1425380 markings, 2032841 edges, 70098 markings/sec, 15 secs
lola: 1781797 markings, 2541219 edges, 71283 markings/sec, 20 secs
lola: 2140940 markings, 3053309 edges, 71829 markings/sec, 25 secs
lola: 2502136 markings, 3568663 edges, 72239 markings/sec, 30 secs
lola: 2865620 markings, 4086862 edges, 72697 markings/sec, 35 secs
lola: 3230126 markings, 4606822 edges, 72901 markings/sec, 40 secs
lola: 3593116 markings, 5124646 edges, 72598 markings/sec, 45 secs
lola: 3956759 markings, 5643537 edges, 72729 markings/sec, 50 secs
lola: 4321785 markings, 6163978 edges, 73005 markings/sec, 55 secs
lola: 4685984 markings, 6683465 edges, 72840 markings/sec, 60 secs
lola: 5047003 markings, 7198672 edges, 72204 markings/sec, 65 secs
lola: 5405178 markings, 7709323 edges, 71635 markings/sec, 70 secs
lola: 5760130 markings, 8215678 edges, 70990 markings/sec, 75 secs
lola: 6114064 markings, 8720520 edges, 70787 markings/sec, 80 secs
lola: 6466944 markings, 9223913 edges, 70576 markings/sec, 85 secs
lola: 6820029 markings, 9727514 edges, 70617 markings/sec, 90 secs
lola: 7175927 markings, 10235077 edges, 71180 markings/sec, 95 secs
lola: 7531807 markings, 10742652 edges, 71176 markings/sec, 100 secs
lola: 7860049 markings, 11210990 edges, 65648 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (((3 <= p702) R ((p88 + 1 <= p829) OR (p875 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((3 <= p702) R ((p88 + 1 <= p829) OR (p875 <= 1))))
lola: processed formula length: 55
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((p829 <= p88) AND (2 <= p875))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 338930 markings, 483205 edges, 67786 markings/sec, 0 secs
lola: sara is running 5 secs || 690344 markings, 984450 edges, 70283 markings/sec, 5 secs
lola: sara is running 10 secs || 1038656 markings, 1481187 edges, 69662 markings/sec, 10 secs
lola: sara is running 15 secs || 1379854 markings, 1967924 edges, 68240 markings/sec, 15 secs
lola: sara is running 20 secs || 1719502 markings, 2452400 edges, 67930 markings/sec, 20 secs
lola: sara is running 25 secs || 2063173 markings, 2942587 edges, 68734 markings/sec, 25 secs
lola: sara is running 30 secs || 2407353 markings, 3433275 edges, 68836 markings/sec, 30 secs
lola: sara is running 35 secs || 2751589 markings, 3924403 edges, 68847 markings/sec, 35 secs
lola: sara is running 40 secs || 3110326 markings, 4436030 edges, 71747 markings/sec, 40 secs
lola: sara is running 45 secs || 3476104 markings, 4957819 edges, 73156 markings/sec, 45 secs
lola: sara is running 50 secs || 3841494 markings, 5478943 edges, 73078 markings/sec, 50 secs
lola: sara is running 55 secs || 4205868 markings, 5998640 edges, 72875 markings/sec, 55 secs
lola: sara is running 60 secs || 4568302 markings, 6515746 edges, 72487 markings/sec, 60 secs
lola: sara is running 65 secs || 4932206 markings, 7034871 edges, 72781 markings/sec, 65 secs
lola: sara is running 70 secs || 5296562 markings, 7554525 edges, 72871 markings/sec, 70 secs
lola: sara is running 75 secs || 5661214 markings, 8074706 edges, 72930 markings/sec, 75 secs
lola: sara is running 80 secs || 6026814 markings, 8596147 edges, 73120 markings/sec, 80 secs
lola: sara is running 85 secs || 6395280 markings, 9121720 edges, 73693 markings/sec, 85 secs
lola: sara is running 90 secs || 6760995 markings, 9643419 edges, 73143 markings/sec, 90 secs
lola: sara is running 95 secs || 7129481 markings, 10168980 edges, 73697 markings/sec, 95 secs
lola: sara is running 100 secs || 7498837 markings, 10695667 edges, 73871 markings/sec, 100 secs
lola: sara is running 105 secs || 7865858 markings, 11219190 edges, 73404 markings/sec, 105 secs
lola: sara is running 110 secs || 8230866 markings, 11739998 edges, 73002 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((p424 <= p375) U (p338 + 1 <= p209))) OR E (G (((p398 + 1 <= p265) OR (p891 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p398 + 1 <= p265) OR (p891 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p398 + 1 <= p265) OR (p891 <= 0))))
lola: processed formula length: 44
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
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: ((p265 <= p398) AND (1 <= p891))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p424 <= p375) U (p338 + 1 <= p209)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p424 <= p375) U (p338 + 1 <= p209)))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p338 + 1 <= p209)
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-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-20-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 360111 markings, 513571 edges, 72022 markings/sec, 0 secs
lola: sara is running 5 secs || 727351 markings, 1037342 edges, 73448 markings/sec, 5 secs
lola: sara is running 10 secs || 1092713 markings, 1558367 edges, 73072 markings/sec, 10 secs
lola: sara is running 15 secs || 1462103 markings, 2085047 edges, 73878 markings/sec, 15 secs
lola: sara is running 20 secs || 1824490 markings, 2602149 edges, 72477 markings/sec, 20 secs
lola: sara is running 25 secs || 2173548 markings, 3099994 edges, 69812 markings/sec, 25 secs
lola: sara is running 30 secs || 2519842 markings, 3593900 edges, 69259 markings/sec, 30 secs
lola: sara is running 35 secs || 2867764 markings, 4090168 edges, 69584 markings/sec, 35 secs
lola: sara is running 40 secs || 3226150 markings, 4601205 edges, 71677 markings/sec, 40 secs
lola: sara is running 45 secs || 3584967 markings, 5113068 edges, 71763 markings/sec, 45 secs
lola: sara is running 50 secs || 3948090 markings, 5631082 edges, 72625 markings/sec, 50 secs
lola: sara is running 55 secs || 4312213 markings, 6150355 edges, 72825 markings/sec, 55 secs
lola: sara is running 60 secs || 4656501 markings, 6641620 edges, 68858 markings/sec, 60 secs
lola: sara is running 65 secs || 5011701 markings, 7148082 edges, 71040 markings/sec, 65 secs
lola: sara is running 70 secs || 5391705 markings, 7690216 edges, 76001 markings/sec, 70 secs
lola: sara is running 75 secs || 5766238 markings, 8224431 edges, 74907 markings/sec, 75 secs
lola: sara is running 80 secs || 6100540 markings, 8701107 edges, 66860 markings/sec, 80 secs
lola: sara is running 85 secs || 6444673 markings, 9192085 edges, 68827 markings/sec, 85 secs
lola: sara is running 90 secs || 6788811 markings, 9683084 edges, 68828 markings/sec, 90 secs
lola: sara is running 95 secs || 7134447 markings, 10175883 edges, 69127 markings/sec, 95 secs
lola: sara is running 100 secs || 7477810 markings, 10665698 edges, 68673 markings/sec, 100 secs
lola: sara is running 105 secs || 7837397 markings, 11178767 edges, 71917 markings/sec, 105 secs
lola: sara is running 110 secs || 8201681 markings, 11698305 edges, 72857 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((p88 <= p47) OR (p485 <= p172)))) OR ((((p798 + 1 <= p240) OR (p881 + 1 <= p80)) AND E (G ((p666 <= p696)))) OR (((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p798 + 1 <= p240) OR (p881 + 1 <= p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p798 + 1 <= p240) OR (p881 + 1 <= p80))
lola: processed formula length: 42
lola: 17 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: ========================================
lola: ...considering subproblem: (((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p4 + 1 <= p140) AND (p564 + 1 <= p873) AND (p762 + 1 <= p615) AND (p59 <= 2)) OR (p441 <= 1))
lola: processed formula length: 97
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: A (G (((p88 <= p47) OR (p485 <= p172))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p88 <= p47) OR (p485 <= p172))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p47 + 1 <= p88) AND (p172 + 1 <= p485))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no unknown yes yes no no no no no unknown yes unknown yes
lola:
preliminary result: no no unknown no unknown yes yes no no no no no unknown yes unknown yes
lola: ========================================
lola: memory consumption: 96472 KB
lola: time consumption: 1384 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552688027580

--------------------
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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r082-csrt-155246550300958"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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