Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r204-smll-162089465200134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 SafeBus-COL-03, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-smll-162089465200134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 14:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1621011493486

Running Version 0
[2021-05-14 16:58:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-14 16:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 16:58:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 16:58:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 16:58:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1285 ms
[2021-05-14 16:58:18] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2021-05-14 16:58:18] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 41 ms.
[2021-05-14 16:58:18] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 5 ms.
[2021-05-14 16:58:18] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1388145255966597055.dot
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 16 ms.
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN properties in 0 ms.
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 7 ms.
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_16065208100229290168.dot
[2021-05-14 16:58:18] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-14 16:58:18] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 0 ms.
[2021-05-14 16:58:18] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1002_14456558214668534011.dot
Reduce places removed 3 places and 0 transitions.
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 5 ms.
[2021-05-14 16:58:18] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1003_6948613471587470744.dot
[2021-05-14 16:58:18] [INFO ] Reduced 3 identical enabling conditions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.13149KB memory used
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 29 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 12 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2021-05-14 16:58:18] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:18] [INFO ] Computed 17 place invariants in 31 ms
[2021-05-14 16:58:18] [INFO ] Implicit Places using invariants in 259 ms returned []
[2021-05-14 16:58:18] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:18] [INFO ] Computed 17 place invariants in 13 ms
[2021-05-14 16:58:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 16:58:18] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2021-05-14 16:58:18] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 16:58:19] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:19] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-14 16:58:19] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned [7, 10, 13, 17, 20, 23, 27, 30, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 30, 27, 23, 20, 17, 13, 10, 7]
Starting structural reductions, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 19 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2021-05-14 16:58:19] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 16:58:19] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:19] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-14 16:58:19] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2265 ms (no deadlock found). (steps per millisecond=551 )
Random directed walk for 1250002 steps, including 0 resets, run took 1231 ms (no deadlock found). (steps per millisecond=1015 )
[2021-05-14 16:58:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:22] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 16:58:23] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-14 16:58:23] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 11 ms returned sat
[2021-05-14 16:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:58:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 16:58:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:58:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-14 16:58:23] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 8 ms returned sat
[2021-05-14 16:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:58:23] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-14 16:58:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 16:58:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2021-05-14 16:58:23] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 16 ms.
[2021-05-14 16:58:23] [INFO ] Added : 43 causal constraints over 9 iterations in 146 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Parikh directed walk for 6700 steps, including 658 resets, run took 41 ms. (steps per millisecond=163 )
Random directed walk for 500000 steps, including 0 resets, run took 797 ms (no deadlock found). (steps per millisecond=627 )
Random walk for 500000 steps, including 0 resets, run took 890 ms (no deadlock found). (steps per millisecond=561 )
Random directed walk for 500000 steps, including 0 resets, run took 617 ms (no deadlock found). (steps per millisecond=810 )
Random walk for 500000 steps, including 0 resets, run took 672 ms (no deadlock found). (steps per millisecond=744 )
Starting structural reductions, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2021-05-14 16:58:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:26] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 16:58:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-14 16:58:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:26] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 16:58:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 16:58:26] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2021-05-14 16:58:26] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 16:58:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:26] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 16:58:26] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 82/82 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1643 ms (no deadlock found). (steps per millisecond=760 )
Random directed walk for 1250000 steps, including 0 resets, run took 1655 ms (no deadlock found). (steps per millisecond=755 )
[2021-05-14 16:58:29] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 16:58:30] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 16:58:30] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-14 16:58:30] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 14 ms returned sat
[2021-05-14 16:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:58:30] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-14 16:58:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:58:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-14 16:58:30] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 14 ms returned sat
[2021-05-14 16:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:58:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-14 16:58:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 16:58:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2021-05-14 16:58:30] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 14 ms.
[2021-05-14 16:58:30] [INFO ] Added : 43 causal constraints over 9 iterations in 192 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Parikh directed walk for 6700 steps, including 687 resets, run took 37 ms. (steps per millisecond=181 )
Random directed walk for 500000 steps, including 0 resets, run took 820 ms (no deadlock found). (steps per millisecond=609 )
Random walk for 500000 steps, including 0 resets, run took 647 ms (no deadlock found). (steps per millisecond=772 )
Random directed walk for 500002 steps, including 0 resets, run took 491 ms (no deadlock found). (steps per millisecond=1018 )
Random walk for 500000 steps, including 0 resets, run took 785 ms (no deadlock found). (steps per millisecond=636 )
[2021-05-14 16:58:33] [INFO ] Flatten gal took : 94 ms
[2021-05-14 16:58:33] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 6 ms.
[2021-05-14 16:58:33] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1004_17948860378664974762.dot
[2021-05-14 16:58:33] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-14 16:58:33] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Finished random walk after 30 steps, including 0 resets, run visited all 13 properties in 2 ms. (steps per millisecond=15 )
Able to resolve query QuasiLiveness after proving 14 properties.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
[2021-05-14 16:58:33] [INFO ] Flatten gal took : 32 ms
[2021-05-14 16:58:33] [INFO ] Flatten gal took : 27 ms
[2021-05-14 16:58:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6890653641652654914.gal : 8 ms
[2021-05-14 16:58:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18431064197047951411.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6890653641652654914.gal, -t, CGAL, -ctl, /tmp/CTLFireability18431064197047951411.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6890653641652654914.gal -t CGAL -ctl /tmp/CTLFireability18431064197047951411.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,0.169463,8872,2,1482,5,16416,6,0,310,14881,0


Converting to forward existential form...Done !
original formula: AG(EF(((ACK_0>=1)&&(R_tout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((ACK_0>=1)&&(R_tout_0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr1i0, I_reemitr1i2, I_reemitr2i0, I_reemitr2i1, C_freei0, C_freei1, C_freei2, I_rec1r0, I_rec1r1, I_rec1r2, loss_mr0, loss_mr1, loss_mr2, I_rec2r0, I_rec2r1, I_rec2r2, I_ask2i0x0, I_ask2i0x1, I_ask2i0x2, I_ask2i1x0, I_ask2i1x1, I_ask2i1x2, I_ask2i2x0, I_ask2i2x1, I_ask2i2x2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/55/27/91
(forward)formula 0,1,1.59225,46316,1,0,211,181081,194,93,2618,148414,211
Formula is TRUE !

***************************************

original formula: AG(EF((((((((wait_ack_1>=1)&&(T_out_0>=1))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((wait_ack_1>=1)&&(T_out_0>=1))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1))))))] = FALSE
(forward)formula 1,1,2.05768,58988,1,0,225,234416,195,101,2623,204479,232
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((((((((((((((((((((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((((((((((((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_2>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 2,1,2.5564,70796,1,0,236,274324,196,107,2657,243438,249
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-14 16:58:36] [INFO ] Flatten gal took : 25 ms
[2021-05-14 16:58:36] [INFO ] Applying decomposition
[2021-05-14 16:58:36] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12295311283461364685.txt, -o, /tmp/graph12295311283461364685.bin, -w, /tmp/graph12295311283461364685.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12295311283461364685.bin, -l, -1, -v, -w, /tmp/graph12295311283461364685.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:58:36] [INFO ] Decomposing Gal with order
[2021-05-14 16:58:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:58:36] [INFO ] Removed a total of 60 redundant transitions.
[2021-05-14 16:58:36] [INFO ] Flatten gal took : 66 ms
[2021-05-14 16:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 13 ms.
[2021-05-14 16:58:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7464815739056342.gal : 6 ms
[2021-05-14 16:58:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4486179883358583519.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7464815739056342.gal, -t, CGAL, -ctl, /tmp/CTLFireability4486179883358583519.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7464815739056342.gal -t CGAL -ctl /tmp/CTLFireability4486179883358583519.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,2.04222,55596,849,1574,14532,9538,271,221744,168,603418,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-14 16:58:40] [INFO ] Flatten gal took : 13 ms
[2021-05-14 16:58:40] [INFO ] Flatten gal took : 12 ms
[2021-05-14 16:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12683994605851452839.gal : 3 ms
[2021-05-14 16:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14112225389688585599.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12683994605851452839.gal, -t, CGAL, -ctl, /tmp/CTLFireability14112225389688585599.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12683994605851452839.gal -t CGAL -ctl /tmp/CTLFireability14112225389688585599.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,0.154203,9048,2,1482,5,16416,6,0,310,14881,0


Converting to forward existential form...Done !
original formula: AG(EF(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_1>=1)&&(FMC_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_1>=1)&&(FMC_1>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr1i0, I_reemitr1i2, I_reemitr2i0, I_reemitr2i1, C_freei0, C_freei1, C_freei2, I_rec1r0, I_rec1r1, I_rec1r2, loss_mr0, loss_mr1, loss_mr2, I_rec2r0, I_rec2r1, I_rec2r2, I_ask2i0x0, I_ask2i0x1, I_ask2i0x2, I_ask2i1x0, I_ask2i1x1, I_ask2i1x2, I_ask2i2x0, I_ask2i2x1, I_ask2i2x2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/55/27/91
(forward)formula 0,1,1.13078,35608,1,0,204,135603,194,87,2666,105656,196
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 1,1,1.33152,42208,1,0,214,157838,195,93,2684,129060,212
Formula is TRUE !

***************************************

original formula: AG(EF(((((listen_2>=1)&&(MSG_2>=1))||((listen_0>=1)&&(MSG_0>=1)))||((listen_1>=1)&&(MSG_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((listen_2>=1)&&(MSG_2>=1))||((listen_0>=1)&&(MSG_0>=1)))||((listen_1>=1)&&(MSG_1>=1))))))] = FALSE
(forward)formula 2,1,2.06155,59104,1,0,230,230721,196,103,2686,200270,238
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((wait_ack_5>=1)&&(ACK_0>=1))&&(FMCb_0>=1))||(((wait_ack_2>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_6>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_1>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_3>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_7>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((wait_ack_5>=1)&&(ACK_0>=1))&&(FMCb_0>=1))||(((wait_ack_2>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_6>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_1>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_3>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_7>=1)&&(ACK_0>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 3,1,2.24738,63328,1,0,239,245828,197,109,2693,215751,254
Formula is TRUE !

***************************************

original formula: AG(EF(((((wait_cable_1>=1)&&(PMC_1>=1))||((wait_cable_2>=1)&&(PMC_2>=1)))||((wait_cable_0>=1)&&(PMC_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((wait_cable_1>=1)&&(PMC_1>=1))||((wait_cable_2>=1)&&(PMC_2>=1)))||((wait_cable_0>=1)&&(PMC_0>=1))))))] = FALSE
(forward)formula 4,1,2.37261,67816,1,0,248,260384,198,114,2695,231895,270
Formula is TRUE !

***************************************

original formula: AG(EF(((((wait_cable_0>=1)&&(RMC_0>=1))||((wait_cable_1>=1)&&(RMC_1>=1)))||((wait_cable_2>=1)&&(RMC_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((wait_cable_0>=1)&&(RMC_0>=1))||((wait_cable_1>=1)&&(RMC_1>=1)))||((wait_cable_2>=1)&&(RMC_2>=1))))))] = FALSE
(forward)formula 5,1,2.5988,77032,1,0,258,286286,199,120,2697,260048,286
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((Cpt1_2>=1)&&(listen_2>=1))||((Cpt1_1>=1)&&(listen_1>=1)))||((Cpt1_1>=1)&&(listen_2>=1)))||((Cpt1_2>=1)&&(listen_0>=1)))||((Cpt1_1>=1)&&(listen_0>=1)))||((Cpt1_2>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_0>=1)))||((Cpt1_0>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((Cpt1_2>=1)&&(listen_2>=1))||((Cpt1_1>=1)&&(listen_1>=1)))||((Cpt1_1>=1)&&(listen_2>=1)))||((Cpt1_2>=1)&&(listen_0>=1)))||((Cpt1_1>=1)&&(listen_0>=1)))||((Cpt1_2>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_0>=1)))||((Cpt1_0>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_2>=1))))))] = FALSE
(forward)formula 6,1,2.74473,81256,1,0,265,301600,200,124,2700,277482,298
Formula is TRUE !

***************************************

original formula: AG(EF(((((MSG_1>=1)&&(R_tout_0>=1))||((MSG_2>=1)&&(R_tout_0>=1)))||((MSG_0>=1)&&(R_tout_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((MSG_1>=1)&&(R_tout_0>=1))||((MSG_2>=1)&&(R_tout_0>=1)))||((MSG_0>=1)&&(R_tout_0>=1))))))] = FALSE
(forward)formula 7,1,3.32229,91288,1,0,275,350146,201,130,2702,324078,314
Formula is TRUE !

***************************************

original formula: AG(EF(((((FMC_1>=1)&&(S_tout_0>=1))||((FMC_2>=1)&&(S_tout_0>=1)))||((FMC_0>=1)&&(S_tout_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((FMC_1>=1)&&(S_tout_0>=1))||((FMC_2>=1)&&(S_tout_0>=1)))||((FMC_0>=1)&&(S_tout_0>=1))))))] = FALSE
(forward)formula 8,1,4.21553,112408,1,0,291,449457,202,140,2704,411030,340
Formula is TRUE !

***************************************

original formula: AG(EF(((((MSG_2>=1)&&(wait_msg_2>=1))||((MSG_0>=1)&&(wait_msg_0>=1)))||((MSG_1>=1)&&(wait_msg_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((MSG_2>=1)&&(wait_msg_2>=1))||((MSG_0>=1)&&(wait_msg_0>=1)))||((MSG_1>=1)&&(wait_msg_1>=1))))))] = FALSE
(forward)formula 9,1,4.45828,116104,1,0,298,466226,203,144,2706,426817,351
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((Cpt1_1>=1)&&(loop_em_1>=1))||((Cpt1_1>=1)&&(loop_em_2>=1)))||((Cpt1_2>=1)&&(loop_em_0>=1)))||((Cpt1_1>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_2>=1)))||((Cpt1_0>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((Cpt1_1>=1)&&(loop_em_1>=1))||((Cpt1_1>=1)&&(loop_em_2>=1)))||((Cpt1_2>=1)&&(loop_em_0>=1)))||((Cpt1_1>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_2>=1)))||((Cpt1_0>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_2>=1))))))] = FALSE
(forward)formula 10,1,4.6634,122968,1,0,305,488291,204,148,2710,450853,363
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 14 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1621011526038

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SafeBus-COL-03"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 SafeBus-COL-03, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-smll-162089465200134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;