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 |
15754.200 | 5929.00 | 10277.00 | 632.60 | FFTFTTFFFFTTTFFF | 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)
.....................
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r212-smll-152732263100319
=====================================================================
--------------------
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 1527959676547
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.201805151631/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.201805151631/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 : !((X("(p5_4>=3)")))
Formula 0 simplified : !X"(p5_4>=3)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20 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.245589,20564,1,0,7,13981,20,0,2459,4095,20
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 : !(("(PaymentResponse_p11_12>=3)"))
Formula 1 simplified : !"(PaymentResponse_p11_12>=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.248699,20992,1,0,7,14283,23,0,2461,4393,24
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 : !((X(F(F("(p3_9>=1)")))))
Formula 2 simplified : !XF"(p3_9>=1)"
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
2 unique states visited
0 strongly connected components in search stack
1 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.288705,22044,1,0,110,19261,32,27,2462,12278,282
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 : !((F((X("(p1_3>=2)"))U(G("(Organization_p21_8>=1)")))))
Formula 3 simplified : !F(X"(p1_3>=2)" U G"(Organization_p21_8>=1)")
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
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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.494882,27328,1,0,314,40728,45,169,2463,55114,866
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X(X(F("(PayReceipt_p21_12<=MerchantDelivery_p4_6)"))))))
Formula 4 simplified : !XXXF"(PayReceipt_p21_12<=MerchantDelivery_p4_6)"
4 unique states visited
0 strongly connected components in search stack
3 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.496297,27572,1,0,315,40728,54,169,2466,55122,873
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(X("(PaySchemeData_p21_6<=p11_0)")))U(F("(ConsumerPayment_p3<=p1_3)"))))
Formula 5 simplified : !(FX"(PaySchemeData_p21_6<=p11_0)" U F"(ConsumerPayment_p3<=p1_3)")
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.497136,27812,1,0,315,40728,63,169,2470,55124,877
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G(G("(ConsumerPayment_p3<=MerchantPayment_p4_0)")))U(F(G("(p6_5<=DeliveryHandlerDelivery_p8_0)")))))
Formula 6 simplified : !(G"(ConsumerPayment_p3<=MerchantPayment_p4_0)" U FG"(p6_5<=DeliveryHandlerDelivery_p8_0)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.715208,31940,1,0,573,59577,76,353,2475,96630,1609
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(F("(Status_p21_14>=2)"))))
Formula 7 simplified : !GF"(Status_p21_14>=2)"
3 unique states visited
3 strongly connected components in search stack
4 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.717471,32200,1,0,573,59602,85,353,2477,96796,1617
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("(p3_3<=p8_2)")))
Formula 8 simplified : !G"(p3_3<=p8_2)"
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.724984,32436,1,0,575,59911,91,355,2481,97398,1656
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G("(p11_4>=2)")))
Formula 9 simplified : !G"(p11_4>=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.7259,32436,1,0,575,59911,97,355,2483,97398,1661
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 : !(("(p10_2<=p5_1)"))
Formula 10 simplified : !"(p10_2<=p5_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.72637,32700,1,0,575,59911,100,355,2487,97400,1663
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 : !((F(F("(Status_p21_5>=1)"))))
Formula 11 simplified : !F"(Status_p21_5>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.737325,32700,1,0,610,61226,109,356,2488,97596,1801
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 : !((X(F(X("(DeliveryNote_p22_12<=p5_3)")))))
Formula 12 simplified : !XFX"(DeliveryNote_p22_12<=p5_3)"
3 unique states visited
0 strongly connected components in search stack
2 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.738021,32964,1,0,610,61226,118,356,2492,97598,1805
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 : !((F((F("(PaymentNote_p21_16>=2)"))U(G("(PaymentNote_p21_13>=2)")))))
Formula 13 simplified : !F(F"(PaymentNote_p21_16>=2)" U G"(PaymentNote_p21_13>=2)")
2 unique states visited
2 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.764646,33320,1,0,617,62620,131,401,2494,101994,2279
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 : !((G(G(("(p1_2>=1)")U("(p11_7>=2)")))))
Formula 14 simplified : !G("(p1_2>=1)" U "(p11_7>=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.767067,33728,1,0,617,62620,147,401,2504,101995,2286
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 : !(("(MerchantDelivery_p4_6>=1)"))
Formula 15 simplified : !"(MerchantDelivery_p4_6>=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.767595,33728,1,0,617,62620,150,401,2505,101995,2288
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, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1527959682476
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /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 -consoleLog -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
Jun 02, 2018 5:14:39 PM 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]
Jun 02, 2018 5:14:39 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 5:14:39 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
Jun 02, 2018 5:14:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Jun 02, 2018 5:14:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 02, 2018 5:14:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Jun 02, 2018 5:14:39 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 82 ms
Jun 02, 2018 5:14:40 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
Jun 02, 2018 5:14:40 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 62 ms
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 335 ms
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Jun 02, 2018 5:14:40 PM 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)
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Jun 02, 2018 5:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:14:40 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (<= (select s1 65) (select s1 94))) with error
Jun 02, 2018 5:14:40 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (>= (select s0 94) 1) (>= (select s0 56) 1)) (>= (select s0 30) 1)) (>= (select s0 44) 1)) (= (store (store (store (store (store s0 44 (- (select s0 44) 1)) 95 (+ (select s0 95) 1)) 30 (- (select s0 30) 1)) 94 (- (select s0 94) 1)) 56 (- (select s0 56) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (and (>= (select s0 94) 1) (>= (select s0 56) 1)) (>= (select s0 30) 1)) (>= (select s0 44) 1)) (= (store (store (store (store (store s0 44 (- (select s0 44) 1)) 95 (+ (select s0 95) 1)) 30 (- (select s0 30) 1)) 94 (- (select s0 94) 1)) 56 (- (select s0 56) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
Jun 02, 2018 5:14:41 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 865ms 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
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
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 r212-smll-152732263100319"
echo "====================================================================="
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 ;