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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.7K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Dekker-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477600032
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527986765013

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/graph8152811747493241080.txt, -o, /tmp/graph8152811747493241080.bin, -w, /tmp/graph8152811747493241080.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/graph8152811747493241080.bin, -l, -1, -v, -w, /tmp/graph8152811747493241080.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
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]
Checking formula 0 : !(("(((i162.u76.flag_1_83>=1)&&(i82.u115.flag_1_127>=1))&&(i82.u252.p1_127>=1))"))
Formula 0 simplified : !"(((i162.u76.flag_1_83>=1)&&(i82.u115.flag_1_127>=1))&&(i82.u252.p1_127>=1))"
built 19995 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
built 600 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_1, exit_3, exit_4, exit_6, exit_8, exit_9, exit_12, exit_13, exit_14, exit_15, exit_17, exit_22, exit_24, exit_25, exit_28, exit_29, exit_31, exit_33, exit_34, exit_35, exit_42, exit_43, exit_44, exit_47, exit_48, exit_49, exit_50, exit_55, exit_56, exit_57, exit_59, exit_62, exit_67, exit_69, exit_70, exit_71, exit_79, exit_80, exit_81, exit_82, exit_83, exit_87, exit_92, exit_93, exit_94, exit_95, exit_98, exit_103, exit_106, exit_108, exit_109, exit_111, exit_113, exit_120, exit_124, exit_125, exit_126, exit_127, exit_129, exit_131, exit_136, exit_137, exit_138, exit_139, exit_140, exit_141, exit_142, exit_145, exit_148, exit_149, exit_153, exit_155, exit_156, exit_158, exit_163, exit_164, exit_165, exit_166, exit_168, exit_169, exit_170, exit_174, exit_177, exit_178, exit_181, exit_183, exit_184, exit_186, exit_187, exit_193, exit_194, exit_197, exit_198, u2.exit_2, u5.exit_5, u9.exit_11, u14.exit_16, u16.exit_18, u17.exit_21, u19.exit_23, u22.exit_26, u23.exit_27, u26.exit_30, u28.exit_32, u32.exit_36, u33.exit_37, u34.exit_38, u35.exit_39, u36.exit_40, u37.exit_41, u41.exit_45, u42.exit_46, u48.exit_51, u49.exit_52, u50.exit_53, u54.exit_58, u56.exit_61, u59.exit_63, u60.exit_64, u61.exit_65, u63.exit_68, u67.exit_72, u68.exit_74, u69.exit_75, u77.exit_85, u78.exit_86, u80.exit_88, u81.exit_89, u87.exit_96, u88.exit_97, u90.exit_99, u91.exit_100, u92.exit_101, u93.exit_102, u95.exit_105, u99.exit_110, u101.exit_112, u103.exit_114, u104.exit_115, u105.exit_116, u106.exit_117, u107.exit_118, u109.exit_121, u110.exit_123, u116.exit_128, u119.exit_132, u120.exit_133, u121.exit_134, u122.exit_135, u130.exit_143, u131.exit_144, u134.exit_146, u135.exit_147, u138.exit_150, u139.exit_151, u140.exit_152, u142.exit_154, u146.exit_161, u155.exit_171, u156.exit_172, u157.exit_173, u159.exit_175, u160.exit_176, u163.exit_179, u168.exit_185, u171.exit_188, u172.exit_189, u173.exit_190, u174.exit_191, u175.exit_192, u178.exit_195, u181.exit_199, u187.exit_7, u190.exit_10, u196.exit_19, u197.exit_20, u213.exit_54, u218.exit_60, u219.exit_66, u224.exit_73, u225.exit_76, u226.exit_77, u227.exit_78, u231.exit_84, u233.exit_90, u234.exit_91, u240.exit_104, u242.exit_107, u247.exit_119, u249.exit_122, u254.exit_130, u268.exit_157, u270.exit_159, u271.exit_160, u272.exit_162, u277.exit_167, u283.exit_180, u285.exit_182, u291.exit_196, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40200/200/40400
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
23858 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,273.939,3038168,1,0,9.4808e+06,20336,106341,4.14865e+06,98,20162,11569
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F("(((u22.flag_1_26>=1)&&(i173.u243.flag_1_108>=1))&&(u22.p1_26>=1))")))U(F(X(G("(((i40.u58.flag_1_62>=1)&&(u106.flag_1_117>=1))&&(i40.u57.p1_62>=1))"))))))
Formula 1 simplified : !(GF"(((u22.flag_1_26>=1)&&(i173.u243.flag_1_108>=1))&&(u22.p1_26>=1))" U FXG"(((i40.u58.flag_1_62>=1)&&(u106.flag_1_117>=1))&&(i40.u57.p1_62>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1585 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,289.805,3038976,1,0,9.4808e+06,20336,128619,4.14865e+06,109,20162,1554011
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(((i2.u189.flag_1_9>=1)&&(u224.flag_1_73>=1))&&(i2.u8.p1_9>=1))")))
Formula 2 simplified : !F"(((i2.u189.flag_1_9>=1)&&(u224.flag_1_73>=1))&&(i2.u8.p1_9>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1226 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,302.063,3038976,1,0,9.4808e+06,20336,131827,4.14865e+06,109,20162,1607818
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((u254.flag_1_130>=1)&&(i113.u158.flag_1_174>=1))&&(u254.p1_130>=1))"))
Formula 3 simplified : !"(((u254.flag_1_130>=1)&&(i113.u158.flag_1_174>=1))&&(u254.p1_130>=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,302.088,3038976,1,0,9.4808e+06,20336,131838,4.14865e+06,111,20162,1607831
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((u142.flag_1_154>=1)&&(i108.u152.flag_1_168>=1))&&(u142.p1_154>=1))"))
Formula 4 simplified : !"(((u142.flag_1_154>=1)&&(i108.u152.flag_1_168>=1))&&(u142.p1_154>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,302.11,3038976,1,0,9.4808e+06,20336,131846,4.14865e+06,111,20162,1607910
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G("(((u34.flag_1_38>=1)&&(u61.flag_1_65>=1))&&(u34.p1_38>=1))"))))
Formula 5 simplified : !XG"(((u34.flag_1_38>=1)&&(u61.flag_1_65>=1))&&(u34.p1_38>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
42 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,302.531,3038976,1,0,9.4808e+06,20336,131882,4.14865e+06,111,20162,1610942
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((F(X("(((i26.u209.flag_1_44>=1)&&(u122.flag_1_135>=1))&&(i26.u40.p1_44>=1))")))U(("(((u69.flag_1_75>=1)&&(u277.flag_1_167>=1))&&(u277.p1_167>=1))")U("(((u213.flag_1_54>=1)&&(u104.flag_1_115>=1))&&(u213.p1_54>=1))")))))
Formula 6 simplified : !X(FX"(((i26.u209.flag_1_44>=1)&&(u122.flag_1_135>=1))&&(i26.u40.p1_44>=1))" U ("(((u69.flag_1_75>=1)&&(u277.flag_1_167>=1))&&(u277.p1_167>=1))" U "(((u213.flag_1_54>=1)&&(u104.flag_1_115>=1))&&(u213.p1_54>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3387 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,336.403,3039164,1,0,9.4808e+06,20336,136676,4.14865e+06,111,20162,1657862
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((u93.flag_1_102>=1)&&(u99.flag_1_110>=1))&&(u93.p1_102>=1))"))
Formula 7 simplified : !"(((u93.flag_1_102>=1)&&(u99.flag_1_110>=1))&&(u93.p1_102>=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,336.426,3039164,1,0,9.4808e+06,20336,136684,4.14865e+06,111,20162,1657984
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F(X("(((u156.flag_1_172>=1)&&(u171.flag_1_188>=1))&&(u171.p1_188>=1))")))U(F(F("(((u271.flag_1_160>=1)&&(i106.u273.flag_1_163>=1))&&(u271.p1_160>=1))"))))))
Formula 8 simplified : !X(FX"(((u156.flag_1_172>=1)&&(u171.flag_1_188>=1))&&(u171.p1_188>=1))" U F"(((u271.flag_1_160>=1)&&(i106.u273.flag_1_163>=1))&&(u271.p1_160>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
753 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,343.951,3039164,1,0,9.4808e+06,20336,138547,4.14865e+06,111,20162,1678469
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((u120.flag_1_133>=1)&&(i90.u125.flag_1_138>=1))&&(u120.p1_133>=1))"))
Formula 9 simplified : !"(((u120.flag_1_133>=1)&&(i90.u125.flag_1_138>=1))&&(u120.p1_133>=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,343.975,3039164,1,0,9.4808e+06,20336,138555,4.14865e+06,111,20162,1678569
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(F(("(((u91.flag_1_100>=1)&&(u268.flag_1_157>=1))&&(u268.p1_157>=1))")U(G("(((i135.u4.flag_1_4>=1)&&(u32.flag_1_36>=1))&&(u32.p1_36>=1))"))))))
Formula 10 simplified : !F("(((u91.flag_1_100>=1)&&(u268.flag_1_157>=1))&&(u268.p1_157>=1))" U G"(((i135.u4.flag_1_4>=1)&&(u32.flag_1_36>=1))&&(u32.p1_36>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
691 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,350.886,3039164,1,0,9.4808e+06,20336,138598,4.14865e+06,111,20162,3144388
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("((u240.flag_0_104>=1)&&(u240.p0_104>=1))")U((X("(((u219.flag_1_66>=1)&&(u172.flag_1_189>=1))&&(u172.p1_189>=1))"))U(X("(((i145.u21.flag_1_25>=1)&&(i31.u47.flag_1_50>=1))&&(i145.u200.p1_25>=1))")))))
Formula 11 simplified : !("((u240.flag_0_104>=1)&&(u240.p0_104>=1))" U (X"(((u219.flag_1_66>=1)&&(u172.flag_1_189>=1))&&(u172.p1_189>=1))" U X"(((i145.u21.flag_1_25>=1)&&(i31.u47.flag_1_50>=1))&&(i145.u200.p1_25>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1650 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,367.381,3039296,1,0,9.4808e+06,20336,142421,4.14865e+06,116,20162,3180255
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(((i135.u4.flag_1_4>=1)&&(u142.flag_1_154>=1))&&(i135.u185.p1_4>=1))"))
Formula 12 simplified : !"(((i135.u4.flag_1_4>=1)&&(u142.flag_1_154>=1))&&(i135.u185.p1_4>=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,367.405,3039296,1,0,9.4808e+06,20336,142429,4.14865e+06,116,20162,3180333
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G("(((i31.u47.flag_1_50>=1)&&(u56.flag_1_61>=1))&&(u56.p1_61>=1))")))
Formula 13 simplified : !G"(((i31.u47.flag_1_50>=1)&&(u56.flag_1_61>=1))&&(u56.p1_61>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
37 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,367.776,3039296,1,0,9.4808e+06,20336,142465,4.14865e+06,116,20162,3180650
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((X("(((u160.flag_1_176>=1)&&(u291.flag_1_196>=1))&&(u160.p1_176>=1))"))U(F("(((i149.u31.flag_1_35>=1)&&(u163.flag_1_179>=1))&&(i149.u206.p1_35>=1))")))U(G(G(G("(((i16.u203.flag_1_31>=1)&&(u159.flag_1_175>=1))&&(u159.p1_175>=1))"))))))
Formula 14 simplified : !((X"(((u160.flag_1_176>=1)&&(u291.flag_1_196>=1))&&(u160.p1_176>=1))" U F"(((i149.u31.flag_1_35>=1)&&(u163.flag_1_179>=1))&&(i149.u206.p1_35>=1))") U G"(((i16.u203.flag_1_31>=1)&&(u159.flag_1_175>=1))&&(u159.p1_175>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1207 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,379.847,3039692,1,0,9.4808e+06,20336,145564,4.14865e+06,116,20162,3200861
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G((G(X("(((i46.u65.flag_1_70>=1)&&(u163.flag_1_179>=1))&&(i46.u222.p1_70>=1))")))U(G(G("(((u247.flag_1_119>=1)&&(i192.u279.flag_1_170>=1))&&(u247.p1_119>=1))"))))))
Formula 15 simplified : !G(GX"(((i46.u65.flag_1_70>=1)&&(u163.flag_1_179>=1))&&(i46.u222.p1_70>=1))" U G"(((u247.flag_1_119>=1)&&(i192.u279.flag_1_170>=1))&&(u247.p1_119>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
323 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,383.085,3039956,1,0,9.4808e+06,20336,146097,4.14865e+06,116,20162,3204000
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527987195435

--------------------
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:46:06 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:46:06 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:46:07 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 1004 ms
Jun 03, 2018 12:46:07 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1000 places.
Jun 03, 2018 12:46:08 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40400 transitions.
Jun 03, 2018 12:46:08 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:46:14 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 5817 ms
Jun 03, 2018 12:46:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 4110 ms
Begin: Sun Jun 3 00:46:23 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:46:23 2018
network size: 1000 nodes, 241600 links, 80800 weight
quality increased from -0.00130924 to 0.506169
end computation: Sun Jun 3 00:46:23 2018
level 1:
start computation: Sun Jun 3 00:46:23 2018
network size: 294 nodes, 83014 links, 80800 weight
quality increased from 0.506169 to 0.661691
end computation: Sun Jun 3 00:46:23 2018
level 2:
start computation: Sun Jun 3 00:46:23 2018
network size: 200 nodes, 40000 links, 80800 weight
quality increased from 0.661691 to 0.661691
end computation: Sun Jun 3 00:46:23 2018
End: Sun Jun 3 00:46:23 2018
Total duration: 0 sec
0.661691
Jun 03, 2018 12:46:23 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:46:26 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 3774 ms
Jun 03, 2018 12:46:27 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:46:44 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 137506 redundant transitions.
Jun 03, 2018 12:46:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 218 ms
Jun 03, 2018 12:46:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 12:46:49 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40400 transitions.
Jun 03, 2018 12:46:49 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
Jun 03, 2018 12:46:54 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 8642ms 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-200"
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-200.tgz
mv Dekker-PT-200 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-200, 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-152732477600032"
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 ;