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-155246550300976.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-1000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550300976
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 3.8K Feb 11 09:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 09:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 09:37 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.5K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 10K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 10:38 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 5.7M 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-1000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552687409770

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

FORMULA JoinFreeModules-PT-1000-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-1000-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA JoinFreeModules-PT-1000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA JoinFreeModules-PT-1000-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2593
rslt: Output for CTLCardinality @ JoinFreeModules-PT-1000

{
"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 22:03:29 2019
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 201
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((p2283 + 1 <= p3694))",
"processed_size": 24,
"rewrites": 18
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 201
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 201
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p588 <= 0) OR (p2460 + 1 <= p362))",
"processed_size": 37,
"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": 216
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p4220 <= 0) AND ((p4571 <= 2) OR (p3792 <= 0)))",
"processed_size": 50,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 232
},
"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": "(p3719 <= p569)",
"processed_size": 15,
"rewrites": 20
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 216
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(EX((p2855 <= p2954)) U (p1063 <= p1092))",
"processed_size": 42,
"rewrites": 19
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 3002,
"markings": 3002,
"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": 232
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 232
},
"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 <= p2099)))",
"processed_size": 20,
"rewrites": 18
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(EX((p936 <= p4410)))",
"processed_size": 23,
"rewrites": 19
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"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": 275
},
"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": "AX(EX((p1804 + 1 <= p3447)))",
"processed_size": 28,
"rewrites": 19
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G (((2 <= p3940) OR (p3284 <= p4075) OR ((3 <= p3399) AND (p4191 <= p3831)) OR ((p3676 <= 2) AND (p471 + 1 <= p3968)))))",
"processed_size": 126,
"rewrites": 18
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 39
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 730
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E((2 <= p512) U AF((3 <= p2937)))",
"processed_size": 33,
"rewrites": 19
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 3003,
"markings": 3002,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"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": "((p4906 <= 0) OR (p956 <= 2) OR (p4336 <= 0) OR ((p632 + 1 <= p969) AND ((p1775 <= 0) OR (p1792 + 1 <= p439))))",
"processed_size": 115,
"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": 2808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p3485 <= p493)))",
"processed_size": 23,
"rewrites": 19
},
"result":
{
"edges": 1001,
"markings": 1002,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))",
"processed_size": 165,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))",
"processed_size": 165,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((p3782 <= p1638)))",
"processed_size": 24,
"rewrites": 19
},
"result":
{
"edges": 1000,
"markings": 1001,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 803888,
"runtime": 977.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((E(F(**)) U A(G(**)))) : E((** U A(F(**)))) : ((E(X(*)) OR **) AND E(X(**))) : E(G(**)) : (A(G(**)) OR **) : E(G(**)) : (** AND ((** OR A(X(**))) AND A(F(*)))) : (A(G(*)) AND *) : A((E(X(**)) U **)) : (A(F(A(X(**)))) OR E(F(**))) : A(G(E(F(**)))) : E(G(E(X(**)))) : E(F(**)) : A(X(E(X(**)))) : E(G(E(X(**)))) : A(G(**))"
},
"net":
{
"arcs": 23002,
"conflict_clusters": 4001,
"places": 5001,
"places_significant": 4000,
"singleton_clusters": 0,
"transitions": 8001
},
"result":
{
"preliminary_value": "unknown no no yes no yes no no no yes unknown no yes yes yes no ",
"value": "unknown no no yes no yes no no no yes unknown no yes yes yes no "
},
"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: 13002/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160032
lola: finding significant places
lola: 5001 places, 8001 transitions, 4000 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: A ((E (F ((2 <= p722))) U A (G ((1 <= p4707))))) : E (((2 <= p512) U A (F ((3 <= p2937))))) : ((NOT(A (X ((3 <= p290)))) OR (p959 <= p1997)) AND E (X ((p2283 + 1 <= p3694)))) : E (G ((p4358 <= p2593))) : (E (G (A (G ((p3782 <= p1638))))) OR ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))) : E (G (((2 <= p3940) OR (p3284 <= p4075) OR ((3 <= p3399) AND (p4191 <= p3831)) OR ((p3676 <= 2) AND (p471 + 1 <= p3968))))) : ((((p4220 <= 0) AND ((p4571 <= 2) OR (p3792 <= 0))) AND (((p588 <= 0) OR (p2460 + 1 <= p362)) OR A (X ((p751 <= p3512))))) AND NOT(E (G ((p3719 <= p569))))) : NOT((E (F ((p493 + 1 <= p3485))) OR ((1 <= p4906) AND (3 <= p956) AND (1 <= p4336) AND ((p969 <= p632) OR ((1 <= p1775) AND (p439 <= p1792)))))) : A ((E (X ((p2855 <= p2954))) U (p1063 <= p1092))) : (A (F (A (X ((1 <= p1344))))) OR A (F (E (F ((2 <= p2099)))))) : A (G (E (F ((1 <= p3570))))) : E (G (E (X ((p936 <= p4410))))) : E ((E (F ((2 <= p1410))) U E (F ((2 <= p975))))) : A (X (E (X ((p1804 + 1 <= p3447))))) : (E (G (E (X ((3 <= p3673))))) OR ()) : A (G ((p4489 <= p2756)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((p290 <= 2))) OR (p959 <= p1997)) AND E (X ((p2283 + 1 <= p3694))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p959 <= p1997)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p959 <= p1997)
lola: processed formula length: 15
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 1 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p2283 + 1 <= p3694)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p2283 + 1 <= p3694))
lola: processed formula length: 24
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p4220 <= 0) AND ((p4571 <= 2) OR (p3792 <= 0))) AND ((((p588 <= 0) OR (p2460 + 1 <= p362)) OR A (X ((p751 <= p3512)))) AND A (F ((p569 + 1 <= p3719)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p588 <= 0) OR (p2460 + 1 <= p362))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p588 <= 0) OR (p2460 + 1 <= p362))
lola: processed formula length: 37
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4220 <= 0) AND ((p4571 <= 2) OR (p3792 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4220 <= 0) AND ((p4571 <= 2) OR (p3792 <= 0)))
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 3 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p569 + 1 <= p3719)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p3719 <= p569)
lola: processed formula length: 15
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p569 + 1 <= p3719)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p2855 <= p2954))) U (p1063 <= p1092)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p2855 <= p2954)) U (p1063 <= p1092))
lola: processed formula length: 42
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: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 3 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((1 <= p1344))))) OR E (F ((2 <= p2099))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2099)))
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 <= p2099)))
lola: processed formula length: 20
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 <= p2099)
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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p936 <= p4410)))))
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((p936 <= p4410)))
lola: processed formula length: 23
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((p1804 + 1 <= p3447)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX((p1804 + 1 <= p3447)))
lola: processed formula length: 28
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((3 <= p3673)))))
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((3 <= p3673)))
lola: processed formula length: 20
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: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p975)))
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 <= p975)))
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 <= p975)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p4489 <= p2756)))
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 ((p4489 <= p2756)))
lola: processed formula length: 24
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: (p2756 + 1 <= p4489)
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: 4 markings, 3 edges
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p3570)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p3570)
lola: processed formula length: 12
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: ========================================
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p3570)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p3570 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
sara: try reading problem file CTLCardinality-9-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 69311 markings, 98823 edges, 13862 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 140535 markings, 200302 edges, 14245 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara is running 10 secs || sara is running 10 secs || 211499 markings, 301148 edges, 14193 markings/sec, 10 secs
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 15 secs || sara is running 15 secs || 280065 markings, 399594 edges, 13713 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 353591 markings, 504192 edges, 14705 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 431014 markings, 614967 edges, 15485 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 508267 markings, 725444 edges, 15451 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 584964 markings, 834957 edges, 15339 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 661623 markings, 944388 edges, 15332 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 733461 markings, 1047222 edges, 14368 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 806012 markings, 1149891 edges, 14510 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 877803 markings, 1253052 edges, 14358 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 955242 markings, 1363849 edges, 15488 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 1034672 markings, 1476924 edges, 15886 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 1113779 markings, 1589623 edges, 15821 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 1192353 markings, 1702408 edges, 15715 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 1269788 markings, 1813201 edges, 15487 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 1346770 markings, 1923206 edges, 15396 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 1418933 markings, 2025539 edges, 14433 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 1490786 markings, 2128049 edges, 14371 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p4358 <= p2593)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p4358 <= p2593)))
lola: processed formula length: 24
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: (p2593 + 1 <= p4358)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 11 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p3940) OR (p3284 <= p4075) OR ((3 <= p3399) AND (p4191 <= p3831)) OR ((p3676 <= 2) AND (p471 + 1 <= p3968)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p3940) OR (p3284 <= p4075) OR ((3 <= p3399) AND (p4191 <= p3831)) OR ((p3676 <= 2) AND (p471 + 1 <= p3968)))))
lola: processed formula length: 126
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: ((p3940 <= 1) AND (p4075 + 1 <= p3284) AND ((p3399 <= 2) OR (p3831 + 1 <= p4191)) AND ((3 <= p3676) OR (p3968 <= p471)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p512) U A (F ((3 <= p2937)))))
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((2 <= p512) U AF((3 <= p2937)))
lola: processed formula length: 33
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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3002 markings, 3003 edges
lola: ========================================
lola: subprocess 13 will run for 974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p722))) U A (G ((1 <= p4707)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF((2 <= p722)) U AG((1 <= p4707)))
lola: processed formula length: 37
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: 65987 markings, 93009 edges, 13197 markings/sec, 0 secs
lola: 133136 markings, 189918 edges, 13430 markings/sec, 5 secs
lola: 198713 markings, 282585 edges, 13115 markings/sec, 10 secs
lola: 263514 markings, 375767 edges, 12960 markings/sec, 15 secs
lola: 330882 markings, 471331 edges, 13474 markings/sec, 20 secs
lola: 400607 markings, 570937 edges, 13945 markings/sec, 25 secs
lola: 469346 markings, 669558 edges, 13748 markings/sec, 30 secs
lola: 539222 markings, 769315 edges, 13975 markings/sec, 35 secs
lola: 610573 markings, 870786 edges, 14270 markings/sec, 40 secs
lola: 681691 markings, 972767 edges, 14224 markings/sec, 45 secs
lola: 753009 markings, 1075113 edges, 14264 markings/sec, 50 secs
lola: 824458 markings, 1177068 edges, 14290 markings/sec, 55 secs
lola: 895788 markings, 1278277 edges, 14266 markings/sec, 60 secs
lola: 966530 markings, 1379115 edges, 14148 markings/sec, 65 secs
lola: 1031566 markings, 1472712 edges, 13007 markings/sec, 70 secs
lola: 1096741 markings, 1565893 edges, 13035 markings/sec, 75 secs
lola: 1161736 markings, 1657820 edges, 12999 markings/sec, 80 secs
lola: 1226786 markings, 1751438 edges, 13010 markings/sec, 85 secs
lola: 1294574 markings, 1847594 edges, 13558 markings/sec, 90 secs
lola: 1358280 markings, 1938856 edges, 12741 markings/sec, 95 secs
lola: 1421877 markings, 2029933 edges, 12719 markings/sec, 100 secs
lola: 1486739 markings, 2123215 edges, 12972 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p3485 <= p493))) AND ((p4906 <= 0) OR (p956 <= 2) OR (p4336 <= 0) OR ((p632 + 1 <= p969) AND ((p1775 <= 0) OR (p1792 + 1 <= p439)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4906 <= 0) OR (p956 <= 2) OR (p4336 <= 0) OR ((p632 + 1 <= p969) AND ((p1775 <= 0) OR (p1792 + 1 <= p439))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4906 <= 0) OR (p956 <= 2) OR (p4336 <= 0) OR ((p632 + 1 <= p969) AND ((p1775 <= 0) OR (p1792 + 1 <= p439))))
lola: processed formula length: 115
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 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 2808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p3485 <= p493)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p3485 <= p493)))
lola: processed formula length: 23
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p493 + 1 <= p3485)
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: 1002 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p3782 <= p1638))) OR ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))
lola: processed formula length: 165
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p3570)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p3570)
lola: processed formula length: 12
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: (p3570 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p3570)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: write sara problem file to CTLCardinality-16-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-1.sara.
sara: try reading problem file CTLCardinality-16-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 68986 markings, 98256 edges, 13797 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 141488 markings, 201255 edges, 14500 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 215163 markings, 306880 edges, 14735 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: sara is running 15 secs || sara is running 15 secs || 275046 markings, 391590 edges, 11977 markings/sec, 15 secs
lola: state equation 1: solution produced
lola: sara is running 20 secs || sara is running 20 secs || 346053 markings, 493248 edges, 14201 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 418104 markings, 596873 edges, 14410 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 495589 markings, 707753 edges, 15497 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 577320 markings, 823821 edges, 16346 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 652161 markings, 930074 edges, 14968 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 724058 markings, 1033433 edges, 14379 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 795738 markings, 1136394 edges, 14336 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 868507 markings, 1239043 edges, 14554 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 940492 markings, 1342533 edges, 14397 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 1012606 markings, 1445895 edges, 14423 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 1085314 markings, 1548795 edges, 14542 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 1161276 markings, 1657324 edges, 15192 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 1240070 markings, 1770184 edges, 15759 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 1318754 markings, 1883165 edges, 15737 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 1399689 markings, 1997839 edges, 16187 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 1478218 markings, 2110555 edges, 15706 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p722))) U A (G ((1 <= p4707)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF((2 <= p722)) U AG((1 <= p4707)))
lola: processed formula length: 37
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: 69688 markings, 99484 edges, 13938 markings/sec, 0 secs
lola: 139403 markings, 199024 edges, 13943 markings/sec, 5 secs
lola: 207180 markings, 295158 edges, 13555 markings/sec, 10 secs
lola: 276487 markings, 393985 edges, 13861 markings/sec, 15 secs
lola: 343144 markings, 489569 edges, 13331 markings/sec, 20 secs
lola: 409777 markings, 584546 edges, 13327 markings/sec, 25 secs
lola: 475720 markings, 678918 edges, 13189 markings/sec, 30 secs
lola: 541665 markings, 772657 edges, 13189 markings/sec, 35 secs
lola: 606939 markings, 866667 edges, 13055 markings/sec, 40 secs
lola: 672281 markings, 959149 edges, 13068 markings/sec, 45 secs
lola: 737165 markings, 1051870 edges, 12977 markings/sec, 50 secs
lola: 802502 markings, 1145992 edges, 13067 markings/sec, 55 secs
lola: 870412 markings, 1242362 edges, 13582 markings/sec, 60 secs
lola: 939044 markings, 1340001 edges, 13726 markings/sec, 65 secs
lola: 1007357 markings, 1437658 edges, 13663 markings/sec, 70 secs
lola: 1075754 markings, 1535940 edges, 13679 markings/sec, 75 secs
lola: 1142879 markings, 1631565 edges, 13425 markings/sec, 80 secs
lola: 1209404 markings, 1726367 edges, 13305 markings/sec, 85 secs
lola: 1276631 markings, 1822933 edges, 13445 markings/sec, 90 secs
lola: 1345332 markings, 1920691 edges, 13740 markings/sec, 95 secs
lola: 1413781 markings, 2018007 edges, 13690 markings/sec, 100 secs
lola: 1480526 markings, 2114026 edges, 13349 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((p3782 <= p1638))) OR ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11 + 1 <= p1937) AND ((2 <= p3822) OR (p3079 <= p249)) AND ((p4844 <= 2) OR (p2892 + 1 <= p3044)) AND ((1 <= p985) OR ((p1532 + 1 <= p2922) AND (p4646 <= 0))))
lola: processed formula length: 165
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 8 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 ((p3782 <= p1638)))
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 ((p3782 <= p1638)))
lola: processed formula length: 24
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: (p1638 + 1 <= p3782)
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: 1001 markings, 1000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: unknown no no yes no yes no no no yes unknown no yes yes yes no
lola:
preliminary result: unknown no no yes no yes no no no yes unknown no yes yes yes no
lola: ========================================
lola: memory consumption: 803888 KB
lola: time consumption: 977 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552688386222

--------------------
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-1000"
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-1000, 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-155246550300976"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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