About the Execution of 2019-Gold for AirplaneLD-PT-0020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4276.410 | 11037.00 | 11435.00 | 40.00 | TTTFTTTFTTFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r015-smll-158897552700063.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is AirplaneLD-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-smll-158897552700063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 12K Mar 24 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 24 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Mar 24 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 24 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 24 06:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 169K Mar 24 05:37 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 AirplaneLD-PT-0020-00
FORMULA_NAME AirplaneLD-PT-0020-01
FORMULA_NAME AirplaneLD-PT-0020-02
FORMULA_NAME AirplaneLD-PT-0020-03
FORMULA_NAME AirplaneLD-PT-0020-04
FORMULA_NAME AirplaneLD-PT-0020-05
FORMULA_NAME AirplaneLD-PT-0020-06
FORMULA_NAME AirplaneLD-PT-0020-07
FORMULA_NAME AirplaneLD-PT-0020-08
FORMULA_NAME AirplaneLD-PT-0020-09
FORMULA_NAME AirplaneLD-PT-0020-10
FORMULA_NAME AirplaneLD-PT-0020-11
FORMULA_NAME AirplaneLD-PT-0020-12
FORMULA_NAME AirplaneLD-PT-0020-13
FORMULA_NAME AirplaneLD-PT-0020-14
FORMULA_NAME AirplaneLD-PT-0020-15
=== Now, execution of the tool begins
BK_START 1589260013733
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AirplaneLD-PT-0020 @ 3570 seconds
FORMULA AirplaneLD-PT-0020-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLCardinality @ AirplaneLD-PT-0020
{
"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": "Tue May 12 05:06:53 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(stp5 <= P5)",
"processed_size": 12,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((stp3 <= P4)) AND (X (F ((stp1 <= Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_Wheel_12 + Speed_Right_Wheel_11 + Speed_Right_Wheel_10))) OR (stp3 <= P4))))))",
"processed_size": 519,
"rewrites": 146
},
"result":
{
"edges": 2500646,
"markings": 986263,
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (F (((1 <= stp4) OR X (TRUE))))))",
"processed_size": 41,
"rewrites": 146
},
"result":
{
"edges": 46534,
"markings": 23331,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 444
},
"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 ((Plane_On_Ground_Signal_no_T <= stp3)))",
"processed_size": 45,
"rewrites": 148
},
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((stp1 + 1 <= stp2) AND (P2 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))))",
"processed_size": 85,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(P4 + 1 <= stp4)",
"processed_size": 16,
"rewrites": 148
},
"result":
{
"edges": 3672,
"markings": 3313,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 61
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"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 ((stp3 <= Plane_On_Ground_Signal_no_F))))",
"processed_size": 49,
"rewrites": 146
},
"result":
{
"edges": 261916,
"markings": 132227,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 889
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((P3 <= 0) OR (G ((1 <= stp3)) AND F ((P3 <= 0)))))",
"processed_size": 54,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((G ((P3 + 1 <= stp2)) R ((P3 <= 0) R (P1 <= 0))))",
"processed_size": 52,
"rewrites": 146
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (F (((P6 + 1 <= Weight_Right_Wheel_off) AND G ((Weight_Right_Wheel_off <= stp2))))))",
"processed_size": 89,
"rewrites": 146
},
"result":
{
"edges": 15,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3559
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(stp1 + 1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)",
"processed_size": 58,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"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": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(stp1 + 1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)",
"processed_size": 58,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "A (((Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_Wheel_12 + Speed_Right_Wheel_11 + Speed_Right_Wheel_10 <= P4) OR G ((Weight_Left_Wheel_on + Weight_Left_Wheel_off <= stp1))))",
"processed_size": 524,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24168,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(G((F(**) AND (X(F(**)) OR **))))) : A(X(X(F((** OR X(TRUE)))))) : TRUE : FALSE : A(F(**)) : TRUE : (A((* OR G(*))) AND A(F(**))) : A(G(*)) : TRUE : A(G(F(**))) : A(G(F((* AND G(*))))) : ** : A((G(*) R (* R *))) : A((** OR (G(**) AND F(**)))) : TRUE : A(G(**))"
},
"net":
{
"arcs": 638,
"conflict_clusters": 11,
"places": 159,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 168
},
"result":
{
"preliminary_value": "yes yes yes no yes yes yes no yes yes no no no yes yes no ",
"value": "yes yes yes no yes yes yes no yes yes no no no 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: 327/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 159
lola: finding significant places
lola: 159 places, 168 transitions, 94 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: place invariant simplifies atomic proposition
lola: before: (stp4 <= SpeedPossibleVal_20 + SpeedPossibleVal_19 + SpeedPossibleVal_18 + SpeedPossibleVal_17 + SpeedPossibleVal_16 + SpeedPossibleVal_15 + SpeedPossibleVal_14 + SpeedPossibleVal_13 + SpeedPossibleVal_12 + SpeedPossibleVal_11 + SpeedPossibleVal_10 + SpeedPossibleVal_9 + SpeedPossibleVal_8 + SpeedPossibleVal_7 + SpeedPossibleVal_6 + SpeedPossibleVal_5 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1)
lola: after: (stp4 <= 20)
lola: LP says that atomic proposition is always true: (stp4 <= 20)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= AltitudePossibleVal_40 + AltitudePossibleVal_39 + AltitudePossibleVal_38 + AltitudePossibleVal_37 + AltitudePossibleVal_36 + AltitudePossibleVal_35 + AltitudePossibleVal_34 + AltitudePossibleVal_33 + AltitudePossibleVal_32 + AltitudePossibleVal_31 + AltitudePossibleVal_30 + AltitudePossibleVal_29 + AltitudePossibleVal_28 + AltitudePossibleVal_27 + AltitudePossibleVal_26 + AltitudePossibleVal_25 + AltitudePossibleVal_24 + AltitudePossibleVal_23 + AltitudePossibleVal_22 + AltitudePossibleVal_21 + AltitudePossibleVal_20 + AltitudePossibleVal_19 + AltitudePossibleVal_18 + AltitudePossibleVal_17 + AltitudePossibleVal_16 + AltitudePossibleVal_15 + AltitudePossibleVal_14 + AltitudePossibleVal_13 + AltitudePossibleVal_12 + AltitudePossibleVal_11 + AltitudePossibleVal_10 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1)
lola: after: (0 <= 37)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= AltitudePossibleVal_40 + AltitudePossibleVal_39 + AltitudePossibleVal_38 + AltitudePossibleVal_37 + AltitudePossibleVal_36 + AltitudePossibleVal_35 + AltitudePossibleVal_34 + AltitudePossibleVal_33 + AltitudePossibleVal_32 + AltitudePossibleVal_31 + AltitudePossibleVal_30 + AltitudePossibleVal_29 + AltitudePossibleVal_28 + AltitudePossibleVal_27 + AltitudePossibleVal_26 + AltitudePossibleVal_25 + AltitudePossibleVal_24 + AltitudePossibleVal_23 + AltitudePossibleVal_22 + AltitudePossibleVal_21 + AltitudePossibleVal_20 + AltitudePossibleVal_19 + AltitudePossibleVal_18 + AltitudePossibleVal_17 + AltitudePossibleVal_16 + AltitudePossibleVal_15 + AltitudePossibleVal_14 + AltitudePossibleVal_13 + AltitudePossibleVal_12 + AltitudePossibleVal_11 + AltitudePossibleVal_10 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1)
lola: after: (0 <= 37)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= AltitudePossibleVal_40 + AltitudePossibleVal_39 + AltitudePossibleVal_38 + AltitudePossibleVal_37 + AltitudePossibleVal_36 + AltitudePossibleVal_35 + AltitudePossibleVal_34 + AltitudePossibleVal_33 + AltitudePossibleVal_32 + AltitudePossibleVal_31 + AltitudePossibleVal_30 + AltitudePossibleVal_29 + AltitudePossibleVal_28 + AltitudePossibleVal_27 + AltitudePossibleVal_26 + AltitudePossibleVal_25 + AltitudePossibleVal_24 + AltitudePossibleVal_23 + AltitudePossibleVal_22 + AltitudePossibleVal_21 + AltitudePossibleVal_20 + AltitudePossibleVal_19 + AltitudePossibleVal_18 + AltitudePossibleVal_17 + AltitudePossibleVal_16 + AltitudePossibleVal_15 + AltitudePossibleVal_14 + AltitudePossibleVal_13 + AltitudePossibleVal_12 + AltitudePossibleVal_11 + AltitudePossibleVal_10 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1)
lola: after: (0 <= 37)
lola: place invariant simplifies atomic proposition
lola: before: (WeightPossibleVal_off + WeightPossibleVal_on <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)
lola: after: (2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= AltitudePossibleVal_40 + AltitudePossibleVal_39 + AltitudePossibleVal_38 + AltitudePossibleVal_37 + AltitudePossibleVal_36 + AltitudePossibleVal_35 + AltitudePossibleVal_34 + AltitudePossibleVal_33 + AltitudePossibleVal_32 + AltitudePossibleVal_31 + AltitudePossibleVal_30 + AltitudePossibleVal_29 + AltitudePossibleVal_28 + AltitudePossibleVal_27 + AltitudePossibleVal_26 + AltitudePossibleVal_25 + AltitudePossibleVal_24 + AltitudePossibleVal_23 + AltitudePossibleVal_22 + AltitudePossibleVal_21 + AltitudePossibleVal_20 + AltitudePossibleVal_19 + AltitudePossibleVal_18 + AltitudePossibleVal_17 + AltitudePossibleVal_16 + AltitudePossibleVal_15 + AltitudePossibleVal_14 + AltitudePossibleVal_13 + AltitudePossibleVal_12 + AltitudePossibleVal_11 + AltitudePossibleVal_10 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1)
lola: after: (0 <= 38)
lola: LP says that atomic proposition is always false: (2 <= P1)
lola: place invariant simplifies atomic proposition
lola: before: (TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10 <= SpeedPossibleVal_20 + SpeedPossibleVal_19 + SpeedPossibleVal_18 + SpeedPossibleVal_17 + SpeedPossibleVal_16 + SpeedPossibleVal_15 + SpeedPossibleVal_14 + SpeedPossibleVal_13 + SpeedPossibleVal_12 + SpeedPossibleVal_11 + SpeedPossibleVal_10 + SpeedPossibleVal_9 + SpeedPossibleVal_8 + SpeedPossibleVal_7 + SpeedPossibleVal_6 + SpeedPossibleVal_5 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1)
lola: after: (TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10 <= 20)
lola: LP says that atomic proposition is always true: (TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10 <= 20)
lola: LP says that atomic proposition is always false: (2 <= P1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_20 + SpeedPossibleVal_19 + SpeedPossibleVal_18 + SpeedPossibleVal_17 + SpeedPossibleVal_16 + SpeedPossibleVal_15 + SpeedPossibleVal_14 + SpeedPossibleVal_13 + SpeedPossibleVal_12 + SpeedPossibleVal_11 + SpeedPossibleVal_10 + SpeedPossibleVal_9 + SpeedPossibleVal_8 + SpeedPossibleVal_7 + SpeedPossibleVal_6 + SpeedPossibleVal_5 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 <= stp2)
lola: after: (20 <= stp2)
lola: LP says that atomic proposition is always false: (20 <= stp2)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)
lola: place invariant simplifies atomic proposition
lola: before: (stp5 <= AltitudePossibleVal_35)
lola: after: (stp5 <= 1)
lola: LP says that atomic proposition is always true: (stp5 <= 1)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_26)
lola: LP says that atomic proposition is always false: (2 <= stp1)
lola: LP says that atomic proposition is always false: (2 <= P1)
lola: place invariant simplifies atomic proposition
lola: before: (0 <= WeightPossibleVal_on)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_12 <= P3)
lola: after: (1 <= P3)
lola: A (NOT(F (NOT(F (NOT(F (NOT((X (F ((stp1 <= Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_Wheel_12 + Speed_Right_Wheel_11 + Speed_Right_Wheel_10))) U (stp3 <= P4)))))))))) : A (X (X ((NOT(G ((1 <= stp4))) U F (((1 <= stp4) OR X ((stp4 <= 20)))))))) : A ((X (((0 <= 37) AND G (X (X ((1 <= P6)))))) OR F (()))) : A (F ((2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10))) : A ((G ((X ((2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)) U (0 <= 38))) AND ((0 <= P3) U (stp4 <= P4)))) : A ((F (G (F (G ((P1 <= 1))))) AND ((TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10 <= 20) OR X ((P1 <= 1))))) : A (NOT((((P4 + 1 <= Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_Wheel_12 + Speed_Right_Wheel_11 + Speed_Right_Wheel_10) AND F ((stp1 + 1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))) OR G (NOT((((20 <= stp2) U (Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)) U (Weight_Left_Wheel_on + Weight_Left_Wheel_off <= stp1))))))) : A (G (NOT((G (((0 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10) AND X (X (((0 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10) U (2 <= TheAltitude_40 + TheAltitude_39 + TheAltitude_38 + TheAltitude_37 + TheAltitude_36 + TheAltitude_35 + TheAltitude_34 + TheAltitude_33 + TheAltitude_32 + TheAltitude_31 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_30 + TheAltitude_29 + TheAltitude_28 + TheAltitude_27 + TheAltitude_26 + TheAltitude_25 + TheAltitude_24 + TheAltitude_23 + TheAltitude_22 + TheAltitude_21 + TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_10)))))) U ((stp2 <= stp1) OR (Weight_Left_Wheel_on + Weight_Left_Wheel_off + 1 <= P2)))))) : A ((G ((P2 <= Speed_Left_Wheel_8)) OR F ((stp5 <= 1)))) : A (G (F (X (((stp3 <= Plane_On_Ground_Signal_no_F) AND F ((0 <= Weight_Left_Wheel_on))))))) : A (NOT(((F (X ((2 <= TheAltitude_26))) U NOT(X ((2 <= stp1)))) U G (((Weight_Right_Wheel_off <= P6) OR F ((stp2 + 1 <= Weight_Right_Wheel_off))))))) : A (((stp5 <= P5) OR G (X (F (X (NOT(X (F (((2 <= P1) U ((0 <= 1) OR F ((stp5 <= P5))))))))))))) : A (NOT((F ((stp2 <= P3)) U ((1 <= P3) U (1 <= P1))))) : A ((G ((1 <= stp3)) U (P3 <= 0))) : A (F ((G ((0 <= stp3)) OR ((1 <= stp1) AND G (X (G ((P3 <= P6)))))))) : A (G ((Plane_On_Ground_Signal_no_T <= stp3)))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:332
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:335
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:371
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (stp5 <= P5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (stp5 <= P5)
lola: processed formula length: 12
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((stp3 <= P4)) AND (X (F ((stp1 <= Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Whe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((stp3 <= P4)) AND (X (F ((stp1 <= Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Whe... (shortened)
lola: processed formula length: 519
lola: 146 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: 874143 markings, 2208408 edges, 174829 markings/sec, 0 secs
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: 986263 markings, 2500646 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((1 <= stp4) OR X (TRUE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((1 <= stp4) OR X (TRUE))))))
lola: processed formula length: 41
lola: 146 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23331 markings, 46534 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Plane_On_Ground_Signal_no_T <= stp3)))
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 ((Plane_On_Ground_Signal_no_T <= stp3)))
lola: processed formula length: 45
lola: 148 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: 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: (stp3 + 1 <= Plane_On_Ground_Signal_no_T)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((stp1 + 1 <= stp2) AND (P2 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))))
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 (((stp1 + 1 <= stp2) AND (P2 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))))
lola: processed formula length: 85
lola: 148 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: 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: ((stp2 <= stp1) OR (Weight_Left_Wheel_on + Weight_Left_Wheel_off + 1 <= P2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((stp4 <= P4)))
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: (P4 + 1 <= stp4)
lola: processed formula length: 16
lola: 148 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: 3313 markings, 3672 edges
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((stp3 <= Plane_On_Ground_Signal_no_F))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((stp3 <= Plane_On_Ground_Signal_no_F))))
lola: processed formula length: 49
lola: 146 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 132227 markings, 261916 edges
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P3 <= 0) OR (G ((1 <= stp3)) AND F ((P3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P3 <= 0) OR (G ((1 <= stp3)) AND F ((P3 <= 0)))))
lola: processed formula length: 54
lola: 146 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: 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 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((P3 + 1 <= stp2)) R ((P3 <= 0) R (P1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((P3 + 1 <= stp2)) R ((P3 <= 0) R (P1 <= 0))))
lola: processed formula length: 52
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((P6 + 1 <= Weight_Right_Wheel_off) AND G ((Weight_Right_Wheel_off <= stp2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P6 + 1 <= Weight_Right_Wheel_off) AND G ((Weight_Right_Wheel_off <= stp2))))))
lola: processed formula length: 89
lola: 146 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: 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: 12 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Weight_Left_Wheel_on + Weight_Left_Wheel_off <= stp1)))
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: (stp1 + 1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)
lola: processed formula length: 58
lola: 148 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: 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 (((Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((Weight_Left_Wheel_on + Weight_Left_Wheel_off <= stp1)))
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: (stp1 + 1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)
lola: processed formula length: 58
lola: 148 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 (((Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_W... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Speed_Right_Wheel_20 + Speed_Right_Wheel_19 + Speed_Right_Wheel_18 + Speed_Right_Wheel_17 + Speed_Right_Wheel_16 + Speed_Right_Wheel_15 + Speed_Right_Wheel_14 + Speed_Right_Wheel_13 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_W... (shortened)
lola: processed formula length: 524
lola: 146 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no yes yes no no no yes yes no
lola:
preliminary result: yes yes yes no yes yes yes no yes yes no no no yes yes no
lola: memory consumption: 24168 KB
lola: time consumption: 11 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589260024770
--------------------
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="AirplaneLD-PT-0020"
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 AirplaneLD-PT-0020, 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 r015-smll-158897552700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0020.tgz
mv AirplaneLD-PT-0020 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 '
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 ;