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.r021-oct2-158897699300658.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 CSRepetitions-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 26K Apr 27 15:14 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 CSRepetitions-PT-02-00
FORMULA_NAME CSRepetitions-PT-02-01
FORMULA_NAME CSRepetitions-PT-02-02
FORMULA_NAME CSRepetitions-PT-02-03
FORMULA_NAME CSRepetitions-PT-02-04
FORMULA_NAME CSRepetitions-PT-02-05
FORMULA_NAME CSRepetitions-PT-02-06
FORMULA_NAME CSRepetitions-PT-02-07
FORMULA_NAME CSRepetitions-PT-02-08
FORMULA_NAME CSRepetitions-PT-02-09
FORMULA_NAME CSRepetitions-PT-02-10
FORMULA_NAME CSRepetitions-PT-02-11
FORMULA_NAME CSRepetitions-PT-02-12
FORMULA_NAME CSRepetitions-PT-02-13
FORMULA_NAME CSRepetitions-PT-02-14
FORMULA_NAME CSRepetitions-PT-02-15

=== Now, execution of the tool begins

BK_START 1589263338844

[2020-05-12 06:02:23] [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-12 06:02:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 06:02:23] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-05-12 06:02:23] [INFO ] Transformed 23 places.
[2020-05-12 06:02:23] [INFO ] Transformed 28 transitions.
[2020-05-12 06:02:23] [INFO ] Parsed PT model containing 23 places and 28 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 90 steps, including 5 resets, run visited all 41 properties in 4 ms. (steps per millisecond=22 )
[2020-05-12 06:02:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 06:02:23] [INFO ] Flatten gal took : 31 ms
FORMULA CSRepetitions-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 06:02:23] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 06:02:23] [INFO ] Applying decomposition
[2020-05-12 06:02:23] [INFO ] Flatten gal took : 7 ms
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/graph14059050880392386450.txt, -o, /tmp/graph14059050880392386450.bin, -w, /tmp/graph14059050880392386450.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/graph14059050880392386450.bin, -l, -1, -v, -w, /tmp/graph14059050880392386450.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 06:02:23] [INFO ] Input system was already deterministic with 28 transitions.
[2020-05-12 06:02:23] [INFO ] Decomposing Gal with order
[2020-05-12 06:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 06:02:23] [INFO ] Removed a total of 8 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
[2020-05-12 06:02:24] [INFO ] Computed 6 place invariants in 2 ms
inv : Client_Sending_1 + Client_Waiting_1 = 1
inv : Server_Anwering_3_2 + Server_Anwering_1_2 + Server_Waiting_2 + Server_Anwering_4_2 + Server_Anwering_2_2 = 1
inv : Client_Waiting_4 + Client_Sending_4 = 1
inv : Server_Anwering_4_1 + Server_Anwering_3_1 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Waiting_1 = 1
inv : Client_Waiting_3 + Client_Sending_3 = 1
inv : Client_Sending_2 + Client_Waiting_2 = 1
Total of 6 invariants.
[2020-05-12 06:02:24] [INFO ] Computed 6 place invariants in 4 ms
[2020-05-12 06:02:24] [INFO ] Flatten gal took : 165 ms
[2020-05-12 06:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-12 06:02:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-12 06:02:24] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 13 LTL properties
Checking formula 0 : !((F((F(((F("(((((((((u6.Client_Sending_1<1)||(u3.Server_Anwering_1_1<1))&&((u2.Client_Sending_4<1)||(u4.Server_Anwering_4_2<1)))&&((u5.Client_Sending_2<1)||(u3.Server_Anwering_2_1<1)))&&((u3.Server_Anwering_4_1<1)||(u2.Client_Sending_4<1)))&&((u4.Server_Anwering_1_2<1)||(u6.Client_Sending_1<1)))&&((u3.Server_Anwering_3_1<1)||(u1.Client_Sending_3<1)))&&((u4.Server_Anwering_3_2<1)||(u1.Client_Sending_3<1)))&&((u5.Client_Sending_2<1)||(u4.Server_Anwering_2_2<1)))"))&&("((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))"))&&("(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1)))")))||(X(G(("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))")U("(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))")))))))
Formula 0 simplified : !F(F("(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1)))" & "((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))" & F"(((((((((u6.Client_Sending_1<1)||(u3.Server_Anwering_1_1<1))&&((u2.Client_Sending_4<1)||(u4.Server_Anwering_4_2<1)))&&((u5.Client_Sending_2<1)||(u3.Server_Anwering_2_1<1)))&&((u3.Server_Anwering_4_1<1)||(u2.Client_Sending_4<1)))&&((u4.Server_Anwering_1_2<1)||(u6.Client_Sending_1<1)))&&((u3.Server_Anwering_3_1<1)||(u1.Client_Sending_3<1)))&&((u4.Server_Anwering_3_2<1)||(u1.Client_Sending_3<1)))&&((u5.Client_Sending_2<1)||(u4.Server_Anwering_2_2<1)))") | XG("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))" U "(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))"))
built 14 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Send_Answer_3_2, Send_Answer_4_2, Send_Answer_1_1, Send_Answer_3_1, Send_Answer_2_1, Send_Answer_4_1, Send_Answer_1_2, Send_Answer_2_2, u0.Lose_Request_4, u0.Lose_Request_2, u0.Lose_Request_3, u0.Lose_Request_1, u1.Prepare_Request_3, u2.Prepare_Request_4, u5.Prepare_Request_2, u6.Prepare_Request_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
[2020-05-12 06:02:24] [INFO ] Proved 23 variables to be positive in 445 ms
[2020-05-12 06:02:24] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2020-05-12 06:02:24] [INFO ] Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:02:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:02:24] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2020-05-12 06:02:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
55 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.582369,32120,1,0,27572,7237,506,40701,194,49661,38825
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X(("(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1)))")U(X("((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))"))))&&(F("((((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))&&((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1)))&&(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1))))")))))
Formula 1 simplified : !G(X("(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1)))" U X"((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))") & F"((((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))&&((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1)))&&(((((((((u6.Client_Sending_1>=1)&&(u3.Server_Anwering_1_1>=1))||((u2.Client_Sending_4>=1)&&(u4.Server_Anwering_4_2>=1)))||((u5.Client_Sending_2>=1)&&(u3.Server_Anwering_2_1>=1)))||((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1)))||((u4.Server_Anwering_1_2>=1)&&(u6.Client_Sending_1>=1)))||((u3.Server_Anwering_3_1>=1)&&(u1.Client_Sending_3>=1)))||((u4.Server_Anwering_3_2>=1)&&(u1.Client_Sending_3>=1)))||((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1))))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.678318,34760,1,0,31370,8045,566,48946,195,58303,47422
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))"))U((G((((((G("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))"))&&("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))"))||("((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))"))||("((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1))"))||("((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1))"))||("((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1))")))&&(("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))")U(X("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))"))))))
Formula 2 simplified : !(X"(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))" U (G("((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1))" | "((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))" | "((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1))" | "((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1))" | ("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))" & G"(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))")) & ("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))" U X"(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))")))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
12 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.824834,40160,1,0,40523,9888,614,65848,195,76596,62856
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X(!(G("(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))")))))&&(("(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))")U("((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))"))))
Formula 3 simplified : !(!X!G"(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))" & ("(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))" U "((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.841606,40688,1,0,41261,10061,636,67387,195,78290,64858
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(((((G("(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))"))||("(u2.Client_Waiting_4>=1)"))||("(u5.Client_Waiting_2>=1)"))||("(u1.Client_Waiting_3>=1)"))||("(u6.Client_Waiting_1>=1)"))))
Formula 4 simplified : !G("(u1.Client_Waiting_3>=1)" | "(u2.Client_Waiting_4>=1)" | "(u5.Client_Waiting_2>=1)" | "(u6.Client_Waiting_1>=1)" | G"(((((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))||((u6.Client_Sending_1>=1)&&(u0.RequestBufferSlots>=1)))||((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1)))||((u1.Client_Sending_3>=1)&&(u0.RequestBufferSlots>=1)))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
27 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.11007,47552,1,0,52615,12880,685,90419,195,106073,81278
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(G(X(!(G((X("((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))"))||("((((u0.RequestBuffer_4<1)&&(u0.RequestBuffer_1<1))&&(u0.RequestBuffer_3<1))&&(u0.RequestBuffer_2<1))")))))))||(F("(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))"))))
Formula 5 simplified : !(!GX!G("((((u0.RequestBuffer_4<1)&&(u0.RequestBuffer_1<1))&&(u0.RequestBuffer_3<1))&&(u0.RequestBuffer_2<1))" | X"((((u0.RequestBuffer_4>=1)||(u0.RequestBuffer_1>=1))||(u0.RequestBuffer_3>=1))||(u0.RequestBuffer_2>=1))") | F"(((((((((u0.RequestBuffer_2>=1)&&(u4.Server_Waiting_2>=1))||((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_4>=1)&&(u3.Server_Waiting_1>=1)))||((u0.RequestBuffer_2>=1)&&(u3.Server_Waiting_1>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_3>=1)))||((u0.RequestBuffer_1>=1)&&(u4.Server_Waiting_2>=1)))||((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1)))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 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.11334,47816,1,0,52792,12880,715,90783,200,106079,81923
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(G(X(X(G(F((F(!(F("((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))"))))&&(X("((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))")))))))))))
Formula 6 simplified : !GXGXXGF(F!F"((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))" & X"((((u2.Client_Waiting_4>=1)||(u5.Client_Waiting_2>=1))||(u1.Client_Waiting_3>=1))||(u6.Client_Waiting_1>=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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,1.1142,47816,1,0,52792,12880,715,90783,200,106079,81923
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(((((G((G(X("((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))")))||("((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1))")))&&(G("((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))")))&&(F("((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))")))&&("(u2.Client_Sending_4>=1)"))&&("(u0.RequestBufferSlots>=1)"))))
Formula 7 simplified : !X("(u0.RequestBufferSlots>=1)" & "(u2.Client_Sending_4>=1)" & G("((u3.Server_Anwering_4_1>=1)&&(u2.Client_Sending_4>=1))" | GX"((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))") & G"((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))" & F"((u2.Client_Sending_4>=1)&&(u0.RequestBufferSlots>=1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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.14836,48608,1,0,55082,12930,762,93695,205,107077,86462
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((((X(F("((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1))")))&&("(u4.Server_Anwering_1_2>=1)"))&&("(u6.Client_Sending_1>=1)"))||(((!(F("(u2.Client_Waiting_4>=1)")))&&(!(G("((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1))"))))&&("((u4.Server_Anwering_1_2<1)||(u6.Client_Sending_1<1))")))))
Formula 8 simplified : !X(("(u4.Server_Anwering_1_2>=1)" & "(u6.Client_Sending_1>=1)" & XF"((u3.Server_Waiting_1>=1)&&(u0.RequestBuffer_3>=1))") | ("((u4.Server_Anwering_1_2<1)||(u6.Client_Sending_1<1))" & !F"(u2.Client_Waiting_4>=1)" & !G"((u0.RequestBuffer_1>=1)&&(u3.Server_Waiting_1>=1))"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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.19365,49400,1,0,56525,12970,863,96468,205,107779,90727
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(X("(((u4.Server_Anwering_3_2<1)||(u1.Client_Sending_3<1))||(u2.Client_Waiting_4>=1))")))))
Formula 9 simplified : !XFX"(((u4.Server_Anwering_3_2<1)||(u1.Client_Sending_3<1))||(u2.Client_Waiting_4>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,1.19455,49664,1,0,56527,12970,883,96477,205,107779,90772
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X(F(((X("((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1))"))&&("(u5.Client_Sending_2>=1)"))&&("(u4.Server_Anwering_2_2>=1)"))))U("(((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1))&&(u0.RequestBuffer_3<1))")))
Formula 10 simplified : !(XF("(u4.Server_Anwering_2_2>=1)" & "(u5.Client_Sending_2>=1)" & X"((u5.Client_Sending_2>=1)&&(u4.Server_Anwering_2_2>=1))") U "(((u5.Client_Sending_2>=1)&&(u0.RequestBufferSlots>=1))&&(u0.RequestBuffer_3<1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.42841,56264,1,0,67294,15158,927,120687,207,131594,111222
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(G(F((G(!(G("(u5.Client_Waiting_2>=1)"))))&&(G("(u0.RequestBuffer_3>=1)"))))))&&(G("(u5.Client_Waiting_2>=1)"))))
Formula 11 simplified : !(G"(u5.Client_Waiting_2>=1)" & !GF(G!G"(u5.Client_Waiting_2>=1)" & G"(u0.RequestBuffer_3>=1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.4412,56528,1,0,67840,15210,940,121804,207,132227,112721
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!(F(("((u5.Client_Sending_2<1)||(u4.Server_Anwering_2_2<1))")U(("((u6.Client_Sending_1<1)||(u0.RequestBufferSlots<1))")U(X(X("((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1))")))))))))
Formula 12 simplified : !X!F("((u5.Client_Sending_2<1)||(u4.Server_Anwering_2_2<1))" U ("((u6.Client_Sending_1<1)||(u0.RequestBufferSlots<1))" U XX"((u4.Server_Waiting_2>=1)&&(u0.RequestBuffer_4>=1))"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,1.56976,61544,1,0,76092,17040,960,139294,207,150606,128122
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 06:02:26] [INFO ] Built C files in 2253ms 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 1589263346763

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699300658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;