Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145100490.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-00010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145100490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 02:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 6 02:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00010-00
FORMULA_NAME Kanban-PT-00010-01
FORMULA_NAME Kanban-PT-00010-02
FORMULA_NAME Kanban-PT-00010-03
FORMULA_NAME Kanban-PT-00010-04
FORMULA_NAME Kanban-PT-00010-05
FORMULA_NAME Kanban-PT-00010-06
FORMULA_NAME Kanban-PT-00010-07
FORMULA_NAME Kanban-PT-00010-08
FORMULA_NAME Kanban-PT-00010-09
FORMULA_NAME Kanban-PT-00010-10
FORMULA_NAME Kanban-PT-00010-11
FORMULA_NAME Kanban-PT-00010-12
FORMULA_NAME Kanban-PT-00010-13
FORMULA_NAME Kanban-PT-00010-14
FORMULA_NAME Kanban-PT-00010-15

=== Now, execution of the tool begins

BK_START 1589581690221

[2020-05-15 22:28:12] [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-15 22:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 22:28:12] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2020-05-15 22:28:12] [INFO ] Transformed 16 places.
[2020-05-15 22:28:12] [INFO ] Transformed 16 transitions.
[2020-05-15 22:28:12] [INFO ] Parsed PT model containing 16 places and 16 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 215 steps, including 0 resets, run visited all 23 properties in 3 ms. (steps per millisecond=71 )
[2020-05-15 22:28:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 22:28:12] [INFO ] Flatten gal took : 18 ms
FORMULA Kanban-PT-00010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 22:28:12] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 22:28:12] [INFO ] Applying decomposition
[2020-05-15 22:28:12] [INFO ] Flatten gal took : 3 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/graph12009221913385878698.txt, -o, /tmp/graph12009221913385878698.bin, -w, /tmp/graph12009221913385878698.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/graph12009221913385878698.bin, -l, -1, -v, -w, /tmp/graph12009221913385878698.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 22:28:12] [INFO ] Decomposing Gal with order
[2020-05-15 22:28:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 22:28:12] [INFO ] Input system was already deterministic with 16 transitions.
[2020-05-15 22:28:12] [INFO ] Flatten gal took : 47 ms
[2020-05-15 22:28:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 22:28:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 0 ms
[2020-05-15 22:28:12] [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]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 16 rows 16 cols
[2020-05-15 22:28:12] [INFO ] Computed 5 place invariants in 2 ms
inv : Pm1 + P1 + Pout1 + Pback1 = 10
inv : P4 + Pm4 + Pback4 + Pout4 = 10
inv : P3 + Pm2 + Pout2 + Pback2 = 10
inv : Pm3 + Pback3 + Pout3 - Pm2 - Pout2 - Pback2 = 0
inv : Pm2 + P2 + Pout2 + Pback2 = 10
Total of 5 invariants.
[2020-05-15 22:28:12] [INFO ] Computed 5 place invariants in 4 ms

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 : !((F((!((("(u0.Pm3>=1)")U(G("(u1.Pm4>=1)")))U(X("(u1.Pm4>=1)"))))||(F("(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))")))))
Formula 0 simplified : !F(!(("(u0.Pm3>=1)" U G"(u1.Pm4>=1)") U X"(u1.Pm4>=1)") | F"(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))")
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 22:28:12] [INFO ] Proved 16 variables to be positive in 76 ms
[2020-05-15 22:28:12] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2020-05-15 22:28:12] [INFO ] Computation of disable matrix completed :0/16 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:28:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:28:12] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2020-05-15 22:28:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.041184,18448,1,0,903,2435,165,1493,139,4758,1163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Kanban-PT-00010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((!(X(!(G("(u1.Pback4>=1)")))))&&(!(G(!(F("(i2.u3.Pout1>=1)"))))))&&(!(G("(u1.Pback4>=1)")))))
Formula 1 simplified : !(!G"(u1.Pback4>=1)" & !X!G"(u1.Pback4>=1)" & !G!F"(i2.u3.Pout1>=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.053922,19128,1,0,1505,2975,216,2701,146,7252,2386
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Kanban-PT-00010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G("(u1.Pback4>=1)"))&&("(u1.Pback4<1)"))U(X((X(G("(u1.Pback4>=1)")))||("(u0.Pback3<1)")))))
Formula 2 simplified : !(("(u1.Pback4<1)" & G"(u1.Pback4>=1)") U X("(u0.Pback3<1)" | XG"(u1.Pback4>=1)"))
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.05455,19340,1,0,1505,2975,217,2701,146,7252,2390
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Kanban-PT-00010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(((G((((X(F("(i2.u3.Pout1>=1)")))&&("(u0.Pout3>=1)"))&&("(i2.u3.P1>=1)"))&&("(u4.Pout2>=1)")))||(G("(u0.Pm3>=1)")))U(X(!(F("(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1))")))))))
Formula 3 simplified : !G((G("(i2.u3.P1>=1)" & "(u0.Pout3>=1)" & "(u4.Pout2>=1)" & XF"(i2.u3.Pout1>=1)") | G"(u0.Pm3>=1)") U X!F"(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1))")
4 unique states visited
4 strongly connected components in search stack
6 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.112051,21940,1,0,4662,4807,314,12333,154,20217,5018
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Kanban-PT-00010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("((u0.Pm3>=1)&&(i2.u3.Pout1>=1))"))))
Formula 4 simplified : !XF"((u0.Pm3>=1)&&(i2.u3.Pout1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
40 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.514033,35404,1,0,17958,7521,333,112399,154,41721,13209
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Kanban-PT-00010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((!(X(X(X("(u0.Pm3>=1)")))))||(!(X("(u4.Pm2<1)")))))))
Formula 5 simplified : !FX(!XXX"(u0.Pm3>=1)" | !X"(u4.Pm2<1)")
5 unique states visited
0 strongly connected components in search stack
4 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.514741,35668,1,0,17979,7535,356,112401,154,41734,13277
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Kanban-PT-00010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(("(i2.u2.Pm1<1)")U(G((!(G("(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))")))||("((u0.Pm3<1)&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))"))))))
Formula 6 simplified : !X("(i2.u2.Pm1<1)" U G("((u0.Pm3<1)&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))" | !G"(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
22 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.739496,44380,1,0,36598,9605,411,127595,154,74587,21848
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Kanban-PT-00010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(X(((G("(u1.Pm4>=1)"))U("(u4.Pm2>=1)"))U(F("(u4.Pm2>=1)")))))||(F("(i2.u2.Pm1>=1)"))))
Formula 7 simplified : !(!X((G"(u1.Pm4>=1)" U "(u4.Pm2>=1)") U F"(u4.Pm2>=1)") | F"(i2.u2.Pm1>=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.741066,44644,1,0,36638,9612,432,127638,154,74604,22008
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Kanban-PT-00010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(!(G((("(i2.u2.Pm1>=1)")U("(i2.u3.Pout1>=1)"))||((("(u4.Pm2>=1)")U("(i2.u2.Pm1>=1)"))U(F("(u1.Pback4<1)")))))))))
Formula 8 simplified : !GF!G(("(i2.u2.Pm1>=1)" U "(i2.u3.Pout1>=1)") | (("(u4.Pm2>=1)" U "(i2.u2.Pm1>=1)") U F"(u1.Pback4<1)"))
2 unique states visited
2 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.75396,44908,1,0,37242,10213,466,128398,154,76192,22822
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Kanban-PT-00010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((F("(u4.Pm2<1)"))||(("(u0.Pback3>=1)")U(X("(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1))"))))))
Formula 9 simplified : !G(F"(u4.Pm2<1)" | ("(u0.Pback3>=1)" U X"(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=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.764975,45436,1,0,37891,10483,488,130580,154,78789,23444
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Kanban-PT-00010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(((F("(u0.Pm3>=1)"))U(X("(u4.Pm2>=1)")))&&("(u0.Pm3>=1)")))))
Formula 10 simplified : F("(u0.Pm3>=1)" & (F"(u0.Pm3>=1)" U X"(u4.Pm2>=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.767528,45700,1,0,37964,10503,500,130662,154,78888,23680
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Kanban-PT-00010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(("(u0.Pm3>=1)")U("((u0.Pm3>=1)||(u4.Pm2>=1))"))))
Formula 11 simplified : !X("(u0.Pm3>=1)" U "((u0.Pm3>=1)||(u4.Pm2>=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.76798,45700,1,0,37964,10503,509,130662,154,78888,23691
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Kanban-PT-00010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F((("(i2.u3.Pout1>=1)")&&((G("(i2.u2.Pm1>=1)"))||("(u1.P4>=1)")))U("(i2.u3.Pout1>=1)")))U(!(F("(i2.u2.Pm1>=1)")))))
Formula 12 simplified : !(F(("(i2.u3.Pout1>=1)" & ("(u1.P4>=1)" | G"(i2.u2.Pm1>=1)")) U "(i2.u3.Pout1>=1)") U !F"(i2.u2.Pm1>=1)")
[2020-05-15 22:28:13] [INFO ] Computing symmetric co enabling matrix : 16 transitions.
14 unique states visited
3 strongly connected components in search stack
16 transitions explored
14 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.788111,46228,1,0,38756,10854,514,135193,154,83622,24469
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Kanban-PT-00010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(X(G(("(u4.Pm2>=1)")U(F(!(X((X("((u0.Pback3<1)&&(i2.u2.Pm1<1))"))||("(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))"))))))))))
Formula 13 simplified : XG("(u4.Pm2>=1)" U F!X("(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))" | X"((u0.Pback3<1)&&(i2.u2.Pm1<1))"))
3 unique states visited
1 strongly connected components in search stack
4 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.793537,46492,1,0,39210,10950,523,135672,154,83947,25072
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Kanban-PT-00010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 22:28:13] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-15 22:28:13] [WARNING] Script execution failed on command (assert (= 10 (+ (select s0 8) (select s0 9) (select s0 10) (select s0 11)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (= 10 (+ (select s0 8) (select s0 9) (select s0 10) (select s0 11)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 10 (+ (select s0 8) (select s0 9) (select s0 10) (select s0 11)))), (assert (= 10 (+ (select s0 0) (select s0 12) (select s0 14) (select s0 15)))), (assert (= (+ (select s0 12) (select s0 14) (select s0 15) 0) (+ (select s0 1) (select s0 2) (select s0 3)))), (assert (= 10 (+ (select s0 12) (select s0 13) (select s0 14) (select s0 15)))), (assert (and (and (>= (select s0 3) 1) (>= (select s0 9) 1)) (>= (select s0 14) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 1) 0)), (assert (>= (select s0 2) 0)), (assert (>= (select s0 3) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 10) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2509ca3b
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2509ca3b
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 22:28:13] [INFO ] Built C files in 1027ms 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 1589581693896

--------------------
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="Kanban-PT-00010"
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 Kanban-PT-00010, 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 r096-oct2-158940145100490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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