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 |
339.210 | 5967.00 | 11425.00 | 109.20 | FFTTFFFFTFTTTFFF | 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-155246555100861.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-csrt-155246555100861
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552809194002
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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(G(F(X("(Order_p20>=2)"))))))
Formula 0 simplified : !GFX"(Order_p20>=2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.152051,21156,1,0,5,13882,24,0,2462,4138,16
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(X(F("(p3_9>=2)")))))
Formula 1 simplified : !FXF"(p3_9>=2)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.262528,25756,1,0,130,35208,33,81,2464,44102,431
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F("(p11_13>=1)")))
Formula 2 simplified : !F"(p11_13>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.263112,26020,1,0,130,35208,42,81,2465,44102,435
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((G(G("(p3_8<=Payment_p20)")))U(X(F("(PayReceipt_p21_15<=PaymentNote_p21_16)")))))
Formula 3 simplified : !(G"(p3_8<=Payment_p20)" U XF"(PayReceipt_p21_15<=PaymentNote_p21_16)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.264462,26180,1,0,130,35208,51,81,2469,44104,439
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("(p5_3>=3)"))
Formula 4 simplified : !"(p5_3>=3)"
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.265636,26180,1,0,130,35250,56,81,2471,44254,445
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(MerchantOffer_p2<=p8_3)"))
Formula 5 simplified : !"(MerchantOffer_p2<=p8_3)"
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.266044,26180,1,0,130,35250,59,81,2475,44254,447
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((("(p10_2<=HowDeliver_p12_2)")U("(Delivery_p22_1>=1)"))U(F(X("(MerchantOffer_p2>=3)")))))
Formula 6 simplified : !(("(p10_2<=HowDeliver_p12_2)" U "(Delivery_p22_1>=1)") U FX"(MerchantOffer_p2>=3)")
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.275493,26528,1,0,130,35253,68,81,2477,44281,616
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G("(Organization_p22_9>=2)")))
Formula 7 simplified : !G"(Organization_p22_9>=2)"
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.276348,27048,1,0,130,35253,74,81,2479,44282,621
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F(("(p2_2>=3)")U("(BrandSelection_p11_5<=Status_p21_14)")))))
Formula 8 simplified : !GF("(p2_2>=3)" U "(BrandSelection_p11_5<=Status_p21_14)")
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
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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.27996,27048,1,0,136,35428,83,82,2484,44875,640
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G("(p5_2>=3)")))
Formula 9 simplified : !G"(p5_2>=3)"
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
3 unique states visited
invariant :Delivery_p20 + -1'p2_2 = 0
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.280615,27048,1,0,136,35428,89,82,2486,44876,645
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(Delivery_p22_4<=p7_1)")))
Formula 10 simplified : !X"(Delivery_p22_4<=p7_1)"
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
2 unique states visited
invariant :Payment_p21_3 + -1'p3_6 + -1'p3_7 = 0
invariant :Organization_p21_2 + -1'p4_5 = 0
0 strongly connected components in search stack
1 transitions explored
2 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.28109,27048,1,0,136,35428,92,82,2489,44877,647
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(Status_p21_11<=DeliveryResponse_p12_6)")))
Formula 11 simplified : !X"(Status_p21_11<=DeliveryResponse_p12_6)"
invariant :Payment_p20 + -1'p2_2 = 0
2 unique states visited
invariant :p11_4 + p11_7 + p3_5 + -1'p4_4 + -1'p4_5 = 2
0 strongly connected components in search stack
1 transitions explored
2 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.281438,27048,1,0,136,35428,95,82,2492,44879,649
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(PaySchemeData_p21_10<=p4_2)"))
Formula 12 simplified : !"(PaySchemeData_p21_10<=p4_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
1 unique states visited
invariant :PayReceipt_p21_15 + -1'p3_10 = 0
invariant :OfferResponce_p10 + p10_2 = 1
0 strongly connected components in search stack
invariant :Order_p22_10 + -1'p8_1 = 0
0 transitions explored
invariant :PaySchemeData_p21_6 + -1'p3_7 = 0
1 items max in DFS search stack
invariant :Status_p21_11 + -1'p5_3 = 0
0 ticks for the emptiness check
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
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
invariant :Status_p21_5 + -1'p3_7 = 0
STATS,0,0.281873,27048,1,0,136,35428,98,82,2495,44880,651
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(Payment_p21_7>=3)"))
Formula 13 simplified : !"(Payment_p21_7>=3)"
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.282208,27048,1,0,136,35428,101,82,2497,44881,653
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(Delivery_p20>=1)"))
Formula 14 simplified : !"(Delivery_p20>=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.282618,27048,1,0,136,35428,104,82,2498,44882,655
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(G(G("(MerchantOffer_p2<=p1_3)"))))))
Formula 15 simplified : !FXG"(MerchantOffer_p2<=p1_3)"
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
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 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.579322,36320,1,0,472,78109,117,325,2502,138271,1574
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552809199969
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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:15 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:15 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 44 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Mar 17, 2019 7:53:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 53 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 44 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 232 ms
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Mar 17, 2019 7:53:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:53:16 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:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Mar 17, 2019 7:53:16 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:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
Mar 17, 2019 7:53:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1552 ms. Total solver calls (SAT/UNSAT): 351(227/124)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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:19 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3295ms 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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r085-csrt-155246555100861"
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 [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;