Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................................................................
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 19K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
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 r261-csrt-152732585800061
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527500008288

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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
Read 16 LTL properties
Checking formula 0 : !((G(F(F(G("(p_1_1<=p_0_2)"))))))
Formula 0 simplified : !GFG"(p_1_1<=p_0_2)"
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
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.179541,20076,1,0,44,23359,24,25,471,22243,113
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(p_2_2>=2)")U(G(F("(p_1_2<=p_1_0)")))))
Formula 1 simplified : !("(p_2_2>=2)" U GF"(p_1_2<=p_1_0)")
3 unique states visited
3 strongly connected components in search stack
4 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,0.220594,20864,1,0,46,26727,37,25,506,25575,132
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((("(p_1_2>=2)")U("(p_0_0<=p_0_1)"))U("(p_2_1<=p_2_0)")))
Formula 2 simplified : !(("(p_1_2>=2)" U "(p_0_0<=p_0_1)") U "(p_2_1<=p_2_0)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.222549,21412,1,0,46,26727,59,25,528,25575,138
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(G(F("(p_0_1>=1)"))))))
Formula 3 simplified : !FGF"(p_0_1>=1)"
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.234537,21412,1,0,48,28251,68,25,529,26958,149
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(p_2_0>=1)"))
Formula 4 simplified : !"(p_2_0>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.234879,21412,1,0,48,28251,71,25,530,26958,151
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(p_2_2>=1)"))
Formula 5 simplified : !"(p_2_2>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.235115,21668,1,0,48,28251,74,25,531,26958,153
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(F("(p_0_1<=p_0_2)"))))))
Formula 6 simplified : !FXF"(p_0_1<=p_0_2)"
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,0.279813,22988,1,0,70,39173,83,33,545,37980,201
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(G(X("(p_0_1>=1)"))))))
Formula 7 simplified : !XGX"(p_0_1>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.304525,23764,1,0,83,44914,88,39,545,42728,245
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(p_0_0<=p_2_2)"))
Formula 8 simplified : !"(p_0_0<=p_2_2)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.305011,24028,1,0,83,44914,91,39,548,42728,247
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((F("(p_2_2<=p_0_2)"))U(G("(p_0_0<=p_2_2)")))))
Formula 9 simplified : !F(F"(p_2_2<=p_0_2)" U G"(p_0_0<=p_2_2)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 72 rows 9 cols
invariant :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
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
14 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.451855,27548,1,0,120,68506,101,63,565,66251,355
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F(("(p_2_1<=p_0_2)")U("(p_2_1<=p_0_2)")))))
Formula 10 simplified : !GF"(p_2_1<=p_0_2)"
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,0.457535,27548,1,0,122,69488,110,63,586,67225,366
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F("(p_1_0>=3)"))))
Formula 11 simplified : !GF"(p_1_0>=3)"
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.462461,27804,1,0,124,70358,119,63,587,68051,377
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(X(X("(p_1_2>=2)"))))))
Formula 12 simplified : !GFXX"(p_1_2>=2)"
4 unique states visited
4 strongly connected components in search stack
5 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,0.464096,28056,1,0,126,70516,126,64,587,68184,390
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((G("(p_1_0<=p_0_2)"))U("(p_1_2<=p_1_1)"))))
Formula 13 simplified : !X(G"(p_1_0<=p_0_2)" U "(p_1_2<=p_1_1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.587222,31312,1,0,145,89953,138,70,632,89365,442
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(F(G(F("(p_1_2<=p_1_1)"))))))
Formula 14 simplified : !XFGF"(p_1_2<=p_1_1)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.597249,31576,1,0,147,91202,145,70,632,90473,455
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G(F("(p_0_0<=p_1_0)")))U(("(p_2_0>=2)")U("(p_0_0>=2)"))))
Formula 15 simplified : !(GF"(p_0_0<=p_1_0)" U ("(p_2_0>=2)" U "(p_0_0>=2)"))
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.628333,32536,1,0,163,97035,160,77,653,95589,508
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527500012100

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 9:33:30 AM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
May 28, 2018 9:33:30 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 9:33:30 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
May 28, 2018 9:33:30 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 9 places.
May 28, 2018 9:33:30 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 72 transitions.
May 28, 2018 9:33:30 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
May 28, 2018 9:33:30 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
May 28, 2018 9:33:31 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
May 28, 2018 9:33:31 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 28, 2018 9:33:31 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 72 transitions.
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 6 ms
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 9 variables to be positive in 144 ms
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 72 transitions.
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/72 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 72 transitions.
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:33:31 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 3) 1) (= (store (store s0 0 (+ (select s0 0) 1)) 3 (- (select s0 3) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 9:33:31 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 626ms conformant to PINS in folder :/home/mcc/execution

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="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1t12.tgz
mv NeighborGrid-PT-d2n3m1t12 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
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 r261-csrt-152732585800061"
echo "====================================================================="
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
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 ;