Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972914300594.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SimpleLoadBal-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914300594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.0K Apr 12 17:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 17:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 20:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 20:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 37K Mar 24 05:38 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 SimpleLoadBal-PT-02-00
FORMULA_NAME SimpleLoadBal-PT-02-01
FORMULA_NAME SimpleLoadBal-PT-02-02
FORMULA_NAME SimpleLoadBal-PT-02-03
FORMULA_NAME SimpleLoadBal-PT-02-04
FORMULA_NAME SimpleLoadBal-PT-02-05
FORMULA_NAME SimpleLoadBal-PT-02-06
FORMULA_NAME SimpleLoadBal-PT-02-07
FORMULA_NAME SimpleLoadBal-PT-02-08
FORMULA_NAME SimpleLoadBal-PT-02-09
FORMULA_NAME SimpleLoadBal-PT-02-10
FORMULA_NAME SimpleLoadBal-PT-02-11
FORMULA_NAME SimpleLoadBal-PT-02-12
FORMULA_NAME SimpleLoadBal-PT-02-13
FORMULA_NAME SimpleLoadBal-PT-02-14
FORMULA_NAME SimpleLoadBal-PT-02-15

=== Now, execution of the tool begins

BK_START 1589916983492

[2020-05-19 19:36:27] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 19:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 19:36:27] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-19 19:36:27] [INFO ] Transformed 32 places.
[2020-05-19 19:36:27] [INFO ] Transformed 45 transitions.
[2020-05-19 19:36:27] [INFO ] Parsed PT model containing 32 places and 45 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 265 ms. (steps per millisecond=377 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-19 19:36:27] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 32 cols
[2020-05-19 19:36:27] [INFO ] Computed 13 place invariants in 3 ms
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-19 19:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-19 19:36:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-19 19:36:28] [INFO ] [Real]Added 13 Read/Feed constraints in 21 ms returned sat
[2020-05-19 19:36:28] [INFO ] Deduced a trap composed of 13 places in 69 ms
[2020-05-19 19:36:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 88 ms
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 19:36:28] [INFO ] [Real]Added 13 Read/Feed constraints in 21 ms returned sat
[2020-05-19 19:36:28] [INFO ] Deduced a trap composed of 13 places in 201 ms
[2020-05-19 19:36:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 217 ms
[2020-05-19 19:36:28] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-19 19:36:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 19:36:28] [INFO ] Flatten gal took : 63 ms
FORMULA SimpleLoadBal-PT-02-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 19:36:28] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2020-05-19 19:36:28] [INFO ] Applying decomposition
[2020-05-19 19:36:28] [INFO ] Flatten gal took : 5 ms
Built C files in :
/home/mcc/execution
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph9972681006378245245.txt, -o, /tmp/graph9972681006378245245.bin, -w, /tmp/graph9972681006378245245.weights], workingDir=null]
[2020-05-19 19:36:29] [INFO ] Input system was already deterministic with 45 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9972681006378245245.bin, -l, -1, -v, -w, /tmp/graph9972681006378245245.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 19:36:29] [INFO ] Decomposing Gal with order
[2020-05-19 19:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 19:36:29] [INFO ] Removed a total of 27 redundant transitions.
[2020-05-19 19:36:29] [INFO ] Flatten gal took : 59 ms
[2020-05-19 19:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2020-05-19 19:36:29] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-19 19:36:29] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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]

Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 35 out of 45 initially.
// Phase 1: matrix 35 rows 32 cols
[2020-05-19 19:36:29] [INFO ] Computed 13 place invariants in 1 ms
inv : P_client_idle_2 + P_client_request_2 + P_client_ack_2 + P_server_request_2_1 + P_server_request_2_2 + P_lb_routing_1_2 = 1
inv : P_server_idle_1 + P_server_notification_ack_1 - P_server_request_1_1 - P_server_request_2_1 + P_lb_load_1_1 + 2*P_lb_load_1_2 = 1
inv : P_lb_load_2_0 + P_lb_load_2_1 + P_lb_load_2_2 = 1
inv : P_server_idle_1 + P_server_waiting_1 + P_server_processed_1 = 1
inv : P_client_idle_1 + P_client_waiting_1 = 1
inv : P_server_processed_2 + P_server_notification_2 + P_server_request_1_2 + P_server_request_2_2 - P_lb_load_2_1 - 2*P_lb_load_2_2 = 0
inv : P_server_processed_1 + P_server_notification_1 + P_server_request_1_1 + P_server_request_2_1 - P_lb_load_1_1 - 2*P_lb_load_1_2 = 0
inv : P_lb_load_1_0 + P_lb_load_1_1 + P_lb_load_1_2 = 1
inv : P_client_idle_2 + P_client_waiting_2 = 1
inv : P_server_idle_2 + P_server_waiting_2 + P_server_processed_2 = 1
inv : P_server_idle_2 + P_server_notification_ack_2 - P_server_request_1_2 - P_server_request_2_2 + P_lb_load_2_1 + 2*P_lb_load_2_2 = 1
inv : P_lb_idle_1 + P_lb_routing_1_1 + P_lb_routing_1_2 + P_lb_balancing_1 = 1
inv : P_client_idle_1 + P_client_request_1 + P_client_ack_1 + P_server_request_1_1 + P_server_request_1_2 + P_lb_routing_1_1 = 1
Total of 13 invariants.
[2020-05-19 19:36:29] [INFO ] Computed 13 place invariants in 2 ms
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 15 LTL properties
Checking formula 0 : !(((!(F("(((i2.u5.P_server_notification_2>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_2_2>=1))")))||(G((!(X("(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_2>=1))&&(u8.P_lb_load_2_1>=1))")))&&("(((i0.u6.P_lb_routing_1_2<1)||(u8.P_lb_load_1_2<1))||(u8.P_lb_load_2_1<1))")))))
Formula 0 simplified : !(!F"(((i2.u5.P_server_notification_2>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_2_2>=1))" | G("(((i0.u6.P_lb_routing_1_2<1)||(u8.P_lb_load_1_2<1))||(u8.P_lb_load_2_1<1))" & !X"(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_2>=1))&&(u8.P_lb_load_2_1>=1))"))
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
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_2, T_lb_idle_receive_notification_6, T_lb_balance_to_1_5, T_lb_balance_to_1_6, u8.T_lb_no_balance_8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/21/9/31
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.174031,20376,1,0,4130,781,594,4409,448,2307,10963
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((((G("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))"))U("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))"))&&(G(X(X("((i3.u2.P_server_idle_1>=1)&&(i0.u6.P_server_request_2_1>=1))")))))&&(F("(i3.u2.P_server_processed_1>=1)")))))
Formula 1 simplified : !F((G"(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))" U "(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))") & GXX"((i3.u2.P_server_idle_1>=1)&&(i0.u6.P_server_request_2_1>=1))" & F"(i3.u2.P_server_processed_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.185808,21248,1,0,4999,781,635,5191,449,2314,13103
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F((((G("(((i2.u5.P_server_notification_2<1)||(u8.P_lb_idle_1<1))||(u8.P_lb_load_2_1<1))"))&&("(i1.u7.P_lb_routing_1_1>=1)"))&&("(u8.P_lb_load_1_1>=1)"))&&("(u8.P_lb_load_2_2>=1)")))&&(G(F((((G("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_2>=1))"))||("(i2.u5.P_server_notification_2<1)"))||("(u8.P_lb_idle_1<1)"))||("(u8.P_lb_load_2_1<1)")))))))
Formula 2 simplified : !G(F("(i1.u7.P_lb_routing_1_1>=1)" & "(u8.P_lb_load_1_1>=1)" & "(u8.P_lb_load_2_2>=1)" & G"(((i2.u5.P_server_notification_2<1)||(u8.P_lb_idle_1<1))||(u8.P_lb_load_2_1<1))") & GF("(i2.u5.P_server_notification_2<1)" | "(u8.P_lb_idle_1<1)" | "(u8.P_lb_load_2_1<1)" | G"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_2>=1))"))
[2020-05-19 19:36:29] [INFO ] Proved 32 variables to be positive in 220 ms
[2020-05-19 19:36:29] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2020-05-19 19:36:29] [INFO ] Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:36:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:36:29] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2020-05-19 19:36:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 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.221739,21716,1,0,6010,816,742,6101,467,2420,15573
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G(("(i0.u0.P_client_idle_2<1)")U("(((i2.u5.P_server_notification_2>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_2_2>=1))"))))&&(F(G(!(F(X("(i0.u0.P_client_idle_2>=1)"))))))))
Formula 3 simplified : !(!G("(i0.u0.P_client_idle_2<1)" U "(((i2.u5.P_server_notification_2>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_2_2>=1))") & FG!FX"(i0.u0.P_client_idle_2>=1)")
9 unique states visited
2 strongly connected components in search stack
10 transitions explored
9 items max in DFS search stack
5 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.264137,22508,1,0,7415,816,790,7866,469,2424,19542
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(X((G("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))"))U("((((i1.u7.P_server_request_1_2>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_2>=1))"))))||(!(F("((i0.u0.P_client_waiting_2>=1)&&(i0.u0.P_client_ack_2>=1))")))))
Formula 4 simplified : !(!X(G"(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))" U "((((i1.u7.P_server_request_1_2>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_2>=1))") | !F"((i0.u0.P_client_waiting_2>=1)&&(i0.u0.P_client_ack_2>=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.266274,22772,1,0,7415,816,855,7866,475,2424,19595
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(F(X("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_1>=1))"))))))
Formula 5 simplified : !FGFX"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_1>=1))"
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.267542,22772,1,0,7460,816,875,7932,477,2424,19693
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(!(F(((F(X(F((X("((i0.u0.P_client_waiting_2>=1)&&(i0.u0.P_client_ack_2>=1))"))||(X("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_2>=1))"))))))&&("(i0.u0.P_client_waiting_2>=1)"))&&("(i0.u0.P_client_ack_2>=1)")))))))
Formula 6 simplified : !XG!F("(i0.u0.P_client_ack_2>=1)" & "(i0.u0.P_client_waiting_2>=1)" & FXF(X"((i0.u0.P_client_waiting_2>=1)&&(i0.u0.P_client_ack_2>=1))" | X"(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_2>=1))"))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.296079,23564,1,0,9722,816,934,10124,484,2426,24839
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(X("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_2>=1))")))&&(X(F("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_2>=1))")))))
Formula 7 simplified : !(FX"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_2>=1))" & XF"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_idle_1>=1))&&(u8.P_lb_load_1_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.301402,23828,1,0,10181,816,946,10531,484,2426,25991
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X((F(X(G("(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))"))))U("(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_0>=1))")))))
Formula 8 simplified : !FX(FXG"(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))" U "(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_0>=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.310399,24092,1,0,10763,816,966,11140,485,2426,27696
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_2>=1))&&(u8.P_lb_load_2_1>=1))"))U(X("((i2.u3.P_server_idle_2>=1)&&(i1.u7.P_server_request_1_2>=1))"))))
Formula 9 simplified : !(F"(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_2>=1))&&(u8.P_lb_load_2_1>=1))" U X"((i2.u3.P_server_idle_2>=1)&&(i1.u7.P_server_request_1_2>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.341541,24884,1,0,11633,816,1014,12043,492,2430,30079
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(G("(i3.u2.P_server_processed_1>=1)")))))
Formula 10 simplified : !XXG"(i3.u2.P_server_processed_1>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.343393,25148,1,0,11685,816,1025,12094,492,2430,30246
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_1>=1))")U(G(((G(X("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))")))||(G(F(X("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))")))))||(X(F("(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))")))))))
Formula 11 simplified : !("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_1>=1))" U G(GX"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))" | GFX"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))" | XF"(((i3.u4.P_server_notification_1>=1)&&(u8.P_lb_balancing_1>=1))&&(u8.P_lb_load_1_2>=1))"))
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.34497,25148,1,0,11705,816,1042,12118,492,2430,30317
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(G(((!(G((((F("(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))"))&&("(i2.u5.P_server_notification_2>=1)"))&&("(u8.P_lb_idle_1>=1)"))&&("(u8.P_lb_load_2_1>=1)"))))&&(F("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_1>=1))")))&&("((i3.u2.P_server_idle_1<1)||(i0.u6.P_server_request_2_1<1))")))))
Formula 12 simplified : !FG("((i3.u2.P_server_idle_1<1)||(i0.u6.P_server_request_2_1<1))" & !G("(i2.u5.P_server_notification_2>=1)" & "(u8.P_lb_idle_1>=1)" & "(u8.P_lb_load_2_1>=1)" & F"(((i0.u6.P_lb_routing_1_2>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_0>=1))") & F"(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_0>=1))&&(u8.P_lb_load_2_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.359333,25412,1,0,12583,816,1059,13087,492,2430,32672
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(F(G(F("(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_2>=1))"))))))
Formula 13 simplified : FGF"(((u8.P_lb_balancing_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_2>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.392031,25676,1,0,13615,816,1085,13893,498,2446,34683
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(!(F((X("(i3.u2.P_server_processed_1>=1)"))U(F(X("(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_1>=1))"))))))))
Formula 14 simplified : !X!F(X"(i3.u2.P_server_processed_1>=1)" U FX"(((i1.u7.P_lb_routing_1_1>=1)&&(u8.P_lb_load_1_1>=1))&&(u8.P_lb_load_2_1>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.401319,26204,1,0,14355,816,1100,14604,500,2446,36780
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-19 19:36:29] [INFO ] Built C files in 791ms conformant to PINS in folder :/home/mcc/execution
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 1589916990413

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="SimpleLoadBal-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-02, 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 r156-oct2-158972914300594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;