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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 17K 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 DoubleExponent-PT-001-00
FORMULA_NAME DoubleExponent-PT-001-01
FORMULA_NAME DoubleExponent-PT-001-02
FORMULA_NAME DoubleExponent-PT-001-03
FORMULA_NAME DoubleExponent-PT-001-04
FORMULA_NAME DoubleExponent-PT-001-05
FORMULA_NAME DoubleExponent-PT-001-06
FORMULA_NAME DoubleExponent-PT-001-07
FORMULA_NAME DoubleExponent-PT-001-08
FORMULA_NAME DoubleExponent-PT-001-09
FORMULA_NAME DoubleExponent-PT-001-10
FORMULA_NAME DoubleExponent-PT-001-11
FORMULA_NAME DoubleExponent-PT-001-12
FORMULA_NAME DoubleExponent-PT-001-13
FORMULA_NAME DoubleExponent-PT-001-14
FORMULA_NAME DoubleExponent-PT-001-15

=== Now, execution of the tool begins

BK_START 1590133741967

[2020-05-22 07:49:04] [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 07:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:49:04] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-05-22 07:49:04] [INFO ] Transformed 57 places.
[2020-05-22 07:49:04] [INFO ] Transformed 48 transitions.
[2020-05-22 07:49:04] [INFO ] Parsed PT model containing 57 places and 48 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3307 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 48 rows 57 cols
[2020-05-22 07:49:04] [INFO ] Computed 9 place invariants in 7 ms
[2020-05-22 07:49:04] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned unsat
[2020-05-22 07:49:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-05-22 07:49:04] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-22 07:49:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 07:49:05] [INFO ] Flatten gal took : 29 ms
FORMULA DoubleExponent-PT-001-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:49:05] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 07:49:05] [INFO ] Applying decomposition
[2020-05-22 07:49:05] [INFO ] Flatten gal took : 5 ms
Built C files in :
/home/mcc/execution
[2020-05-22 07:49:05] [INFO ] Input system was already deterministic with 48 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/graph1776782030480133921.txt, -o, /tmp/graph1776782030480133921.bin, -w, /tmp/graph1776782030480133921.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/graph1776782030480133921.bin, -l, -1, -v, -w, /tmp/graph1776782030480133921.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:49:05] [INFO ] Decomposing Gal with order
[2020-05-22 07:49:05] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 48 rows 57 cols
[2020-05-22 07:49:05] [INFO ] Computed 9 place invariants in 2 ms
inv : 3*p1 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 3*p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + 3*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + 2*p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + 2*p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + 2*p6 + p7 = 3
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p4 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p7 = 1
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 = 2
inv : p22 - p26 - p27 - p28 - p29 - p30 - p31 - p32 - p33 - p34 - p35 - p37 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : -p19 - p20 + p55 - p57 = 0
inv : -p20 + p56 - p57 = 0
inv : 2*p1 + p10 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p4 - p48 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p7 = 1
Total of 9 invariants.
[2020-05-22 07:49:05] [INFO ] Computed 9 place invariants in 3 ms
[2020-05-22 07:49:05] [INFO ] Removed a total of 11 redundant transitions.
[2020-05-22 07:49:05] [INFO ] Flatten gal took : 44 ms
[2020-05-22 07:49:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-22 07:49:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-22 07:49:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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 14 LTL properties
Checking formula 0 : !((X(G("(i4.u17.p47<1)"))))
Formula 0 simplified : !XG"(i4.u17.p47<1)"
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-22 07:49:05] [INFO ] Proved 57 variables to be positive in 121 ms
[2020-05-22 07:49:05] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2020-05-22 07:49:05] [INFO ] Computation of disable matrix completed :0/48 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:49:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:49:05] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2020-05-22 07:49:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t19, t9, i0.i1.t16, i2.t25, i2.u9.t30, i4.t37, i4.u17.t42, i6.u2.t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/8/47
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.067124,18272,1,0,4011,233,868,5365,127,730,15970
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("(i0.i0.u3.p19>=1)")))U("((i1.u7.p24>=1)&&(i6.u2.p42>=1))")))
Formula 1 simplified : !(!F"(i0.i0.u3.p19>=1)" U "((i1.u7.p24>=1)&&(i6.u2.p42>=1))")
Computing Next relation with stutter on 16 deadlock states
15 unique states visited
15 strongly connected components in search stack
15 transitions explored
15 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.098062,20220,1,0,7032,233,934,8366,128,747,26468
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(("(i4.u16.p45>=1)")U(X(G(F("(i5.u1.p6>=1)")))))))
Formula 2 simplified : !X("(i4.u16.p45>=1)" U XGF"(i5.u1.p6>=1)")
Computing Next relation with stutter on 16 deadlock states
109 unique states visited
109 strongly connected components in search stack
110 transitions explored
109 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.129593,21664,1,0,8481,235,955,11870,128,772,34726
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X(G((X("((i3.u10.p10>=1)&&(i0.i1.u11.p16>=1))"))&&((!(F(X(G("(i0.i1.u6.p21>=1)")))))||(!(X("(i3.u4.p2>=1)"))))))))))
Formula 3 simplified : !FGXG(X"((i3.u10.p10>=1)&&(i0.i1.u11.p16>=1))" & (!FXG"(i0.i1.u6.p21>=1)" | !X"(i3.u4.p2>=1)"))
Computing Next relation with stutter on 16 deadlock states
109 unique states visited
108 strongly connected components in search stack
111 transitions explored
109 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.137333,23516,1,0,8517,235,983,11957,128,772,35115
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F(X(X("((i5.u1.p13>=1)&&(i4.u16.p46>=1))"))))||(G(F(G("(i4.u14.p38>=1)")))))))
Formula 4 simplified : !X(FXX"((i5.u1.p13>=1)&&(i4.u16.p46>=1))" | GFG"(i4.u14.p38>=1)")
Computing Next relation with stutter on 16 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.169291,25100,1,0,12219,239,1017,15580,128,786,47587
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(!(X(F(X((X((G("(i4.u14.p38>=1)"))&&("(i3.u4.p2>=1)")))&&(!(F("(i4.u14.p39>=1)")))))))))))
Formula 5 simplified : G!XFX(X("(i3.u4.p2>=1)" & G"(i4.u14.p38>=1)") & !F"(i4.u14.p39>=1)")
Computing Next relation with stutter on 16 deadlock states
39 unique states visited
23 strongly connected components in search stack
56 transitions explored
23 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.181839,26156,1,0,12813,239,1095,16497,136,786,51604
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G("(i2.u8.p26<1)"))||((X("(i0.i0.u3.p19<1)"))&&(("(i2.u8.p27>=1)")U("((i2.u8.p26>=1)&&(i0.i0.u3.p19<1))")))))
Formula 6 simplified : !(G"(i2.u8.p26<1)" | (X"(i0.i0.u3.p19<1)" & ("(i2.u8.p27>=1)" U "((i2.u8.p26>=1)&&(i0.i0.u3.p19<1))")))
Computing Next relation with stutter on 16 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.191135,26156,1,0,12959,239,1162,16710,138,786,52461
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((i6.u23.p15<1)||(i4.u14.p38>=1))")))
Formula 7 simplified : !G"((i6.u23.p15<1)||(i4.u14.p38>=1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.193883,26420,1,0,13046,239,1176,16882,138,786,52976
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("(i5.u1.p6>=1)"))&&(F("(i6.u2.p7<1)"))))
Formula 8 simplified : !(F"(i5.u1.p6>=1)" & F"(i6.u2.p7<1)")
Computing Next relation with stutter on 16 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.194985,26420,1,0,13062,239,1189,16906,138,786,53210
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(!(X(G("(i6.u2.p7>=1)"))))))
Formula 9 simplified : !X!XG"(i6.u2.p7>=1)"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.195394,26420,1,0,13062,239,1203,16906,138,786,53220
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((!(G(("((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))")U(F("(i5.u19.p51>=1)")))))||("(i1.u7.p23>=1)"))))
Formula 10 simplified : !G("(i1.u7.p23>=1)" | !G("((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))" U F"(i5.u19.p51>=1)"))
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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.231482,27740,1,0,16337,239,1237,20306,138,786,63503
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((G(F(G(F("(i4.u14.p39>=1)")))))&&((!(F(G("(i1.u7.p23>=1)"))))||("(i4.u14.p39>=1)")))))
Formula 11 simplified : !G(GFGF"(i4.u14.p39>=1)" & ("(i4.u14.p39>=1)" | !FG"(i1.u7.p23>=1)"))
Computing Next relation with stutter on 16 deadlock states
110 unique states visited
109 strongly connected components in search stack
111 transitions explored
109 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.237189,28268,1,0,16453,240,1247,20441,138,787,64565
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F(F(("(i2.u9.p35>=1)")U("((i1.u13.p36>=1)&&(i1.u13.p54>=1))"))))||(G(X(!(X("(i2.u9.p35>=1)")))))))
Formula 12 simplified : !(F("(i2.u9.p35>=1)" U "((i1.u13.p36>=1)&&(i1.u13.p54>=1))") | GX!X"(i2.u9.p35>=1)")
Computing Next relation with stutter on 16 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.242475,28268,1,0,16810,240,1304,20856,142,787,66283
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(!(G(F(X(F("((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))")))))))U(F(X("((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))")))))
Formula 13 simplified : !(F!GFXF"((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))" U FX"((i0.i1.u6.p22>=1)&&(i1.u13.p37>=1))")
Computing Next relation with stutter on 16 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.25119,28532,1,0,17853,240,1327,21826,142,787,70235
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 07:49:05] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-22 07:49:05] [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 07:49:05] [WARNING] Script execution failed on command (assert (and (>= (select s0 13) 1) (= (store (store (store s0 14 (+ (select s0 14) 1)) 13 (- (select s0 13) 1)) 18 (+ (select s0 18) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 13) 1) (= (store (store (store s0 14 (+ (select s0 14) 1)) 13 (- (select s0 13) 1)) 18 (+ (select s0 18) 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 07:49:05] [INFO ] Built C files in 453ms 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 1590133746046

--------------------
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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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-158922814800746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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