Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922815201026.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Eratosthenes-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922815201026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 14 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 14 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 14 12:25 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.4K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 14 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 14 12:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 14 12:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 54K 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 Eratosthenes-PT-050-00
FORMULA_NAME Eratosthenes-PT-050-01
FORMULA_NAME Eratosthenes-PT-050-02
FORMULA_NAME Eratosthenes-PT-050-03
FORMULA_NAME Eratosthenes-PT-050-04
FORMULA_NAME Eratosthenes-PT-050-05
FORMULA_NAME Eratosthenes-PT-050-06
FORMULA_NAME Eratosthenes-PT-050-07
FORMULA_NAME Eratosthenes-PT-050-08
FORMULA_NAME Eratosthenes-PT-050-09
FORMULA_NAME Eratosthenes-PT-050-10
FORMULA_NAME Eratosthenes-PT-050-11
FORMULA_NAME Eratosthenes-PT-050-12
FORMULA_NAME Eratosthenes-PT-050-13
FORMULA_NAME Eratosthenes-PT-050-14
FORMULA_NAME Eratosthenes-PT-050-15

=== Now, execution of the tool begins

BK_START 1590158412436

[2020-05-22 14:40:13] [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-22 14:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:40:14] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-05-22 14:40:14] [INFO ] Transformed 49 places.
[2020-05-22 14:40:14] [INFO ] Transformed 108 transitions.
[2020-05-22 14:40:14] [INFO ] Found NUPN structural information;
[2020-05-22 14:40:14] [INFO ] Parsed PT model containing 49 places and 108 transitions in 77 ms.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 89 steps, including 2 resets, run visited all 42 properties in 4 ms. (steps per millisecond=22 )
[2020-05-22 14:40:14] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 14:40:14] [INFO ] Flatten gal took : 25 ms
FORMULA Eratosthenes-PT-050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 14:40:14] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 14:40:14] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 14:40:14] [INFO ] Flatten gal took : 23 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/graph12544423740667760632.txt, -o, /tmp/graph12544423740667760632.bin, -w, /tmp/graph12544423740667760632.weights], workingDir=null]
[2020-05-22 14:40:14] [INFO ] Input system was already deterministic with 80 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12544423740667760632.bin, -l, -1, -v, -w, /tmp/graph12544423740667760632.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 14:40:14] [INFO ] Decomposing Gal with order
[2020-05-22 14:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 14:40:14] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-22 14:40:14] [INFO ] Flatten gal took : 35 ms
[2020-05-22 14:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-22 14:40:14] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-22 14:40:14] [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]

Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34 out of 80 initially.
// Phase 1: matrix 34 rows 34 cols
[2020-05-22 14:40:14] [INFO ] Computed 0 place invariants in 3 ms
Total of 0 invariants.
[2020-05-22 14:40:14] [INFO ] Computed 0 place invariants in 3 ms
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 12 LTL properties
Checking formula 0 : !((G((!(X("(u32.p38==1)")))||(F(G((!(G("((u24.p36==1)&&(u28.p4==1))")))||("(u32.p38==1)")))))))
Formula 0 simplified : !G(!X"(u32.p38==1)" | FG("(u32.p38==1)" | !G"((u24.p36==1)&&(u28.p4==1))"))
built 46 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 14:40:14] [INFO ] Proved 34 variables to be positive in 78 ms
[2020-05-22 14:40:14] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2020-05-22 14:40:14] [INFO ] Computation of disable matrix completed :0/80 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:40:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:40:14] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2020-05-22 14:40:14] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
164 unique states visited
0 strongly connected components in search stack
228 transitions explored
36 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.102543,19988,1,0,6575,77,715,10512,19,55,14749
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-050-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(u25.p34!=1)")U(((G(("(u25.p34==1)")U(("((u12.p28!=1)||(u28.p4!=1))")U("((u28.p4!=1)||(u30.p8!=1))"))))&&("(u18.p12==1)"))&&("(u27.p6==1)"))))
Formula 1 simplified : !("(u25.p34!=1)" U ("(u18.p12==1)" & "(u27.p6==1)" & G("(u25.p34==1)" U ("((u12.p28!=1)||(u28.p4!=1))" U "((u28.p4!=1)||(u30.p8!=1))"))))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
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.175352,24480,1,0,14632,77,947,19401,21,55,25461
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("(u23.p30!=1)"))U(((!(F("((u21.p16==1)&&(u30.p8==1))")))&&("(u22.p18==1)"))&&("((u6.p21==1)||(u23.p30==1))"))))
Formula 2 simplified : !(F"(u23.p30!=1)" U ("((u6.p21==1)||(u23.p30==1))" & "(u22.p18==1)" & !F"((u21.p16==1)&&(u30.p8==1))"))
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
35 transitions explored
35 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.245514,28704,1,0,23728,77,1057,33360,21,55,42426
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(G("(u15.p33==1)")))))
Formula 3 simplified : !FXG"(u15.p33==1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.314024,31080,1,0,29943,77,1136,41212,21,55,53042
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G("(u23.p30==1)")))
Formula 4 simplified : !G"(u23.p30==1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
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.326149,31608,1,0,31000,77,1168,42606,21,55,55105
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X("((u11.p44==1)||(u32.p38==1))")))))
Formula 5 simplified : !XGX"((u11.p44==1)||(u32.p38==1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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.358609,32928,1,0,34740,77,1245,47623,21,55,61823
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(((!(X("((u12.p28==1)&&(u19.p14==1))")))||(!(G("((u12.p28==1)&&(u19.p14==1))"))))&&(((X(X("(u20.p15==1)")))||("(u12.p28!=1)"))||("(u19.p14!=1)")))))
Formula 6 simplified : !F((!X"((u12.p28==1)&&(u19.p14==1))" | !G"((u12.p28==1)&&(u19.p14==1))") & ("(u12.p28!=1)" | "(u19.p14!=1)" | XX"(u20.p15==1)"))
Computing Next relation with stutter on 1 deadlock states
98 unique states visited
0 strongly connected components in search stack
97 transitions explored
34 items max in DFS search stack
11 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.464963,36096,1,0,41627,77,1373,57139,21,55,75828
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-050-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(F((F((F("(u24.p36==1)"))||("((u17.p10==1)&&(u29.p50==1))")))||(!(G("(u2.p25==1)"))))))))
Formula 7 simplified : !FXF(F("((u17.p10==1)&&(u29.p50==1))" | F"(u24.p36==1)") | !G"(u2.p25==1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.467244,36360,1,0,41627,77,1412,57139,21,55,75874
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-050-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F((X(F("((u17.p10==1)&&(u23.p30==1))")))||(F("((u3.p24==1)&&(u27.p6==1))"))))&&(G(X((G("((u3.p24==1)&&(u27.p6==1))"))&&("(u12.p28==1)"))))))
Formula 8 simplified : !(F(XF"((u17.p10==1)&&(u23.p30==1))" | F"((u3.p24==1)&&(u27.p6==1))") & GX("(u12.p28==1)" & G"((u3.p24==1)&&(u27.p6==1))"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
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.497286,37416,1,0,45210,77,1519,61467,21,55,81450
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(!(X((("((((u1.p48==1)&&(u21.p16==1))&&(u10.p45==1))&&(u31.p9==1))")U("((u20.p15==1)&&(u23.p30==1))"))U(G(("((u20.p15==1)&&(u23.p30==1))")U(F("((u1.p48==1)&&(u21.p16==1))"))))))))))
Formula 9 simplified : !FX!X(("((((u1.p48==1)&&(u21.p16==1))&&(u10.p45==1))&&(u31.p9==1))" U "((u20.p15==1)&&(u23.p30==1))") U G("((u20.p15==1)&&(u23.p30==1))" U F"((u1.p48==1)&&(u21.p16==1))"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.611408,42432,1,0,58458,77,1614,77349,21,55,100549
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-050-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(!(("((u29.p50==1)||((u16.p32==1)&&(u30.p8==1)))")U(F(("((u23.p30==1)&&(u27.p6==1))")U("(u7.p20==1)"))))))))
Formula 10 simplified : F!("((u29.p50==1)||((u16.p32==1)&&(u30.p8==1)))" U F("((u23.p30==1)&&(u27.p6==1))" U "(u7.p20==1)"))
Computing Next relation with stutter on 1 deadlock states
37 unique states visited
37 strongly connected components in search stack
38 transitions explored
37 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.628751,43488,1,0,60933,77,1686,79988,21,55,104815
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Eratosthenes-PT-050-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(((("((u18.p12==1)&&(u27.p6==1))")U("(u24.p36!=1)"))||(F("(u24.p36!=1)")))||((!(X("((u18.p12==1)&&(u27.p6==1))")))&&("((u10.p45!=1)||(u31.p9!=1))")))))
Formula 11 simplified : !X(("((u18.p12==1)&&(u27.p6==1))" U "(u24.p36!=1)") | F"(u24.p36!=1)" | ("((u10.p45!=1)||(u31.p9!=1))" & !X"((u18.p12==1)&&(u27.p6==1))"))
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 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.658074,44280,1,0,62932,77,1747,82666,21,55,109034
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-050-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 14:40:15] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-22 14:40:15] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-22 14:40:15] [WARNING] Script execution failed on command (assert (and (>= (select s0 17) 1) (= (store s0 17 (- (select s0 17) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 17) 1) (= (store s0 17 (- (select s0 17) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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-22 14:40:15] [INFO ] Built C files in 1109ms 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 1590158415668

--------------------
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="Eratosthenes-PT-050"
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 Eratosthenes-PT-050, 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 r066-tajo-158922815201026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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