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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.0K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 17K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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.5K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 153K 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-05-00
FORMULA_NAME SimpleLoadBal-PT-05-01
FORMULA_NAME SimpleLoadBal-PT-05-02
FORMULA_NAME SimpleLoadBal-PT-05-03
FORMULA_NAME SimpleLoadBal-PT-05-04
FORMULA_NAME SimpleLoadBal-PT-05-05
FORMULA_NAME SimpleLoadBal-PT-05-06
FORMULA_NAME SimpleLoadBal-PT-05-07
FORMULA_NAME SimpleLoadBal-PT-05-08
FORMULA_NAME SimpleLoadBal-PT-05-09
FORMULA_NAME SimpleLoadBal-PT-05-10
FORMULA_NAME SimpleLoadBal-PT-05-11
FORMULA_NAME SimpleLoadBal-PT-05-12
FORMULA_NAME SimpleLoadBal-PT-05-13
FORMULA_NAME SimpleLoadBal-PT-05-14
FORMULA_NAME SimpleLoadBal-PT-05-15

=== Now, execution of the tool begins

BK_START 1589917058356

[2020-05-19 19:37:40] [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:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 19:37:40] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-19 19:37:40] [INFO ] Transformed 59 places.
[2020-05-19 19:37:40] [INFO ] Transformed 180 transitions.
[2020-05-19 19:37:40] [INFO ] Parsed PT model containing 59 places and 180 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 238 ms. (steps per millisecond=420 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0]
[2020-05-19 19:37:40] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2020-05-19 19:37:40] [INFO ] Computed 19 place invariants in 7 ms
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 5 ms returned unsat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:40] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 19:37:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-05-19 19:37:40] [INFO ] [Real]Added 61 Read/Feed constraints in 12 ms returned sat
[2020-05-19 19:37:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:37:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-19 19:37:40] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2020-05-19 19:37:40] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 17 ms.
[2020-05-19 19:37:43] [INFO ] Added : 133 causal constraints over 27 iterations in 2256 ms. Result :sat
[2020-05-19 19:37:43] [INFO ] Deduced a trap composed of 29 places in 49 ms
[2020-05-19 19:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Added 61 Read/Feed constraints in 11 ms returned sat
[2020-05-19 19:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Added 61 Read/Feed constraints in 10 ms returned sat
[2020-05-19 19:37:43] [INFO ] Deduced a trap composed of 26 places in 34 ms
[2020-05-19 19:37:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:43] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Real]Added 61 Read/Feed constraints in 10 ms returned sat
[2020-05-19 19:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:37:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-19 19:37:43] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2020-05-19 19:37:43] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-05-19 19:37:43] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2020-05-19 19:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2020-05-19 19:37:43] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 32 ms.
[2020-05-19 19:37:45] [INFO ] Added : 118 causal constraints over 25 iterations in 1860 ms. Result :sat
[2020-05-19 19:37:45] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2020-05-19 19:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 19:37:45] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-05-19 19:37:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 19:37:46] [INFO ] Flatten gal took : 113 ms
FORMULA SimpleLoadBal-PT-05-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 19:37:46] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 19:37:46] [INFO ] Applying decomposition
[2020-05-19 19:37:46] [INFO ] Flatten gal took : 95 ms
[2020-05-19 19:37:46] [INFO ] Input system was already deterministic with 180 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/graph17576449723033975107.txt, -o, /tmp/graph17576449723033975107.bin, -w, /tmp/graph17576449723033975107.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 140 out of 180 initially.
// Phase 1: matrix 140 rows 59 cols
[2020-05-19 19:37:46] [INFO ] Computed 19 place invariants in 7 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_client_idle_1 + P_client_idle_2 + P_client_idle_3 + P_client_idle_4 + P_client_idle_5 + P_client_request_1 + P_client_request_2 + P_client_request_3 + P_client_request_4 + P_client_request_5 + P_client_ack_1 + P_client_ack_2 + P_client_ack_3 + P_client_ack_4 + P_client_ack_5 + P_server_idle_1 + P_server_idle_2 + P_server_notification_ack_1 + P_server_notification_ack_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 - 4*P_lb_load_1_0 - 3*P_lb_load_1_1 - 2*P_lb_load_1_2 - P_lb_load_1_3 + P_lb_load_1_5 - 4*P_lb_load_2_0 - 3*P_lb_load_2_1 - 2*P_lb_load_2_2 - P_lb_load_2_3 + P_lb_load_2_5 = -1
inv : P_client_idle_1 + P_client_waiting_1 = 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_2 + P_client_waiting_2 = 1
inv : -P_client_idle_2 - P_client_idle_3 - P_client_idle_4 - P_client_idle_5 - P_client_request_2 - P_client_request_3 - P_client_request_4 - P_client_request_5 - P_client_ack_2 - P_client_ack_3 - P_client_ack_4 - P_client_ack_5 - P_server_idle_1 - P_server_notification_ack_1 + P_server_request_1_1 - P_server_request_2_2 - P_server_request_3_2 - P_server_request_4_2 - P_server_request_5_2 - P_lb_routing_1_2 - P_lb_routing_1_3 - P_lb_routing_1_4 - P_lb_routing_1_5 + 4*P_lb_load_1_0 + 3*P_lb_load_1_1 + 2*P_lb_load_1_2 + P_lb_load_1_3 - P_lb_load_1_5 = -1
inv : P_lb_load_2_0 + P_lb_load_2_1 + P_lb_load_2_2 + P_lb_load_2_3 + P_lb_load_2_4 + P_lb_load_2_5 = 1
inv : P_server_idle_2 + P_server_processed_2 + P_server_notification_2 + P_server_notification_ack_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 + 4*P_lb_load_2_0 + 3*P_lb_load_2_1 + 2*P_lb_load_2_2 + P_lb_load_2_3 - P_lb_load_2_5 = 3
inv : P_client_idle_4 + P_client_waiting_4 = 1
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 = 1
inv : P_server_idle_2 + P_server_waiting_2 + P_server_processed_2 = 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_balancing_1 = 1
inv : P_client_idle_5 + P_client_waiting_5 = 1
inv : P_server_idle_1 + P_server_waiting_1 + P_server_processed_1 = 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_3 + P_client_waiting_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_server_idle_1 + P_server_processed_1 + P_server_notification_1 + P_server_notification_ack_1 = 1
Total of 19 invariants.
[2020-05-19 19:37:46] [INFO ] Computed 19 place invariants in 8 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17576449723033975107.bin, -l, -1, -v, -w, /tmp/graph17576449723033975107.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 19:37:46] [INFO ] Decomposing Gal with order
[2020-05-19 19:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 19:37:46] [INFO ] Removed a total of 296 redundant transitions.
[2020-05-19 19:37:46] [INFO ] Proved 59 variables to be positive in 251 ms
[2020-05-19 19:37:46] [INFO ] Computing symmetric may disable matrix : 180 transitions.
[2020-05-19 19:37:46] [INFO ] Computation of disable matrix completed :0/180 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:37:46] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:37:46] [INFO ] Computing symmetric may enable matrix : 180 transitions.
[2020-05-19 19:37:46] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 19:37:46] [INFO ] Flatten gal took : 167 ms
[2020-05-19 19:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 38 ms.
[2020-05-19 19:37:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-19 19:37:47] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 14 LTL properties
Checking formula 0 : !((X(((((G("(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_3>=1))"))&&("(i2.u13.P_server_request_5_1>=1)"))&&("(u14.P_lb_balancing_1>=1)"))&&("(u14.P_lb_load_1_4>=1)"))&&("(u14.P_lb_load_2_2>=1)"))))
Formula 0 simplified : !X("(i2.u13.P_server_request_5_1>=1)" & "(u14.P_lb_balancing_1>=1)" & "(u14.P_lb_load_1_4>=1)" & "(u14.P_lb_load_2_2>=1)" & G"(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_3>=1))")
built 25 ordering constraints for composite.
built 9 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.
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_lb_idle_receive_notification_3, T_lb_idle_receive_notification_4, T_lb_idle_receive_notification_6, T_lb_idle_receive_notification_8, T_lb_idle_receive_notification_9, T_lb_balance_to_2_166, T_lb_balance_to_2_167, T_lb_balance_to_2_168, T_lb_balance_to_2_169, T_lb_balance_to_2_170, T_lb_balancing_receive_notification_12, u14.T_lb_no_balance_22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :16/79/22/117
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 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.153956,21820,1,0,10034,1087,1532,9630,590,2628,29701
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(X(G(X(F(G(X("(((i6.u11.P_lb_routing_1_3>=1)&&(u15.P_lb_load_1_2>=1))&&(u14.P_lb_load_2_2>=1))"))))))))))
Formula 1 simplified : !FXXGXFGX"(((i6.u11.P_lb_routing_1_3>=1)&&(u15.P_lb_load_1_2>=1))&&(u14.P_lb_load_2_2>=1))"
3 unique states visited
2 strongly connected components in search stack
5 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.157733,22548,1,0,10170,1087,1551,9860,590,2628,30027
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(F(!((X("((((i0.u12.P_server_request_4_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))"))U("(((i6.u11.P_lb_routing_1_3>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_1>=1))")))))||(X((((X("((((i0.u12.P_lb_routing_1_4>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_1>=1))||(((i2.u13.P_lb_routing_1_5>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_0>=1)))"))&&("(i6.u11.P_lb_routing_1_3>=1)"))&&("(u15.P_lb_load_1_0>=1)"))&&("(u15.P_lb_load_2_1>=1)")))))
Formula 2 simplified : !(GF!(X"((((i0.u12.P_server_request_4_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))" U "(((i6.u11.P_lb_routing_1_3>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_1>=1))") | X("(i6.u11.P_lb_routing_1_3>=1)" & "(u15.P_lb_load_1_0>=1)" & "(u15.P_lb_load_2_1>=1)" & X"((((i0.u12.P_lb_routing_1_4>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_1>=1))||(((i2.u13.P_lb_routing_1_5>=1)&&(u15.P_lb_load_1_0>=1))&&(u15.P_lb_load_2_0>=1)))"))
29 unique states visited
0 strongly connected components in search stack
29 transitions explored
17 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.174555,24112,1,0,11032,1088,1650,10288,600,2636,34739
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-05-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G(F("(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_3>=1))"))))U("(((u14.P_lb_balancing_1>=1)&&(u15.P_lb_load_1_1>=1))&&(u15.P_lb_load_2_0>=1))")))
Formula 3 simplified : !(FGF"(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_3>=1))" U "(((u14.P_lb_balancing_1>=1)&&(u15.P_lb_load_1_1>=1))&&(u15.P_lb_load_2_0>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.228193,26540,1,0,17075,1088,1670,14997,600,2679,53768
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F("(((i2.u13.P_lb_routing_1_5>=1)&&(u14.P_lb_load_1_3>=1))&&(u14.P_lb_load_2_3>=1))"))))
Formula 4 simplified : !F"(((i2.u13.P_lb_routing_1_5>=1)&&(u14.P_lb_load_1_3>=1))&&(u14.P_lb_load_2_3>=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.319405,31820,1,0,30054,1088,1707,25700,602,2679,88146
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X("(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=1))")))&&((G((X("((((i2.u13.P_server_request_5_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))"))||("((((i1.u10.P_server_request_2_2>=1)&&(u14.P_lb_balancing_1>=1))&&(u15.P_lb_load_1_2>=1))&&(u14.P_lb_load_2_4>=1))")))||(F("((((i2.u13.P_server_request_5_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))")))))
Formula 5 simplified : !(!X"(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=1))" & (G("((((i1.u10.P_server_request_2_2>=1)&&(u14.P_lb_balancing_1>=1))&&(u15.P_lb_load_1_2>=1))&&(u14.P_lb_load_2_4>=1))" | X"((((i2.u13.P_server_request_5_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))") | F"((((i2.u13.P_server_request_5_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))"))
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,0.413086,36836,1,0,41136,1088,1764,35121,606,2681,119655
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(((i0.u12.P_lb_routing_1_4>=1)&&(u15.P_lb_load_1_1>=1))&&(u15.P_lb_load_2_1>=1))")U(F(G(F(X(F("(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=1))"))))))))
Formula 6 simplified : !("(((i0.u12.P_lb_routing_1_4>=1)&&(u15.P_lb_load_1_1>=1))&&(u15.P_lb_load_2_1>=1))" U FGFXF"(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=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.423089,37100,1,0,41870,1088,1785,35910,606,2681,122160
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(("((i0.u1.P_client_waiting_4>=1)&&(i0.u1.P_client_ack_4>=1))")U((X("((((i0.u1.P_client_waiting_4>=1)&&(i0.u1.P_client_ack_4>=1))&&(i0.u1.P_client_waiting_4>=1))&&(i0.u1.P_client_ack_4>=1))"))||("((i3.u6.P_server_idle_2>=1)&&(i1.u10.P_server_request_2_2>=1))"))))))
Formula 7 simplified : F("((i0.u1.P_client_waiting_4>=1)&&(i0.u1.P_client_ack_4>=1))" U ("((i3.u6.P_server_idle_2>=1)&&(i1.u10.P_server_request_2_2>=1))" | X"((((i0.u1.P_client_waiting_4>=1)&&(i0.u1.P_client_ack_4>=1))&&(i0.u1.P_client_waiting_4>=1))&&(i0.u1.P_client_ack_4>=1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
24 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.661903,48452,1,0,69336,1088,1978,60612,613,2687,184564
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F("((i0.u1.P_client_request_4>=1)&&(u14.P_lb_idle_1>=1))"))))
Formula 8 simplified : !F"((i0.u1.P_client_request_4>=1)&&(u14.P_lb_idle_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.761829,53204,1,0,79449,1088,2016,69278,613,2687,211809
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(("((i1.u2.P_client_waiting_2>=1)&&(i1.u2.P_client_ack_2>=1))")U(X("((i1.u2.P_client_waiting_2<1)||(i1.u2.P_client_ack_2<1))")))))
Formula 9 simplified : !F("((i1.u2.P_client_waiting_2>=1)&&(i1.u2.P_client_ack_2>=1))" U X"((i1.u2.P_client_waiting_2<1)||(i1.u2.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.763082,53468,1,0,79449,1088,2039,69278,613,2687,211836
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-05-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(G(F((F((((((!(G("((((i2.u13.P_server_request_5_2>=1)&&(u14.P_lb_balancing_1>=1))&&(u15.P_lb_load_1_0>=1))&&(u14.P_lb_load_2_2>=1))")))||("(i1.u2.P_client_idle_2<1)"))&&("(i6.u11.P_server_request_3_1>=1)"))&&("(u14.P_lb_balancing_1>=1)"))&&("(u14.P_lb_load_1_5>=1)"))&&("(u14.P_lb_load_2_3>=1)")))U("(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=1))")))))))
Formula 10 simplified : !G!GF(F("(i6.u11.P_server_request_3_1>=1)" & "(u14.P_lb_balancing_1>=1)" & "(u14.P_lb_load_1_5>=1)" & "(u14.P_lb_load_2_3>=1)" & ("(i1.u2.P_client_idle_2<1)" | !G"((((i2.u13.P_server_request_5_2>=1)&&(u14.P_lb_balancing_1>=1))&&(u15.P_lb_load_1_0>=1))&&(u14.P_lb_load_2_2>=1))")) U "(((i4.u7.P_server_notification_1>=1)&&(u14.P_lb_idle_1>=1))&&(u14.P_lb_load_1_4>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
25 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,1.01621,64028,1,0,106906,1088,2047,89413,613,2698,284461
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("((((i6.u11.P_server_request_3_1<1)||(u14.P_lb_balancing_1<1))||(u14.P_lb_load_1_4<1))||(u14.P_lb_load_2_2<1))")))
Formula 11 simplified : !G"((((i6.u11.P_server_request_3_1<1)||(u14.P_lb_balancing_1<1))||(u14.P_lb_load_1_4<1))||(u14.P_lb_load_2_2<1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.06091,66140,1,0,111067,1097,2065,93545,616,2735,298048
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G("((((i5.u9.P_server_request_1_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=1))"))))
Formula 12 simplified : !XG"((((i5.u9.P_server_request_1_1>=1)&&(u14.P_lb_balancing_1>=1))&&(u14.P_lb_load_1_4>=1))&&(u14.P_lb_load_2_2>=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,1.06217,66404,1,0,111067,1097,2090,93545,616,2735,298064
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X((F(X("((i4.u5.P_server_idle_1>=1)&&(i1.u10.P_server_request_2_1>=1))")))U(X("(((i4.u5.P_server_idle_1>=1)&&(i1.u10.P_server_request_2_1>=1))||((i3.u6.P_server_idle_2>=1)&&(i0.u12.P_server_request_4_2>=1)))"))))))
Formula 13 simplified : !FX(FX"((i4.u5.P_server_idle_1>=1)&&(i1.u10.P_server_request_2_1>=1))" U X"(((i4.u5.P_server_idle_1>=1)&&(i1.u10.P_server_request_2_1>=1))||((i3.u6.P_server_idle_2>=1)&&(i0.u12.P_server_request_4_2>=1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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,1.37932,81980,1,0,149958,1097,2124,126557,616,2735,380068
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-05-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 19:37:48] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 46) 1) (>= (select s0 50) 1)) (>= (select s0 56) 1)) (= (store (store s0 46 (- (select s0 46) 1)) 40 (+ (select s0 40) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (>= (select s0 46) 1) (>= (select s0 50) 1)) (>= (select s0 56) 1)) (= (store (store s0 46 (- (select s0 46) 1)) 40 (+ (select s0 40) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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:37:48] [INFO ] Built C files in 2405ms 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 1589917069179

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

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