Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r165-oct2-158972938900055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is RobotManipulation-PT-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-oct2-158972938900055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K Apr 12 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 11 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 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 RobotManipulation-PT-02000-00
FORMULA_NAME RobotManipulation-PT-02000-01
FORMULA_NAME RobotManipulation-PT-02000-02
FORMULA_NAME RobotManipulation-PT-02000-03
FORMULA_NAME RobotManipulation-PT-02000-04
FORMULA_NAME RobotManipulation-PT-02000-05
FORMULA_NAME RobotManipulation-PT-02000-06
FORMULA_NAME RobotManipulation-PT-02000-07
FORMULA_NAME RobotManipulation-PT-02000-08
FORMULA_NAME RobotManipulation-PT-02000-09
FORMULA_NAME RobotManipulation-PT-02000-10
FORMULA_NAME RobotManipulation-PT-02000-11
FORMULA_NAME RobotManipulation-PT-02000-12
FORMULA_NAME RobotManipulation-PT-02000-13
FORMULA_NAME RobotManipulation-PT-02000-14
FORMULA_NAME RobotManipulation-PT-02000-15

=== Now, execution of the tool begins

BK_START 1590263960841

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RobotManipulation-PT-02000 @ 3570 seconds

FORMULA RobotManipulation-PT-02000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-02000-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2161
rslt: Output for LTLCardinality @ RobotManipulation-PT-02000

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 19:59:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (F (((p_i2 + 1 <= r_moving) AND X (G ((p_sc + 1 <= initialized)))))))",
"processed_size": 74,
"rewrites": 123
},
"result":
{
"edges": 24004,
"markings": 24004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 123
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (F (((p_rel <= 0) OR (initialized + 1 <= p_i1)))))",
"processed_size": 55,
"rewrites": 123
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((X (F ((off + 1 <= r_active))) U (moved <= 0))))",
"processed_size": 54,
"rewrites": 123
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((((p_sc <= off) AND X (TRUE)) OR F (G ((off + 1 <= p_sc)))))))",
"processed_size": 71,
"rewrites": 123
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 334
},
"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": "A (X ((p_m <= 2)))",
"processed_size": 18,
"rewrites": 123
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((G ((r_stopped + 1 <= off)) R (r_moving + 1 <= off))))",
"processed_size": 60,
"rewrites": 123
},
"result":
{
"edges": 24004,
"markings": 24004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (X (G ((r_moving <= off))))",
"processed_size": 29,
"rewrites": 123
},
"result":
{
"edges": 24004,
"markings": 24004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((p_i2 <= r_stopped))))",
"processed_size": 31,
"rewrites": 123
},
"result":
{
"edges": 20011,
"markings": 16009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 601
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G (((p_rel + 1 <= initialized) AND (F ((p_rel + 1 <= initialized)) AND (F ((p_rel + 1 <= initialized)) OR G (((p_rel + 1 <= initialized) AND F ((p_rel + 1 <= initialized))))))))))",
"processed_size": 185,
"rewrites": 123
},
"result":
{
"edges": 20005,
"markings": 20004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 751
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((G ((access <= p_i2)) OR G (((move <= 2) AND G ((3 <= move))))) U (p_i2 <= r_moving)))",
"processed_size": 90,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1002
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((3 <= p_sc) OR G (F ((G ((p_rel + 1 <= p_rdy)) OR ((move + 1 <= initialized) AND (p_rel + 1 <= p_rdy)))))))",
"processed_size": 111,
"rewrites": 123
},
"result":
{
"edges": 100633,
"markings": 73981,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (F (((r_active <= r_stopped) OR ((r_moving + 1 <= initialize) R ((initialize <= r_moving) OR G ((2 <= move))))))))",
"processed_size": 119,
"rewrites": 123
},
"result":
{
"edges": 10011,
"markings": 8011,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3006
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= r_active)))",
"processed_size": 23,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p_i1 + 1 <= r_active)",
"processed_size": 22,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22748,
"runtime": 1384.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F((* OR (* R (** OR G(**))))))) : A((** OR G(F((G(*) OR (* AND *)))))) : A(X(F((* AND X(G(*)))))) : A(X((X(F(**)) U (** OR G(**))))) : A(X(TRUE)) : A(X(F((* OR *)))) : A(X((X(F(*)) U **))) : A(G(F(**))) : (A(F(**)) AND A(G((** OR X(TRUE))))) : A(X(F(((** AND X(TRUE)) OR F(G(*)))))) : (A(G(**)) AND A(F(G(**)))) : (A(X(*)) AND (A(X((G(*) R *))) AND A((X(G((* AND (G(*) R *)))) OR G(F(*)))))) : A(((G(**) OR G((** AND G(**)))) U **)) : A(F(*)) : (A(X(G(**))) AND A(X(**))) : A(F(G((* AND (F(*) AND (F(*) OR G((* AND F(*)))))))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no unknown yes yes yes no unknown yes no no yes yes no no ",
"value": "no no no unknown yes yes yes no unknown yes no no yes yes no 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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (NOT(F (G (((r_stopped + 1 <= r_active) AND ((initialize <= r_moving) U NOT(((initialize <= r_moving) OR G ((2 <= move)))))))))) : A (((3 <= p_sc) OR G (((((p_rdy <= p_rel) OR (1 <= off)) OR F ((p_rdy <= p_rel))) U NOT(G (((initialized <= move) U (p_rdy <= p_rel)))))))) : A (F ((NOT(((p_rel <= r_stopped) U (r_stopped + 1 <= p_rel))) U NOT((X ((r_moving <= p_i2)) OR X (F (X ((initialized <= p_sc))))))))) : A (X ((X (F ((r_stopped <= p_rdy))) U ((r_stopped <= p_rdy) OR G ((3 <= p_i2)))))) : A ((G ((0 <= p_rel)) AND F (X ((((p_m <= move) OR ((p_rdy <= r_moving) AND (r_moving + 1 <= p_rdy))) OR F ((0 <= p_rel))))))) : A (X (F (NOT(((1 <= p_rel) AND ((p_i1 <= initialized) OR (() AND F ((0 <= r_stopped))))))))) : A (X ((F (NOT(((0 <= p_m) AND X (G ((r_active <= off)))))) U (moved <= 0)))) : A (X (X (G (F ((p_i2 <= r_stopped)))))) : A ((F ((r_active <= p_i1)) AND G ((((off <= moved) OR (r_active <= p_i1)) OR X (X (G ((0 <= initialize)))))))) : A (X (F ((((p_sc <= off) AND G (X ((0 <= access)))) OR F (G (NOT(F ((p_sc <= off))))))))) : A ((G ((1 <= r_active)) AND G (F (G ((1 <= r_active)))))) : A (NOT((G (F (G (((r_stopped <= p_i1) OR (off <= r_stopped))))) U X (((3 <= p_m) OR (F ((off <= r_stopped)) U (off <= r_moving))))))) : A (((G ((access <= p_i2)) OR G (((move <= 2) AND G ((3 <= move))))) U (p_i2 <= r_moving))) : A (NOT(G ((1 <= initialized)))) : A ((X (G ((r_moving <= off))) AND X (((p_sc <= p_m) OR (off <= moved))))) : A (NOT(G (X (F ((G ((initialized <= p_rel)) U ((initialized <= p_rel) OR G ((initialized <= p_rel)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p_i2 + 1 <= r_moving) AND X (G ((p_sc + 1 <= initialized)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p_i2 + 1 <= r_moving) AND X (G ((p_sc + 1 <= initialized)))))))
lola: processed formula length: 74
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24004 markings, 24004 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (F ((r_stopped <= p_rdy))) U ((r_stopped <= p_rdy) OR G ((3 <= p_i2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F ((r_stopped <= p_rdy))) U ((r_stopped <= p_rdy) OR G ((3 <= p_i2))))))
lola: processed formula length: 82
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5536984 markings, 6910490 edges, 1107397 markings/sec, 0 secs
lola: 10268030 markings, 13380528 edges, 946209 markings/sec, 5 secs
lola: 13803852 markings, 18683940 edges, 707164 markings/sec, 10 secs
lola: 17051759 markings, 23724330 edges, 649581 markings/sec, 15 secs
lola: 20307811 markings, 29150795 edges, 651210 markings/sec, 20 secs
lola: 23411683 markings, 34777371 edges, 620774 markings/sec, 25 secs
lola: 25558502 markings, 39071011 edges, 429364 markings/sec, 30 secs
lola: 27431991 markings, 42817990 edges, 374698 markings/sec, 35 secs
lola: 30124374 markings, 47500897 edges, 538477 markings/sec, 40 secs
lola: 32903205 markings, 52132075 edges, 555766 markings/sec, 45 secs
lola: 35198180 markings, 56333352 edges, 458995 markings/sec, 50 secs
lola: 37363133 markings, 60663260 edges, 432991 markings/sec, 55 secs
lola: 39104611 markings, 64146215 edges, 348296 markings/sec, 60 secs
lola: 41124862 markings, 67826147 edges, 404050 markings/sec, 65 secs
lola: 44101681 markings, 72787245 edges, 595364 markings/sec, 70 secs
lola: 46725145 markings, 77368261 edges, 524693 markings/sec, 75 secs
lola: 49167505 markings, 82252981 edges, 488472 markings/sec, 80 secs
lola: 51322407 markings, 86562784 edges, 430980 markings/sec, 85 secs
lola: 54142438 markings, 91514982 edges, 564006 markings/sec, 90 secs
lola: 57085336 markings, 96419594 edges, 588580 markings/sec, 95 secs
lola: 59778471 markings, 101453879 edges, 538627 markings/sec, 100 secs
lola: 61965651 markings, 105828240 edges, 437436 markings/sec, 105 secs
lola: 63706234 markings, 109309404 edges, 348117 markings/sec, 110 secs
lola: 66483975 markings, 114079165 edges, 555548 markings/sec, 115 secs
lola: 69088857 markings, 118420448 edges, 520976 markings/sec, 120 secs
lola: 71583355 markings, 123040603 edges, 498900 markings/sec, 125 secs
lola: 73715473 markings, 127304840 edges, 426424 markings/sec, 130 secs
lola: 75425540 markings, 130724973 edges, 342013 markings/sec, 135 secs
lola: 77875745 markings, 135062495 edges, 490041 markings/sec, 140 secs
lola: 80643247 markings, 139674775 edges, 553500 markings/sec, 145 secs
lola: 83174484 markings, 144197805 edges, 506247 markings/sec, 150 secs
lola: 85420572 markings, 148689980 edges, 449218 markings/sec, 155 secs
lola: 87258740 markings, 152366317 edges, 367634 markings/sec, 160 secs
lola: 89487440 markings, 156414352 edges, 445740 markings/sec, 165 secs
lola: 92400157 markings, 161268626 edges, 582543 markings/sec, 170 secs
lola: 94869057 markings, 165559882 edges, 493780 markings/sec, 175 secs
lola: 97171202 markings, 170164172 edges, 460429 markings/sec, 180 secs
lola: 98971238 markings, 173764245 edges, 360007 markings/sec, 185 secs
lola: 100579805 markings, 176902779 edges, 321713 markings/sec, 190 secs
lola: 103592014 markings, 181922765 edges, 602442 markings/sec, 195 secs
lola: 106144609 markings, 186176923 edges, 510519 markings/sec, 200 secs
lola: 108621620 markings, 191035926 edges, 495402 markings/sec, 205 secs
lola: 110693894 markings, 195180474 edges, 414455 markings/sec, 210 secs
lola: 112377420 markings, 198547524 edges, 336705 markings/sec, 215 secs
lola: 115323638 markings, 203478480 edges, 589244 markings/sec, 220 secs
lola: 117534063 markings, 207162369 edges, 442085 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p_rel <= 0) OR (initialized + 1 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p_rel <= 0) OR (initialized + 1 <= p_i1)))))
lola: processed formula length: 55
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (F ((off + 1 <= r_active))) U (moved <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F ((off + 1 <= r_active))) U (moved <= 0))))
lola: processed formula length: 54
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((r_active <= p_i1))) AND A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((r_active <= p_i1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_i1 + 1 <= r_active)
lola: processed formula length: 22
lola: 125 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE))))
lola: processed formula length: 61
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2477604 markings, 6759257 edges, 495521 markings/sec, 0 secs
lola: 3948660 markings, 11821882 edges, 294211 markings/sec, 5 secs
lola: 5237805 markings, 16521810 edges, 257829 markings/sec, 10 secs
lola: 6440120 markings, 20881409 edges, 240463 markings/sec, 15 secs
lola: 7629807 markings, 25302266 edges, 237937 markings/sec, 20 secs
lola: 8825874 markings, 29731295 edges, 239213 markings/sec, 25 secs
lola: 9920546 markings, 33922789 edges, 218934 markings/sec, 30 secs
lola: 10981180 markings, 38001443 edges, 212127 markings/sec, 35 secs
lola: 12029294 markings, 41993249 edges, 209623 markings/sec, 40 secs
lola: 13006943 markings, 45775456 edges, 195530 markings/sec, 45 secs
lola: 13962202 markings, 49480879 edges, 191052 markings/sec, 50 secs
lola: 14941210 markings, 53218270 edges, 195802 markings/sec, 55 secs
lola: 15838784 markings, 56727991 edges, 179515 markings/sec, 60 secs
lola: 16696352 markings, 60087708 edges, 171514 markings/sec, 65 secs
lola: 17515042 markings, 63323743 edges, 163738 markings/sec, 70 secs
lola: 18467139 markings, 66732271 edges, 190419 markings/sec, 75 secs
lola: 19263871 markings, 69878007 edges, 159346 markings/sec, 80 secs
lola: 20052894 markings, 72969366 edges, 157805 markings/sec, 85 secs
lola: 20825048 markings, 76033135 edges, 154431 markings/sec, 90 secs
lola: 21612505 markings, 79039270 edges, 157491 markings/sec, 95 secs
lola: 22350046 markings, 81985371 edges, 147508 markings/sec, 100 secs
lola: 23085566 markings, 84912401 edges, 147104 markings/sec, 105 secs
lola: 23829495 markings, 87846348 edges, 148786 markings/sec, 110 secs
lola: 24631906 markings, 90865602 edges, 160482 markings/sec, 115 secs
lola: 25362336 markings, 93801818 edges, 146086 markings/sec, 120 secs
lola: 26079254 markings, 96676967 edges, 143384 markings/sec, 125 secs
lola: 26774952 markings, 99488313 edges, 139140 markings/sec, 130 secs
lola: 27476726 markings, 102303303 edges, 140355 markings/sec, 135 secs
lola: 28193944 markings, 105135930 edges, 143444 markings/sec, 140 secs
lola: 28882168 markings, 107913736 edges, 137645 markings/sec, 145 secs
lola: 29560982 markings, 110679100 edges, 135763 markings/sec, 150 secs
lola: 30256188 markings, 113495730 edges, 139041 markings/sec, 155 secs
lola: 30964754 markings, 116349586 edges, 141713 markings/sec, 160 secs
lola: 31660732 markings, 119182586 edges, 139196 markings/sec, 165 secs
lola: 32466886 markings, 122279376 edges, 161231 markings/sec, 170 secs
lola: 33184679 markings, 125184289 edges, 143559 markings/sec, 175 secs
lola: 33918010 markings, 128122312 edges, 146666 markings/sec, 180 secs
lola: 34638879 markings, 131059701 edges, 144174 markings/sec, 185 secs
lola: 35395220 markings, 134086773 edges, 151268 markings/sec, 190 secs
lola: 36131094 markings, 137083311 edges, 147175 markings/sec, 195 secs
lola: 36858660 markings, 140059030 edges, 145513 markings/sec, 200 secs
lola: 37600088 markings, 143088443 edges, 148286 markings/sec, 205 secs
lola: 38333525 markings, 146088401 edges, 146687 markings/sec, 210 secs
lola: 39087433 markings, 149158663 edges, 150782 markings/sec, 215 secs
lola: 39829376 markings, 152202731 edges, 148389 markings/sec, 220 secs
lola: 40573271 markings, 155259319 edges, 148779 markings/sec, 225 secs
lola: 41318228 markings, 158314719 edges, 148991 markings/sec, 230 secs
lola: 42068108 markings, 161389936 edges, 149976 markings/sec, 235 secs
lola: 42835416 markings, 164515152 edges, 153462 markings/sec, 240 secs
lola: 43579358 markings, 167591596 edges, 148788 markings/sec, 245 secs
lola: 44336402 markings, 170706315 edges, 151409 markings/sec, 250 secs
lola: 45095952 markings, 173837669 edges, 151910 markings/sec, 255 secs
lola: 45865304 markings, 176992969 edges, 153870 markings/sec, 260 secs
lola: 46614600 markings, 180109404 edges, 149859 markings/sec, 265 secs
lola: 47386069 markings, 183280917 edges, 154294 markings/sec, 270 secs
lola: 48153209 markings, 186448490 edges, 153428 markings/sec, 275 secs
lola: 48960820 markings, 189672877 edges, 161522 markings/sec, 280 secs
lola: 49726420 markings, 192836153 edges, 153120 markings/sec, 285 secs
lola: 50481954 markings, 195979372 edges, 151107 markings/sec, 290 secs
lola: 51254248 markings, 199181059 edges, 154459 markings/sec, 295 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no unknown yes yes yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown no unknown yes yes yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8789816 KB
lola: time consumption: 540 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: memory consumption: 8790056 KB
lola: time consumption: 540 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown no unknown yes yes yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 23316 KB
lola: time consumption: 543 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((((p_sc <= off) AND X (TRUE)) OR F (G ((off + 1 <= p_sc)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((((p_sc <= off) AND X (TRUE)) OR F (G ((off + 1 <= p_sc)))))))
lola: processed formula length: 71
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p_m <= 2))) AND (A (X ((G ((r_stopped + 1 <= off)) R (r_moving + 1 <= off)))) AND A ((X (G (((p_m <= 2) AND (G ((r_stopped + 1 <= off)) R (r_moving + 1 <= off))))) OR G (F (((p_i1 + 1 <= r_stopped) AND (r_stopped + 1 <= off))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p_m <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p_m <= 2)))
lola: processed formula length: 18
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((r_stopped + 1 <= off)) R (r_moving + 1 <= off))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((r_stopped + 1 <= off)) R (r_moving + 1 <= off))))
lola: processed formula length: 60
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24004 markings, 24004 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G ((r_moving <= off)))) AND A (X (((p_sc <= p_m) OR (off <= moved)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((r_moving <= off))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((r_moving <= off))))
lola: processed formula length: 29
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24004 markings, 24004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((initialized <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= initialized)
lola: processed formula length: 18
lola: 125 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p_i2 <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p_i2 <= r_stopped))))
lola: processed formula length: 31
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16009 markings, 20011 edges
lola: ========================================
lola: subprocess 11 will run for 601 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p_rel + 1 <= initialized) AND (F ((p_rel + 1 <= initialized)) AND (F ((p_rel + 1 <= initialized)) OR G (((p_rel + 1 <= initialized) AND F ((p_rel + 1 <= initialized))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p_rel + 1 <= initialized) AND (F ((p_rel + 1 <= initialized)) AND (F ((p_rel + 1 <= initialized)) OR G (((p_rel + 1 <= initialized) AND F ((p_rel + 1 <= initialized))))))))))
lola: processed formula length: 185
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20004 markings, 20005 edges
lola: ========================================
lola: subprocess 12 will run for 751 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((G ((access <= p_i2)) OR G (((move <= 2) AND G ((3 <= move))))) U (p_i2 <= r_moving)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((G ((access <= p_i2)) OR G (((move <= 2) AND G ((3 <= move))))) U (p_i2 <= r_moving)))
lola: processed formula length: 90
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1002 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p_sc) OR G (F ((G ((p_rel + 1 <= p_rdy)) OR ((move + 1 <= initialized) AND (p_rel + 1 <= p_rdy)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p_sc) OR G (F ((G ((p_rel + 1 <= p_rdy)) OR ((move + 1 <= initialized) AND (p_rel + 1 <= p_rdy)))))))
lola: processed formula length: 111
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73981 markings, 100633 edges
lola: ========================================
lola: subprocess 14 will run for 1503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((r_active <= r_stopped) OR ((r_moving + 1 <= initialize) R ((initialize <= r_moving) OR G ((2 <= move))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((r_active <= r_stopped) OR ((r_moving + 1 <= initialize) R ((initialize <= r_moving) OR G ((2 <= move))))))))
lola: processed formula length: 119
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8011 markings, 10011 edges
lola: ========================================
lola: subprocess 15 will run for 3006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= r_active))) AND A (F (G ((1 <= r_active)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= r_active)))
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 ((1 <= r_active)))
lola: processed formula length: 23
lola: 125 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((X (F ((r_stopped <= p_rdy))) U ((r_stopped <= p_rdy) OR G ((3 <= p_i2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F ((r_stopped <= p_rdy))) U ((r_stopped <= p_rdy) OR G ((3 <= p_i2))))))
lola: processed formula length: 82
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5649261 markings, 7050824 edges, 1129852 markings/sec, 0 secs
lola: 10465464 markings, 13676655 edges, 963241 markings/sec, 5 secs
lola: 14312536 markings, 19446929 edges, 769414 markings/sec, 10 secs
lola: 17955320 markings, 25230162 edges, 728557 markings/sec, 15 secs
lola: 21207380 markings, 30650020 edges, 650412 markings/sec, 20 secs
lola: 24103521 markings, 36161047 edges, 579228 markings/sec, 25 secs
lola: 26518320 markings, 40990648 edges, 482960 markings/sec, 30 secs
lola: 29112712 markings, 45814906 edges, 518878 markings/sec, 35 secs
lola: 32180277 markings, 50927242 edges, 613513 markings/sec, 40 secs
lola: 35014264 markings, 55965520 edges, 566797 markings/sec, 45 secs
lola: 37339188 markings, 60615369 edges, 464985 markings/sec, 50 secs
lola: 39354536 markings, 64646065 edges, 403070 markings/sec, 55 secs
lola: 42119130 markings, 69483149 edges, 552919 markings/sec, 60 secs
lola: 44990514 markings, 74268576 edges, 574277 markings/sec, 65 secs
lola: 47559244 markings, 79036458 edges, 513746 markings/sec, 70 secs
lola: 49718048 markings, 83354066 edges, 431761 markings/sec, 75 secs
lola: 51729810 markings, 87377590 edges, 402352 markings/sec, 80 secs
lola: 54720801 markings, 92478869 edges, 598198 markings/sec, 85 secs
lola: 57532083 markings, 97164146 edges, 562256 markings/sec, 90 secs
lola: 60030446 markings, 101957830 edges, 499673 markings/sec, 95 secs
lola: 62287992 markings, 106472922 edges, 451509 markings/sec, 100 secs
lola: 64746356 markings, 111183341 edges, 491673 markings/sec, 105 secs
lola: 67929658 markings, 116488525 edges, 636660 markings/sec, 110 secs
lola: 70927541 markings, 121728976 edges, 599577 markings/sec, 115 secs
lola: 73380428 markings, 126634749 edges, 490577 markings/sec, 120 secs
lola: 75575200 markings, 131024291 edges, 438954 markings/sec, 125 secs
lola: 78545039 markings, 136177919 edges, 593968 markings/sec, 130 secs
lola: 81556064 markings, 141196081 edges, 602205 markings/sec, 135 secs
lola: 84279890 markings, 146408617 edges, 544765 markings/sec, 140 secs
lola: 86693166 markings, 151235170 edges, 482655 markings/sec, 145 secs
lola: 89467360 markings, 156380888 edges, 554839 markings/sec, 150 secs
lola: 92546989 markings, 161513335 edges, 615926 markings/sec, 155 secs
lola: 95412370 markings, 166646508 edges, 573076 markings/sec, 160 secs
lola: 97569952 markings, 170961672 edges, 431516 markings/sec, 165 secs
lola: 99558392 markings, 174938553 edges, 397688 markings/sec, 170 secs
lola: 102133312 markings, 179491721 edges, 514984 markings/sec, 175 secs
lola: 104910046 markings, 184119393 edges, 555347 markings/sec, 180 secs
lola: 107761980 markings, 189316645 edges, 570387 markings/sec, 185 secs
lola: 110166088 markings, 194124862 edges, 480822 markings/sec, 190 secs
lola: 112425900 markings, 198644485 edges, 451962 markings/sec, 195 secs
lola: 115709142 markings, 204120957 edges, 656648 markings/sec, 200 secs
lola: 118744650 markings, 209252037 edges, 607102 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((r_active <= p_i1))) AND A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((r_active <= p_i1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_i1 + 1 <= r_active)
lola: processed formula length: 22
lola: 125 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((off <= moved) OR (r_active <= p_i1)) OR X (TRUE))))
lola: processed formula length: 61
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2449711 markings, 6666330 edges, 489942 markings/sec, 0 secs
lola: 3908652 markings, 11675103 edges, 291788 markings/sec, 5 secs
lola: 5179732 markings, 16306901 edges, 254216 markings/sec, 10 secs
lola: 6403743 markings, 20794343 edges, 244802 markings/sec, 15 secs
lola: 7645687 markings, 25362488 edges, 248389 markings/sec, 20 secs
lola: 8880491 markings, 29937494 edges, 246961 markings/sec, 25 secs
lola: 10057360 markings, 34447028 edges, 235374 markings/sec, 30 secs
lola: 11213843 markings, 38895398 edges, 231297 markings/sec, 35 secs
lola: 12338563 markings, 43180591 edges, 224944 markings/sec, 40 secs
lola: 13393893 markings, 47259210 edges, 211066 markings/sec, 45 secs
lola: 14318319 markings, 50873747 edges, 184885 markings/sec, 50 secs
lola: 15265062 markings, 54482103 edges, 189349 markings/sec, 55 secs
lola: 16139163 markings, 57898070 edges, 174820 markings/sec, 60 secs
lola: 16994516 markings, 61268323 edges, 171071 markings/sec, 65 secs
lola: 17834749 markings, 64591276 edges, 168047 markings/sec, 70 secs
lola: 18806592 markings, 68067260 edges, 194369 markings/sec, 75 secs
lola: 19634677 markings, 71297705 edges, 165617 markings/sec, 80 secs
lola: 20421653 markings, 74433042 edges, 157395 markings/sec, 85 secs
lola: 21253205 markings, 77614172 edges, 166310 markings/sec, 90 secs
lola: 22023568 markings, 80672202 edges, 154073 markings/sec, 95 secs
lola: 22767013 markings, 83659973 edges, 148689 markings/sec, 100 secs
lola: 23531588 markings, 86661425 edges, 152915 markings/sec, 105 secs
lola: 24275162 markings, 89618645 edges, 148715 markings/sec, 110 secs
lola: 25067909 markings, 92612249 edges, 158549 markings/sec, 115 secs
lola: 25781840 markings, 95483128 edges, 142786 markings/sec, 120 secs
lola: 26489621 markings, 98329720 edges, 141556 markings/sec, 125 secs
lola: 27186103 markings, 101140931 edges, 139296 markings/sec, 130 secs
lola: 27905278 markings, 103977536 edges, 143835 markings/sec, 135 secs
lola: 28594976 markings, 106760127 edges, 137940 markings/sec, 140 secs
lola: 29292439 markings, 109593517 edges, 139493 markings/sec, 145 secs
lola: 29996918 markings, 112442048 edges, 140896 markings/sec, 150 secs
lola: 30702360 markings, 115300498 edges, 141088 markings/sec, 155 secs
lola: 31406731 markings, 118144213 edges, 140874 markings/sec, 160 secs
lola: 32198477 markings, 121183278 edges, 158349 markings/sec, 165 secs
lola: 32900194 markings, 124042682 edges, 140343 markings/sec, 170 secs
lola: 33625009 markings, 126980356 edges, 144963 markings/sec, 175 secs
lola: 34363037 markings, 129950293 edges, 147606 markings/sec, 180 secs
lola: 35087535 markings, 132899430 edges, 144900 markings/sec, 185 secs
lola: 35851287 markings, 135945946 edges, 152750 markings/sec, 190 secs
lola: 36587007 markings, 138951490 edges, 147144 markings/sec, 195 secs
lola: 37321807 markings, 141962300 edges, 146960 markings/sec, 200 secs
lola: 38068817 markings, 145007363 edges, 149402 markings/sec, 205 secs
lola: 38800996 markings, 148001245 edges, 146436 markings/sec, 210 secs
lola: 39543930 markings, 151028360 edges, 148587 markings/sec, 215 secs
lola: 40283904 markings, 154061895 edges, 147995 markings/sec, 220 secs
lola: 41024177 markings, 157100025 edges, 148055 markings/sec, 225 secs
lola: 41761754 markings, 160131764 edges, 147515 markings/sec, 230 secs
lola: 42518184 markings, 163232876 edges, 151286 markings/sec, 235 secs
lola: 43286982 markings, 166374028 edges, 153760 markings/sec, 240 secs
lola: 44016147 markings, 169399044 edges, 145833 markings/sec, 245 secs
lola: 44771868 markings, 172495809 edges, 151144 markings/sec, 250 secs
lola: 45540062 markings, 175643861 edges, 153639 markings/sec, 255 secs
lola: 46282589 markings, 178732340 edges, 148505 markings/sec, 260 secs
lola: 47045557 markings, 181872991 edges, 152594 markings/sec, 265 secs
lola: 47808800 markings, 185024452 edges, 152649 markings/sec, 270 secs
lola: 48605082 markings, 188207288 edges, 159256 markings/sec, 275 secs
lola: 49373680 markings, 191375048 edges, 153720 markings/sec, 280 secs
lola: 50131493 markings, 194520309 edges, 151563 markings/sec, 285 secs
lola: 50889083 markings, 197673089 edges, 151518 markings/sec, 290 secs
lola: 51660641 markings, 200860821 edges, 154312 markings/sec, 295 secs
lola: 52429598 markings, 204037724 edges, 153791 markings/sec, 300 secs
lola: 53203846 markings, 207239406 edges, 154850 markings/sec, 305 secs
lola: 54066975 markings, 210593770 edges, 172626 markings/sec, 310 secs
lola: 54830794 markings, 213775060 edges, 152764 markings/sec, 315 secs
lola: 55647465 markings, 217082310 edges, 163334 markings/sec, 320 secs
lola: 56447322 markings, 220335982 edges, 159971 markings/sec, 325 secs
lola: 57216558 markings, 223549599 edges, 153847 markings/sec, 330 secs
lola: 57981027 markings, 226741348 edges, 152894 markings/sec, 335 secs
lola: 58759347 markings, 229977553 edges, 155664 markings/sec, 340 secs
lola: 59529119 markings, 233195503 edges, 153954 markings/sec, 345 secs
lola: 60311310 markings, 236441512 edges, 156438 markings/sec, 350 secs
lola: 61072824 markings, 239639219 edges, 152303 markings/sec, 355 secs
lola: 61844829 markings, 242863510 edges, 154401 markings/sec, 360 secs
lola: 62625182 markings, 246113949 edges, 156071 markings/sec, 365 secs
lola: 63386278 markings, 249313067 edges, 152219 markings/sec, 370 secs
lola: 64151304 markings, 252531429 edges, 153005 markings/sec, 375 secs
lola: 64929264 markings, 255776316 edges, 155592 markings/sec, 380 secs
lola: 65702087 markings, 259017042 edges, 154565 markings/sec, 385 secs
lola: 66487651 markings, 262288391 edges, 157113 markings/sec, 390 secs
lola: 67282509 markings, 265583139 edges, 158972 markings/sec, 395 secs
lola: 68048107 markings, 268801898 edges, 153120 markings/sec, 400 secs
lola: 68829288 markings, 272064821 edges, 156236 markings/sec, 405 secs
lola: 69609401 markings, 275333738 edges, 156023 markings/sec, 410 secs
lola: 70374880 markings, 278557397 edges, 153096 markings/sec, 415 secs
lola: 71141506 markings, 281777627 edges, 153325 markings/sec, 420 secs
lola: 71916807 markings, 285029194 edges, 155060 markings/sec, 425 secs
lola: 72696501 markings, 288303385 edges, 155939 markings/sec, 430 secs
lola: 73473913 markings, 291564453 edges, 155482 markings/sec, 435 secs
lola: 74242303 markings, 294805023 edges, 153678 markings/sec, 440 secs
lola: 74999498 markings, 298012027 edges, 151439 markings/sec, 445 secs
lola: 75754753 markings, 301222267 edges, 151051 markings/sec, 450 secs
lola: 76535346 markings, 304525436 edges, 156119 markings/sec, 455 secs
lola: 77331673 markings, 307872723 edges, 159265 markings/sec, 460 secs
lola: 78113176 markings, 311176752 edges, 156301 markings/sec, 465 secs
lola: 78901829 markings, 314515364 edges, 157731 markings/sec, 470 secs
lola: 79705916 markings, 317898640 edges, 160817 markings/sec, 475 secs
lola: 80527167 markings, 321361674 edges, 164250 markings/sec, 480 secs
lola: 81341579 markings, 324795021 edges, 162882 markings/sec, 485 secs
lola: 82168712 markings, 328280547 edges, 165427 markings/sec, 490 secs
lola: 82998315 markings, 331783362 edges, 165921 markings/sec, 495 secs
lola: 83855565 markings, 335331515 edges, 171450 markings/sec, 500 secs
lola: 84674700 markings, 338813535 edges, 163827 markings/sec, 505 secs
lola: 85492416 markings, 342290908 edges, 163543 markings/sec, 510 secs
lola: 86333772 markings, 345812140 edges, 168271 markings/sec, 515 secs
lola: 87216480 markings, 349401110 edges, 176542 markings/sec, 520 secs
lola: 88091217 markings, 352980574 edges, 174947 markings/sec, 525 secs
lola: 88930222 markings, 356472313 edges, 167801 markings/sec, 530 secs
lola: 89744973 markings, 359940827 edges, 162950 markings/sec, 535 secs
lola: 90583641 markings, 363456095 edges, 167734 markings/sec, 540 secs
lola: 91424357 markings, 366963509 edges, 168143 markings/sec, 545 secs
lola: 92237641 markings, 370429164 edges, 162657 markings/sec, 550 secs
lola: 93060581 markings, 373914420 edges, 164588 markings/sec, 555 secs
lola: 93880746 markings, 377389987 edges, 164033 markings/sec, 560 secs
lola: 94685943 markings, 380826726 edges, 161039 markings/sec, 565 secs
lola: 94840848 markings, 381482110 edges, 30981 markings/sec, 570 secs
lola: 94861003 markings, 381567632 edges, 4031 markings/sec, 575 secs
lola: 94861073 markings, 381567921 edges, 14 markings/sec, 580 secs
lola: 94861132 markings, 381568181 edges, 12 markings/sec, 585 secs
lola: 94863090 markings, 381576975 edges, 392 markings/sec, 590 secs
lola: 94864806 markings, 381585163 edges, 343 markings/sec, 595 secs
lola: 94864997 markings, 381585943 edges, 38 markings/sec, 600 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: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no unknown yes no no yes yes no no
lola:
preliminary result: no no no unknown yes yes yes no unknown yes no no yes yes no no
lola: memory consumption: 22748 KB
lola: time consumption: 1384 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590265369084

--------------------
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="RobotManipulation-PT-02000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is RobotManipulation-PT-02000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-oct2-158972938900055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;