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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.0K Apr 14 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 14 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 14 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.1K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.8K Apr 14 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 14 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 15K 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-020-00
FORMULA_NAME Eratosthenes-PT-020-01
FORMULA_NAME Eratosthenes-PT-020-02
FORMULA_NAME Eratosthenes-PT-020-03
FORMULA_NAME Eratosthenes-PT-020-04
FORMULA_NAME Eratosthenes-PT-020-05
FORMULA_NAME Eratosthenes-PT-020-06
FORMULA_NAME Eratosthenes-PT-020-07
FORMULA_NAME Eratosthenes-PT-020-08
FORMULA_NAME Eratosthenes-PT-020-09
FORMULA_NAME Eratosthenes-PT-020-10
FORMULA_NAME Eratosthenes-PT-020-11
FORMULA_NAME Eratosthenes-PT-020-12
FORMULA_NAME Eratosthenes-PT-020-13
FORMULA_NAME Eratosthenes-PT-020-14
FORMULA_NAME Eratosthenes-PT-020-15

=== Now, execution of the tool begins

BK_START 1590158368501

[2020-05-22 14:39:30] [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:39:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:39:30] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-05-22 14:39:30] [INFO ] Transformed 19 places.
[2020-05-22 14:39:30] [INFO ] Transformed 27 transitions.
[2020-05-22 14:39:30] [INFO ] Found NUPN structural information;
[2020-05-22 14:39:30] [INFO ] Parsed PT model containing 19 places and 27 transitions in 65 ms.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 23 steps, including 2 resets, run visited all 22 properties in 2 ms. (steps per millisecond=11 )
[2020-05-22 14:39:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 14:39:30] [INFO ] Flatten gal took : 22 ms
FORMULA Eratosthenes-PT-020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 14:39:30] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 14:39:30] [INFO ] Applying decomposition
[2020-05-22 14:39:30] [INFO ] Flatten gal took : 4 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/graph17993384269954379199.txt, -o, /tmp/graph17993384269954379199.bin, -w, /tmp/graph17993384269954379199.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/graph17993384269954379199.bin, -l, -1, -v, -w, /tmp/graph17993384269954379199.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 14:39:31] [INFO ] Input system was already deterministic with 20 transitions.
[2020-05-22 14:39:31] [INFO ] Decomposing Gal with order
[2020-05-22 14:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 14:39:31] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-22 14:39:31] [INFO ] Flatten gal took : 37 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-22 14:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
Normalized transition count is 11 out of 20 initially.
// Phase 1: matrix 11 rows 11 cols
[2020-05-22 14:39:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-22 14:39:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
[2020-05-22 14:39:31] [INFO ] Computed 0 place invariants in 11 ms
Total of 0 invariants.
[2020-05-22 14:39:31] [INFO ] Computed 0 place invariants in 12 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 15 LTL properties
Checking formula 0 : !(((F(X("((u2.p8==1)&&(u8.p16==1))")))U((G("(u9.p18==1)"))&&(F(X("(u9.p18==1)"))))))
Formula 0 simplified : !(FX"((u2.p8==1)&&(u8.p16==1))" U (G"(u9.p18==1)" & FX"(u9.p18==1)"))
[2020-05-22 14:39:31] [INFO ] Proved 11 variables to be positive in 65 ms
[2020-05-22 14:39:31] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-22 14:39:31] [INFO ] Computation of disable matrix completed :0/20 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:39:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 14:39:31] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2020-05-22 14:39:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 9 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 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.028691,17276,1,0,437,22,203,609,19,18,1251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(((("(u7.p15==1)")U(G("(u7.p15==1)")))&&(("(u6.p14==1)")U("((u1.p4==1)&&(u10.p20==1))")))&&(F("(u6.p14==1)"))))))
Formula 1 simplified : F(("(u7.p15==1)" U G"(u7.p15==1)") & ("(u6.p14==1)" U "((u1.p4==1)&&(u10.p20==1))") & F"(u6.p14==1)")
Computing Next relation with stutter on 1 deadlock states
53 unique states visited
0 strongly connected components in search stack
62 transitions explored
12 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.044018,18648,1,0,1611,22,304,2412,19,18,5215
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(X(!(G(!(F("(u1.p4==1)")))))))))
Formula 2 simplified : !F!X!G!F"(u1.p4==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
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.04842,18912,1,0,2229,22,325,3215,19,18,6334
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((X(G(!(G("(u7.p15==1)")))))&&(F(X(G("(u1.p4!=1)")))))))
Formula 3 simplified : !F(XG!G"(u7.p15==1)" & FXG"(u1.p4!=1)")
Computing Next relation with stutter on 1 deadlock states
23 unique states visited
0 strongly connected components in search stack
23 transitions explored
12 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.05318,19152,1,0,2463,22,330,3563,19,18,6922
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((F("(u7.p15==1)"))U(X(G("((u2.p8==1)&&(u8.p16==1))"))))||(!(F("((u2.p8==1)&&(u8.p16==1))"))))U(X(("(u0.p6==1)")U("(u2.p8==1)")))))
Formula 4 simplified : !(((F"(u7.p15==1)" U XG"((u2.p8==1)&&(u8.p16==1))") | !F"((u2.p8==1)&&(u8.p16==1))") U X("(u0.p6==1)" U "(u2.p8==1)"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.062105,19808,1,0,2810,22,430,3993,19,18,7929
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(!(F("((((u2.p8!=1)||(u8.p16!=1))&&(u10.p20!=1))&&((u2.p8!=1)||(u8.p16!=1)))"))))))
Formula 5 simplified : !XG!F"((((u2.p8!=1)||(u8.p16!=1))&&(u10.p20!=1))&&((u2.p8!=1)||(u8.p16!=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
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.066005,19808,1,0,3194,22,471,4623,19,18,8934
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(u6.p14==1)")U(X(!(X(X("(u1.p4==1)")))))))
Formula 6 simplified : !("(u6.p14==1)" U X!XX"(u1.p4==1)")
Computing Next relation with stutter on 1 deadlock states
22 unique states visited
13 strongly connected components in search stack
22 transitions explored
13 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.070813,20072,1,0,3729,22,496,5306,19,18,10111
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(X("(u7.p15==1)")))||(!(X(G("((u7.p15==1)||(u10.p20==1))"))))))
Formula 7 simplified : !(GX"(u7.p15==1)" | !XG"((u7.p15==1)||(u10.p20==1))")
Computing Next relation with stutter on 1 deadlock states
22 unique states visited
0 strongly connected components in search stack
21 transitions explored
12 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.073954,20072,1,0,3846,22,528,5514,19,18,10720
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X(X(("(u4.p10!=1)")&&(!(F("(u4.p10==1)"))))))))
Formula 8 simplified : !XXX("(u4.p10!=1)" & !F"(u4.p10==1)")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.075626,20336,1,0,3879,22,554,5563,24,18,10903
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(!(G("(u9.p18!=1)"))))U(((X(("(u9.p18==1)")U("(u4.p10==1)")))&&("(u1.p4==1)"))&&("(u10.p20==1)"))))
Formula 9 simplified : !(F!G"(u9.p18!=1)" U ("(u1.p4==1)" & "(u10.p20==1)" & X("(u9.p18==1)" U "(u4.p10==1)")))
Computing Next relation with stutter on 1 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 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.080817,20336,1,0,4174,22,629,5995,24,18,12243
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(X(!(G("(u7.p15==1)")))))&&(F((F("((u1.p4!=1)||(u2.p8!=1))"))&&("(u2.p8!=1)")))))
Formula 10 simplified : !(!X!G"(u7.p15==1)" & F("(u2.p8!=1)" & F"((u1.p4!=1)||(u2.p8!=1))"))
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.08415,20600,1,0,4345,22,647,6414,24,18,12956
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(X(((X(X(G("((u0.p6==1)&&(u5.p12==1))"))))&&(("(u9.p18==1)")U("(u9.p18==1)")))&&(G("((u0.p6==1)&&(u5.p12==1))")))))))
Formula 11 simplified : !GFX("(u9.p18==1)" & G"((u0.p6==1)&&(u5.p12==1))" & XXG"((u0.p6==1)&&(u5.p12==1))")
Computing Next relation with stutter on 1 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 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.085786,20600,1,0,4345,22,691,6414,24,18,13017
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F((((X(F(G("((u0.p6==1)&&(u9.p18==1))"))))||(X(X("((u0.p6==1)&&(u9.p18==1))"))))||("(u2.p8==1)"))||("((u3.p9==1)&&(u9.p18==1))")))))
Formula 12 simplified : !GF("((u3.p9==1)&&(u9.p18==1))" | "(u2.p8==1)" | XFG"((u0.p6==1)&&(u9.p18==1))" | XX"((u0.p6==1)&&(u9.p18==1))")
Computing Next relation with stutter on 1 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.088938,20600,1,0,4443,22,748,6529,24,18,13366
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(G("((u1.p4==1)&&(u10.p20==1))")))))
Formula 13 simplified : !XXG"((u1.p4==1)&&(u10.p20==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
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.092419,20600,1,0,4748,22,757,6900,24,18,13961
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((!(X(!(X((G(X(G("(u9.p18==1)"))))||(F("(u5.p12==1)"))))))))
Formula 14 simplified : X!X(GXG"(u9.p18==1)" | F"(u5.p12==1)")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.096633,20864,1,0,5107,22,821,7439,24,18,15068
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-22 14:39:31] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 1) 1) (>= (select s0 8) 1)) (= (store s0 8 (- (select s0 8) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 1) 1) (>= (select s0 8) 1)) (= (store s0 8 (- (select s0 8) 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: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: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:39:31] [INFO ] Built C files in 278ms 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 1590158371640

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

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