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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.0K Mar 31 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 31 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 20:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 20:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 36K 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 DNAwalker-PT-01track12Block1-00
FORMULA_NAME DNAwalker-PT-01track12Block1-01
FORMULA_NAME DNAwalker-PT-01track12Block1-02
FORMULA_NAME DNAwalker-PT-01track12Block1-03
FORMULA_NAME DNAwalker-PT-01track12Block1-04
FORMULA_NAME DNAwalker-PT-01track12Block1-05
FORMULA_NAME DNAwalker-PT-01track12Block1-06
FORMULA_NAME DNAwalker-PT-01track12Block1-07
FORMULA_NAME DNAwalker-PT-01track12Block1-08
FORMULA_NAME DNAwalker-PT-01track12Block1-09
FORMULA_NAME DNAwalker-PT-01track12Block1-10
FORMULA_NAME DNAwalker-PT-01track12Block1-11
FORMULA_NAME DNAwalker-PT-01track12Block1-12
FORMULA_NAME DNAwalker-PT-01track12Block1-13
FORMULA_NAME DNAwalker-PT-01track12Block1-14
FORMULA_NAME DNAwalker-PT-01track12Block1-15

=== Now, execution of the tool begins

BK_START 1590100005253

[2020-05-21 22:26:46] [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-21 22:26:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 22:26:47] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-21 22:26:47] [INFO ] Transformed 13 places.
[2020-05-21 22:26:47] [INFO ] Transformed 82 transitions.
[2020-05-21 22:26:47] [INFO ] Parsed PT model containing 13 places and 82 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 12202 resets, run finished after 196 ms. (steps per millisecond=510 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-05-21 22:26:47] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
// Phase 1: matrix 81 rows 13 cols
[2020-05-21 22:26:47] [INFO ] Computed 0 place invariants in 3 ms
[2020-05-21 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-21 22:26:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 22:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Nat]Absence check using state equation in 43 ms returned unsat
[2020-05-21 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-21 22:26:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 22:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned unsat
[2020-05-21 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-21 22:26:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 22:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned unsat
[2020-05-21 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-21 22:26:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 22:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 22:26:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-21 22:26:47] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-21 22:26:47] [INFO ] Flatten gal took : 31 ms
FORMULA DNAwalker-PT-01track12Block1-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 22:26:47] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 22:26:47] [INFO ] Applying decomposition
[2020-05-21 22:26:47] [INFO ] Flatten gal took : 22 ms
[2020-05-21 22:26:48] [INFO ] Input system was already deterministic with 82 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/graph10928021663985082993.txt, -o, /tmp/graph10928021663985082993.bin, -w, /tmp/graph10928021663985082993.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/graph10928021663985082993.bin, -l, -1, -v, -w, /tmp/graph10928021663985082993.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 81 out of 82 initially.
// Phase 1: matrix 81 rows 13 cols
[2020-05-21 22:26:48] [INFO ] Computed 0 place invariants in 1 ms
Total of 0 invariants.
[2020-05-21 22:26:48] [INFO ] Computed 0 place invariants in 2 ms
[2020-05-21 22:26:48] [INFO ] Decomposing Gal with order
[2020-05-21 22:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 22:26:48] [INFO ] Removed a total of 134 redundant transitions.
[2020-05-21 22:26:48] [INFO ] Proved 13 variables to be positive in 68 ms
[2020-05-21 22:26:48] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2020-05-21 22:26:48] [INFO ] Computation of disable matrix completed :0/82 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:26:48] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:26:48] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2020-05-21 22:26:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:26:48] [INFO ] Flatten gal took : 34 ms
[2020-05-21 22:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-21 22:26:48] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-21 22:26:48] [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 10 LTL properties
Checking formula 0 : !(((X((F("((u0.A1>=2)&&(u1.A2>=1))"))U(X(("((u4.A5>=2)&&(u6.A7>=1))")U("((u3.A4>=2)&&(u9.A10>=1))")))))U((!(F("((u3.A4>=2)&&(u9.A10>=1))")))||(X("((u0.A1>=2)&&(u1.A2>=1))")))))
Formula 0 simplified : !(X(F"((u0.A1>=2)&&(u1.A2>=1))" U X("((u4.A5>=2)&&(u6.A7>=1))" U "((u3.A4>=2)&&(u9.A10>=1))")) U (!F"((u3.A4>=2)&&(u9.A10>=1))" | X"((u0.A1>=2)&&(u1.A2>=1))"))
built 42 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t1_2, t1_3, t1_4, t1_5, t1_9, t2_3, t2_4, t2_5, t2_6, t2_9, t2_10, t3_2, t3_4, t3_5, t3_6, t3_7, t3_9, t3_10, t3_11, t4_2, t4_3, t4_5, t4_6, t4_7, t4_9, t4_10, t4_11, t5_2, t5_3, t5_4, t5_6, t5_7, t5_8, t5_9, t5_10, t5_11, t6_2, t6_3, t6_4, t6_5, t6_8, t6_9, t6_10, t7_3, t7_4, t7_5, t7_9, t9_2, t9_3, t9_4, t9_5, t9_6, t9_7, t9_10, t9_11, t9_12, t10_2, t10_3, t10_4, t10_5, t10_6, t10_9, t10_12, t11_3, t11_4, t11_5, t11_9, u4.tb5, u4.tAb5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/8/69/82
Computing Next relation with stutter on 6 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
9 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.108734,23148,1,0,11919,67,782,12270,56,169,36024
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G((F((G(((F("((u3.A4>=2)&&(u8.A9>=1))"))&&("(u2.A3>=2)"))&&("(u8.A9>=1)")))||("((u4.A5>=2)&&(u6.A7>=1))")))||("((u2.A3>=2)&&(u8.A9>=1))")))))
Formula 1 simplified : G("((u2.A3>=2)&&(u8.A9>=1))" | F("((u4.A5>=2)&&(u6.A7>=1))" | G("(u2.A3>=2)" & "(u8.A9>=1)" & F"((u3.A4>=2)&&(u8.A9>=1))")))
Computing Next relation with stutter on 6 deadlock states
89 unique states visited
0 strongly connected components in search stack
104 transitions explored
12 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.252127,30036,1,0,24239,67,957,29175,59,169,87267
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DNAwalker-PT-01track12Block1-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(F((("(u7.A8<2)")&&((G("(u7.A8>=2)"))||("((u3.A4>=2)&&(u8.A9>=1))")))U(G("(u7.A8>=2)")))))))
Formula 2 simplified : !FXF(("(u7.A8<2)" & ("((u3.A4>=2)&&(u8.A9>=1))" | G"(u7.A8>=2)")) U G"(u7.A8>=2)")
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.290766,31356,1,0,28299,67,979,33226,59,169,96870
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G(((X(X(G(X("((((u0.A1>=1)&&(u3.A4>=2))||(u3.A4<2))||(u6.A7<1))")))))||("(u5.A6<2)"))||("(u9.A10<1)"))))))
Formula 3 simplified : !XFG("(u5.A6<2)" | "(u9.A10<1)" | XXGX"((((u0.A1>=1)&&(u3.A4>=2))||(u3.A4<2))||(u6.A7<1))")
Computing Next relation with stutter on 6 deadlock states
222 unique states visited
0 strongly connected components in search stack
283 transitions explored
13 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,0.401654,36004,1,0,36689,67,1038,47239,59,169,132564
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DNAwalker-PT-01track12Block1-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(F(X(((((X("((u4.A5>=1)&&(u10.A11>=2))"))||(!(G("((u1.A2>=1)&&(u9.A10>=2))"))))||("((u4.A5>=1)&&(u5.A6>=2))"))&&("(u4.A5>=1)"))&&("(u6.A7>=2)"))))))
Formula 4 simplified : FX("(u4.A5>=1)" & "(u6.A7>=2)" & ("((u4.A5>=1)&&(u5.A6>=2))" | X"((u4.A5>=1)&&(u10.A11>=2))" | !G"((u1.A2>=1)&&(u9.A10>=2))"))
Computing Next relation with stutter on 6 deadlock states
14 unique states visited
12 strongly connected components in search stack
15 transitions explored
12 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.468529,38352,1,0,41601,67,1090,53447,59,171,146565
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(G("((u4.A5>=2)&&(u5.A6>=1))")))))
Formula 5 simplified : !XXG"((u4.A5>=2)&&(u5.A6>=1))"
Computing Next relation with stutter on 6 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.482117,38880,1,0,42879,67,1157,54953,59,171,150673
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("((u0.A1>=2)&&(u2.A3>=1))")U("((u2.A3>=1)&&(u10.A11>=2))"))U((G("((u2.A3>=1)&&(u10.A11>=2))"))U("((u2.A3>=1)&&(u10.A11>=2))"))))
Formula 6 simplified : !(("((u0.A1>=2)&&(u2.A3>=1))" U "((u2.A3>=1)&&(u10.A11>=2))") U (G"((u2.A3>=1)&&(u10.A11>=2))" U "((u2.A3>=1)&&(u10.A11>=2))"))
Computing Next relation with stutter on 6 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.487542,39144,1,0,43156,67,1263,55298,59,171,151771
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(("((u4.A5<2)||(u10.A11<1))")U(F("((u1.A2>=1)&&(u5.A6>=2))"))))))
Formula 7 simplified : X("((u4.A5<2)||(u10.A11<1))" U F"((u1.A2>=1)&&(u5.A6>=2))")
Computing Next relation with stutter on 6 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.513028,40464,1,0,45876,67,1341,58715,59,171,160542
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(((u3.A4<2)||(u5.A6<1))&&((u2.A3<2)||(u4.A5<1)))"))U(G(X(G("((u2.A3>=1)&&(u4.A5>=2))"))))))
Formula 8 simplified : !(G"(((u3.A4<2)||(u5.A6<1))&&((u2.A3<2)||(u4.A5<1)))" U GXG"((u2.A3>=1)&&(u4.A5>=2))")
Computing Next relation with stutter on 6 deadlock states
15 unique states visited
12 strongly connected components in search stack
16 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.528654,41252,1,0,46883,67,1439,59551,59,174,164421
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(G((X("(((u0.A1>=1)&&(u4.A5>=2))||((u1.A2>=1)&&(u3.A4>=2)))"))||(X(!(X(G(X("((u1.A2>=2)&&(u4.A5>=1))")))))))))))
Formula 9 simplified : !XXG(X"(((u0.A1>=1)&&(u4.A5>=2))||((u1.A2>=1)&&(u3.A4>=2)))" | X!XGX"((u1.A2>=2)&&(u4.A5>=1))")
Computing Next relation with stutter on 6 deadlock states
36 unique states visited
0 strongly connected components in search stack
39 transitions explored
15 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.544366,41516,1,0,47892,67,1532,60634,59,174,169019
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DNAwalker-PT-01track12Block1-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 22:26:48] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 0) 2) (>= (select s0 1) 1)) (= (store (store s0 0 (- (select s0 0) 2)) 1 (+ (select s0 1) 1)) s1))) with error
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-21 22:26:48] [INFO ] Built C files in 989ms 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 1590100009152

--------------------
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="DNAwalker-PT-01track12Block1"
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 DNAwalker-PT-01track12Block1, 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-158922813800082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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