fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r085-csrt-155246555100862
Last Updated
Apr 15, 2019

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
411.170 5289.00 13091.00 117.40 FFFTTFFFFFFFTFTF 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.r085-csrt-155246555100862.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 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 r085-csrt-155246555100862
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.1K Feb 11 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K 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.3K 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.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Jan 31 06:54 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-C01M01P01D01-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-09
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

=== Now, execution of the tool begins

BK_START 1552809196781

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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 : !(("(p7_3>=1)"))
Formula 0 simplified : !"(p7_3>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15 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.18069,20580,1,0,6,13933,20,0,2461,4093,17
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(X(X("(p8_3>=1)")))))
Formula 1 simplified : !GXX"(p8_3>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.185385,21300,1,0,8,14282,26,0,2462,4392,30
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(("(p6_3>=1)")U(("(p3_3>=1)")U("(p7_3>=1)")))))
Formula 2 simplified : !G("(p6_3>=1)" U ("(p3_3>=1)" U "(p7_3>=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.189004,22188,1,0,8,14282,52,0,2480,4393,39
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(F("((DeliveryResponse_p12_6>=1)&&(p6_5>=1))"))))
Formula 3 simplified : !F"((DeliveryResponse_p12_6>=1)&&(p6_5>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
invariant :ConsumerPayment_p3 + -1'MerchantPayment_p4_0 + p1_3 + p10_2 + p11_7 + p3_1 + p3_2 + p3_3 + p3_4 + p3_5 + -1'p4_1 + -1'p4_2 + -1'p4_3 + -1'p4_4 + -1'p4_5 = 1
invariant :DeliveryRequest_p12_5 + -1'p12_7 + -1'p6_5 + p8_1 + p8_2 = -1
invariant :p11_3 + -1'p11_7 + -1'p3_3 + -1'p3_4 + -1'p3_5 + p4_3 + p4_4 + p4_5 = 0
invariant :Delivery_p22_4 + -1'p6_3 + -1'p6_4 = 0
invariant :Organization_p21_8 + -1'p5_1 = 0
invariant :Status_p20 + -1'p2_2 = 0
invariant :PaySchemeData_p11_10 + -1'p11_8 + -1'p3_8 + p5_1 + p5_2 = -1
invariant :HowDeliver_p12_2 + p12_3 = 1
invariant :Organization_p20_2 + -1'p2_2 = 0
invariant :Order_p22_3 + -1'p7_2 = 0
invariant :DeliveryNote_p22_14 + -1'p6_6 = 0
invariant :Status_p21_14 + -1'p3_10 = 0
invariant :Status_p20_6 + -1'p1_3 = 0
invariant :PaidFor_p11_1 + -1'p11_7 + -1'p3_2 + -1'p3_3 + -1'p3_4 + -1'p3_5 + p4_1 + p4_2 + p4_3 + p4_4 + p4_5 = -1
invariant :ConsumerDelivery_p6_0 + MerchantOffer_p2 + MerchantPayment_p4_0 + -1'p11_7 + p12_3 + p2_1 + p2_2 + p3_10 + p3_6 + p3_7 + p3_8 + p3_9 + p4_1 + p4_2 + p4_3 + p4_4 + p4_5 + p6_1 + p6_2 + p7_3 = 1
invariant :DeliveryResponse_p12_6 + p12_7 = 1
invariant :PaymentResponse_p11_12 + -1'p11_8 + -1'p3_8 + -1'p3_9 + p5_1 + p5_2 + p5_3 = -1
invariant :Organization_p22_5 + -1'p6_3 + -1'p6_4 = 0
invariant :Order_p20_8 + -1'p1_3 = 0
invariant :p12_4 + p12_7 + p6_5 + -1'p8_1 + -1'p8_2 = 2
invariant :MerchantDelivery_p4_6 + MerchantOffer_p2 + MerchantPayment_p4_0 + p2_1 + p2_2 + p4_1 + p4_2 + p4_3 + p4_4 + p4_5 + p7_1 + p7_2 + p7_3 = 1
invariant :DeliveryHandlerDelivery_p8_0 + p8_1 + p8_2 + p8_3 = 1
invariant :Delivery_p22_1 + -1'p7_2 = 0
invariant :Delivery_p20 + -1'p2_2 = 0
invariant :PaymentHandlerPayment_p5_0 + p5_1 + p5_2 + p5_3 + p5_4 = 1
invariant :Organization_p21_4 + -1'p3_6 + -1'p3_7 = 0
invariant :PaymentNote_p21_16 + -1'p3_10 = 0
invariant :Payment_p21_3 + -1'p3_6 + -1'p3_7 = 0
invariant :Organization_p21_2 + -1'p4_5 = 0
invariant :Payment_p20 + -1'p2_2 = 0
invariant :p11_4 + p11_7 + p3_5 + -1'p4_4 + -1'p4_5 = 2
invariant :PaymentAmount_p11_6 + p11_7 = 1
invariant :Status_p22_7 + -1'p6_4 = 0
invariant :DeliveryNote_p22_12 + -1'p8_2 = 0
invariant :Payment_p21_1 + -1'p4_5 = 0
invariant :p11_13 + p11_8 + p3_8 + p3_9 + -1'p5_1 + -1'p5_2 + -1'p5_3 = 2
invariant :PayReceipt_p21_15 + -1'p3_10 = 0
invariant :OfferResponce_p10 + p10_2 = 1
invariant :Order_p22_10 + -1'p8_1 = 0
invariant :PaySchemeData_p21_6 + -1'p3_7 = 0
invariant :Status_p21_11 + -1'p5_3 = 0
invariant :ConsumerOffer_p1 + -1'MerchantOffer_p2 + p1_1 + -1'p10_0 + -1'p12_3 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 + -1'p7_3 = -2
invariant :Status_p21_9 + -1'p5_1 = 0
invariant :Organization_p20_7 + -1'p1_3 = 0
invariant :Status_p21_5 + -1'p3_7 = 0
invariant :Organization_p22_9 + -1'p8_1 = 0
invariant :Status_p22_11 + -1'p8_1 + -1'p8_2 = 0
invariant :PayReceipt_p21_12 + -1'p5_3 = 0
invariant :Payment_p21_7 + -1'p5_1 = 0
invariant :Payment_p20_9 + -1'p1_3 = 0
invariant :p11_11 + p11_8 + p3_8 + -1'p5_1 + -1'p5_2 = 2
invariant :p1_2 + p10_0 + -1'p10_2 + -1'p2_1 + -1'p2_2 = 1
invariant :BrandList_p11_2 + p11_7 + p3_3 + p3_4 + p3_5 + -1'p4_3 + -1'p4_4 + -1'p4_5 = 1
invariant :Delivery_p20_10 + -1'p1_3 = 0
invariant :p12_0 + p12_3 + p6_2 + -1'p7_1 + -1'p7_2 = 2
invariant :Organization_p22_2 + -1'p7_2 = 0
invariant :p11_0 + p11_7 + p3_2 + p3_3 + p3_4 + p3_5 + -1'p4_1 + -1'p4_2 + -1'p4_3 + -1'p4_4 + -1'p4_5 = 2
invariant :OfferRequest_p10 + p10_0 = 1
invariant :Delivery_p22_8 + -1'p8_1 = 0
invariant :Order_p20 + -1'p2_2 = 0
invariant :PaySchemeData_p21_10 + -1'p5_1 + -1'p5_2 = 0
invariant :WhatDeliver_p12_1 + -1'p12_3 + -1'p6_2 + p7_1 + p7_2 = -1
invariant :Order_p22_6 + -1'p6_3 + -1'p6_4 = 0
invariant :Status_p22_13 + -1'p6_6 = 0
invariant :BrandSelection_p11_5 + -1'p11_7 + -1'p3_5 + p4_4 + p4_5 = -1
invariant :PaymentNote_p21_13 + -1'p5_3 = 0
invariant :PaymentRequest_p11_9 + p11_8 = 1
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
8 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.27017,24776,1,0,171,27647,61,42,2484,24477,447
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X((F(X("(p7_1>=1)")))U("(ConsumerOffer_p1>=1)"))))
Formula 4 simplified : !X(FX"(p7_1>=1)" U "(ConsumerOffer_p1>=1)")
60 unique states visited
0 strongly connected components in search stack
89 transitions explored
46 items max in DFS search stack
134 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,1.61736,65000,1,0,2490,179216,72,1056,2486,386986,6079
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(G("(((Status_p22_13>=1)&&(DeliveryNote_p22_14>=1))&&(p6_6>=1))")))))
Formula 5 simplified : !XFG"(((Status_p22_13>=1)&&(DeliveryNote_p22_14>=1))&&(p6_6>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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,1.70565,67620,1,0,2615,190063,85,1142,2493,409180,6555
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X("(p5_4>=1)")))
Formula 6 simplified : !X"(p5_4>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.71004,67620,1,0,2615,190085,88,1142,2494,409362,6559
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(X(G(X(X("((DeliveryResponse_p12_6>=1)&&(p6_5>=1))")))))))
Formula 7 simplified : !GXGXX"((DeliveryResponse_p12_6>=1)&&(p6_5>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,1.71312,67844,1,0,2616,190222,91,1142,2494,409571,6569
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F((("((((Payment_p21_1>=1)&&(Organization_p21_2>=1))&&(p4_5>=1))&&(p11_7>=1))")U("((((p5_1>=1)&&(Status_p21_9>=1))&&(Organization_p21_8>=1))&&(Payment_p21_7>=1))"))U(X(G("((((((Status_p22_7>=1)&&(Order_p22_6>=1))&&(Organization_p22_5>=1))&&(Delivery_p22_4>=1))&&(p6_4>=1))&&(p12_4>=1))"))))))
Formula 8 simplified : !F(("((((Payment_p21_1>=1)&&(Organization_p21_2>=1))&&(p4_5>=1))&&(p11_7>=1))" U "((((p5_1>=1)&&(Status_p21_9>=1))&&(Organization_p21_8>=1))&&(Payment_p21_7>=1))") U XG"((((((Status_p22_7>=1)&&(Order_p22_6>=1))&&(Organization_p22_5>=1))&&(Delivery_p22_4>=1))&&(p6_4>=1))&&(p12_4>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
22 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,1.93489,70648,1,0,2723,201375,104,1235,2510,430864,7054
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(p6_3>=1)"))
Formula 9 simplified : !"(p6_3>=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,1.93552,70648,1,0,2723,201375,105,1235,2510,430864,7056
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G((("((p1_2>=1)&&(p10_2>=1))")U("((((((Delivery_p20_10>=1)&&(Payment_p20_9>=1))&&(Order_p20_8>=1))&&(Organization_p20_7>=1))&&(Status_p20_6>=1))&&(p1_3>=1))"))U(("(p6_3>=1)")U("(ConsumerPayment_p3>=1)")))))
Formula 10 simplified : !G(("((p1_2>=1)&&(p10_2>=1))" U "((((((Delivery_p20_10>=1)&&(Payment_p20_9>=1))&&(Order_p20_8>=1))&&(Organization_p20_7>=1))&&(Status_p20_6>=1))&&(p1_3>=1))") U ("(p6_3>=1)" U "(ConsumerPayment_p3>=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,1.94209,71964,1,0,2723,201375,148,1235,2569,430873,7067
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X((X("((MerchantDelivery_p4_6>=1)&&(WhatDeliver_p12_1>=1))"))U(X("((p3_8>=1)&&(PaySchemeData_p11_10>=1))"))))))
Formula 11 simplified : !XX(X"((MerchantDelivery_p4_6>=1)&&(WhatDeliver_p12_1>=1))" U X"((p3_8>=1)&&(PaySchemeData_p11_10>=1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,1.94336,71964,1,0,2723,201375,158,1235,2581,430875,7071
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 : !(((G("((((((Delivery_p20_10>=1)&&(Payment_p20_9>=1))&&(Order_p20_8>=1))&&(Organization_p20_7>=1))&&(Status_p20_6>=1))&&(p1_3>=1))"))U(F(F(F("((p6_1>=1)&&(p12_0>=1))"))))))
Formula 12 simplified : !(G"((((((Delivery_p20_10>=1)&&(Payment_p20_9>=1))&&(Order_p20_8>=1))&&(Organization_p20_7>=1))&&(Status_p20_6>=1))&&(p1_3>=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
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,1.96514,72224,1,0,2784,204757,167,1237,2585,433218,7285
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 : !((G(G("((p3_1>=1)&&(p11_0>=1))"))))
Formula 13 simplified : !G"((p3_1>=1)&&(p11_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,1.96626,72488,1,0,2784,204757,173,1237,2589,433218,7290
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 : !((X((F(F("((MerchantDelivery_p4_6>=1)&&(WhatDeliver_p12_1>=1))")))U(F(X("((((((Status_p22_7>=1)&&(Order_p22_6>=1))&&(Organization_p22_5>=1))&&(Delivery_p22_4>=1))&&(p6_4>=1))&&(p12_4>=1))"))))))
Formula 14 simplified : !X(F"((MerchantDelivery_p4_6>=1)&&(WhatDeliver_p12_1>=1))" U FX"((((((Status_p22_7>=1)&&(Order_p22_6>=1))&&(Organization_p22_5>=1))&&(Delivery_p22_4>=1))&&(p6_4>=1))&&(p12_4>=1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
12 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,2.08592,74332,1,0,2890,210504,179,1273,2589,446371,7638
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 : !((X("((p3_1>=1)&&(p11_0>=1))")))
Formula 15 simplified : !X"((p3_1>=1)&&(p11_0>=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,2.08677,74332,1,0,2890,210504,179,1273,2589,446371,7640
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552809202070

--------------------
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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 17, 2019 7:53:18 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 17, 2019 7:53:18 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 7:53:18 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 63 ms
Mar 17, 2019 7:53:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Mar 17, 2019 7:53:19 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 19 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 33 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 197 ms
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/45 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:53:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
Mar 17, 2019 7:53:21 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 17, 2019 7:53:21 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (= (+ (select s0 78) 0) (select s0 51))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= (+ (select s0 78) 0) (select s0 51))")
[(declare-fun s0 () (Array Int Int)), (assert (= (+ (select s0 78) 0) (select s0 51))), (assert (= (+ (select s0 78) 0) (select s0 27))), (assert (= (+ (select s0 71) 1) (+ (select s0 2) (select s0 17) (select s0 18) (select s0 74) (select s0 77) (select s0 78) (select s0 80) (select s0 85) (select s0 86) (select s0 87) (select s0 88) (select s0 89) (select s0 90) (select s0 91) (select s0 92) (select s0 93) (select s0 98) (select s0 99) (select s0 107)))), (assert (= 1 (+ (select s0 16) (select s0 17) (select s0 18) (select s0 77) (select s0 78) (select s0 89) (select s0 90) (select s0 91) (select s0 92) (select s0 93) (select s0 105) (select s0 106) (select s0 107)))), (assert (= (+ (select s0 78) 0) (select s0 5))), (assert (= (+ (select s0 78) 0) (select s0 40))), (assert (= 1 (+ (select s0 20) (select s0 65)))), (assert (= (+ (select s0 65) (select s0 77) (select s0 78) 1) (+ (select s0 62) (select s0 64)))), (assert (= (+ (select s0 78) 0) (select s0 21))), (assert (and (and (and (and (and (and (>= (select s0 51) 1) (>= (select s0 27) 1)) (>= (select s0 21) 1)) (>= (select s0 40) 1)) (>= (select s0 5) 1)) (>= (select s0 78) 1)) (>= (select s0 20) 1))), (assert (>= (select s0 2) 0)), (assert (>= (select s0 5) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 18) 0)), (assert (>= (select s0 20) 0)), (assert (>= (select s0 21) 0)), (assert (>= (select s0 27) 0)), (assert (>= (select s0 40) 0)), (assert (>= (select s0 51) 0)), (assert (>= (select s0 62) 0)), (assert (>= (select s0 64) 0)), (assert (>= (select s0 65) 0)), (assert (>= (select s0 71) 0)), (assert (>= (select s0 74) 0)), (assert (>= (select s0 77) 0)), (assert (>= (select s0 78) 0)), (assert (>= (select s0 80) 0)), (assert (>= (select s0 85) 0)), (assert (>= (select s0 86) 0)), (assert (>= (select s0 87) 0)), (assert (>= (select s0 88) 0)), (assert (>= (select s0 89) 0)), (assert (>= (select s0 90) 0)), (assert (>= (select s0 91) 0)), (assert (>= (select s0 92) 0)), (assert (>= (select s0 93) 0)), (assert (>= (select s0 98) 0)), (assert (>= (select s0 99) 0)), (assert (>= (select s0 105) 0)), (assert (>= (select s0 106) 0)), (assert (>= (select s0 107) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@20c03e87
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@20c03e87
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:448)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 17, 2019 7:53:21 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2525ms conformant to PINS in folder :/home/mcc/execution

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
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 r085-csrt-155246555100862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;