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-158897699300657.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300657
=====================================================================

--------------------
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 1589263320586

[2020-05-12 06:02:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 06:02:02] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-05-12 06:02:02] [INFO ] Transformed 23 places.
[2020-05-12 06:02:02] [INFO ] Transformed 28 transitions.
[2020-05-12 06:02:02] [INFO ] Parsed PT model containing 23 places and 28 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5597 resets, run finished after 215 ms. (steps per millisecond=465 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 28 rows 23 cols
[2020-05-12 06:02:02] [INFO ] Computed 6 place invariants in 3 ms
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-12 06:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 06:02:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 21 simplifications.
[2020-05-12 06:02:02] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 06:02:02] [INFO ] Flatten gal took : 32 ms
FORMULA CSRepetitions-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 06:02:02] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 06:02:02] [INFO ] Applying decomposition
[2020-05-12 06:02:02] [INFO ] Flatten gal took : 3 ms
[2020-05-12 06:02:02] [INFO ] Input system was already deterministic with 28 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/graph5030590985238319774.txt, -o, /tmp/graph5030590985238319774.bin, -w, /tmp/graph5030590985238319774.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/graph5030590985238319774.bin, -l, -1, -v, -w, /tmp/graph5030590985238319774.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
[2020-05-12 06:02:03] [INFO ] Computed 6 place invariants in 1 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:03] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-12 06:02:03] [INFO ] Decomposing Gal with order
[2020-05-12 06:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 06:02:03] [INFO ] Proved 23 variables to be positive in 42 ms
[2020-05-12 06:02:03] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2020-05-12 06:02:03] [INFO ] Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:02:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:02:03] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2020-05-12 06:02:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:02:03] [INFO ] Removed a total of 10 redundant transitions.
[2020-05-12 06:02:03] [INFO ] Flatten gal took : 57 ms
[2020-05-12 06:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2020-05-12 06:02:03] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-12 06:02:03] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((G(F(X(!(F("((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))")))))))
Formula 0 simplified : !GFX!F"((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))"
Reverse transition relation is NOT exact ! Due to transitions gu0.Lose_Request_4, gu0.Lose_Request_2, gu0.Lose_Request_3, gu0.Lose_Request_1, gi1.Prepare_Request_4, gi1.Prepare_Request_1, gi1.Prepare_Request_3, gi1.Prepare_Request_2, 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, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/6/16/22
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.115801,20904,1,0,86,22957,78,45,1003,32812,102
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(("((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=3)")U(X("(gu0.RequestBufferSlots<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))")))))
Formula 1 simplified : !G("((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=3)" U X"(gu0.RequestBufferSlots<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))")
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
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.139971,22212,1,0,90,26268,86,47,1078,37320,116
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 : !((G(F(!(G((("(gu0.RequestBufferSlots>=2)")U("((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))"))||((("((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(gi1.gu1.Server_Waiting_2+gi1.gu1.Server_Waiting_1))")U("(gu0.RequestBufferSlots>=2)"))U(F("((gi1.gu1.Server_Waiting_2+gi1.gu1.Server_Waiting_1)<1)")))))))))
Formula 2 simplified : !GF!G(("(gu0.RequestBufferSlots>=2)" U "((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))") | (("((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(gi1.gu1.Server_Waiting_2+gi1.gu1.Server_Waiting_1))" U "(gu0.RequestBufferSlots>=2)") U F"((gi1.gu1.Server_Waiting_2+gi1.gu1.Server_Waiting_1)<1)"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.151822,24192,1,0,100,28026,108,54,1155,39438,145
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G((!(G("(gu0.RequestBufferSlots>=1)")))||("((gu0.RequestBufferSlots<1)&&((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)>(((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)))"))))))
Formula 3 simplified : !XFG("((gu0.RequestBufferSlots<1)&&((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)>(((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)))" | !G"(gu0.RequestBufferSlots>=1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.16177,24452,1,0,110,30097,127,60,1194,42440,194
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(X(!(G("(gu0.RequestBufferSlots<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))")))))&&(!(G(!(F("((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)>=1)"))))))&&(!(G("(gu0.RequestBufferSlots<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))")))))
Formula 4 simplified : !(!G"(gu0.RequestBufferSlots<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))" & !X!G"(gu0.RequestBufferSlots<=(((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1))" & !G!F"((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)>=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
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.163985,24940,1,0,111,30159,138,61,1223,42463,205
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((("((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)<=gu0.RequestBufferSlots)")&&((G("((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=2)"))||("((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))")))U("((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)<=gu0.RequestBufferSlots)")))U(!(F("((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=2)")))))
Formula 5 simplified : !(F(("((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)<=gu0.RequestBufferSlots)" & ("((((gi1.gu1.Client_Waiting_4+gi1.gu1.Client_Waiting_3)+gi1.gu1.Client_Waiting_2)+gi1.gu1.Client_Waiting_1)<=(((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2))" | G"((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=2)")) U "((((((((gu0.Server_Anwering_3_2+gu0.Server_Anwering_1_2)+gu0.Server_Anwering_4_1)+gu0.Server_Anwering_3_1)+gu0.Server_Anwering_2_1)+gu0.Server_Anwering_1_1)+gu0.Server_Anwering_4_2)+gu0.Server_Anwering_2_2)<=gu0.RequestBufferSlots)") U !F"((((gi1.gu2.Client_Sending_1+gi1.gu2.Client_Sending_2)+gi1.gu2.Client_Sending_3)+gi1.gu2.Client_Sending_4)>=2)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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.279369,29408,1,0,157,53409,149,105,1309,78671,330
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(X("(gu0.Server_Anwering_4_2>=1)")))))
Formula 6 simplified : !XGX"(gu0.Server_Anwering_4_2>=1)"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.285182,29672,1,0,159,54681,155,107,1310,80140,343
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X("(gi1.gu1.Server_Waiting_1<=gi1.gu1.Client_Waiting_2)"))))
Formula 7 simplified : !GX"(gi1.gu1.Server_Waiting_1<=gi1.gu1.Client_Waiting_2)"
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
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.418595,34988,1,0,206,81768,161,152,1314,120759,462
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(((X(X("(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)")))&&("(gu0.Server_Anwering_2_1<=gi1.gu1.Server_Waiting_1)"))&&((F("(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)"))||("(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)")))))
Formula 8 simplified : !F("(gu0.Server_Anwering_2_1<=gi1.gu1.Server_Waiting_1)" & XX"(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)" & ("(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)" | F"(gi1.gu2.Client_Sending_3<=gi1.gu1.Server_Waiting_2)"))
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,0.419772,35248,1,0,206,81768,175,152,1325,120763,475
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((F(X("(gu0.RequestBufferSlots>=2)")))&&(G("(gu0.RequestBufferSlots>=2)")))))
Formula 9 simplified : !G(FX"(gu0.RequestBufferSlots>=2)" & G"(gu0.RequestBufferSlots>=2)")
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
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.42321,35248,1,0,219,82491,179,162,1325,121667,510
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 06:02:03] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 9) 1) (>= (select s0 13) 1)) (= (store (store (store (store s0 13 (- (select s0 13) 1)) 17 (+ (select s0 17) 1)) 9 (- (select s0 9) 1)) 22 (+ (select s0 22) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 9) 1) (>= (select s0 13) 1)) (= (store (store (store (store s0 13 (- (select s0 13) 1)) 17 (+ (select s0 17) 1)) 9 (- (select s0 9) 1)) 22 (+ (select s0 22) 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-12 06:02:03] [INFO ] Built C files in 828ms 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 1589263323910

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-158897699300657"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;