About the Execution of LoLA for IOTPpurchase-PT-C12M10P15D17
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4276.280 | 4796.00 | 4959.00 | 30.10 | TFTTTTFFFFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550200890.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550200890
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.3K Feb 11 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 7 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 115 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 353 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 5 00:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jan 31 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552684221857
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ IOTPpurchase-PT-C12M10P15D17 @ 3570 seconds
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityCardinality @ IOTPpurchase-PT-C12M10P15D17
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 21:10:21 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= Delivery_p22_1)))",
"processed_size": 29,
"rewrites": 7
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 ((p6_4 <= MerchantOffer_p2)))",
"processed_size": 34,
"rewrites": 8
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((Status_p22_11 <= p4_1) OR (1 <= DeliveryNote_p22_12))))",
"processed_size": 64,
"rewrites": 8
},
"result":
{
"edges": 136,
"markings": 137,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((Organization_p20_2 <= 0) OR (p11_4 + 1 <= p8_3)) AND (3 <= Order_p22_6))))",
"processed_size": 84,
"rewrites": 7
},
"result":
{
"edges": 102,
"markings": 103,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p5_3 + 1 <= DeliveryNote_p22_12) AND ((p5_3 + 1 <= p6_6) OR (DeliveryNote_p22_12 + 1 <= Payment_p20)))))",
"processed_size": 113,
"rewrites": 7
},
"result":
{
"edges": 78,
"markings": 79,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((3 <= p8_3) OR ((3 <= Organization_p21_8) AND (p8_2 <= p6_2))) AND (p8_2 <= Order_p22_6))))",
"processed_size": 100,
"rewrites": 7
},
"result":
{
"edges": 119,
"markings": 120,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((ConsumerOffer_p1 <= 1) OR ((1 <= PaymentHandlerPayment_p5_0) AND (Delivery_p22_8 <= p6_2)) OR (2 <= Organization_p21_2))))",
"processed_size": 132,
"rewrites": 8
},
"result":
{
"edges": 37,
"markings": 38,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((Delivery_p22_1 <= 1) OR (p10_2 + 1 <= BrandList_p11_2) OR (p3_7 <= WhatDeliver_p12_1))))",
"processed_size": 98,
"rewrites": 8
},
"result":
{
"edges": 84,
"markings": 85,
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p3_10 <= OfferResponce_p10) OR (Payment_p20 + 1 <= p3_6) OR (((DeliveryHandlerDelivery_p8_0 <= Status_p21_14) OR (1 <= OfferResponce_p10)) AND ((2 <= Payment_p20))))))",
"processed_size": 178,
"rewrites": 8
},
"result":
{
"edges": 80,
"markings": 81,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((Organization_p20_7 <= ConsumerPayment_p3) AND (Payment_p20 <= 2) AND (3 <= Organization_p21_8) AND (Status_p22_7 <= p4_1))))",
"processed_size": 132,
"rewrites": 7
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1_3) AND (1 <= Status_p20_6) AND ((Organization_p21_8 <= Organization_p21_2) OR (3 <= Status_p21_9)) AND (p11_11 <= p5_4))))",
"processed_size": 139,
"rewrites": 7
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p6_3 <= Status_p21_9) OR (p12_4 <= p3_8) OR ((Organization_p21_2 <= BrandSelection_p11_5) AND (2 <= p6_5)) OR (1 <= p6_2))))",
"processed_size": 135,
"rewrites": 8
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= PaySchemeData_p21_6) OR (p3_8 <= p6_7) OR ((Status_p20_6 <= DeliveryHandlerDelivery_p8_0) AND (1 <= p11_13))) AND ((DeliveryResponse_p12_6 <= DeliveryNote_p22_14) OR (PayReceipt_p21_15 <= Payment_p20) OR (2 <= Organization_p22_9)))))",
"processed_size": 251,
"rewrites": 8
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F (((Status_p21_9 <= Status_p22_11) AND (Organization_p20_2 <= p3_4) AND (p4_3 <= Status_p22_7) AND (Order_p20_8 <= p6_5) AND (p6_7 <= Delivery_p20_10) AND (PaymentAmount_p11_6 <= WhatDeliver_p12_1) AND (3 <= Delivery_p22_8) AND (p11_13 <= MerchantPayment_p4_0))))",
"processed_size": 267,
"rewrites": 7
},
"result":
{
"edges": 116,
"markings": 117,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25952,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : FALSE : E(F(**)) : TRUE : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 224,
"conflict_clusters": 44,
"places": 111,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "yes no yes yes yes yes no no no no yes no yes yes no no ",
"value": "yes no yes yes yes yes no no no no yes 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: 156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p11_13)
lola: place invariant simplifies atomic proposition
lola: before: (Payment_p21_7 <= Status_p21_9)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= p12_3)
lola: E (F ((((3 <= p8_3) OR ((3 <= Organization_p21_8) AND (p8_2 <= p6_2))) AND (p8_2 <= Order_p22_6)))) : A (G ((p6_4 <= MerchantOffer_p2))) : E (F ((((Organization_p20_2 <= 0) OR (p11_4 + 1 <= p8_3)) AND (3 <= Order_p22_6)))) : E (F (((Status_p21_9 <= Status_p22_11) AND (Organization_p20_2 <= p3_4) AND (p4_3 <= Status_p22_7) AND (Order_p20_8 <= p6_5) AND (p6_7 <= Delivery_p20_10) AND (PaymentAmount_p11_6 <= WhatDeliver_p12_1) AND (3 <= Delivery_p22_8) AND (p11_13 <= MerchantPayment_p4_0)))) : E (F (((1 <= p1_3) AND (1 <= Status_p20_6) AND ((Organization_p21_8 <= Organization_p21_2) OR (3 <= Status_p21_9)) AND (p11_11 <= p5_4)))) : E (F (((p5_3 + 1 <= DeliveryNote_p22_12) AND ((p5_3 + 1 <= p6_6) OR (DeliveryNote_p22_12 + 1 <= Payment_p20))))) : A (G (((p6_3 <= Status_p21_9) OR (p12_4 <= p3_8) OR ((Organization_p21_2 <= BrandSelection_p11_5) AND (2 <= p6_5)) OR (1 <= p6_2)))) : A (G (((ConsumerOffer_p1 <= 1) OR ((1 <= PaymentHandlerPayment_p5_0) AND (Delivery_p22_8 <= p6_2)) OR (2 <= Organization_p21_2)))) : A (G (((p3_10 <= OfferResponce_p10) OR (Payment_p20 + 1 <= p3_6) OR (((DeliveryHandlerDelivery_p8_0 <= Status_p21_14) OR (1 <= OfferResponce_p10)) AND ((2 <= Payment_p20)))))) : A (G (((Status_p22_11 <= p4_1) OR (1 <= DeliveryNote_p22_12)))) : E (F (((Organization_p20_7 <= ConsumerPayment_p3) AND (Payment_p20 <= 2) AND (3 <= Organization_p21_8) AND (Status_p22_7 <= p4_1)))) : E (F ((3 <= p12_3))) : E (F ((2 <= Delivery_p22_1))) : A (G ((0 <= 0))) : A (G (((Delivery_p22_1 <= 1) OR (p10_2 + 1 <= BrandList_p11_2) OR (p3_7 <= WhatDeliver_p12_1)))) : A (G ((((1 <= PaySchemeData_p21_6) OR (p3_8 <= p6_7) OR ((Status_p20_6 <= DeliveryHandlerDelivery_p8_0) AND (1 <= p11_13))) AND ((DeliveryResponse_p12_6 <= DeliveryNote_p22_14) OR (PayReceipt_p21_15 <= Payment_p20) OR (2 <= Organization_p22_9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ReachabilityCardinality.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 1 will run for 237 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: 6 rewrites
lola: closed formula file ReachabilityCardinality.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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Delivery_p22_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= Delivery_p22_1)))
lola: processed formula length: 29
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= Delivery_p22_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p6_4 <= MerchantOffer_p2)))
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 ((p6_4 <= MerchantOffer_p2)))
lola: processed formula length: 34
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: (MerchantOffer_p2 + 1 <= p6_4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Status_p22_11 <= p4_1) OR (1 <= DeliveryNote_p22_12))))
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 (((Status_p22_11 <= p4_1) OR (1 <= DeliveryNote_p22_12))))
lola: processed formula length: 64
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p4_1 + 1 <= Status_p22_11) AND (DeliveryNote_p22_12 <= 0))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 137 markings, 136 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Organization_p20_2 <= 0) OR (p11_4 + 1 <= p8_3)) AND (3 <= Order_p22_6))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((Organization_p20_2 <= 0) OR (p11_4 + 1 <= p8_3)) AND (3 <= Order_p22_6))))
lola: processed formula length: 84
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((Organization_p20_2 <= 0) OR (p11_4 + 1 <= p8_3)) AND (3 <= Order_p22_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p5_3 + 1 <= DeliveryNote_p22_12) AND ((p5_3 + 1 <= p6_6) OR (DeliveryNote_p22_12 + 1 <= Payment_p20)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p5_3 + 1 <= DeliveryNote_p22_12) AND ((p5_3 + 1 <= p6_6) OR (DeliveryNote_p22_12 + 1 <= Payment_p20)))))
lola: processed formula length: 113
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p5_3 + 1 <= DeliveryNote_p22_12) AND ((p5_3 + 1 <= p6_6) OR (DeliveryNote_p22_12 + 1 <= Payment_p20)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p8_3) OR ((3 <= Organization_p21_8) AND (p8_2 <= p6_2))) AND (p8_2 <= Order_p22_6))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((3 <= p8_3) OR ((3 <= Organization_p21_8) AND (p8_2 <= p6_2))) AND (p8_2 <= Order_p22_6))))
lola: processed formula length: 100
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((3 <= p8_3) OR ((3 <= Organization_p21_8) AND (p8_2 <= p6_2))) AND (p8_2 <= Order_p22_6))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 120 markings, 119 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ConsumerOffer_p1 <= 1) OR ((1 <= PaymentHandlerPayment_p5_0) AND (Delivery_p22_8 <= p6_2)) OR (2 <= Organization_p21_2))))
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 (((ConsumerOffer_p1 <= 1) OR ((1 <= PaymentHandlerPayment_p5_0) AND (Delivery_p22_8 <= p6_2)) OR (2 <= Organization_p21_2))))
lola: processed formula length: 132
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((2 <= ConsumerOffer_p1) AND ((PaymentHandlerPayment_p5_0 <= 0) OR (p6_2 + 1 <= Delivery_p22_8)) AND (Organization_p21_2 <= 1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Delivery_p22_1 <= 1) OR (p10_2 + 1 <= BrandList_p11_2) OR (p3_7 <= WhatDeliver_p12_1))))
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 (((Delivery_p22_1 <= 1) OR (p10_2 + 1 <= BrandList_p11_2) OR (p3_7 <= WhatDeliver_p12_1))))
lola: processed formula length: 98
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((2 <= Delivery_p22_1) AND (BrandList_p11_2 <= p10_2) AND (WhatDeliver_p12_1 + 1 <= p3_7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 85 markings, 84 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3_10 <= OfferResponce_p10) OR (Payment_p20 + 1 <= p3_6) OR (((DeliveryHandlerDelivery_p8_0 <= Status_p21_14) OR (1 <= OfferResponce_p10)) AND ((2 <= Payment_p20))))))
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 (((p3_10 <= OfferResponce_p10) OR (Payment_p20 + 1 <= p3_6) OR (((DeliveryHandlerDelivery_p8_0 <= Status_p21_14) OR (1 <= OfferResponce_p10)) AND ((2 <= Payment_p20))))))
lola: processed formula length: 178
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((OfferResponce_p10 + 1 <= p3_10) AND (p3_6 <= Payment_p20) AND (((Status_p21_14 + 1 <= DeliveryHandlerDelivery_p8_0) AND (OfferResponce_p10 <= 0)) OR ((Payment_p20 <= 1))))
lola: The predicate is not invariant.
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Organization_p20_7 <= ConsumerPayment_p3) AND (Payment_p20 <= 2) AND (3 <= Organization_p21_8) AND (Status_p22_7 <= p4_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Organization_p20_7 <= ConsumerPayment_p3) AND (Payment_p20 <= 2) AND (3 <= Organization_p21_8) AND (Status_p22_7 <= p4_1))))
lola: processed formula length: 132
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Organization_p20_7 <= ConsumerPayment_p3) AND (Payment_p20 <= 2) AND (3 <= Organization_p21_8) AND (Status_p22_7 <= p4_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1_3) AND (1 <= Status_p20_6) AND ((Organization_p21_8 <= Organization_p21_2) OR (3 <= Status_p21_9)) AND (p11_11 <= p5_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p1_3) AND (1 <= Status_p20_6) AND ((Organization_p21_8 <= Organization_p21_2) OR (3 <= Status_p21_9)) AND (p11_11 <= p5_4))))
lola: processed formula length: 139
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1_3) AND (1 <= Status_p20_6) AND ((Organization_p21_8 <= Organization_p21_2) OR (3 <= Status_p21_9)) AND (p11_11 <= p5_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6_3 <= Status_p21_9) OR (p12_4 <= p3_8) OR ((Organization_p21_2 <= BrandSelection_p11_5) AND (2 <= p6_5)) OR (1 <= p6_2))))
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 (((p6_3 <= Status_p21_9) OR (p12_4 <= p3_8) OR ((Organization_p21_2 <= BrandSelection_p11_5) AND (2 <= p6_5)) OR (1 <= p6_2))))
lola: processed formula length: 135
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((Status_p21_9 + 1 <= p6_3) AND (p3_8 + 1 <= p12_4) AND ((BrandSelection_p11_5 + 1 <= Organization_p21_2) OR (p6_5 <= 1)) AND (p6_2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= PaySchemeData_p21_6) OR (p3_8 <= p6_7) OR ((Status_p20_6 <= DeliveryHandlerDelivery_p8_0) AND (1 <= p11_13))) AND ((DeliveryResponse_p12_6 <= DeliveryNote_p22_14) OR (PayReceipt_p21_15 <= Payment_p20) OR (2 <= Organization_p22_9)))))
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 <= PaySchemeData_p21_6) OR (p3_8 <= p6_7) OR ((Status_p20_6 <= DeliveryHandlerDelivery_p8_0) AND (1 <= p11_13))) AND ((DeliveryResponse_p12_6 <= DeliveryNote_p22_14) OR (PayReceipt_p21_15 <= Payment_p20) OR (2 <= Organization_p22_9)))))
lola: processed formula length: 251
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: (((PaySchemeData_p21_6 <= 0) AND (p6_7 + 1 <= p3_8) AND ((DeliveryHandlerDelivery_p8_0 + 1 <= Status_p20_6) OR (p11_13 <= 0))) OR ((DeliveryNote_p22_14 + 1 <= DeliveryResponse_p12_6) AND (Payment_p20 + 1 <= PayReceipt_p21_15) AND (Organization_p22_9 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Status_p21_9 <= Status_p22_11) AND (Organization_p20_2 <= p3_4) AND (p4_3 <= Status_p22_7) AND (Order_p20_8 <= p6_5) AND (p6_7 <= Delivery_p20_10) AND (PaymentAmount_p11_6 <= WhatDeliver_p12_1) AND (3 <= Delivery_p22_8) AND (p11_13 <= MerchantPayment_p4_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Status_p21_9 <= Status_p22_11) AND (Organization_p20_2 <= p3_4) AND (p4_3 <= Status_p22_7) AND (Order_p20_8 <= p6_5) AND (p6_7 <= Delivery_p20_10) AND (PaymentAmount_p11_6 <= WhatDeliver_p12_1) AND (3 <= Delivery_p22_8) AND (p11_13 <= MerchantPayment_p4_0))))
lola: processed formula length: 267
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Status_p21_9 <= Status_p22_11) AND (Organization_p20_2 <= p3_4) AND (p4_3 <= Status_p22_7) AND (Order_p20_8 <= p6_5) AND (p6_7 <= Delivery_p20_10) AND (PaymentAmount_p11_6 <= WhatDeliver_p12_1) AND (3 <= Delivery_p22_8) AND (p11_13 <= MerchantPayment_p4_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 117 markings, 116 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no no no no yes no yes yes no no
lola:
preliminary result: yes no yes yes yes yes no no no no yes no yes yes no no
lola: memory consumption: 25952 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552684226653
--------------------
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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-csrt-155246550200890"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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
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 ;