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-158922815201034.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-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922815201034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 14 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 14 12:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 14 12:26 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.1K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 14 12:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 14 12:20 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 134K 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-100-00
FORMULA_NAME Eratosthenes-PT-100-01
FORMULA_NAME Eratosthenes-PT-100-02
FORMULA_NAME Eratosthenes-PT-100-03
FORMULA_NAME Eratosthenes-PT-100-04
FORMULA_NAME Eratosthenes-PT-100-05
FORMULA_NAME Eratosthenes-PT-100-06
FORMULA_NAME Eratosthenes-PT-100-07
FORMULA_NAME Eratosthenes-PT-100-08
FORMULA_NAME Eratosthenes-PT-100-09
FORMULA_NAME Eratosthenes-PT-100-10
FORMULA_NAME Eratosthenes-PT-100-11
FORMULA_NAME Eratosthenes-PT-100-12
FORMULA_NAME Eratosthenes-PT-100-13
FORMULA_NAME Eratosthenes-PT-100-14
FORMULA_NAME Eratosthenes-PT-100-15

=== Now, execution of the tool begins

BK_START 1590158453666

[2020-05-22 14:40:55] [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:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:40:55] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-05-22 14:40:55] [INFO ] Transformed 99 places.
[2020-05-22 14:40:55] [INFO ] Transformed 283 transitions.
[2020-05-22 14:40:55] [INFO ] Found NUPN structural information;
[2020-05-22 14:40:55] [INFO ] Parsed PT model containing 99 places and 283 transitions in 110 ms.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1532 resets, run finished after 369 ms. (steps per millisecond=271 ) properties seen :[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, 1, 1, 1]
[2020-05-22 14:40:56] [INFO ] Flow matrix only has 74 transitions (discarded 137 similar events)
// Phase 1: matrix 74 rows 74 cols
[2020-05-22 14:40:56] [INFO ] Computed 0 place invariants in 3 ms
[2020-05-22 14:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:56] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-22 14:40:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 14:40:56] [INFO ] Flatten gal took : 44 ms
FORMULA Eratosthenes-PT-100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 14:40:56] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 14:40:56] [INFO ] Applying decomposition
[2020-05-22 14:40:56] [INFO ] Flatten gal took : 12 ms
[2020-05-22 14:40:56] [INFO ] Input system was already deterministic with 211 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/graph1316024231677550392.txt, -o, /tmp/graph1316024231677550392.bin, -w, /tmp/graph1316024231677550392.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/graph1316024231677550392.bin, -l, -1, -v, -w, /tmp/graph1316024231677550392.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 14:40:56] [INFO ] Decomposing Gal with order
[2020-05-22 14:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 14:40:56] [INFO ] Removed a total of 200 redundant transitions.
[2020-05-22 14:40:56] [INFO ] Flatten gal took : 82 ms
[2020-05-22 14:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 14:40:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-22 14:40:56] [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 : !((X(((!(G("(((u40.p48!=1)||(u55.p4!=1))||(u73.p78==1))")))&&(!(F("(u73.p78==1)"))))&&("((u16.p96!=1)||(u54.p6!=1))"))))
Formula 0 simplified : !X("((u16.p96!=1)||(u54.p6!=1))" & !G"(((u40.p48!=1)||(u55.p4!=1))||(u73.p78==1))" & !F"(u73.p78==1)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
built 137 ordering constraints for composite.
Normalized transition count is 74 out of 211 initially.
// Phase 1: matrix 74 rows 74 cols
[2020-05-22 14:40:56] [INFO ] Computed 0 place invariants in 1 ms
Total of 0 invariants.
[2020-05-22 14:40:56] [INFO ] Computed 0 place invariants in 2 ms
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
20 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.229188,28832,1,0,28119,199,1620,30407,19,146,40071
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(("((u22.p18!=1)||(u71.p72!=1))")U(X(G("((u22.p18==1)&&(u71.p72==1))"))))))
Formula 1 simplified : "((u22.p18!=1)||(u71.p72!=1))" U XG"((u22.p18==1)&&(u71.p72==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
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.293019,33832,1,0,40760,199,1717,43366,19,146,58405
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X("((u5.p86==1)||((u10.p90==1)&&(u17.p10==1)))"))U(X(!(G((F("(u7.p84==1)"))||("(u5.p86==1)"))))))))
Formula 2 simplified : !G(X"((u5.p86==1)||((u10.p90==1)&&(u17.p10==1)))" U X!G("(u5.p86==1)" | F"(u7.p84==1)"))
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 14:40:57] [INFO ] Proved 74 variables to be positive in 322 ms
[2020-05-22 14:40:57] [INFO ] Computing symmetric may disable matrix : 211 transitions.
[2020-05-22 14:40:57] [INFO ] Computation of disable matrix completed :0/211 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:40:57] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:40:57] [INFO ] Computing symmetric may enable matrix : 211 transitions.
[2020-05-22 14:40:57] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
221 unique states visited
0 strongly connected components in search stack
369 transitions explored
77 items max in DFS search stack
70 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.999447,68696,1,0,103451,199,2037,193160,19,146,184494
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(F(G(!((G("(u65.p68==1)"))U(F(X("((u28.p20!=1)||((u7.p84==1)&&(u30.p28==1)))"))))))))))
Formula 3 simplified : !X!FG!(G"(u65.p68==1)" U FX"((u28.p20!=1)||((u7.p84==1)&&(u30.p28==1)))")
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 14:40:58] [INFO ] Computing symmetric co enabling matrix : 211 transitions.
149 unique states visited
0 strongly connected components in search stack
150 transitions explored
76 items max in DFS search stack
45 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.44297,85308,1,0,138015,199,2201,257683,19,146,241122
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(G((X(F((X("((u68.p77!=1)&&(u10.p90!=1))"))&&("(u68.p77==1)"))))&&(X("(u54.p6==1)")))))))
Formula 4 simplified : !FXG(XF("(u68.p77==1)" & X"((u68.p77!=1)&&(u10.p90!=1))") & X"(u54.p6==1)")
Computing Next relation with stutter on 1 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 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,1.4583,86400,1,0,138015,199,2354,257683,19,146,241312
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("(u27.p21==1)"))))
Formula 5 simplified : !FG"(u27.p21==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
29 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.75295,105144,1,0,188090,199,2512,316505,19,146,310663
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G((X(G("(u73.p78==1)")))||("((u26.p26==1)&&(u53.p52==1))")))))
Formula 6 simplified : !FG("((u26.p26==1)&&(u53.p52==1))" | XG"(u73.p78==1)")
Computing Next relation with stutter on 1 deadlock states
76 unique states visited
75 strongly connected components in search stack
77 transitions explored
76 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,1.82304,108236,1,0,193709,199,2564,326392,19,146,325249
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(!(("((u24.p24==1)&&(u56.p8==1))")U("((u56.p8==1)&&(u71.p72==1))"))))))
Formula 7 simplified : !GX!("((u24.p24==1)&&(u56.p8==1))" U "((u56.p8==1)&&(u71.p72==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
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,1.85336,109012,1,0,195629,199,2702,329127,19,146,328773
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(("((u56.p8==1)&&(u16.p96==1))")U("(u16.p96==1)")))U(X(F("(u56.p8==1)")))))
Formula 8 simplified : !(!("((u56.p8==1)&&(u16.p96==1))" U "(u16.p96==1)") U XF"(u56.p8==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
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.06412,115044,1,0,210822,199,2767,345023,19,146,351664
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("((u0.p88==1)&&(u55.p4==1))")))
Formula 9 simplified : !G"((u0.p88==1)&&(u55.p4==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
15 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.20378,123492,1,0,234087,199,2948,369562,19,146,381159
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(F("(u56.p8==1)")))))
Formula 10 simplified : GF"(u56.p8==1)"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
53 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.74578,148304,1,0,298826,199,2955,448523,19,146,462278
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((G("(u56.p8==1)"))||("(u72.p70==1)"))U((F((F("(u11.p91==1)"))&&("(u11.p91!=1)")))&&("(u47.p54==1)"))))
Formula 11 simplified : !(("(u72.p70==1)" | G"(u56.p8==1)") U ("(u47.p54==1)" & F("(u11.p91!=1)" & F"(u11.p91==1)")))
Computing Next relation with stutter on 1 deadlock states
77 unique states visited
77 strongly connected components in search stack
77 transitions explored
77 items max in DFS search stack
57 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.31904,178120,1,0,357035,199,3160,571172,21,146,569416
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Eratosthenes-PT-100-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(G("((u55.p4==1)&&(u71.p72==1))"))))
Formula 12 simplified : G"((u55.p4==1)&&(u71.p72==1))"
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 14:41:00] [INFO ] Computation of co-enabling matrix(109/211) took 1950 ms. Total solver calls (SAT/UNSAT): 979(979/0)
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.41953,183664,1,0,371370,199,3258,585427,21,146,595048
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 14:41:01] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[(declare-fun s0 () (Array Int Int)), (assert (>= (select s0 29) 1)), (assert (>= (select s0 29) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@710921f7
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@710921f7
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
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-22 14:41:01] [INFO ] Built C files in 4696ms 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 1590158461391

--------------------
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-100"
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-100, 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-158922815201034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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