Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257300178.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NeighborGrid-PT-d2n3m1c12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 11K 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 NeighborGrid-PT-d2n3m1c12-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-15

=== Now, execution of the tool begins

BK_START 1589841545778

[2020-05-18 22:39:08] [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-18 22:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 22:39:08] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-18 22:39:08] [INFO ] Transformed 9 places.
[2020-05-18 22:39:08] [INFO ] Transformed 40 transitions.
[2020-05-18 22:39:08] [INFO ] Parsed PT model containing 9 places and 40 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 38 steps, including 0 resets, run visited all 18 properties in 3 ms. (steps per millisecond=12 )
[2020-05-18 22:39:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 33 ms
FORMULA NeighborGrid-PT-d2n3m1c12-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 22:39:09] [INFO ] Applying decomposition
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 5 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/graph2989961305460869605.txt, -o, /tmp/graph2989961305460869605.bin, -w, /tmp/graph2989961305460869605.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/graph2989961305460869605.bin, -l, -1, -v, -w, /tmp/graph2989961305460869605.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 22:39:09] [INFO ] Input system was already deterministic with 40 transitions.
[2020-05-18 22:39:09] [INFO ] Decomposing Gal with order
[2020-05-18 22:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 22:39:09] [INFO ] Removed a total of 30 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 9 cols
[2020-05-18 22:39:09] [INFO ] Computed 1 place invariants in 10 ms
inv : p_0_0 + p_0_1 + p_0_2 + p_1_0 + p_1_1 + p_1_2 + p_2_0 + p_2_1 + p_2_2 = 9
Total of 1 invariants.
[2020-05-18 22:39:09] [INFO ] Computed 1 place invariants in 12 ms
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 121 ms
[2020-05-18 22:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2020-05-18 22:39:09] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-18 22:39:09] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/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 : !(((G(F(X("(i0.u0.p_2_2>=1)"))))U(("(i0.u0.p_2_2<1)")U(G("(i0.u0.p_2_2>=1)")))))
Formula 0 simplified : !(GFX"(i0.u0.p_2_2>=1)" U ("(i0.u0.p_2_2<1)" U G"(i0.u0.p_2_2>=1)"))
built 1 ordering constraints for composite.
built 11 ordering constraints for composite.
[2020-05-18 22:39:09] [INFO ] Proved 9 variables to be positive in 150 ms
[2020-05-18 22:39:09] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2020-05-18 22:39:09] [INFO ] Computation of disable matrix completed :0/40 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 22:39:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 22:39:09] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2020-05-18 22:39:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
40 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.45313,31392,1,0,14659,7811,284,73389,113,79293,9315
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(i0.u1.p_0_2>=1)"))))
Formula 1 simplified : !GF"(i0.u1.p_0_2>=1)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.471624,32084,1,0,15406,8135,302,75496,114,81843,10437
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F(X("(u2.p_2_1>=1)")))U(X(F(!(F((G("(u2.p_2_1>=1)"))||("(i0.u0.p_1_1>=1)")))))))))
Formula 2 simplified : !X(FX"(u2.p_2_1>=1)" U XF!F("(i0.u0.p_1_1>=1)" | G"(u2.p_2_1>=1)"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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.4961,33184,1,0,16876,8254,320,77862,114,83049,12183
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(G("(i0.u1.p_0_1>=1)")))||(X("(i0.u1.p_1_2>=1)")))))
Formula 3 simplified : !G(FG"(i0.u1.p_0_1>=1)" | X"(i0.u1.p_1_2>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
23 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.728249,39204,1,0,23004,11274,345,107235,115,117897,16605
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G("((i0.u1.p_1_2>=1)||(i0.u1.p_0_1<1))")))
Formula 4 simplified : !G"((i0.u1.p_1_2>=1)||(i0.u1.p_0_1<1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.14915,53196,1,0,37539,17088,362,182174,117,194322,25335
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((G(F("(i0.u1.p_1_2>=1)")))U((F((F("(u2.p_2_1>=1)"))&&("(u2.p_2_1>=1)")))&&(G("(i0.u1.p_1_2<1)"))))))
Formula 5 simplified : !X(GF"(i0.u1.p_1_2>=1)" U (F("(u2.p_2_1>=1)" & F"(u2.p_2_1>=1)") & G"(i0.u1.p_1_2<1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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.32158,57072,1,0,41232,18587,377,195798,119,206723,28348
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F((!(X("(i0.u0.p_1_1>=1)")))&&("(i0.u1.p_1_2<1)")))))
Formula 6 simplified : !XF("(i0.u1.p_1_2<1)" & !X"(i0.u0.p_1_1>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
67 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.99739,72384,1,0,60439,23651,394,266782,119,268614,39747
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(X("(i0.u1.p_0_2<1)")))&&(G(X(("(u2.p_2_0>=1)")U(X("((u2.p_2_0>=1)||(i0.u1.p_0_1>=1))")))))))
Formula 7 simplified : !(GX"(i0.u1.p_0_2<1)" & GX("(u2.p_2_0>=1)" U X"((u2.p_2_0>=1)||(i0.u1.p_0_1>=1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
47 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.47148,86844,1,0,78813,28242,399,326089,119,322785,53174
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((("(i0.u0.p_1_1>=1)")U(("(i0.u1.p_1_2>=1)")U("(i0.u0.p_1_1>=1)")))&&((G(!(G(F("(i0.u1.p_0_1>=1)")))))U(F(X("(i0.u0.p_1_1>=1)"))))))
Formula 8 simplified : !(("(i0.u0.p_1_1>=1)" U ("(i0.u1.p_1_2>=1)" U "(i0.u0.p_1_1>=1)")) & (G!GF"(i0.u1.p_0_1>=1)" U FX"(i0.u0.p_1_1>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
50 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.97099,101088,1,0,96305,36091,413,394214,119,393108,63430
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(((!(("(i0.u1.p_1_2>=1)")U("(u2.p_2_0>=1)")))U("(u2.p_2_1>=1)"))||(!(G(X(G("(i0.u1.p_1_2>=1)"))))))))
Formula 9 simplified : !X((!("(i0.u1.p_1_2>=1)" U "(u2.p_2_0>=1)") U "(u2.p_2_1>=1)") | !GXG"(i0.u1.p_1_2>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
48 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,3.44891,107664,1,0,101627,38729,430,424818,123,424874,65554
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(("(i0.u1.p_1_2>=1)")||((G(("(u2.p_1_0>=1)")U((F("(u2.p_2_0>=1)"))&&("(u2.p_1_0>=1)"))))&&("(u2.p_2_0>=1)")))))
Formula 10 simplified : !G("(i0.u1.p_1_2>=1)" | ("(u2.p_2_0>=1)" & G("(u2.p_1_0>=1)" U ("(u2.p_1_0>=1)" & F"(u2.p_2_0>=1)"))))
[2020-05-18 22:39:13] [INFO ] Computing symmetric co enabling matrix : 40 transitions.
[2020-05-18 22:39:13] [INFO ] Computation of co-enabling matrix(0/40) took 86 ms. Total solver calls (SAT/UNSAT): 39(39/0)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
95 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,4.3989,125596,1,0,120492,46911,461,505215,128,505909,74208
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G("((i0.u0.p_1_1>=1)||(i0.u1.p_0_2>=1))"))))
Formula 11 simplified : !XG"((i0.u0.p_1_1>=1)||(i0.u1.p_0_2>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,4.73349,134572,1,0,128295,51441,474,551829,128,556620,78604
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(("(i0.u0.p_0_0<1)")||((F((X("(u2.p_1_0>=1)"))&&("(i0.u0.p_1_1>=1)")))&&(G("(i0.u1.p_0_1>=1)")))))))
Formula 12 simplified : !XX("(i0.u0.p_0_0<1)" | (F("(i0.u0.p_1_1>=1)" & X"(u2.p_1_0>=1)") & G"(i0.u1.p_0_1>=1)"))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
90 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,5.62951,153556,1,0,148918,59351,507,635843,128,638874,89555
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 22:39:16] [INFO ] Computation of co-enabling matrix(15/40) took 3186 ms. Total solver calls (SAT/UNSAT): 504(504/0)
SMT solver raised 'unknown', retrying with same input.
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-18 22:39:16] [INFO ] Built C files in 7537ms 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 1589841557487

--------------------
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="NeighborGrid-PT-d2n3m1c12"
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 NeighborGrid-PT-d2n3m1c12, 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 r111-csrt-158961257300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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