About the Execution of ITS-Tools for S_SimpleLoadBal-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
254.160 | 3251.00 | 6415.00 | 125.30 | FFFTFTFTFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_SimpleLoadBal-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443435000374
=====================================================================
--------------------
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 SimpleLoadBal-COL-02-LTLCardinality-0
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-1
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-10
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-11
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-12
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-13
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-14
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-15
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-2
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-3
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-4
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-5
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-6
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-7
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-8
FORMULA_NAME SimpleLoadBal-COL-02-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496667565859
Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(G(X(X("(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)>=3"))))))
Formula 0 simplified : !XGXX"(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)>=3"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 32 cols
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
14 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.164266,26968,1,0,104,14111,118,47,1500,13498,122
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("(((((P_lb_load_1_0+P_lb_load_1_1)+P_lb_load_1_2)+P_lb_load_2_0)+P_lb_load_2_1)+P_lb_load_2_2)<=(P_lb_routing_1_1+P_lb_routing_1_2)"))
Formula 1 simplified : !"(((((P_lb_load_1_0+P_lb_load_1_1)+P_lb_load_1_2)+P_lb_load_2_0)+P_lb_load_2_1)+P_lb_load_2_2)<=(P_lb_routing_1_1+P_lb_routing_1_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.166088,27180,1,0,104,14156,121,47,1509,13563,126
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X(F("(P_server_processed_1+P_server_processed_2)>=2")))))
Formula 2 simplified : !FXF"(P_server_processed_1+P_server_processed_2)>=2"
invariant : -1'P_server_waiting_2 + 1'P_server_notification_2 + 1'P_server_notification_ack_2= 0
invariant : 1'P_server_idle_2 + 1'P_server_waiting_2 + 1'P_server_processed_2= 1
invariant : 1'P_client_idle_1 + 1'P_client_request_1 + 1'P_client_ack_1 + 1'P_server_request_1_1 + 1'P_server_request_1_2 + 1'P_lb_routing_1_1= 1
invariant : -1'P_client_idle_1 + -1'P_client_idle_2 + -1'P_client_request_1 + -1'P_client_request_2 + -1'P_client_ack_1 + -1'P_client_ack_2 + -1'P_server_request_1_1 + -1'P_server_request_1_2 + -1'P_server_request_2_1 + -1'P_server_request_2_2 + 1'P_lb_idle_1 + 1'P_lb_balancing_1= -1
invariant : 1'P_client_idle_1 + 1'P_client_waiting_1= 1
invariant : 1'P_server_idle_1 + 1'P_server_waiting_1 + -1'P_server_notification_1 + -1'P_server_request_1_1 + -1'P_server_request_2_1 + -1'P_lb_load_1_0 + 1'P_lb_load_1_2= 0
invariant : 1'P_server_idle_2 + 1'P_server_waiting_2 + -1'P_server_notification_2 + -1'P_server_request_1_2 + -1'P_server_request_2_2 + -1'P_lb_load_2_0 + 1'P_lb_load_2_2= 0
invariant : 1'P_client_idle_2 + 1'P_client_waiting_2= 1
invariant : -1'P_server_waiting_1 + 1'P_server_notification_1 + 1'P_server_notification_ack_1= 0
invariant : -1'P_server_idle_1 + -1'P_server_waiting_1 + 1'P_server_notification_1 + 1'P_server_request_1_1 + 1'P_server_request_2_1 + 2'P_lb_load_1_0 + 1'P_lb_load_1_1= 1
invariant : 1'P_client_idle_2 + 1'P_client_request_2 + 1'P_client_ack_2 + 1'P_server_request_2_1 + 1'P_server_request_2_2 + 1'P_lb_routing_1_2= 1
invariant : -1'P_server_idle_2 + -1'P_server_waiting_2 + 1'P_server_notification_2 + 1'P_server_request_1_2 + 1'P_server_request_2_2 + 2'P_lb_load_2_0 + 1'P_lb_load_2_1= 1
invariant : 1'P_server_idle_1 + 1'P_server_waiting_1 + 1'P_server_processed_1= 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.251575,29684,1,0,155,24356,130,72,1513,30366,258
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(X(G(X("(P_server_waiting_1+P_server_waiting_2)>=2"))))))
Formula 3 simplified : !FXGX"(P_server_waiting_1+P_server_waiting_2)>=2"
3 unique states visited
2 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.255366,30036,1,0,158,24619,135,73,1517,30941,272
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(F(X("(P_client_ack_1+P_client_ack_2)<=(P_client_idle_1+P_client_idle_2)")))))
Formula 4 simplified : !GFX"(P_client_ack_1+P_client_ack_2)<=(P_client_idle_1+P_client_idle_2)"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.284321,31060,1,0,192,27803,144,74,1532,34596,363
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(P_client_request_1+P_client_request_2)>=1"))
Formula 5 simplified : !"(P_client_request_1+P_client_request_2)>=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.284782,31060,1,0,192,27803,147,74,1535,34596,365
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(P_server_notification_1+P_server_notification_2)>=2"))
Formula 6 simplified : !"(P_server_notification_1+P_server_notification_2)>=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.285157,31096,1,0,192,27803,150,74,1538,34597,367
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G("(P_server_notification_1+P_server_notification_2)>=3"))))
Formula 7 simplified : !G"(P_server_notification_1+P_server_notification_2)>=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.285716,31344,1,0,192,27803,156,74,1542,34597,372
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F("(P_server_notification_ack_1+P_server_notification_ack_2)>=3"))))
Formula 8 simplified : !GF"(P_server_notification_ack_1+P_server_notification_ack_2)>=3"
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.287005,31380,1,0,192,27803,165,74,1546,34597,378
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F((F("(P_server_idle_1+P_server_idle_2)>=1"))U(X("(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)<=P_lb_balancing_1")))))
Formula 9 simplified : !F(F"(P_server_idle_1+P_server_idle_2)>=1" U X"(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)<=P_lb_balancing_1")
2 unique states visited
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.287582,31420,1,0,192,27803,174,74,1553,34597,382
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(P_server_waiting_1+P_server_waiting_2)>=1")))
Formula 10 simplified : !X"(P_server_waiting_1+P_server_waiting_2)>=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,0.288493,31424,1,0,192,27823,177,74,1556,34630,386
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(("(((((P_lb_load_1_0+P_lb_load_1_1)+P_lb_load_1_2)+P_lb_load_2_0)+P_lb_load_2_1)+P_lb_load_2_2)<=(P_client_request_1+P_client_request_2)")U(F("(P_server_notification_1+P_server_notification_2)<=(P_server_processed_1+P_server_processed_2)")))))
Formula 11 simplified : !F("(((((P_lb_load_1_0+P_lb_load_1_1)+P_lb_load_1_2)+P_lb_load_2_0)+P_lb_load_2_1)+P_lb_load_2_2)<=(P_client_request_1+P_client_request_2)" U F"(P_server_notification_1+P_server_notification_2)<=(P_server_processed_1+P_server_processed_2)")
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.288899,31436,1,0,192,27823,186,74,1562,34630,390
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F(F(G("(P_client_idle_1+P_client_idle_2)>=1"))))))
Formula 12 simplified : !GFG"(P_client_idle_1+P_client_idle_2)>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.382914,34200,1,0,278,39493,199,117,1566,57560,591
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(P_server_notification_ack_1+P_server_notification_ack_2)<=(P_lb_routing_1_1+P_lb_routing_1_2)"))
Formula 13 simplified : !"(P_server_notification_ack_1+P_server_notification_ack_2)<=(P_lb_routing_1_1+P_lb_routing_1_2)"
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.383413,34204,1,0,278,39493,202,117,1572,57560,593
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)>=2"))
Formula 14 simplified : !"(((P_server_request_1_1+P_server_request_1_2)+P_server_request_2_1)+P_server_request_2_2)>=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.383951,34228,1,0,278,39493,205,117,1577,57561,595
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((("(P_client_waiting_1+P_client_waiting_2)>=2")U("(P_server_waiting_1+P_server_waiting_2)>=1"))U(X("(P_client_idle_1+P_client_idle_2)<=(P_client_request_1+P_client_request_2)"))))
Formula 15 simplified : !(("(P_client_waiting_1+P_client_waiting_2)>=2" U "(P_server_waiting_1+P_server_waiting_2)>=1") U X"(P_client_idle_1+P_client_idle_2)<=(P_client_request_1+P_client_request_2)")
2 unique states visited
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.38693,35660,1,0,278,39493,220,117,1596,57561,603
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496667569110
--------------------
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
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 12:59:27 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 12:59:27 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Jun 05, 2017 12:59:27 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 places.
Jun 05, 2017 12:59:27 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 54 ms
Jun 05, 2017 12:59:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Jun 05, 2017 12:59:28 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 16 ms
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 32 variables to be positive in 97 ms
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/45 took 5 ms. Total solver calls (SAT/UNSAT): 20(5/15)
Jun 05, 2017 12:59:28 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions T_server_process_1, T_server_process_2, T_server_process_3, T_server_process_4, T_lb_idle_receive_notification_3, T_lb_idle_receive_notification_6, T_lb_no_balance_8, T_lb_balance_to_1_5, T_lb_balance_to_1_6, T_lb_balancing_receive_notification_3, T_lb_balancing_receive_notification_5, T_lb_balancing_receive_notification_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/32/12/45
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="S_SimpleLoadBal-PT-02"
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/S_SimpleLoadBal-PT-02.tgz
mv S_SimpleLoadBal-PT-02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_SimpleLoadBal-PT-02, 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 r150-csrt-149443435000374"
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 ;