Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Dekker-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477600028
=====================================================================

--------------------
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-050-LTLFireability-00
FORMULA_NAME Dekker-PT-050-LTLFireability-01
FORMULA_NAME Dekker-PT-050-LTLFireability-02
FORMULA_NAME Dekker-PT-050-LTLFireability-03
FORMULA_NAME Dekker-PT-050-LTLFireability-04
FORMULA_NAME Dekker-PT-050-LTLFireability-05
FORMULA_NAME Dekker-PT-050-LTLFireability-06
FORMULA_NAME Dekker-PT-050-LTLFireability-07
FORMULA_NAME Dekker-PT-050-LTLFireability-08
FORMULA_NAME Dekker-PT-050-LTLFireability-09
FORMULA_NAME Dekker-PT-050-LTLFireability-10
FORMULA_NAME Dekker-PT-050-LTLFireability-11
FORMULA_NAME Dekker-PT-050-LTLFireability-12
FORMULA_NAME Dekker-PT-050-LTLFireability-13
FORMULA_NAME Dekker-PT-050-LTLFireability-14
FORMULA_NAME Dekker-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527985747521

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph2572757326665054877.txt, -o, /tmp/graph2572757326665054877.bin, -w, /tmp/graph2572757326665054877.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph2572757326665054877.bin, -l, -1, -v, -w, /tmp/graph2572757326665054877.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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.201805241334/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 16 LTL properties
Checking formula 0 : !((X(F((G("((u45.flag_1_43>=1)&&(u45.p3_43>=1))"))U(X("(((u31.flag_1_30>=1)&&(i29.u38.flag_1_37>=1))&&(i29.u70.p1_37>=1))"))))))
Formula 0 simplified : !XF(G"((u45.flag_1_43>=1)&&(u45.p3_43>=1))" U X"(((u31.flag_1_30>=1)&&(i29.u38.flag_1_37>=1))&&(i29.u70.p1_37>=1))")
built 1248 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
built 150 ordering constraints for composite.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_2, exit_3, exit_6, exit_7, exit_9, exit_11, exit_12, exit_15, exit_17, exit_18, exit_19, exit_20, exit_21, exit_26, exit_32, exit_33, exit_34, exit_36, exit_37, exit_40, exit_49, u1.exit_1, u6.exit_4, u7.exit_5, u10.exit_8, u12.exit_10, u16.exit_13, u17.exit_14, u19.exit_16, u26.exit_23, u27.exit_24, u29.exit_28, u30.exit_29, u31.exit_30, u32.exit_31, u36.exit_35, u39.exit_38, u40.exit_39, u43.exit_41, u44.exit_42, u45.exit_43, u46.exit_44, u47.exit_45, u48.exit_46, u49.exit_47, u50.exit_48, u62.exit_22, u63.exit_25, u65.exit_27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
189 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,2.18541,74948,1,0,159098,1361,20310,76236,363,1336,206611
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("(((u7.flag_1_5>=1)&&(i25.u33.flag_1_32>=1))&&(i25.u66.p1_32>=1))")))
Formula 1 simplified : !F"(((u7.flag_1_5>=1)&&(i25.u33.flag_1_32>=1))&&(i25.u66.p1_32>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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,2.39339,79288,1,0,163218,1361,21016,81430,363,1336,215901
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(((u1.flag_1_1>=1)&&(u19.flag_1_16>=1))&&(u19.p1_16>=1))")))
Formula 2 simplified : !X"(((u1.flag_1_1>=1)&&(u19.flag_1_16>=1))&&(u19.p1_16>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,2.45796,82184,1,0,163572,1361,21194,82025,365,1336,217570
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(G("(((i25.u33.flag_1_32>=1)&&(u49.flag_1_47>=1))&&(i25.u66.p1_32>=1))"))))
Formula 3 simplified : !G"(((i25.u33.flag_1_32>=1)&&(u49.flag_1_47>=1))&&(i25.u66.p1_32>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.47922,82952,1,0,163645,1361,21228,82074,365,1336,217980
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(("(((i12.u57.flag_1_15>=1)&&(u46.flag_1_44>=1))&&(u46.p1_44>=1))")U("(((i5.u9.flag_1_7>=1)&&(u10.flag_1_8>=1))&&(u10.p1_8>=1))")))U(F("(((u62.flag_1_22>=1)&&(u27.flag_1_24>=1))&&(u27.p1_24>=1))"))))
Formula 4 simplified : !(X("(((i12.u57.flag_1_15>=1)&&(u46.flag_1_44>=1))&&(u46.p1_44>=1))" U "(((i5.u9.flag_1_7>=1)&&(u10.flag_1_8>=1))&&(u10.p1_8>=1))") U F"(((u62.flag_1_22>=1)&&(u27.flag_1_24>=1))&&(u27.p1_24>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24 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,2.72591,85516,1,0,166423,1361,21595,86552,365,1336,225363
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X("(((u17.flag_1_14>=1)&&(u19.flag_1_16>=1))&&(u17.p1_14>=1))"))U("(((u40.flag_1_39>=1)&&(i32.u42.flag_1_40>=1))&&(u40.p1_39>=1))"))U(F(("(((i5.u9.flag_1_7>=1)&&(i29.u38.flag_1_37>=1))&&(i29.u70.p1_37>=1))")U("(((u1.flag_1_1>=1)&&(i42.u8.flag_1_6>=1))&&(i42.u53.p1_6>=1))")))))
Formula 5 simplified : !((X"(((u17.flag_1_14>=1)&&(u19.flag_1_16>=1))&&(u17.p1_14>=1))" U "(((u40.flag_1_39>=1)&&(i32.u42.flag_1_40>=1))&&(u40.p1_39>=1))") U F("(((i5.u9.flag_1_7>=1)&&(i29.u38.flag_1_37>=1))&&(i29.u70.p1_37>=1))" U "(((u1.flag_1_1>=1)&&(i42.u8.flag_1_6>=1))&&(i42.u53.p1_6>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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,2.88572,90148,1,0,170603,1361,22283,92763,365,1336,235714
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(X(X(G("(((i9.u15.flag_1_12>=1)&&(u49.flag_1_47>=1))&&(i9.u56.p1_12>=1))")))))))
Formula 6 simplified : !GFXXG"(((i9.u15.flag_1_12>=1)&&(u49.flag_1_47>=1))&&(i9.u56.p1_12>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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,3.03475,93744,1,0,172622,1361,22964,95861,365,1336,239998
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("(((u39.flag_1_38>=1)&&(i32.u42.flag_1_40>=1))&&(u39.p1_38>=1))")))
Formula 7 simplified : !G"(((u39.flag_1_38>=1)&&(i32.u42.flag_1_40>=1))&&(u39.p1_38>=1))"
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,3.05086,94800,1,0,172622,1361,23000,95861,365,1336,240043
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X("(((u36.flag_1_35>=1)&&(u43.flag_1_41>=1))&&(u43.p1_41>=1))"))))
Formula 8 simplified : !FX"(((u36.flag_1_35>=1)&&(u43.flag_1_41>=1))&&(u43.p1_41>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.13958,96384,1,0,174095,1361,23307,98007,365,1336,243925
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X("(((i1.u3.flag_1_2>=1)&&(i2.u5.flag_1_3>=1))&&(i1.u2.p1_2>=1))")))
Formula 9 simplified : !X"(((i1.u3.flag_1_2>=1)&&(i2.u5.flag_1_3>=1))&&(i1.u2.p1_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,3.14116,96648,1,0,174095,1361,23317,98007,365,1336,244027
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(G(F(F("(((i5.u9.flag_1_7>=1)&&(u50.flag_1_48>=1))&&(i5.u54.p1_7>=1))")))))))
Formula 10 simplified : !XFGF"(((i5.u9.flag_1_7>=1)&&(u50.flag_1_48>=1))&&(i5.u54.p1_7>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
17 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,3.31573,100072,1,0,176224,1361,24051,101350,365,1336,248414
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(F("(((u10.flag_1_8>=1)&&(i16.u24.flag_1_20>=1))&&(i16.u23.p1_20>=1))")))))
Formula 11 simplified : !F"(((u10.flag_1_8>=1)&&(i16.u24.flag_1_20>=1))&&(i16.u23.p1_20>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,3.70415,104032,1,0,180170,1361,24736,105966,365,1336,256835
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(((i2.u5.flag_1_3>=1)&&(i25.u33.flag_1_32>=1))&&(i25.u66.p1_32>=1))")U(G(("(((i42.u8.flag_1_6>=1)&&(i28.u69.flag_1_36>=1))&&(i28.u37.p1_36>=1))")U("(((u44.flag_1_42>=1)&&(u47.flag_1_45>=1))&&(u47.p1_45>=1))")))))
Formula 12 simplified : !("(((i2.u5.flag_1_3>=1)&&(i25.u33.flag_1_32>=1))&&(i25.u66.p1_32>=1))" U G("(((i42.u8.flag_1_6>=1)&&(i28.u69.flag_1_36>=1))&&(i28.u37.p1_36>=1))" U "(((u44.flag_1_42>=1)&&(u47.flag_1_45>=1))&&(u47.p1_45>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.73611,105712,1,0,180170,1361,24834,105966,365,1336,256996
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(((i25.u33.flag_1_32>=1)&&(u48.flag_1_46>=1))&&(i25.u66.p1_32>=1))"))
Formula 13 simplified : !"(((i25.u33.flag_1_32>=1)&&(u48.flag_1_46>=1))&&(i25.u66.p1_32>=1))"
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,3.73734,105712,1,0,180170,1361,24840,105966,365,1336,257005
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X("(((i43.u55.flag_1_9>=1)&&(u31.flag_1_30>=1))&&(u31.p1_30>=1))")))
Formula 14 simplified : !X"(((i43.u55.flag_1_9>=1)&&(u31.flag_1_30>=1))&&(u31.p1_30>=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,3.73854,105712,1,0,180170,1361,24848,105966,365,1336,257046
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X("(((i12.u57.flag_1_15>=1)&&(i26.u34.flag_1_33>=1))&&(i12.u18.p1_15>=1))"))))
Formula 15 simplified : !GX"(((i12.u57.flag_1_15>=1)&&(i26.u34.flag_1_33>=1))&&(i12.u18.p1_15>=1))"
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,3.75131,105976,1,0,180170,1361,24884,105966,365,1336,257182
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527985757146

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 12:29:09 AM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
Jun 03, 2018 12:29:09 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:29:09 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 286 ms
Jun 03, 2018 12:29:09 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
Jun 03, 2018 12:29:10 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 2600 transitions.
Jun 03, 2018 12:29:10 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:29:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 636 ms
Jun 03, 2018 12:29:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 275 ms
Begin: Sun Jun 3 00:29:11 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:29:11 2018
network size: 250 nodes, 15400 links, 5200 weight
quality increased from -0.0051242 to 0.504687
end computation: Sun Jun 3 00:29:11 2018
level 1:
start computation: Sun Jun 3 00:29:11 2018
network size: 72 nodes, 5028 links, 5200 weight
quality increased from 0.504687 to 0.647051
end computation: Sun Jun 3 00:29:11 2018
level 2:
start computation: Sun Jun 3 00:29:11 2018
network size: 50 nodes, 2500 links, 5200 weight
quality increased from 0.647051 to 0.647051
end computation: Sun Jun 3 00:29:11 2018
End: Sun Jun 3 00:29:11 2018
Total duration: 0 sec
0.647051
Jun 03, 2018 12:29:11 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:29:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 246 ms
Jun 03, 2018 12:29:11 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:29:12 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 8278 redundant transitions.
Jun 03, 2018 12:29:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 24 ms
Jun 03, 2018 12:29:12 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 12:29:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 2600 transitions.
Jun 03, 2018 12:29:13 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
Jun 03, 2018 12:29:13 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 849ms conformant to PINS in folder :/home/mcc/execution

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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Dekker-PT-050, 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 r237-blw3-152732477600028"
echo "====================================================================="
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
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 ;