About the Execution of ITS-Tools for IOTPpurchase-PT-C01M01P01D01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
264.260 | 2825.00 | 4086.00 | 96.40 | TTTFTFTTFFFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486300105
=====================================================================
--------------------
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-C01M01P01D01-LTLFireability-0
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-1
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-15
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-2
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-3
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-4
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-5
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-6
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-7
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-8
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496262618746
Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((((((("Status_p20>=1")&&("Organization_p20_2>=1"))&&("Order_p20>=1"))&&("Payment_p20>=1"))&&("Delivery_p20>=1"))&&("p2_2>=1"))&&("OfferResponce_p10>=1"))))
Formula 0 simplified : !F("Delivery_p20>=1" & "OfferResponce_p10>=1" & "Order_p20>=1" & "Organization_p20_2>=1" & "Payment_p20>=1" & "Status_p20>=1" & "p2_2>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
invariant : -1'PayReceipt_p21_12 + 1'PaymentNote_p21_13= 0
invariant : 1'HowDeliver_p12_2 + 1'p12_3= 1
invariant : -1'Delivery_p22_4 + 1'Organization_p22_5= 0
invariant : -1'PayReceipt_p21_12 + 1'p5_3= 0
invariant : -1'DeliveryNote_p22_14 + 1'Status_p22_13= 0
invariant : 1'PayReceipt_p21_12 + 1'PaySchemeData_p21_10 + 1'PaymentHandlerPayment_p5_0 + 1'p5_4= 1
invariant : -1'Delivery_p22_8 + 1'Order_p22_10= 0
invariant : 1'BrandList_p11_2 + 1'PaidFor_p11_1 + -1'p3_2 + 1'p4_1 + 1'p4_2= 0
invariant : -1'Delivery_p20_10 + 1'Payment_p20_9= 0
invariant : -1'PayReceipt_p21_15 + 1'p3_10= 0
invariant : 1'Delivery_p22_1 + 1'HowDeliver_p12_2 + 1'WhatDeliver_p12_1 + -1'p6_2 + 1'p7_1= 0
invariant : -1'Organization_p21_2 + 1'p4_5= 0
invariant : 1'DeliveryRequest_p12_5 + 1'p12_4= 1
invariant : -1'PaySchemeData_p21_6 + 1'Status_p21_5= 0
invariant : 1'ConsumerOffer_p1 + 1'Delivery_p22_4 + 1'Delivery_p22_8 + 1'DeliveryNote_p22_12 + 1'DeliveryNote_p22_14 + 1'DeliveryRequest_p12_5 + 1'DeliveryResponse_p12_6 + 1'MerchantDelivery_p4_6 + 1'MerchantPayment_p4_0 + 1'OfferResponce_p10 + -1'PaidFor_p11_1 + -1'PaymentAmount_p11_6 + -1'WhatDeliver_p12_1 + 1'p1_1 + 1'p1_2 + 1'p3_2 + 1'p3_3 + 1'p3_4 + 1'p3_5 + 1'p6_2 + 1'p6_7= 2
invariant : -1'Delivery_p20_10 + 1'Organization_p20_7= 0
invariant : -1'Delivery_p22_1 + 1'p7_2= 0
invariant : 1'PaySchemeData_p11_10 + 1'p11_11= 1
invariant : 1'DeliveryResponse_p12_6 + 1'p12_7= 1
invariant : -1'Delivery_p22_1 + 1'Organization_p22_2= 0
invariant : -1'Delivery_p20 + 1'Order_p20= 0
invariant : -1'Delivery_p20_10 + 1'Order_p20_8= 0
invariant : -1'BrandList_p11_2 + -1'BrandSelection_p11_5 + -1'p3_3 + -1'p3_4 + 1'p4_3= 0
invariant : 1'BrandSelection_p11_5 + 1'p11_4= 1
invariant : 1'ConsumerPayment_p3 + 1'Delivery_p20_10 + -1'MerchantPayment_p4_0 + -1'OfferResponce_p10 + 1'PaidFor_p11_1 + 1'p3_1= -1
invariant : 1'Delivery_p22_8 + 1'DeliveryHandlerDelivery_p8_0 + 1'DeliveryNote_p22_12 + 1'p8_3= 1
invariant : 1'BrandList_p11_2 + 1'p11_3= 1
invariant : -1'Delivery_p22_1 + 1'Order_p22_3= 0
invariant : -1'Delivery_p22_8 + 1'Organization_p22_9= 0
invariant : -1'HowDeliver_p12_2 + 1'MerchantDelivery_p4_6 + 1'MerchantOffer_p2 + 1'MerchantPayment_p4_0 + -1'OfferRequest_p10 + 1'OfferResponce_p10 + -1'PaidFor_p11_1 + -1'PaymentAmount_p11_6 + -1'WhatDeliver_p12_1 + 1'p1_2 + 1'p3_2 + 1'p3_3 + 1'p3_4 + 1'p3_5 + 1'p6_2 + 1'p7_3= 2
invariant : -1'Delivery_p22_4 + 1'Order_p22_6= 0
invariant : -1'PayReceipt_p21_12 + 1'Status_p21_11= 0
invariant : -1'Organization_p21_2 + 1'Payment_p21_1= 0
invariant : -1'PayReceipt_p21_12 + 1'PaySchemeData_p11_10 + -1'PaymentResponse_p11_12 + 1'p3_9= 0
invariant : -1'Delivery_p20 + 1'Organization_p20_2= 0
invariant : 1'PaymentAmount_p11_6 + 1'p11_7= 1
invariant : 1'OfferResponce_p10 + 1'p10_2= 1
invariant : 1'PaidFor_p11_1 + 1'p11_0= 1
invariant : -1'Delivery_p20_10 + 1'Status_p20_6= 0
invariant : 1'ConsumerDelivery_p6_0 + -1'MerchantDelivery_p4_6 + 1'Organization_p21_4 + 1'PayReceipt_p21_12 + 1'PayReceipt_p21_15 + 1'PaySchemeData_p21_10 + 1'PaymentAmount_p11_6 + 1'PaymentRequest_p11_9 + 1'PaymentResponse_p11_12 + 1'WhatDeliver_p12_1 + 1'p6_1= 0
invariant : -1'PaySchemeData_p11_10 + -1'PaySchemeData_p21_10 + -1'PaymentRequest_p11_9 + 1'p3_8= 0
invariant : -1'Delivery_p22_8 + 1'p8_1= 0
invariant : 1'Delivery_p20 + 1'OfferRequest_p10 + -1'OfferResponce_p10 + -1'p1_2 + 1'p2_1= -1
invariant : -1'PayReceipt_p21_15 + 1'PaymentNote_p21_16= 0
invariant : 1'Organization_p21_8 + -1'PaySchemeData_p21_10 + 1'p5_2= 0
invariant : -1'Delivery_p20 + 1'p2_2= 0
invariant : -1'Delivery_p20 + 1'Status_p20= 0
invariant : -1'Delivery_p22_8 + -1'DeliveryNote_p22_12 + 1'Status_p22_11= 0
invariant : -1'Delivery_p22_8 + -1'DeliveryNote_p22_12 + -1'DeliveryRequest_p12_5 + -1'DeliveryResponse_p12_6 + 1'p6_5= 0
invariant : -1'Organization_p21_4 + 1'PaySchemeData_p21_6 + 1'p3_6= 0
invariant : -1'Delivery_p20 + 1'Payment_p20= 0
invariant : -1'Organization_p21_8 + 1'Payment_p21_7= 0
invariant : -1'DeliveryNote_p22_14 + 1'p6_6= 0
invariant : 1'OfferRequest_p10 + 1'p10_0= 1
invariant : 1'BrandSelection_p11_5 + 1'Organization_p21_2 + 1'PaymentAmount_p11_6 + -1'p3_5 + 1'p4_4= 0
invariant : 1'WhatDeliver_p12_1 + 1'p12_0= 1
invariant : -1'Organization_p21_4 + 1'Payment_p21_3= 0
invariant : -1'Delivery_p22_4 + 1'Status_p22_7 + 1'p6_3= 0
invariant : -1'DeliveryNote_p22_12 + 1'p8_2= 0
invariant : 1'PaymentResponse_p11_12 + 1'p11_13= 1
invariant : -1'Status_p22_7 + 1'p6_4= 0
invariant : -1'Organization_p21_8 + 1'p5_1= 0
invariant : -1'PayReceipt_p21_15 + 1'Status_p21_14= 0
invariant : -1'PaySchemeData_p21_6 + 1'p3_7= 0
invariant : -1'Delivery_p20_10 + 1'p1_3= 0
invariant : 1'PaymentRequest_p11_9 + 1'p11_8= 1
invariant : -1'Organization_p21_8 + 1'Status_p21_9= 0
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.134271,30692,1,0,18,13166,50,5,2358,3050,43
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(F(F(F("p8_3>=1")))))))
Formula 1 simplified : !GF"p8_3>=1"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.187432,32168,1,0,110,21284,63,6,2485,9757,285
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((("p5_2>=1")&&("PaySchemeData_p21_10>=1"))&&("p11_11>=1")))
Formula 2 simplified : !("PaySchemeData_p21_10>=1" & "p5_2>=1" & "p11_11>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.191831,32464,1,0,110,21475,78,6,2494,9942,291
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("p5_4>=1"))
Formula 3 simplified : !"p5_4>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.192452,32464,1,0,110,21475,81,6,2495,9943,293
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(("p1_1>=1")&&("p10_0>=1"))))
Formula 4 simplified : !G("p1_1>=1" & "p10_0>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.19368,32548,1,0,110,21475,94,6,2502,9944,298
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(F(("p3_4>=1")&&("p11_4>=1"))))))
Formula 5 simplified : !XF("p3_4>=1" & "p11_4>=1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.227662,33152,1,0,154,24769,108,20,2507,14807,426
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(G(X(("MerchantDelivery_p4_6>=1")&&("WhatDeliver_p12_1>=1"))))))
Formula 6 simplified : !GX("MerchantDelivery_p4_6>=1" & "WhatDeliver_p12_1>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.230879,33440,1,0,154,24962,121,20,2514,15067,433
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("DeliveryHandlerDelivery_p8_0>=1")&&("DeliveryRequest_p12_5>=1"))U(X(G(F("p7_3>=1"))))))
Formula 7 simplified : !(("DeliveryHandlerDelivery_p8_0>=1" & "DeliveryRequest_p12_5>=1") U XGF"p7_3>=1")
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.276035,35160,1,0,246,35968,130,21,2515,22865,667
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F("p3_6>=1"))))
Formula 8 simplified : !GF"p3_6>=1"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.320207,37012,1,0,338,43903,139,22,2516,27767,901
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("MerchantDelivery_p4_6>=1")&&("WhatDeliver_p12_1>=1")))
Formula 9 simplified : !("MerchantDelivery_p4_6>=1" & "WhatDeliver_p12_1>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.320751,37272,1,0,338,43903,139,22,2516,27767,903
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F((F(G(((("p3_10>=1")&&("PaymentNote_p21_16>=1"))&&("PayReceipt_p21_15>=1"))&&("Status_p21_14>=1"))))U(F(F(("p6_1>=1")&&("p12_0>=1")))))))
Formula 10 simplified : !F(FG("PayReceipt_p21_15>=1" & "PaymentNote_p21_16>=1" & "Status_p21_14>=1" & "p3_10>=1") U F("p6_1>=1" & "p12_0>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.369946,38240,1,0,439,49226,153,49,2521,36293,1192
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("p7_1>=1"))
Formula 11 simplified : !"p7_1>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.370406,38240,1,0,439,49226,156,49,2522,36293,1194
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(((("DeliveryHandlerDelivery_p8_0>=1")&&("DeliveryRequest_p12_5>=1"))U(("DeliveryResponse_p12_6>=1")&&("p6_5>=1")))U(G(F((("Status_p22_13>=1")&&("DeliveryNote_p22_14>=1"))&&("p6_6>=1")))))))
Formula 12 simplified : !F((("DeliveryHandlerDelivery_p8_0>=1" & "DeliveryRequest_p12_5>=1") U ("DeliveryResponse_p12_6>=1" & "p6_5>=1")) U GF("DeliveryNote_p22_14>=1" & "Status_p22_13>=1" & "p6_6>=1"))
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.403076,39248,1,0,533,54378,175,50,2531,40097,1433
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((("p5_2>=1")&&("PaySchemeData_p21_10>=1"))&&("p11_11>=1")))
Formula 13 simplified : !("PaySchemeData_p21_10>=1" & "p5_2>=1" & "p11_11>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.403607,39508,1,0,533,54378,175,50,2531,40097,1433
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((G(G(X(("p3_1>=1")&&("p11_0>=1")))))U(X(F(X((((("p7_2>=1")&&("p12_3>=1"))&&("Delivery_p22_1>=1"))&&("Organization_p22_2>=1"))&&("Order_p22_3>=1")))))))
Formula 14 simplified : !(GX("p3_1>=1" & "p11_0>=1") U XFX("Delivery_p22_1>=1" & "Order_p22_3>=1" & "Organization_p22_2>=1" & "p7_2>=1" & "p12_3>=1"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.454466,41376,1,0,639,60519,204,82,2548,52610,1738
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((G(("p1_2>=1")&&("p10_2>=1")))U(F(X(((((("p3_7>=1")&&("Payment_p21_3>=1"))&&("Organization_p21_4>=1"))&&("Status_p21_5>=1"))&&("PaySchemeData_p21_6>=1"))&&("p11_8>=1")))))))
Formula 15 simplified : !G(G("p1_2>=1" & "p10_2>=1") U FX("Organization_p21_4>=1" & "PaySchemeData_p21_6>=1" & "Payment_p21_3>=1" & "Status_p21_5>=1" & "p3_7>=1" & "p11_8>=1"))
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.483541,42656,1,0,687,64142,238,83,2569,56451,1972
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496262621571
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 8:30:20 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 8:30:20 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 48 ms
May 31, 2017 8:30:20 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
May 31, 2017 8:30:20 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
May 31, 2017 8:30:20 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 39 ms
May 31, 2017 8:30:20 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
May 31, 2017 8:30:20 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 31, 2017 8:30:20 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 25 ms
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 297 ms
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 2(1/1)
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 121(45/76)
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
May 31, 2017 8:30:21 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 121(49/72)
May 31, 2017 8:30:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
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-C01M01P01D01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r040-blw7-149440486300105"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 ;