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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.4K Mar 31 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 23:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 23:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 28K 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 DiscoveryGPU-PT-08a-00
FORMULA_NAME DiscoveryGPU-PT-08a-01
FORMULA_NAME DiscoveryGPU-PT-08a-02
FORMULA_NAME DiscoveryGPU-PT-08a-03
FORMULA_NAME DiscoveryGPU-PT-08a-04
FORMULA_NAME DiscoveryGPU-PT-08a-05
FORMULA_NAME DiscoveryGPU-PT-08a-06
FORMULA_NAME DiscoveryGPU-PT-08a-07
FORMULA_NAME DiscoveryGPU-PT-08a-08
FORMULA_NAME DiscoveryGPU-PT-08a-09
FORMULA_NAME DiscoveryGPU-PT-08a-10
FORMULA_NAME DiscoveryGPU-PT-08a-11
FORMULA_NAME DiscoveryGPU-PT-08a-12
FORMULA_NAME DiscoveryGPU-PT-08a-13
FORMULA_NAME DiscoveryGPU-PT-08a-14
FORMULA_NAME DiscoveryGPU-PT-08a-15

=== Now, execution of the tool begins

BK_START 1590129693488

[2020-05-22 06:41:35] [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 06:41:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:41:35] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-22 06:41:35] [INFO ] Transformed 83 places.
[2020-05-22 06:41:35] [INFO ] Transformed 113 transitions.
[2020-05-22 06:41:35] [INFO ] Found NUPN structural information;
[2020-05-22 06:41:35] [INFO ] Parsed PT model containing 83 places and 113 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 419 steps, including 4 resets, run visited all 35 properties in 8 ms. (steps per millisecond=52 )
[2020-05-22 06:41:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 06:41:35] [INFO ] Flatten gal took : 33 ms
FORMULA DiscoveryGPU-PT-08a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:41:35] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:41:35] [INFO ] Applying decomposition
[2020-05-22 06:41:35] [INFO ] Flatten gal took : 12 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/graph8850868602094071413.txt, -o, /tmp/graph8850868602094071413.bin, -w, /tmp/graph8850868602094071413.weights], workingDir=null]
[2020-05-22 06:41:36] [INFO ] Input system was already deterministic with 113 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8850868602094071413.bin, -l, -1, -v, -w, /tmp/graph8850868602094071413.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:41:36] [INFO ] Decomposing Gal with order
[2020-05-22 06:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:41:36] [INFO ] Removed a total of 65 redundant transitions.
[2020-05-22 06:41:36] [INFO ] Flatten gal took : 95 ms
[2020-05-22 06:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 46 ms.
[2020-05-22 06:41:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-22 06:41:36] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
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]
Normalized transition count is 105 out of 113 initially.
// Phase 1: matrix 105 rows 83 cols
[2020-05-22 06:41:36] [INFO ] Computed 2 place invariants in 22 ms
inv : p0 + p82 = 1
inv : p0 + p81 = 1
Total of 2 invariants.
[2020-05-22 06:41:36] [INFO ] Computed 2 place invariants in 25 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 : !(((!(("((i6.i0.u19.p53==1)&&(i2.u7.p82==1))")U("((i6.i1.u21.p57==1)&&(i0.u1.p81==1))")))&&(F("((i6.i0.u19.p53==1)&&(i2.u7.p82==1))"))))
Formula 0 simplified : !(!("((i6.i0.u19.p53==1)&&(i2.u7.p82==1))" U "((i6.i1.u21.p57==1)&&(i0.u1.p81==1))") & F"((i6.i0.u19.p53==1)&&(i2.u7.p82==1))")
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t105, i1.u5.t103, i2.u0.t106, i2.u3.t104, i2.u7.t107, i3.u9.t108, i4.u11.t102, i4.u13.t101, i5.i0.u15.t109, i5.i1.u17.t110, i6.i0.u19.t100, i6.i1.u21.t99, i7.i0.u23.t111, i7.i1.u25.t112, i8.u27.t98, i8.u29.t97, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/68/16/84
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 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.15153,19628,1,0,6141,196,1149,15002,164,708,10217
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(G(X((G(X(F("(i3.u10.p28==1)"))))U(F("((i1.u5.p16==1)&&(i0.u1.p81==1))"))))))))
Formula 1 simplified : !X!GX(GXF"(i3.u10.p28==1)" U F"((i1.u5.p16==1)&&(i0.u1.p81==1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.188187,21636,1,0,11110,222,1235,20983,166,822,17712
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(F("((i1.u4.p14==1)&&(i2.u7.p82==1))")))||(X(F(!(G(F(X("((i8.u29.p77==1)&&(i0.u1.p81==1))")))))))))
Formula 2 simplified : !(GF"((i1.u4.p14==1)&&(i2.u7.p82==1))" | XF!GFX"((i8.u29.p77==1)&&(i0.u1.p81==1))")
Computing Next relation with stutter on 1 deadlock states
26 unique states visited
8 strongly connected components in search stack
36 transitions explored
10 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.216821,23124,1,0,13007,223,1320,24876,166,865,21865
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F("((i0.u2.p10!=1)||(i0.u1.p81!=1))"))))
Formula 3 simplified : !GF"((i0.u2.p10!=1)||(i0.u1.p81!=1))"
Computing Next relation with stutter on 1 deadlock states
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.226363,23376,1,0,13286,223,1370,25200,168,865,22487
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(!(X(F(X("((i3.u10.p28==1)&&(i2.u7.p82==1))"))))))))
Formula 4 simplified : !FX!XFX"((i3.u10.p28==1)&&(i2.u7.p82==1))"
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
5 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.233586,23552,1,0,13786,223,1402,26060,168,865,23454
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X(X("((((i2.u7.p22==1)&&(i0.u1.p81==1))&&(i0.u2.p8==1))&&(i2.u7.p82==1))"))))||(X(((G("((i0.u2.p8==1)&&(i2.u7.p82==1))"))U("((i2.u7.p22==1)&&(i0.u1.p81==1))"))&&(X("((i7.i0.u23.p63==1)&&(i2.u7.p82==1))"))))))
Formula 5 simplified : !(GXX"((((i2.u7.p22==1)&&(i0.u1.p81==1))&&(i0.u2.p8==1))&&(i2.u7.p82==1))" | X((G"((i0.u2.p8==1)&&(i2.u7.p82==1))" U "((i2.u7.p22==1)&&(i0.u1.p81==1))") & X"((i7.i0.u23.p63==1)&&(i2.u7.p82==1))"))
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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.252607,24964,1,0,14052,223,1460,26601,170,865,24423
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(X(X("((i1.u6.p18==1)&&(i2.u7.p82==1))"))))))
Formula 6 simplified : !GFXX"((i1.u6.p18==1)&&(i2.u7.p82==1))"
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.258395,25228,1,0,14487,224,1496,27179,170,866,25335
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((G("(((i4.u14.p40==1)&&(i0.u1.p81==1))||((i4.u13.p37==1)&&(i0.u1.p81==1)))"))&&("((i4.u14.p40!=1)||(i0.u1.p81!=1))"))))
Formula 7 simplified : !X("((i4.u14.p40!=1)||(i0.u1.p81!=1))" & G"(((i4.u14.p40==1)&&(i0.u1.p81==1))||((i4.u13.p37==1)&&(i0.u1.p81==1)))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.26032,25492,1,0,14490,224,1521,27182,170,866,25380
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F(("(i8.u27.p73==1)")U(X("(i8.u27.p71==1)"))))))
Formula 8 simplified : !XF("(i8.u27.p73==1)" U X"(i8.u27.p71==1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.263282,25492,1,0,14590,225,1538,27455,171,875,25731
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X("((i5.i1.u18.p49==1)&&(i0.u1.p81==1))"))))
Formula 9 simplified : !FX"((i5.i1.u18.p49==1)&&(i0.u1.p81==1))"
Computing Next relation with stutter on 1 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.280583,26020,1,0,17181,225,1564,30077,171,885,29555
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(F("(((i7.i0.u24.p65==1)&&(i0.u1.p81==1))||(i6.i0.u19.p51==1))")))&&(F(!(F("((i1.u6.p19==1)&&(i0.u1.p81==1))"))))))
Formula 10 simplified : !(!F"(((i7.i0.u24.p65==1)&&(i0.u1.p81==1))||(i6.i0.u19.p51==1))" & F!F"((i1.u6.p19==1)&&(i0.u1.p81==1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
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.307261,27868,1,0,21991,225,1598,33934,171,892,35921
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(G(((G(F(("((i3.u9.p26==1)||((i0.u2.p8==1)&&(i2.u7.p82==1)))")U("((i3.u10.p28==1)&&(i2.u7.p82==1))"))))&&("(i0.u1.p4==1)"))&&("(i2.u7.p82==1)"))))))
Formula 11 simplified : !FXG("(i0.u1.p4==1)" & "(i2.u7.p82==1)" & GF("((i3.u9.p26==1)||((i0.u2.p8==1)&&(i2.u7.p82==1)))" U "((i3.u10.p28==1)&&(i2.u7.p82==1))"))
Computing Next relation with stutter on 1 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.314045,28128,1,0,22527,231,1632,34747,171,927,37140
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((!(X(((G("((i7.i1.u25.p67==1)&&(i0.u1.p81==1))"))||("((i8.u30.p79==1)&&(i0.u1.p81==1))"))||("((i0.u1.p4==1)&&(i2.u7.p82==1))"))))&&(((!(F("((i7.i1.u25.p67==1)&&(i0.u1.p81==1))")))||("(i8.u30.p79!=1)"))||("(i0.u1.p81!=1)")))))
Formula 12 simplified : !X(!X("((i0.u1.p4==1)&&(i2.u7.p82==1))" | "((i8.u30.p79==1)&&(i0.u1.p81==1))" | G"((i7.i1.u25.p67==1)&&(i0.u1.p81==1))") & ("(i0.u1.p81!=1)" | "(i8.u30.p79!=1)" | !F"((i7.i1.u25.p67==1)&&(i0.u1.p81==1))"))
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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.317728,28388,1,0,22531,231,1687,34778,172,927,37293
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X("((i3.u8.p25!=1)||(i0.u1.p81!=1))"))))
Formula 13 simplified : !FX"((i3.u8.p25!=1)||(i0.u1.p81!=1))"
Computing Next relation with stutter on 1 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.318457,28388,1,0,22531,231,1708,34778,172,927,37312
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:41:36] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 06:41:36] [INFO ] Built C files in 750ms 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 1590129697205

--------------------
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="DiscoveryGPU-PT-08a"
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 DiscoveryGPU-PT-08a, 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-158922814600618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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