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-158961257300185.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-d2n3m1t12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257300185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.9K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 19K 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-d2n3m1t12-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-15

=== Now, execution of the tool begins

BK_START 1589841546398

[2020-05-18 22:39:08] [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-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): 35 ms
[2020-05-18 22:39:08] [INFO ] Transformed 9 places.
[2020-05-18 22:39:08] [INFO ] Transformed 72 transitions.
[2020-05-18 22:39:08] [INFO ] Parsed PT model containing 9 places and 72 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 66 ms. (steps per millisecond=1515 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 72 rows 9 cols
[2020-05-18 22:39:08] [INFO ] Computed 1 place invariants in 4 ms
[2020-05-18 22:39:09] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-18 22:39:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 36 ms
FORMULA NeighborGrid-PT-d2n3m1t12-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 10 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 : 7 ms
[2020-05-18 22:39:09] [INFO ] Input system was already deterministic with 72 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/graph17487427927568622036.txt, -o, /tmp/graph17487427927568622036.bin, -w, /tmp/graph17487427927568622036.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/graph17487427927568622036.bin, -l, -1, -v, -w, /tmp/graph17487427927568622036.weights, -q, 0, -e, 0.001], workingDir=null]
[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 62 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 72 rows 9 cols
[2020-05-18 22:39:09] [INFO ] Computed 1 place invariants in 1 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 2 ms
[2020-05-18 22:39:09] [INFO ] Flatten gal took : 63 ms
[2020-05-18 22:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2020-05-18 22:39:09] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-18 22:39:09] [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 15 LTL properties
Checking formula 0 : !(((("(gu0.p_0_2<=gu0.p_2_0)")&&((G("((gu0.p_0_2<=gu0.p_2_0)||(gu0.p_0_0>=2))"))||("(gu1.p_1_1>=3)")))U(X("(gu1.p_1_1>=2)"))))
Formula 0 simplified : !(("(gu0.p_0_2<=gu0.p_2_0)" & ("(gu1.p_1_1>=3)" | G"((gu0.p_0_2<=gu0.p_2_0)||(gu0.p_0_0>=2))")) U X"(gu1.p_1_1>=2)")
[2020-05-18 22:39:09] [INFO ] Proved 9 variables to be positive in 97 ms
[2020-05-18 22:39:09] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2020-05-18 22:39:09] [INFO ] Computation of disable matrix completed :0/72 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 22:39:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 22:39:09] [INFO ] Computing symmetric may enable matrix : 72 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.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.11556,19912,1,0,25,14799,45,7,416,15403,70
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(!(F((G(X("(gu1.p_1_2<=gu1.p_2_1)")))||("(gu1.p_2_1>=1)")))))||(G(("(gu0.p_0_1>=2)")U("(gu1.p_1_2<=gu1.p_2_1)"))))))
Formula 1 simplified : !F(G!F("(gu1.p_2_1>=1)" | GX"(gu1.p_1_2<=gu1.p_2_1)") | G("(gu0.p_0_1>=2)" U "(gu1.p_1_2<=gu1.p_2_1)"))
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 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.213616,23148,1,0,66,30632,90,21,464,34586,206
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G((X("(gu1.p_1_0<=gu1.p_1_2)"))||("(gu1.p_1_0<=gu1.p_1_2)")))U("((gu0.p_0_0>=0)&&(gu1.p_1_1>=3))")))
Formula 2 simplified : !(G("(gu1.p_1_0<=gu1.p_1_2)" | X"(gu1.p_1_0<=gu1.p_1_2)") U "((gu0.p_0_0>=0)&&(gu1.p_1_1>=3))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.24147,23900,1,0,82,36410,100,28,490,40878,259
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((X((("(gu1.p_1_0<=gu1.p_2_2)")U("(gu1.p_1_2<=gu1.p_2_1)"))||("(gu1.p_1_0<=gu1.p_2_2)")))||(X(X(G("(gu1.p_1_2<=gu1.p_2_1)")))))))
Formula 3 simplified : !G(X("(gu1.p_1_0<=gu1.p_2_2)" | ("(gu1.p_1_0<=gu1.p_2_2)" U "(gu1.p_1_2<=gu1.p_2_1)")) | XXG"(gu1.p_1_2<=gu1.p_2_1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
6 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.299004,25736,1,0,118,45027,115,40,507,52097,352
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(gu1.p_1_2>=1)")))U(("(gu0.p_0_0>=1)")U(F(!(G("(gu1.p_1_2>=1)")))))))
Formula 4 simplified : !(!F"(gu1.p_1_2>=1)" U ("(gu0.p_0_0>=1)" U F!G"(gu1.p_1_2>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.332408,26000,1,0,131,46363,124,47,508,53741,399
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((G("(gu1.p_1_0>=1)"))||("((gu0.p_0_0>=3)&&(gu1.p_2_2<=gu1.p_1_0))"))))
Formula 5 simplified : !G("((gu0.p_0_0>=3)&&(gu1.p_2_2<=gu1.p_1_0))" | G"(gu1.p_1_0>=1)")
4 unique states visited
4 strongly connected components in search stack
5 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.35335,26788,1,0,141,49949,141,47,520,58288,455
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F("(gu0.p_0_2<=gu0.p_0_0)"))))
Formula 6 simplified : !GF"(gu0.p_0_2<=gu0.p_0_0)"
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.365682,26788,1,0,143,51789,150,47,538,60288,468
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(!((X("(gu0.p_2_0<=gu0.p_0_2)"))U(X(X("(gu0.p_0_1>=3)"))))))))
Formula 7 simplified : !XX!(X"(gu0.p_2_0<=gu0.p_0_2)" U XX"(gu0.p_0_1>=3)")
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
6 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.434624,28608,1,0,163,61990,158,53,561,71822,518
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(X("(gu1.p_1_2<=gu0.p_2_0)")))U("((gu1.p_2_1>gu0.p_0_1)&&((gu1.p_1_2>gu0.p_2_0)||(gu1.p_2_2<3)))")))
Formula 8 simplified : !(!X"(gu1.p_1_2<=gu0.p_2_0)" U "((gu1.p_2_1>gu0.p_0_1)&&((gu1.p_1_2>gu0.p_2_0)||(gu1.p_2_2<3)))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.559704,31824,1,0,182,79219,169,59,614,96998,576
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(((!(("(gu1.p_1_1>=3)")U(X(G("(gu1.p_1_1>=3)")))))U(F("(gu0.p_0_1<=gu0.p_0_0)")))U("((gu1.p_1_0>=2)&&(gu1.p_1_1>=3))")))))
Formula 9 simplified : !XF((!("(gu1.p_1_1>=3)" U XG"(gu1.p_1_1>=3)") U F"(gu0.p_0_1<=gu0.p_0_0)") U "((gu1.p_1_0>=2)&&(gu1.p_1_1>=3))")
3 unique states visited
3 strongly connected components in search stack
3 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.575533,32088,1,0,192,81439,178,63,618,99289,615
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(!(G(X((F(G(F("((gu1.p_2_2<=gu0.p_0_2)&&(gu1.p_1_0<=gu1.p_2_1))"))))U("(gu1.p_1_0<=gu1.p_2_1)")))))))
Formula 10 simplified : !F!GX(FGF"((gu1.p_2_2<=gu0.p_0_2)&&(gu1.p_1_0<=gu1.p_2_1))" U "(gu1.p_1_0<=gu1.p_2_1)")
3 unique states visited
3 strongly connected components in search stack
3 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.667961,33892,1,0,228,91011,191,78,652,111990,716
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((X(!(F(X("(gu1.p_1_2<=gu1.p_1_0)")))))U(G((!(G("(gu1.p_1_2<=gu0.p_0_0)")))||("(gu1.p_1_2>gu1.p_1_0)"))))))
Formula 11 simplified : !F(X!FX"(gu1.p_1_2<=gu1.p_1_0)" U G("(gu1.p_1_2>gu1.p_1_0)" | !G"(gu1.p_1_2<=gu0.p_0_0)"))
3 unique states visited
3 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.695001,34652,1,0,236,94219,210,84,684,116443,746
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((!(F(G("(gu0.p_0_2<=gu0.p_2_0)"))))||(!(F(X(G("(gu0.p_2_0<3)"))))))||(!(("(gu0.p_0_1<=gu0.p_2_0)")U("(gu0.p_0_2<=gu0.p_2_0)")))))
Formula 12 simplified : !(!FG"(gu0.p_0_2<=gu0.p_2_0)" | !FXG"(gu0.p_2_0<3)" | !("(gu0.p_0_1<=gu0.p_2_0)" U "(gu0.p_0_2<=gu0.p_2_0)"))
3 unique states visited
3 strongly connected components in search stack
3 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.72674,35672,1,0,252,99886,229,91,691,122711,796
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F("(gu0.p_0_2>=2)"))U(G("(gu0.p_0_2>=2)"))))
Formula 13 simplified : !(F"(gu0.p_0_2>=2)" U G"(gu0.p_0_2>=2)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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.814164,37520,1,0,306,112292,242,121,692,137261,933
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F("(gu0.p_2_0>=1)"))U(((F(X("(gu1.p_2_1<=gu1.p_1_1)")))U(F(X(G("(gu0.p_2_0<=gu0.p_0_0)")))))&&("(gu1.p_2_1<=gu1.p_1_1)"))))
Formula 14 simplified : !(F"(gu0.p_2_0>=1)" U ("(gu1.p_2_1<=gu1.p_1_1)" & (FX"(gu1.p_2_1<=gu1.p_1_1)" U FXG"(gu0.p_2_0<=gu0.p_0_0)")))
3 unique states visited
3 strongly connected components in search stack
3 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,0.88858,39860,1,0,344,126184,264,145,709,153109,1045
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 22:39:12] [INFO ] Computing symmetric co enabling matrix : 72 transitions.
[2020-05-18 22:39:12] [INFO ] Computation of co-enabling matrix(0/72) took 68 ms. Total solver calls (SAT/UNSAT): 71(71/0)
[2020-05-18 22:39:15] [INFO ] Computation of co-enabling matrix(56/72) took 3085 ms. Total solver calls (SAT/UNSAT): 2451(2451/0)
[2020-05-18 22:39:16] [INFO ] Computation of Finished co-enabling matrix. took 3513 ms. Total solver calls (SAT/UNSAT): 2556(2556/0)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
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-18 22:39:16] [INFO ] Built C files in 6928ms 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 1589841556507

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

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