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 itstoolsl
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 r213-smll-152732264200320
=====================================================================

--------------------
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 1527941873132

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph7327344198093874263.txt, -o, /tmp/graph7327344198093874263.bin, -w, /tmp/graph7327344198093874263.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph7327344198093874263.bin, -l, -1, -v, -w, /tmp/graph7327344198093874263.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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 : !((X((X(X("((i7.u3.p6_2>=1)&&(i7.u3.HowDeliver_p12_2>=1))")))U(F("((i4.u12.p4_3>=1)&&(i5.u13.BrandSelection_p11_5>=1))")))))
Formula 0 simplified : !X(XX"((i7.u3.p6_2>=1)&&(i7.u3.HowDeliver_p12_2>=1))" U F"((i4.u12.p4_3>=1)&&(i5.u13.BrandSelection_p11_5>=1))")
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.075793,17276,1,0,1101,666,669,895,607,868,3389
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(X(F(X("((((((u20.Status_p22_7>=1)&&(i7.u3.Order_p22_6>=1))&&(i7.u3.Organization_p22_5>=1))&&(i7.u3.Delivery_p22_4>=1))&&(u20.p6_4>=1))&&(u22.p12_4>=1))")))))))
Formula 1 simplified : !GXFX"((((((u20.Status_p22_7>=1)&&(i7.u3.Order_p22_6>=1))&&(i7.u3.Organization_p22_5>=1))&&(i7.u3.Delivery_p22_4>=1))&&(u20.p6_4>=1))&&(u22.p12_4>=1))"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 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.102943,18288,1,0,2535,789,792,2066,628,1507,8144
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((((i5.u18.Payment_p21_1>=1)&&(i5.u18.Organization_p21_2>=1))&&(i5.u18.p4_5>=1))&&(i5.u8.p11_7>=1))"))
Formula 2 simplified : !"((((i5.u18.Payment_p21_1>=1)&&(i5.u18.Organization_p21_2>=1))&&(i5.u18.p4_5>=1))&&(i5.u8.p11_7>=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.105574,18552,1,0,2559,795,821,2102,632,1520,8251
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 USE_NUPN
Checking formula 3 : !((F(X(G(("(i7.u4.p7_3>=1)")U("(i4.u17.p4_1>=1)"))))))
Formula 3 simplified : !FXG("(i7.u4.p7_3>=1)" U "(i4.u17.p4_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.111623,18944,1,0,2755,796,862,2333,634,1559,9023
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((i4.u17.p4_2>=1)&&(i4.u12.p11_3>=1))"))
Formula 4 simplified : !"((i4.u17.p4_2>=1)&&(i4.u12.p11_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.112303,19116,1,0,2755,796,871,2333,634,1559,9032
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("(((((u22.Order_p22_10>=1)&&(u22.Organization_p22_9>=1))&&(u22.Delivery_p22_8>=1))&&(u22.Status_p22_11>=1))&&(u22.p8_1>=1))")))
Formula 5 simplified : !F"(((((u22.Order_p22_10>=1)&&(u22.Organization_p22_9>=1))&&(u22.Delivery_p22_8>=1))&&(u22.Status_p22_11>=1))&&(u22.p8_1>=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.118685,19116,1,0,3163,796,912,2582,651,1581,10244
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("(((u1.Status_p22_13>=1)&&(u1.DeliveryNote_p22_14>=1))&&(u1.p6_6>=1))")))
Formula 6 simplified : !G"(((u1.Status_p22_13>=1)&&(u1.DeliveryNote_p22_14>=1))&&(u1.p6_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.120957,19116,1,0,3163,796,938,2582,660,1581,10268
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 USE_NUPN
Checking formula 7 : !((X(X(X(("(i7.u21.p7_1>=1)")U("(((i3.u19.p5_2>=1)&&(i3.u10.PaySchemeData_p21_10>=1))&&(i2.u7.p11_11>=1))"))))))
Formula 7 simplified : !XXX("(i7.u21.p7_1>=1)" U "(((i3.u19.p5_2>=1)&&(i3.u10.PaySchemeData_p21_10>=1))&&(i2.u7.p11_11>=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,0.123404,19356,1,0,3200,796,959,2619,660,1581,10542
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 USE_NUPN
Checking formula 8 : !((G(G(F(X(G("(u22.p8_3>=1)")))))))
Formula 8 simplified : !GFXG"(u22.p8_3>=1)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 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.140993,19532,1,0,4227,840,977,3900,660,2369,13028
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 USE_NUPN
Checking formula 9 : !(("(i7.u4.p7_3>=1)"))
Formula 9 simplified : !"(i7.u4.p7_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,0.14156,19532,1,0,4227,840,978,3900,660,2369,13032
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 USE_NUPN
Checking formula 10 : !((X(("(i1.u14.p2_1>=1)")U("((i5.u8.p3_5>=1)&&(i5.u8.PaymentAmount_p11_6>=1))"))))
Formula 10 simplified : !X("(i1.u14.p2_1>=1)" U "((i5.u8.p3_5>=1)&&(i5.u8.PaymentAmount_p11_6>=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.142755,19768,1,0,4227,840,1001,3900,664,2369,13063
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 USE_NUPN
Checking formula 11 : !((G(G(G(G("((i7.u4.MerchantOffer_p2>=1)&&(i1.u5.OfferRequest_p10>=1))"))))))
Formula 11 simplified : !G"((i7.u4.MerchantOffer_p2>=1)&&(i1.u5.OfferRequest_p10>=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.144001,19768,1,0,4227,840,1023,3900,664,2369,13088
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 USE_NUPN
Checking formula 12 : !(("(i4.u17.p4_1>=1)"))
Formula 12 simplified : !"(i4.u17.p4_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.144513,19768,1,0,4227,840,1023,3900,664,2369,13094
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G((F("(u20.p6_3>=1)"))U(G("((i1.u14.MerchantPayment_p4_0>=1)&&(i4.u6.PaidFor_p11_1>=1))"))))))
Formula 13 simplified : !G(F"(u20.p6_3>=1)" U G"((i1.u14.MerchantPayment_p4_0>=1)&&(i4.u6.PaidFor_p11_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 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.150852,20272,1,0,4287,840,1066,3951,664,2369,13408
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 USE_NUPN
Checking formula 14 : !(("((i2.u0.p6_1>=1)&&(i7.u11.p12_0>=1))"))
Formula 14 simplified : !"((i2.u0.p6_1>=1)&&(i7.u11.p12_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.151533,20272,1,0,4287,840,1073,3951,664,2369,13424
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(F(("((((u22.p12_7>=1)&&(u22.DeliveryNote_p22_12>=1))&&(u22.Status_p22_11>=1))&&(u22.p8_2>=1))")U("(i5.u16.p3_6>=1)")))))
Formula 15 simplified : !F("((((u22.p12_7>=1)&&(u22.DeliveryNote_p22_12>=1))&&(u22.Status_p22_11>=1))&&(u22.p8_2>=1))" U "(i5.u16.p3_6>=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.155,20272,1,0,4541,840,1098,4047,664,2369,14429
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527941877569

--------------------
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 LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 12:17:55 PM 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/, -louvain, -smt]
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 86 ms
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 02, 2018 12:17:55 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 32 ms
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 12:17:55 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 54 ms
Jun 02, 2018 12:17:56 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Begin: Sat Jun 2 12:17:56 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:17:56 2018
network size: 111 nodes, 496 links, 90 weight
quality increased from -0.011965 to 0.628039
end computation: Sat Jun 2 12:17:56 2018
level 1:
start computation: Sat Jun 2 12:17:56 2018
network size: 23 nodes, 121 links, 90 weight
quality increased from 0.628039 to 0.70705
end computation: Sat Jun 2 12:17:56 2018
level 2:
start computation: Sat Jun 2 12:17:56 2018
network size: 9 nodes, 39 links, 90 weight
quality increased from 0.70705 to 0.712606
end computation: Sat Jun 2 12:17:56 2018
End: Sat Jun 2 12:17:56 2018
Total duration: 0 sec
0.712606
Jun 02, 2018 12:17:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:17:56 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
Jun 02, 2018 12:17:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:17:56 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 12:17:56 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 12:17:56 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Jun 02, 2018 12:17:56 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) with error
Jun 02, 2018 12:17:56 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun _enabledsrc__0 ((src (Array Int Int))) Bool (and (>= (select src 72) 1) (>= (select src 73) 1))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 12:17:56 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 187ms 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="itstoolsl"
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 itstoolsl"
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 r213-smll-152732264200320"
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 '' 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 ;