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-158972914300610.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914300610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 4.7K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:01 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.6K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 530K 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-10-00
FORMULA_NAME SimpleLoadBal-PT-10-01
FORMULA_NAME SimpleLoadBal-PT-10-02
FORMULA_NAME SimpleLoadBal-PT-10-03
FORMULA_NAME SimpleLoadBal-PT-10-04
FORMULA_NAME SimpleLoadBal-PT-10-05
FORMULA_NAME SimpleLoadBal-PT-10-06
FORMULA_NAME SimpleLoadBal-PT-10-07
FORMULA_NAME SimpleLoadBal-PT-10-08
FORMULA_NAME SimpleLoadBal-PT-10-09
FORMULA_NAME SimpleLoadBal-PT-10-10
FORMULA_NAME SimpleLoadBal-PT-10-11
FORMULA_NAME SimpleLoadBal-PT-10-12
FORMULA_NAME SimpleLoadBal-PT-10-13
FORMULA_NAME SimpleLoadBal-PT-10-14
FORMULA_NAME SimpleLoadBal-PT-10-15

=== Now, execution of the tool begins

BK_START 1589917109337

[2020-05-19 19:38:31] [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:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 19:38:31] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-05-19 19:38:31] [INFO ] Transformed 104 places.
[2020-05-19 19:38:31] [INFO ] Transformed 605 transitions.
[2020-05-19 19:38:31] [INFO ] Parsed PT model containing 104 places and 605 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 452 ms. (steps per millisecond=221 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1]
[2020-05-19 19:38:31] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2020-05-19 19:38:31] [INFO ] Computed 29 place invariants in 13 ms
[2020-05-19 19:38:31] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned sat
[2020-05-19 19:38:31] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:31] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-05-19 19:38:32] [INFO ] State equation strengthened by 221 read => feed constraints.
[2020-05-19 19:38:32] [INFO ] [Real]Added 221 Read/Feed constraints in 63 ms returned sat
[2020-05-19 19:38:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:38:32] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2020-05-19 19:38:32] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:32] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2020-05-19 19:38:32] [INFO ] [Nat]Added 221 Read/Feed constraints in 61 ms returned sat
[2020-05-19 19:38:32] [INFO ] Deduced a trap composed of 13 places in 357 ms
[2020-05-19 19:38:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 392 ms
[2020-05-19 19:38:33] [INFO ] [Real]Absence check using 25 positive place invariants in 158 ms returned sat
[2020-05-19 19:38:33] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:33] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-05-19 19:38:33] [INFO ] [Real]Added 221 Read/Feed constraints in 40 ms returned sat
[2020-05-19 19:38:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:38:33] [INFO ] [Nat]Absence check using 25 positive place invariants in 107 ms returned sat
[2020-05-19 19:38:33] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:34] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2020-05-19 19:38:34] [INFO ] [Nat]Added 221 Read/Feed constraints in 67 ms returned sat
[2020-05-19 19:38:34] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 132 ms.
[2020-05-19 19:38:53] [INFO ] Added : 300 causal constraints over 60 iterations in 18832 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-19 19:38:53] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2020-05-19 19:38:53] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:53] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-05-19 19:38:53] [INFO ] [Real]Added 221 Read/Feed constraints in 49 ms returned sat
[2020-05-19 19:38:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:38:53] [INFO ] [Nat]Absence check using 25 positive place invariants in 64 ms returned sat
[2020-05-19 19:38:53] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-19 19:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:38:54] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2020-05-19 19:38:54] [INFO ] [Nat]Added 221 Read/Feed constraints in 70 ms returned sat
[2020-05-19 19:38:54] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 116 ms.
[2020-05-19 19:39:06] [INFO ] Added : 270 causal constraints over 54 iterations in 12572 ms. Result :sat
[2020-05-19 19:39:06] [INFO ] [Real]Absence check using 25 positive place invariants in 10 ms returned sat
[2020-05-19 19:39:06] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:06] [INFO ] [Real]Absence check using 25 positive place invariants in 36 ms returned sat
[2020-05-19 19:39:06] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:07] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Real]Added 221 Read/Feed constraints in 43 ms returned sat
[2020-05-19 19:39:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:07] [INFO ] [Nat]Absence check using 25 positive place invariants in 109 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:07] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Nat]Added 221 Read/Feed constraints in 49 ms returned sat
[2020-05-19 19:39:07] [INFO ] Deduced a trap composed of 53 places in 115 ms
[2020-05-19 19:39:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 122 ms
[2020-05-19 19:39:07] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:07] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Real]Added 221 Read/Feed constraints in 52 ms returned sat
[2020-05-19 19:39:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:07] [INFO ] [Nat]Absence check using 25 positive place invariants in 21 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-19 19:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:08] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-19 19:39:08] [INFO ] [Nat]Added 221 Read/Feed constraints in 78 ms returned sat
[2020-05-19 19:39:08] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 64 ms.
[2020-05-19 19:39:27] [INFO ] Added : 310 causal constraints over 62 iterations in 19780 ms. Result :unknown
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 163 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:28] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Real]Added 221 Read/Feed constraints in 44 ms returned sat
[2020-05-19 19:39:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:28] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:28] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Nat]Added 221 Read/Feed constraints in 49 ms returned sat
[2020-05-19 19:39:28] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 33 ms.
[2020-05-19 19:39:48] [INFO ] Added : 305 causal constraints over 61 iterations in 19813 ms. Result :unknown
[2020-05-19 19:39:48] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:48] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Real]Added 221 Read/Feed constraints in 45 ms returned sat
[2020-05-19 19:39:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 17 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Added 221 Read/Feed constraints in 77 ms returned sat
[2020-05-19 19:39:49] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 53 ms.
[2020-05-19 19:40:08] [INFO ] Added : 310 causal constraints over 62 iterations in 19661 ms. Result :unknown
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-05-19 19:40:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:40:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 48 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:09] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2020-05-19 19:40:09] [INFO ] [Nat]Added 221 Read/Feed constraints in 100 ms returned sat
[2020-05-19 19:40:09] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-05-19 19:40:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 101 ms
Successfully simplified 14 atomic propositions for a total of 17 simplifications.
[2020-05-19 19:40:09] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-19 19:40:09] [INFO ] Flatten gal took : 155 ms
FORMULA SimpleLoadBal-PT-10-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 19:40:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 19:40:09] [INFO ] Flatten gal took : 43 ms
[2020-05-19 19:40:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 19:40:09] [INFO ] Applying decomposition
[2020-05-19 19:40:10] [INFO ] Flatten gal took : 69 ms
[2020-05-19 19:40:10] [INFO ] Input system was already deterministic with 605 transitions.
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/graph15714208318746587937.txt, -o, /tmp/graph15714208318746587937.bin, -w, /tmp/graph15714208318746587937.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15714208318746587937.bin, -l, -1, -v, -w, /tmp/graph15714208318746587937.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 475 out of 605 initially.
// Phase 1: matrix 475 rows 104 cols
[2020-05-19 19:40:10] [INFO ] Computed 29 place invariants in 16 ms
inv : P_client_idle_1 + P_client_idle_2 + P_client_idle_3 + P_client_idle_4 + P_client_idle_5 + P_client_idle_6 + P_client_idle_7 + P_client_idle_8 + P_client_idle_10 + P_client_request_1 + P_client_request_2 + P_client_request_3 + P_client_request_4 + P_client_request_5 + P_client_request_6 + P_client_request_7 + P_client_request_8 + P_client_request_10 + P_client_ack_1 + P_client_ack_2 + P_client_ack_3 + P_client_ack_4 + P_client_ack_5 + P_client_ack_6 + P_client_ack_7 + P_client_ack_8 + P_client_ack_10 + P_server_idle_1 + P_server_notification_ack_1 + P_server_request_1_2 + P_server_request_2_2 + P_server_request_3_2 + P_server_request_4_2 + P_server_request_5_2 + P_server_request_6_2 + P_server_request_7_2 + P_server_request_8_2 - P_server_request_9_1 + P_server_request_10_2 + P_lb_routing_1_1 + P_lb_routing_1_2 + P_lb_routing_1_3 + P_lb_routing_1_4 + P_lb_routing_1_5 + P_lb_routing_1_6 + P_lb_routing_1_7 + P_lb_routing_1_8 + P_lb_routing_1_10 - P_lb_load_1_0 + P_lb_load_1_2 + 2*P_lb_load_1_3 + 3*P_lb_load_1_4 + 4*P_lb_load_1_5 + 5*P_lb_load_1_6 + 6*P_lb_load_1_7 + 7*P_lb_load_1_8 + 8*P_lb_load_1_9 + 9*P_lb_load_1_10 = 9
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_server_request_3_2 + P_server_request_4_2 + P_server_request_5_2 + P_server_request_6_2 + P_server_request_7_2 + P_server_request_8_2 + P_server_request_9_2 + P_server_request_10_2 + 9*P_lb_load_2_0 + 8*P_lb_load_2_1 + 7*P_lb_load_2_2 + 6*P_lb_load_2_3 + 5*P_lb_load_2_4 + 4*P_lb_load_2_5 + 3*P_lb_load_2_6 + 2*P_lb_load_2_7 + P_lb_load_2_8 - P_lb_load_2_10 = 8
inv : P_client_idle_8 + P_client_waiting_8 = 1
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_client_idle_3 + P_client_waiting_3 = 1
inv : P_client_idle_3 + P_client_request_3 + P_client_ack_3 + P_server_request_3_1 + P_server_request_3_2 + P_lb_routing_1_3 = 1
inv : P_client_idle_4 + P_client_request_4 + P_client_ack_4 + P_server_request_4_1 + P_server_request_4_2 + P_lb_routing_1_4 = 1
inv : P_client_idle_6 + P_client_waiting_6 = 1
inv : P_client_idle_9 + P_client_waiting_9 = 1
inv : -P_client_idle_1 - P_client_idle_2 - P_client_idle_3 - P_client_idle_4 - P_client_idle_5 - P_client_idle_6 - P_client_idle_7 - P_client_idle_8 - P_client_idle_10 - P_client_request_1 - P_client_request_2 - P_client_request_3 - P_client_request_4 - P_client_request_5 - P_client_request_6 - P_client_request_7 - P_client_request_8 - P_client_request_10 - P_client_ack_1 - P_client_ack_2 - P_client_ack_3 - P_client_ack_4 - P_client_ack_5 - P_client_ack_6 - P_client_ack_7 - P_client_ack_8 - P_client_ack_10 + P_server_processed_1 + P_server_notification_1 - P_server_request_1_2 - P_server_request_2_2 - P_server_request_3_2 - P_server_request_4_2 - P_server_request_5_2 - P_server_request_6_2 - P_server_request_7_2 - P_server_request_8_2 + P_server_request_9_1 - P_server_request_10_2 - P_lb_routing_1_1 - P_lb_routing_1_2 - P_lb_routing_1_3 - P_lb_routing_1_4 - P_lb_routing_1_5 - P_lb_routing_1_6 - P_lb_routing_1_7 - P_lb_routing_1_8 - P_lb_routing_1_10 + P_lb_load_1_0 - P_lb_load_1_2 - 2*P_lb_load_1_3 - 3*P_lb_load_1_4 - 4*P_lb_load_1_5 - 5*P_lb_load_1_6 - 6*P_lb_load_1_7 - 7*P_lb_load_1_8 - 8*P_lb_load_1_9 - 9*P_lb_load_1_10 = -8
inv : P_lb_load_1_0 + P_lb_load_1_1 + P_lb_load_1_2 + P_lb_load_1_3 + P_lb_load_1_4 + P_lb_load_1_5 + P_lb_load_1_6 + P_lb_load_1_7 + P_lb_load_1_8 + P_lb_load_1_9 + P_lb_load_1_10 = 1
inv : P_lb_idle_1 + P_lb_routing_1_1 + P_lb_routing_1_2 + P_lb_routing_1_3 + P_lb_routing_1_4 + P_lb_routing_1_5 + P_lb_routing_1_6 + P_lb_routing_1_7 + P_lb_routing_1_8 + P_lb_routing_1_9 + P_lb_routing_1_10 + P_lb_balancing_1 = 1
inv : P_client_idle_2 + P_client_waiting_2 = 1
inv : P_client_idle_5 + P_client_request_5 + P_client_ack_5 + P_server_request_5_1 + P_server_request_5_2 + P_lb_routing_1_5 = 1
inv : P_client_idle_10 + P_client_waiting_10 = 1
inv : P_client_idle_10 + P_client_request_10 + P_client_ack_10 + P_server_request_10_1 + P_server_request_10_2 + P_lb_routing_1_10 = 1
inv : P_client_idle_8 + P_client_request_8 + P_client_ack_8 + P_server_request_8_1 + P_server_request_8_2 + P_lb_routing_1_8 = 1
inv : P_client_idle_5 + P_client_waiting_5 = 1
inv : P_client_idle_6 + P_client_request_6 + P_client_ack_6 + P_server_request_6_1 + P_server_request_6_2 + P_lb_routing_1_6 = 1
inv : P_client_idle_7 + P_client_request_7 + P_client_ack_7 + P_server_request_7_1 + P_server_request_7_2 + P_lb_routing_1_7 = 1
inv : P_server_idle_2 + P_server_notification_ack_2 - P_server_request_1_2 - P_server_request_2_2 - P_server_request_3_2 - P_server_request_4_2 - P_server_request_5_2 - P_server_request_6_2 - P_server_request_7_2 - P_server_request_8_2 - P_server_request_9_2 - P_server_request_10_2 - P_lb_load_2_0 + P_lb_load_2_2 + 2*P_lb_load_2_3 + 3*P_lb_load_2_4 + 4*P_lb_load_2_5 + 5*P_lb_load_2_6 + 6*P_lb_load_2_7 + 7*P_lb_load_2_8 + 8*P_lb_load_2_9 + 9*P_lb_load_2_10 = 0
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_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
inv : P_client_idle_4 + P_client_waiting_4 = 1
inv : P_server_idle_2 + P_server_processed_2 + P_server_notification_2 + P_server_notification_ack_2 = 1
inv : P_client_idle_7 + P_client_waiting_7 = 1
inv : P_client_idle_9 + P_client_request_9 + P_client_ack_9 + P_server_request_9_1 + P_server_request_9_2 + P_lb_routing_1_9 = 1
Total of 29 invariants.
[2020-05-19 19:40:10] [INFO ] Computed 29 place invariants in 17 ms
[2020-05-19 19:40:10] [INFO ] Decomposing Gal with order
[2020-05-19 19:40:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 19:40:10] [INFO ] Removed a total of 1721 redundant transitions.
[2020-05-19 19:40:10] [INFO ] Flatten gal took : 148 ms
[2020-05-19 19:40:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 31 ms.
[2020-05-19 19:40:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-19 19:40:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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]

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 10 LTL properties
Checking formula 0 : !(((!(F(!(G("(((i5.u18.P_lb_routing_1_9>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_4>=1))")))))||(!(F(X((X("(((i5.u18.P_lb_routing_1_9>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_4>=1))"))&&(X("(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_idle_1>=1))&&(i9.u26.P_lb_load_2_5>=1))"))))))))
Formula 0 simplified : !(!F!G"(((i5.u18.P_lb_routing_1_9>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_4>=1))" | !FX(X"(((i5.u18.P_lb_routing_1_9>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_4>=1))" & X"(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_idle_1>=1))&&(i9.u26.P_lb_load_2_5>=1))"))
built 71 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.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 20 ordering constraints for composite.
built 46 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
[2020-05-19 19:40:11] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
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_server_process_5, T_server_process_6, T_server_process_7, T_server_process_8, T_server_process_9, T_server_process_10, T_server_process_11, T_server_process_12, T_server_process_13, T_server_process_14, T_server_process_15, T_server_process_16, T_server_process_17, T_server_process_18, T_server_process_19, T_server_process_20, T_lb_idle_receive_notification_3, T_lb_idle_receive_notification_5, T_lb_idle_receive_notification_7, T_lb_idle_receive_notification_8, T_lb_idle_receive_notification_14, T_lb_idle_receive_notification_16, T_lb_idle_receive_notification_18, T_lb_idle_receive_notification_19, T_lb_no_balance_72, T_lb_no_balance_73, T_lb_balance_to_1_501, T_lb_balance_to_1_502, T_lb_balance_to_1_503, T_lb_balance_to_1_504, T_lb_balance_to_1_505, T_lb_balance_to_1_506, T_lb_balance_to_1_507, T_lb_balance_to_1_508, T_lb_balance_to_1_509, T_lb_balance_to_1_510, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :157/208/40/405
[2020-05-19 19:40:12] [INFO ] Proved 104 variables to be positive in 1885 ms
[2020-05-19 19:40:12] [INFO ] Computing symmetric may disable matrix : 605 transitions.
[2020-05-19 19:40:12] [INFO ] Computation of disable matrix completed :0/605 took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:40:12] [INFO ] Computation of Complete disable matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:40:12] [INFO ] Computing symmetric may enable matrix : 605 transitions.
[2020-05-19 19:40:12] [INFO ] Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
451 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,4.59898,149980,1,0,274828,1216,4367,302253,411,3518,683320
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-10-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X((G(X("((((i1.u16.P_server_request_5_2<1)||(i14.u24.P_lb_balancing_1<1))||(i14.u25.P_lb_load_1_0<1))||(i14.u25.P_lb_load_2_2<1))")))U("(((i10.u19.P_lb_routing_1_2>=1)&&(i14.u25.P_lb_load_1_0>=1))&&(i14.u25.P_lb_load_2_1>=1))")))))
Formula 1 simplified : X(GX"((((i1.u16.P_server_request_5_2<1)||(i14.u24.P_lb_balancing_1<1))||(i14.u25.P_lb_load_1_0<1))||(i14.u25.P_lb_load_2_2<1))" U "(((i10.u19.P_lb_routing_1_2>=1)&&(i14.u25.P_lb_load_1_0>=1))&&(i14.u25.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
397 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,8.57039,260140,1,0,487624,1216,4503,551796,417,3522,1258641
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X(X("((((i11.u20.P_server_request_4_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_0>=1))")))U("(((i8.u14.P_lb_routing_1_1<1)||(i9.u26.P_lb_load_1_4<1))||(i9.u26.P_lb_load_2_4<1))"))))
Formula 2 simplified : !G(XX"((((i11.u20.P_server_request_4_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_0>=1))" U "(((i8.u14.P_lb_routing_1_1<1)||(i9.u26.P_lb_load_1_4<1))||(i9.u26.P_lb_load_2_4<1))")
17 unique states visited
17 strongly connected components in search stack
18 transitions explored
17 items max in DFS search stack
156 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,10.1279,284392,1,0,538810,1224,4815,600779,420,3542,1441387
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X((X(X(F("(((i0.u15.P_lb_routing_1_3>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))"))))U((X("(((i0.u15.P_lb_routing_1_3>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))"))U(X((G("((((i12.u22.P_server_request_8_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i9.u26.P_lb_load_1_5>=1))&&(i14.u25.P_lb_load_2_3>=1))"))||("(i0.u1.P_client_idle_3>=1)"))))))))
Formula 3 simplified : !XX(XXF"(((i0.u15.P_lb_routing_1_3>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))" U (X"(((i0.u15.P_lb_routing_1_3>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))" U X("(i0.u1.P_client_idle_3>=1)" | G"((((i12.u22.P_server_request_8_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i9.u26.P_lb_load_1_5>=1))&&(i14.u25.P_lb_load_2_3>=1))")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
171 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,11.8447,334488,1,0,639750,1224,5092,709176,420,3544,1722994
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(G(X("((((i2.u21.P_server_request_6_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_3>=1))&&(i14.u25.P_lb_load_2_1>=1))"))))&&((G(X("(((i4.u23.P_lb_routing_1_10>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_5>=1))")))||(X("((((i2.u21.P_server_request_6_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_3>=1))&&(i14.u25.P_lb_load_2_1>=1))")))))
Formula 4 simplified : !(!GX"((((i2.u21.P_server_request_6_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_3>=1))&&(i14.u25.P_lb_load_2_1>=1))" & (X"((((i2.u21.P_server_request_6_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_3>=1))&&(i14.u25.P_lb_load_2_1>=1))" | GX"(((i4.u23.P_lb_routing_1_10>=1)&&(i9.u26.P_lb_load_1_4>=1))&&(i9.u26.P_lb_load_2_5>=1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10 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,11.9425,335492,1,0,644082,1224,5131,715338,422,3544,1736726
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(!(F("(((i8.u14.P_lb_routing_1_1<1)||(i14.u25.P_lb_load_1_2<1))||(i14.u25.P_lb_load_2_3<1))"))))||(X("(((i8.u14.P_lb_routing_1_1>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))"))))
Formula 5 simplified : !(G!F"(((i8.u14.P_lb_routing_1_1<1)||(i14.u25.P_lb_load_1_2<1))||(i14.u25.P_lb_load_2_3<1))" | X"(((i8.u14.P_lb_routing_1_1>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=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,11.9446,335748,1,0,644082,1224,5157,715338,427,3546,1736764
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F("((i6.u10.P_server_idle_1>=1)&&(i2.u21.P_server_request_6_1>=1))"))))
Formula 6 simplified : F"((i6.u10.P_server_idle_1>=1)&&(i2.u21.P_server_request_6_1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
171 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,13.652,392244,1,0,771322,1224,5390,833119,427,3546,2054574
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(((i8.u14.P_lb_routing_1_1>=1)&&(i9.u27.P_lb_load_1_6>=1))&&(i9.u26.P_lb_load_2_5>=1))")U("(((i5.u18.P_lb_routing_1_9>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))"))||(((X("((((i0.u15.P_server_request_3_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_1>=1))&&(i14.u25.P_lb_load_2_3>=1))"))&&(F("(((i8.u14.P_lb_routing_1_1>=1)&&(i9.u27.P_lb_load_1_6>=1))&&(i9.u26.P_lb_load_2_5>=1))")))&&(F("((((i0.u15.P_server_request_3_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_1>=1))&&(i14.u25.P_lb_load_2_3>=1))")))))
Formula 7 simplified : !(("(((i8.u14.P_lb_routing_1_1>=1)&&(i9.u27.P_lb_load_1_6>=1))&&(i9.u26.P_lb_load_2_5>=1))" U "(((i5.u18.P_lb_routing_1_9>=1)&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_3>=1))") | (X"((((i0.u15.P_server_request_3_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_1>=1))&&(i14.u25.P_lb_load_2_3>=1))" & F"(((i8.u14.P_lb_routing_1_1>=1)&&(i9.u27.P_lb_load_1_6>=1))&&(i9.u26.P_lb_load_2_5>=1))" & F"((((i0.u15.P_server_request_3_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_1>=1))&&(i14.u25.P_lb_load_2_3>=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,13.6551,392992,1,0,771322,1224,5437,833119,429,3546,2054626
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("(((i4.u23.P_lb_routing_1_10>=1)&&(i14.u25.P_lb_load_1_0>=1))&&(i14.u25.P_lb_load_2_1>=1))"))&&(X("((((i10.u19.P_server_request_2_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.P_lb_load_2_0>=1))"))))
Formula 8 simplified : !(F"(((i4.u23.P_lb_routing_1_10>=1)&&(i14.u25.P_lb_load_1_0>=1))&&(i14.u25.P_lb_load_2_1>=1))" & X"((((i10.u19.P_server_request_2_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_1_2>=1))&&(i14.u25.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
227 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,15.9198,438928,1,0,867626,1224,5468,924256,429,3546,2318721
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-10-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(((X(!(F("(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_2_2>=1))"))))U("((((i10.u19.P_server_request_2_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i9.u26.P_lb_load_1_4>=1))&&(i14.u25.P_lb_load_2_2>=1))"))U("(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_2_2>=1))"))))
Formula 9 simplified : (X!F"(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_2_2>=1))" U "((((i10.u19.P_server_request_2_1>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i9.u26.P_lb_load_1_4>=1))&&(i14.u25.P_lb_load_2_2>=1))") U "(((i7.u12.P_server_notification_2>=1)&&(i14.u24.P_lb_balancing_1>=1))&&(i14.u25.P_lb_load_2_2>=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,15.9231,439448,1,0,867626,1224,5516,924256,429,3546,2318744
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-10-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 19:40:27] [INFO ] Computing symmetric co enabling matrix : 605 transitions.
[2020-05-19 19:40:27] [INFO ] Computation of co-enabling matrix(0/605) took 522 ms. Total solver calls (SAT/UNSAT): 571(519/52)
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:40:29] [INFO ] Built C files in 19659ms 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 1589917229933

--------------------
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-10"
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-10, 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-158972914300610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 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 ;