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.r096-oct2-158940145000393.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 JoinFreeModules-PT-0004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Apr 7 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 5 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 23K Mar 24 05:37 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 JoinFreeModules-PT-0004-00
FORMULA_NAME JoinFreeModules-PT-0004-01
FORMULA_NAME JoinFreeModules-PT-0004-02
FORMULA_NAME JoinFreeModules-PT-0004-03
FORMULA_NAME JoinFreeModules-PT-0004-04
FORMULA_NAME JoinFreeModules-PT-0004-05
FORMULA_NAME JoinFreeModules-PT-0004-06
FORMULA_NAME JoinFreeModules-PT-0004-07
FORMULA_NAME JoinFreeModules-PT-0004-08
FORMULA_NAME JoinFreeModules-PT-0004-09
FORMULA_NAME JoinFreeModules-PT-0004-10
FORMULA_NAME JoinFreeModules-PT-0004-11
FORMULA_NAME JoinFreeModules-PT-0004-12
FORMULA_NAME JoinFreeModules-PT-0004-13
FORMULA_NAME JoinFreeModules-PT-0004-14
FORMULA_NAME JoinFreeModules-PT-0004-15

=== Now, execution of the tool begins

BK_START 1589574095569

[2020-05-15 20:21:38] [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-15 20:21:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:21:38] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-15 20:21:38] [INFO ] Transformed 21 places.
[2020-05-15 20:21:38] [INFO ] Transformed 33 transitions.
[2020-05-15 20:21:38] [INFO ] Parsed PT model containing 21 places and 33 transitions in 77 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 368 resets, run finished after 114 ms. (steps per millisecond=877 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 33 rows 20 cols
[2020-05-15 20:21:38] [INFO ] Computed 4 place invariants in 3 ms
[2020-05-15 20:21:38] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 20:21:38] [INFO ] Flatten gal took : 35 ms
[2020-05-15 20:21:38] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:21:38] [INFO ] Applying decomposition
[2020-05-15 20:21:38] [INFO ] Flatten gal took : 4 ms
[2020-05-15 20:21:38] [INFO ] Input system was already deterministic with 33 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 33 rows 20 cols
[2020-05-15 20:21:39] [INFO ] Computed 4 place invariants in 1 ms
inv : p6 + p7 + p8 + p9 + p10 = 7
inv : p1 + p2 + p3 + p4 + p5 = 7
inv : p11 + p12 + p13 + p14 + p15 = 7
inv : p16 + p17 + p18 + p19 + p20 = 7
Total of 4 invariants.
[2020-05-15 20:21:39] [INFO ] Computed 4 place invariants in 2 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/graph15322826150284808730.txt, -o, /tmp/graph15322826150284808730.bin, -w, /tmp/graph15322826150284808730.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/graph15322826150284808730.bin, -l, -1, -v, -w, /tmp/graph15322826150284808730.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:21:39] [INFO ] Proved 20 variables to be positive in 118 ms
[2020-05-15 20:21:39] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2020-05-15 20:21:39] [INFO ] Computation of disable matrix completed :0/33 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:39] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2020-05-15 20:21:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:39] [INFO ] Decomposing Gal with order
[2020-05-15 20:21:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:21:39] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-15 20:21:39] [INFO ] Flatten gal took : 68 ms
[2020-05-15 20:21:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-15 20:21:39] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-15 20:21:39] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 10 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 16 LTL properties
Checking formula 0 : !(((G(F("(gu1.p10>=2)")))&&((F((G("(gu1.p10>=2)"))||("(gu1.p8<=gu1.p10)")))||(X("(gu0.p4>=1)")))))
Formula 0 simplified : !(GF"(gu1.p10>=2)" & (F("(gu1.p8<=gu1.p10)" | G"(gu1.p10>=2)") | X"(gu0.p4>=1)"))
Reverse transition relation is NOT exact ! Due to transitions gu1.t12, gu2.t26, t2, t3, t4, t10, t11, t18, t19, t20, t27, t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/20/12/32
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
16 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.211411,23040,1,0,197,31893,93,157,1005,43899,382
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((!(G(("(gu3.p12>=1)")U("(gu3.p1<=gu3.p7)"))))||(!(("(gu3.p12>=1)")U("(gu1.p14>=3)"))))||(!(F(G(X("(gu3.p1<=gu4.p19)"))))))))
Formula 1 simplified : !X(!G("(gu3.p12>=1)" U "(gu3.p1<=gu3.p7)") | !("(gu3.p12>=1)" U "(gu1.p14>=3)") | !FGX"(gu3.p1<=gu4.p19)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
33 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.544198,36936,1,0,393,94385,139,401,1050,162027,851
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((((X("(gu1.p6<=gu1.p14)"))U("(gu4.p16<=gu4.p20)"))U(G("(gu1.p6>gu1.p14)")))&&((("(gu1.p6<=gu1.p14)")U("(gu1.p6>=1)"))||(G("(gu4.p16<=gu4.p20)")))))
Formula 2 simplified : !(((X"(gu1.p6<=gu1.p14)" U "(gu4.p16<=gu4.p20)") U G"(gu1.p6>gu1.p14)") & (("(gu1.p6<=gu1.p14)" U "(gu1.p6>=1)") | G"(gu4.p16<=gu4.p20)"))
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
42 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.964027,44652,1,0,504,127262,201,510,1142,220376,1160
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(X(("(gu1.p8<=gu1.p14)")U(!(F(X(X("(gu1.p8<=gu1.p14)"))))))))))
Formula 3 simplified : GX("(gu1.p8<=gu1.p14)" U !FXX"(gu1.p8<=gu1.p14)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.0925,49052,1,0,604,148096,213,611,1157,256419,1425
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(X(G("(gu3.p1<=gu3.p12)"))))))
Formula 4 simplified : !XGXG"(gu3.p1<=gu3.p12)"
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
63 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.72233,64364,1,0,786,210610,219,758,1165,390680,1731
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((G(!(G(!(X("(gu3.p5>=1)"))))))U("(gu1.p6<=gu0.p4)")))))
Formula 5 simplified : !FX(G!G!X"(gu3.p5>=1)" U "(gu1.p6<=gu0.p4)")
Computing Next relation with stutter on 16 deadlock states
[2020-05-15 20:21:41] [INFO ] Computing symmetric co enabling matrix : 33 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
34 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,2.06837,69908,1,0,893,236029,228,865,1178,434573,2013
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X("((gu2.p18<0)||(gu0.p4<1))"))))
Formula 6 simplified : !FX"((gu2.p18<0)||(gu0.p4<1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
21 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,2.26485,74132,1,0,1054,256908,237,1018,1182,469189,2288
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(F(G((G((F("(gu4.p20>=1)"))&&("(gu1.p14>=2)")))||(G("(gu1.p14>=2)"))))))))
Formula 7 simplified : XFG(G("(gu1.p14>=2)" & F"(gu4.p20>=1)") | G"(gu1.p14>=2)")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.26683,74132,1,0,1056,257127,246,1020,1184,469402,2301
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("(gu3.p1<=1)")))U(X(("(gu3.p1<=1)")&&((X("(gu2.p18>=1)"))||("(gu3.p2>=2)"))))))
Formula 8 simplified : !(XG"(gu3.p1<=1)" U X("(gu3.p1<=1)" & ("(gu3.p2>=2)" | X"(gu2.p18>=1)")))
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.26893,74396,1,0,1056,257134,254,1020,1188,469415,2307
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!(F(G(X(F("((gu3.p5<=gu3.p12)||(gu0.p4<=gu0.p15))"))))))))
Formula 9 simplified : !F!FGXF"((gu3.p5<=gu3.p12)||(gu0.p4<=gu0.p15))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
7 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,2.35792,75968,1,0,1062,265511,267,1028,1217,482064,2329
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!(((G(X("(gu1.p14>=1)")))&&("(gu4.p19>=3)"))U(F((F(G(X("(gu3.p2>=1)"))))U("(gu4.p19<=gu4.p20)")))))))
Formula 10 simplified : !X!(("(gu4.p19>=3)" & GX"(gu1.p14>=1)") U F(FGX"(gu3.p2>=1)" U "(gu4.p19<=gu4.p20)"))
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.36038,76232,1,0,1062,265511,273,1028,1223,482065,2334
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(F(G(F("(gu3.p1<=gu3.p12)")))))))
Formula 11 simplified : !XXFGF"(gu3.p1<=gu3.p12)"
Computing Next relation with stutter on 16 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,2.36927,76496,1,0,1064,266890,279,1030,1223,484264,2345
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X((G("(gu1.p9>=3)"))U("(gu2.p11>gu2.p17)")))||((F("(gu4.p19>=3)"))&&((G("(gu1.p9>=3)"))||(F("(gu2.p11<=gu2.p17)"))))))
Formula 12 simplified : !(X(G"(gu1.p9>=3)" U "(gu2.p11>gu2.p17)") | (F"(gu4.p19>=3)" & (G"(gu1.p9>=3)" | F"(gu2.p11<=gu2.p17)")))
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.48344,78872,1,0,1182,277438,316,1143,1255,499678,2649
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(((X("(gu3.p5>=2)"))U("(((gu2.p13>gu2.p17)&&(gu0.p4>=1))&&(gu3.p5>=2))"))||(F("(gu3.p5>=2)")))))
Formula 13 simplified : !F((X"(gu3.p5>=2)" U "(((gu2.p13>gu2.p17)&&(gu0.p4>=1))&&(gu3.p5>=2))") | F"(gu3.p5>=2)")
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
19 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,2.66393,83624,1,0,1294,303238,329,1256,1276,542270,2947
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G((X("(gu0.p3<=gu0.p4)"))||("(gu3.p5>=1)"))))
Formula 14 simplified : !G("(gu3.p5>=1)" | X"(gu0.p3<=gu0.p4)")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.66505,83888,1,0,1294,303238,346,1256,1287,542270,2959
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(F("(gu4.p16>=3)")))&&(X(F(G("(gu2.p17>=1)"))))))
Formula 15 simplified : !(XF"(gu4.p16>=3)" & XFG"(gu2.p17>=1)")
Computing Next relation with stutter on 16 deadlock states
[2020-05-15 20:21:42] [INFO ] Computation of co-enabling matrix(26/33) took 1005 ms. Total solver calls (SAT/UNSAT): 129(96/33)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.70844,84944,1,0,1501,309377,360,1551,1290,553252,3485
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 20:21:42] [INFO ] Computation of Finished co-enabling matrix. took 1360 ms. Total solver calls (SAT/UNSAT): 144(108/36)
[2020-05-15 20:21:42] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:630)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-15 20:21:42] [INFO ] Built C files in 3831ms 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 1589574103396

--------------------
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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r096-oct2-158940145000393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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