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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 141K Apr 27 14:36 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 Dekker-PT-015-00
FORMULA_NAME Dekker-PT-015-01
FORMULA_NAME Dekker-PT-015-02
FORMULA_NAME Dekker-PT-015-03
FORMULA_NAME Dekker-PT-015-04
FORMULA_NAME Dekker-PT-015-05
FORMULA_NAME Dekker-PT-015-06
FORMULA_NAME Dekker-PT-015-07
FORMULA_NAME Dekker-PT-015-08
FORMULA_NAME Dekker-PT-015-09
FORMULA_NAME Dekker-PT-015-10
FORMULA_NAME Dekker-PT-015-11
FORMULA_NAME Dekker-PT-015-12
FORMULA_NAME Dekker-PT-015-13
FORMULA_NAME Dekker-PT-015-14
FORMULA_NAME Dekker-PT-015-15

=== Now, execution of the tool begins

BK_START 1590110852231

[2020-05-22 01:27:33] [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 01:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:27:33] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-22 01:27:33] [INFO ] Transformed 75 places.
[2020-05-22 01:27:33] [INFO ] Transformed 255 transitions.
[2020-05-22 01:27:33] [INFO ] Found NUPN structural information;
[2020-05-22 01:27:33] [INFO ] Parsed PT model containing 75 places and 255 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 254 ms. (steps per millisecond=393 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
[2020-05-22 01:27:34] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2020-05-22 01:27:34] [INFO ] Computed 45 place invariants in 8 ms
[2020-05-22 01:27:34] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-22 01:27:34] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-05-22 01:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:34] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-05-22 01:27:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-05-22 01:27:34] [INFO ] [Real]Added 15 Read/Feed constraints in 13 ms returned sat
[2020-05-22 01:27:34] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 11 ms.
[2020-05-22 01:27:34] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
[2020-05-22 01:27:34] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 01:27:34] [INFO ] Flatten gal took : 58 ms
FORMULA Dekker-PT-015-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:27:34] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:27:34] [INFO ] Applying decomposition
[2020-05-22 01:27:34] [INFO ] Flatten gal took : 19 ms
[2020-05-22 01:27:34] [INFO ] Input system was already deterministic with 255 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/graph12243434959357645472.txt, -o, /tmp/graph12243434959357645472.bin, -w, /tmp/graph12243434959357645472.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/graph12243434959357645472.bin, -l, -1, -v, -w, /tmp/graph12243434959357645472.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:27:34] [INFO ] Decomposing Gal with order
[2020-05-22 01:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 60 out of 255 initially.
// Phase 1: matrix 60 rows 75 cols
[2020-05-22 01:27:34] [INFO ] Computed 45 place invariants in 2 ms
inv : flag_0_12 + p1_12 + p3_12 = 1
inv : flag_1_14 - p1_14 - p3_14 = 0
inv : flag_1_11 - p1_11 - p3_11 = 0
inv : p0_6 + p1_6 + p3_6 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : p0_12 + p1_12 + p3_12 = 1
inv : flag_1_5 - p1_5 - p3_5 = 0
inv : p0_2 + p1_2 + p3_2 = 1
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_1_10 - p1_10 - p3_10 = 0
inv : flag_1_2 - p1_2 - p3_2 = 0
inv : p0_8 + p1_8 + p3_8 = 1
inv : flag_1_7 - p1_7 - p3_7 = 0
inv : p0_0 + p1_0 + p3_0 = 1
inv : p0_5 + p1_5 + p3_5 = 1
inv : p0_3 + p1_3 + p3_3 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : p0_13 + p1_13 + p3_13 = 1
inv : flag_0_11 + p1_11 + p3_11 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_1_3 - p1_3 - p3_3 = 0
inv : flag_1_6 - p1_6 - p3_6 = 0
inv : p0_7 + p1_7 + p3_7 = 1
inv : flag_1_9 - p1_9 - p3_9 = 0
inv : p0_10 + p1_10 + p3_10 = 1
inv : flag_0_10 + p1_10 + p3_10 = 1
inv : flag_0_14 + p1_14 + p3_14 = 1
inv : flag_0_4 + p1_4 + p3_4 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : p0_11 + p1_11 + p3_11 = 1
inv : p0_14 + p1_14 + p3_14 = 1
inv : flag_1_13 - p1_13 - p3_13 = 0
inv : flag_1_8 - p1_8 - p3_8 = 0
inv : p0_9 + p1_9 + p3_9 = 1
inv : flag_1_12 - p1_12 - p3_12 = 0
inv : flag_1_4 - p1_4 - p3_4 = 0
inv : flag_0_13 + p1_13 + p3_13 = 1
inv : flag_1_0 - p1_0 - p3_0 = 0
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : p0_4 + p1_4 + p3_4 = 1
inv : flag_0_9 + p1_9 + p3_9 = 1
Total of 45 invariants.
[2020-05-22 01:27:34] [INFO ] Computed 45 place invariants in 3 ms
[2020-05-22 01:27:34] [INFO ] Removed a total of 683 redundant transitions.
[2020-05-22 01:27:35] [INFO ] Flatten gal took : 65 ms
[2020-05-22 01:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-22 01:27:35] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-22 01:27:35] [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("(((i5.u6.flag_1_5==1)&&(i13.u20.flag_1_12==1))&&(i5.u16.p1_5==1))")))U(F("(((i5.u6.flag_1_5==1)&&(u8.flag_1_8==1))&&(i5.u16.p1_5==1))"))))||(!(X(G("(((i5.u6.flag_1_5==1)&&(i13.u20.flag_1_12==1))&&(i5.u16.p1_5==1))"))))))
Formula 0 simplified : !(!(XG"(((i5.u6.flag_1_5==1)&&(i13.u20.flag_1_12==1))&&(i5.u16.p1_5==1))" U F"(((i5.u6.flag_1_5==1)&&(u8.flag_1_8==1))&&(i5.u16.p1_5==1))") | !XG"(((i5.u6.flag_1_5==1)&&(i13.u20.flag_1_12==1))&&(i5.u16.p1_5==1))")
built 106 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u1.exit_1, u2.exit_2, u5.exit_4, u7.exit_6, u8.exit_8, u9.exit_9, u14.exit_14, u17.exit_7, i0.exit_0, i3.exit_3, i5.exit_5, i9.exit_10, i10.exit_11, i13.exit_12, i14.exit_13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/240/15/255
[2020-05-22 01:27:35] [INFO ] Proved 75 variables to be positive in 159 ms
[2020-05-22 01:27:35] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2020-05-22 01:27:35] [INFO ] Computation of disable matrix completed :0/255 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.078074,18716,1,0,5155,171,2346,2995,251,237,8095
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-015-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(((((X((G("(((i9.u10.flag_1_10==1)&&(u14.flag_1_14==1))&&(i9.u18.p1_10==1))"))U("(((i3.u4.flag_1_3==1)&&(u7.flag_1_6==1))&&(i3.u3.p1_3==1))")))||("(i3.u4.flag_1_3!=1)"))||("(u7.flag_1_6!=1)"))||("(i3.u3.p1_3!=1)"))||("(((i9.u10.flag_1_10==1)&&(u14.flag_1_14==1))&&(i9.u18.p1_10==1))")))))
Formula 1 simplified : !XG("(((i9.u10.flag_1_10==1)&&(u14.flag_1_14==1))&&(i9.u18.p1_10==1))" | "(i3.u3.p1_3!=1)" | "(i3.u4.flag_1_3!=1)" | "(u7.flag_1_6!=1)" | X(G"(((i9.u10.flag_1_10==1)&&(u14.flag_1_14==1))&&(i9.u18.p1_10==1))" U "(((i3.u4.flag_1_3==1)&&(u7.flag_1_6==1))&&(i3.u3.p1_3==1))"))
[2020-05-22 01:27:35] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:27:35] [INFO ] Computing symmetric may enable matrix : 255 transitions.
5 unique states visited
5 strongly connected components in search stack
6 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.092836,20612,1,0,6202,171,2562,4327,261,237,10726
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-015-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((((G(X(F(G("(((u1.flag_1_1==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))")))))&&("(u5.flag_0_4==1)"))&&("(u5.p0_4==1)"))U(G(("(((u1.flag_1_1==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))")U("(((u1.flag_1_1==1)&&(i10.u11.flag_1_11==1))&&(u1.p1_1==1))"))))))
Formula 2 simplified : !F(("(u5.flag_0_4==1)" & "(u5.p0_4==1)" & GXFG"(((u1.flag_1_1==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))") U G("(((u1.flag_1_1==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))" U "(((u1.flag_1_1==1)&&(i10.u11.flag_1_11==1))&&(u1.p1_1==1))"))
[2020-05-22 01:27:35] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.110202,21392,1,0,7215,171,2784,5800,264,237,12995
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-015-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G(!(G("((((((u2.flag_1_2==1)&&(u7.flag_1_6==1))&&(u7.p1_6==1))&&(i0.u0.flag_1_0==1))&&(u17.flag_1_7==1))&&(i0.u15.p1_0==1))")))))))
Formula 3 simplified : !XFG!G"((((((u2.flag_1_2==1)&&(u7.flag_1_6==1))&&(u7.p1_6==1))&&(i0.u0.flag_1_0==1))&&(u17.flag_1_7==1))&&(i0.u15.p1_0==1))"
3 unique states visited
3 strongly connected components in search stack
4 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.118069,21648,1,0,7612,171,2997,6233,264,237,13991
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G((!(X("(((u2.flag_1_2==1)&&(i13.u20.flag_1_12==1))&&(u2.p1_2==1))")))&&((!(G(F("(((u1.flag_1_1==1)&&(u5.flag_1_4==1))&&(u1.p1_1==1))"))))||(!(G("(((u9.flag_1_9==1)&&(i10.u11.flag_1_11==1))&&(u9.p1_9==1))"))))))))
Formula 4 simplified : !XG(!X"(((u2.flag_1_2==1)&&(i13.u20.flag_1_12==1))&&(u2.p1_2==1))" & (!GF"(((u1.flag_1_1==1)&&(u5.flag_1_4==1))&&(u1.p1_1==1))" | !G"(((u9.flag_1_9==1)&&(i10.u11.flag_1_11==1))&&(u9.p1_9==1))"))
5 unique states visited
5 strongly connected components in search stack
6 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.130789,22352,1,0,8748,171,3185,7686,264,237,16598
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-015-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(("((i13.u12.flag_0_12==1)&&(i13.u20.p0_12==1))")U(F(G("(((u1.flag_1_1==1)&&(i10.u11.flag_1_11==1))&&(u1.p1_1==1))"))))))
Formula 5 simplified : !F("((i13.u12.flag_0_12==1)&&(i13.u20.p0_12==1))" U FG"(((u1.flag_1_1==1)&&(i10.u11.flag_1_11==1))&&(u1.p1_1==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.160783,24200,1,0,12940,171,3220,13196,264,237,25112
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-015-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(((u1.flag_1_1!=1)||(u7.flag_1_6!=1))||(u7.p1_6!=1))")U(G((X(X(G("(((i0.u0.flag_1_0==1)&&(i10.u11.flag_1_11==1))&&(i0.u15.p1_0==1))"))))||("(((u5.flag_1_4==1)&&(i14.u13.flag_1_13==1))&&(u5.p1_4==1))")))))
Formula 6 simplified : !("(((u1.flag_1_1!=1)||(u7.flag_1_6!=1))||(u7.p1_6!=1))" U G("(((u5.flag_1_4==1)&&(i14.u13.flag_1_13==1))&&(u5.p1_4==1))" | XXG"(((i0.u0.flag_1_0==1)&&(i10.u11.flag_1_11==1))&&(i0.u15.p1_0==1))"))
7 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 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.196623,25664,1,0,15478,171,3565,16828,266,237,30624
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-015-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X("(((u5.flag_1_4==1)&&(i10.u11.flag_1_11==1))&&(u5.p1_4==1))"))))
Formula 7 simplified : !GX"(((u5.flag_1_4==1)&&(i10.u11.flag_1_11==1))&&(u5.p1_4==1))"
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.204954,25928,1,0,15532,171,3598,16868,266,237,30880
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-015-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G((!(X("(((u8.flag_1_8!=1)||(i9.u10.flag_1_10!=1))||(u8.p1_8!=1))")))&&((X("(((u1.flag_1_1==1)&&(u17.flag_1_7==1))&&(u17.p1_7==1))"))||(!(G("(((u8.flag_1_8==1)&&(i9.u10.flag_1_10==1))&&(u8.p1_8==1))"))))))))
Formula 8 simplified : !XG(!X"(((u8.flag_1_8!=1)||(i9.u10.flag_1_10!=1))||(u8.p1_8!=1))" & (X"(((u1.flag_1_1==1)&&(u17.flag_1_7==1))&&(u17.p1_7==1))" | !G"(((u8.flag_1_8==1)&&(i9.u10.flag_1_10==1))&&(u8.p1_8==1))"))
5 unique states visited
5 strongly connected components in search stack
6 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.207753,25928,1,0,15779,171,3615,17123,266,237,31413
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-015-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(((!(G("((u2.flag_0_2==1)&&(u2.p0_2==1))")))&&("(((i3.u4.flag_1_3!=1)||(i13.u20.flag_1_12!=1))||(i3.u3.p1_3!=1))"))&&(((F("((u2.flag_0_2==1)&&(u2.p0_2==1))"))||("(u2.flag_0_2!=1)"))||("(u2.p0_2!=1)"))))))
Formula 9 simplified : !XF("(((i3.u4.flag_1_3!=1)||(i13.u20.flag_1_12!=1))||(i3.u3.p1_3!=1))" & !G"((u2.flag_0_2==1)&&(u2.p0_2==1))" & ("(u2.flag_0_2!=1)" | "(u2.p0_2!=1)" | F"((u2.flag_0_2==1)&&(u2.p0_2==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.217698,26184,1,0,16214,171,3832,17774,275,237,32849
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-015-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G(X(X(X(("(((u2.flag_1_2==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))")U((((F(("(((u7.flag_1_6==1)&&(i14.u13.flag_1_13==1))&&(i14.u21.p1_13==1))")U("(((u2.flag_1_2==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))")))&&("(u2.flag_1_2==1)"))&&("(i5.u6.flag_1_5==1)"))&&("(i5.u16.p1_5==1)")))))))))
Formula 10 simplified : !XGXXX("(((u2.flag_1_2==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))" U ("(i5.u6.flag_1_5==1)" & "(i5.u16.p1_5==1)" & "(u2.flag_1_2==1)" & F("(((u7.flag_1_6==1)&&(i14.u13.flag_1_13==1))&&(i14.u21.p1_13==1))" U "(((u2.flag_1_2==1)&&(i5.u6.flag_1_5==1))&&(i5.u16.p1_5==1))")))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.222293,26440,1,0,16435,171,3873,18015,275,237,33332
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-015-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(("((i10.u11.flag_0_11==1)&&(i10.u19.p0_11==1))")U(X(("(((u1.flag_1_1==1)&&(i9.u10.flag_1_10==1))&&(u1.p1_1==1))")U(X(X(G((X("((i10.u11.flag_0_11==1)&&(i10.u19.p0_11==1))"))||("(((u1.flag_1_1==1)&&(i9.u10.flag_1_10==1))&&(u1.p1_1==1))")))))))))))
Formula 11 simplified : !GF("((i10.u11.flag_0_11==1)&&(i10.u19.p0_11==1))" U X("(((u1.flag_1_1==1)&&(i9.u10.flag_1_10==1))&&(u1.p1_1==1))" U XXG("(((u1.flag_1_1==1)&&(i9.u10.flag_1_10==1))&&(u1.p1_1==1))" | X"((i10.u11.flag_0_11==1)&&(i10.u19.p0_11==1))")))
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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.230879,26696,1,0,16873,171,4029,18637,275,237,34420
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-015-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(!(X(G((X("((u2.flag_0_2!=1)||(u2.p0_2!=1))"))&&(G("(((u7.flag_1_6!=1)||(u9.flag_1_9!=1))||(u9.p1_9!=1))"))))))))
Formula 12 simplified : !G!XG(X"((u2.flag_0_2!=1)||(u2.p0_2!=1))" & G"(((u7.flag_1_6!=1)||(u9.flag_1_9!=1))||(u9.p1_9!=1))")
4 unique states visited
4 strongly connected components in search stack
5 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.239323,26696,1,0,17403,171,4176,19453,275,237,35721
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-015-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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 01:27:35] [INFO ] Built C files in 677ms 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 1590110855543

--------------------
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="Dekker-PT-015"
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 Dekker-PT-015, 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-158922814100314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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