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 376K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 174K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is IBM319-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264200312
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527941384928

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/graph2706602892062441882.txt, -o, /tmp/graph2706602892062441882.bin, -w, /tmp/graph2706602892062441882.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/graph2706602892062441882.bin, -l, -1, -v, -w, /tmp/graph2706602892062441882.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 : !(((G(F(G("((i0.u66.callToTask_s00002929_output_s00001054>=1)&&(i0.u66.callToTask_s00002929_output_s00001077>=1))"))))U("((i1.u5.merge_s00001161_input_s00001052>=1)&&(i1.u5.merge_s00001161_input_s00001068>=1))")))
Formula 0 simplified : !(GFG"((i0.u66.callToTask_s00002929_output_s00001054>=1)&&(i0.u66.callToTask_s00002929_output_s00001077>=1))" U "((i1.u5.merge_s00001161_input_s00001052>=1)&&(i1.u5.merge_s00001161_input_s00001068>=1))")
built 23 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions merge_s00001061_activate_s00001062, merge_s00001061_activate_s00001064, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :8/168/2/178
Computing Next relation with stutter on 20 deadlock states
131 unique states visited
131 strongly connected components in search stack
131 transitions explored
131 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,0.283781,23604,1,0,10295,470,2398,17918,503,976,44224
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X(X("(i2.u19.decision_s00001126_activated>=1)")))U(G("((i7.u6.join_s00001164_input_s00001052>=1)&&(i7.u6.join_s00001164_input_s00001068>=1))")))))
Formula 1 simplified : !F(XX"(i2.u19.decision_s00001126_activated>=1)" U G"((i7.u6.join_s00001164_input_s00001052>=1)&&(i7.u6.join_s00001164_input_s00001068>=1))")
Computing Next relation with stutter on 20 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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.386649,27140,1,0,17220,486,2432,30742,507,1057,63359
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(((i1.u70.join_s00001163_activated_s00001062>=1)&&(i5.u25.join_s00001163_activated_s00001064>=1))&&(i12.u26.join_s00001163_activated_s00001065>=1))")U(G(G("((i3.u44.callToTask_s00002952_output_s00001054>=1)&&(i3.u12.callToTask_s00002952_output_s00001077>=1))")))))
Formula 2 simplified : !("(((i1.u70.join_s00001163_activated_s00001062>=1)&&(i5.u25.join_s00001163_activated_s00001064>=1))&&(i12.u26.join_s00001163_activated_s00001065>=1))" U G"((i3.u44.callToTask_s00002952_output_s00001054>=1)&&(i3.u12.callToTask_s00002952_output_s00001077>=1))")
Computing Next relation with stutter on 20 deadlock states
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,0.394245,27348,1,0,17280,488,2515,31023,507,1062,64720
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(X(X(F("(i6.u33.decision_s00001157_activated>=1)")))))))
Formula 3 simplified : !XXXXF"(i6.u33.decision_s00001157_activated>=1)"
Computing Next relation with stutter on 20 deadlock states
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.397267,27588,1,0,17409,488,2536,31193,507,1062,65414
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IBM319-PT-none-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(G(X("(i3.u44.callToTask_s00002952_inputCriterion_s00001053_used>=1)"))))U(X(X("((i3.u10.merge_s00001160_input_s00001052>=1)&&(i3.u10.merge_s00001160_input_s00001127>=1))")))))
Formula 4 simplified : !(XGX"(i3.u44.callToTask_s00002952_inputCriterion_s00001053_used>=1)" U XX"((i3.u10.merge_s00001160_input_s00001052>=1)&&(i3.u10.merge_s00001160_input_s00001127>=1))")
Computing Next relation with stutter on 20 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.401069,28316,1,0,17429,488,2564,31216,510,1062,65528
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("((i0.u45.callToTask_s00002961_input_s00001052>=1)&&(i0.u45.callToTask_s00002961_input_s00001066>=1))"))U(F(X(X("((i9.u23.callToProcess_s00002499_input_s00001052>=1)&&(i9.u23.callToProcess_s00002499_input_s00001066>=1))"))))))
Formula 5 simplified : !(G"((i0.u45.callToTask_s00002961_input_s00001052>=1)&&(i0.u45.callToTask_s00002961_input_s00001066>=1))" U FXX"((i9.u23.callToProcess_s00002499_input_s00001052>=1)&&(i9.u23.callToProcess_s00002499_input_s00001066>=1))")
Computing Next relation with stutter on 20 deadlock states
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.408283,28504,1,0,17843,488,2591,31799,510,1062,67226
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(G(("(i8.u13.callToProcess_s00002121_inputCriterion_s00001053_used>=1)")U("((i7.u6.join_s00001164_activated_s00001062>=1)&&(i2.u8.join_s00001164_activated_s00001064>=1))"))))))
Formula 6 simplified : !GFG("(i8.u13.callToProcess_s00002121_inputCriterion_s00001053_used>=1)" U "((i7.u6.join_s00001164_activated_s00001062>=1)&&(i2.u8.join_s00001164_activated_s00001064>=1))")
Computing Next relation with stutter on 20 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 178 rows 253 cols
129 unique states visited
129 strongly connected components in search stack
129 transitions explored
129 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.476542,30248,1,0,20523,488,2641,35403,510,1065,83684
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(X("(i0.u66.callToTask_s00002929_inputCriterion_s00001053_used>=1)")))))
Formula 7 simplified : !GXX"(i0.u66.callToTask_s00002929_inputCriterion_s00001053_used>=1)"
Computing Next relation with stutter on 20 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 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.477846,30512,1,0,20523,488,2654,35403,510,1065,83710
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(F("(i2.u27.fork_s00001071_activated_s00001075>=1)")))U(X("((i2.u27.decision_s00001126_input_s00001052>=1)&&(i2.u27.decision_s00001126_input_s00001066>=1))")))))
Formula 8 simplified : !X(XF"(i2.u27.fork_s00001071_activated_s00001075>=1)" U X"((i2.u27.decision_s00001126_input_s00001052>=1)&&(i2.u27.decision_s00001126_input_s00001066>=1))")
Computing Next relation with stutter on 20 deadlock states
invariant :i1:u70:join_s00001163_input_s00001052 + -1'i1:u70:join_s00001163_input_s00001127 = 0
invariant :i3:u10:merge_s00001160_input_s00001052 + -1'i3:u10:merge_s00001160_input_s00001127 = 0
invariant :i9:u3:merge_s00002238_input_s00001052 + -1'i9:u3:merge_s00002238_input_s00001068 = 0
invariant :i3:u40:callToTask_s00002963_input_s00001052 + -1'i3:u40:callToTask_s00002963_input_s00001066 = 0
invariant :i5:u25:join_s00001163_input_s00001128 + -1'i5:u25:join_s00001163_input_s00001066 = 0
invariant :i1:u5:merge_s00001161_activated + i1:u5:merge_s00001161_input_s00001068 + i1:u28:decision_s00001841_activated + i1:u28:fork_s00001298_activated_s00001073 + i1:u28:decision_s00001841_input_s00001066 + i1:u67:callToTask_s00002931_output_s00001077 + i1:u67:callToTask_s00002931_inputCriterion_s00001053_used + i1:u67:callToTask_s00002931_input_s00001066 + i1:u70:join_s00001163_activated_s00001062 + i1:u70:join_s00001163_input_s00001127 + -1'i12:u26:join_s00001163_activated_s00001065 + -1'i12:u26:callToTask_s00002930_inputCriterion_s00001053_used + -1'i12:u26:callToTask_s00002930_output_s00001077 + -1'i12:u29:fork_s00001298_activated_s00001078 + -1'i12:u29:callToTask_s00002930_input_s00001066 = 0
invariant :i7:u35:callToTask_s00001406_output_s00001077 + -1'i7:u60:callToTask_s00001406_output_s00001054 = 0
invariant :i2:u8:join_s00001164_input_s00001127 + -1'i2:u8:join_s00001164_input_s00001066 = 0
invariant :i10:u0:callToTask_s00002960_input_s00001128 + -1'i10:u39:fork_s00001403_activated_s00001075 + -1'i10:u39:callToTask_s00002960_input_s00001052 + -1'i10:u39:process_s00000343__s00003019_input_s00001109 = 0
invariant :i10:u64:callToTask_s00002869_output_s00001054 + -1'i10:u64:callToTask_s00002869_output_s00001077 = 0
invariant :i6:u33:endNode_s00001057_input_default + -1'i6:u33:process_s00000343__s00003019_output_s00001249 + -1'i11:u63:process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
invariant :i8:u13:callToTask_s00002962_output_s00001077 + -1'i8:u43:callToTask_s00002962_output_s00001054 = 0
invariant :i3:u15:callToTask_s00002958_output_s00001077 + -1'i3:u15:callToTask_s00002958_output_s00001054 + -1'i11:u63:process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
invariant :i9:u7:callToTask_s00002965_output_s00001077 + -1'i9:u46:callToTask_s00002965_output_s00001054 = 0
invariant :i0:u66:callToTask_s00002929_output_s00001054 + -1'i0:u66:callToTask_s00002929_output_s00001077 = 0
invariant :i4:u57:callToProcess_s00002943_output_s00001054 + -1'i4:u59:callToProcess_s00002943_output_s00001077 = 0
invariant :i0:u45:callToTask_s00002961_output_s00001054 + -1'i0:u56:callToTask_s00002961_output_s00001077 = 0
invariant :i10:u55:callToProcess_s00002944_output_s00001054 + -1'i10:u55:callToProcess_s00002944_output_s00001077 = 0
invariant :i4:u47:callToTask_s00002956_input_s00001052 + -1'i4:u47:callToTask_s00002956_input_s00001066 = 0
invariant :i10:u1:merge_s00001061_input_s00001068 + -1'i10:u21:merge_s00001061_input_s00001052 = 0
invariant :i2:u69:callToTask_s00002964_output_s00001054 + -1'i2:u49:callToTask_s00002964_output_s00001077 = 0
invariant :i4:u17:callToTask_s00002966_output_s00001054 + -1'i4:u57:callToTask_s00002966_output_s00001077 = 0
98 unique states visited
98 strongly connected components in search stack
98 transitions explored
98 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,0.554864,32868,1,0,24308,488,2715,42690,512,1065,102776
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(X(X(X("((i10.u52.callToTask_s00002869_input_s00001052>=1)&&(i10.u21.callToTask_s00002869_input_s00001066>=1))")))))))
Formula 9 simplified : !GXXXX"((i10.u52.callToTask_s00002869_input_s00001052>=1)&&(i10.u21.callToTask_s00002869_input_s00001066>=1))"
Computing Next relation with stutter on 20 deadlock states
invariant :i3:u15:callToTask_s00002950_output_s00001054 + -1'i3:u15:callToTask_s00002950_output_s00001077 = 0
invariant :i0:u4:merge_s00002239_activated + i0:u4:merge_s00002239_input_s00001066 + i0:u20:merge_s00002239_input_s00001129 + i0:u20:decision_s00001840_activated + i0:u20:callToTask_s00001168_input_s00001068 + i0:u66:callToTask_s00002929_inputCriterion_s00001053_used + i0:u66:callToTask_s00002929_output_s00001077 + i0:u66:callToTask_s00002929_input_s00001066 + i0:u16:callToTask_s00002957_inputCriterion_s00001053_used + i0:u16:callToTask_s00002957_input_s00001066 + i0:u24:decision_s00002948_activated + i0:u24:callToTask_s00002957_output_s00001054 + i0:u37:callToTask_s00002954_inputCriterion_s00001053_used + i0:u37:callToTask_s00002954_input_s00001052 + i0:u37:callToTask_s00002954_output_s00001077 + i0:u45:callToTask_s00002961_inputCriterion_s00001053_used + i0:u45:callToTask_s00002961_input_s00001066 + i0:u56:callToProcess_s00002038_inputCriterion_s00001053_used + i0:u56:callToProcess_s00002038_output_s00001077 + i0:u56:callToTask_s00002961_output_s00001077 + i3:u10:decision_s00003020_activated + i3:u10:callToTask_s00002949_output_s00001077 + i3:u10:merge_s00001160_input_s00001127 + i3:u14:callToTask_s00002949_inputCriterion_s00001053_used + i3:u14:callToTask_s00002951_inputCriterion_s00001053_used + i3:u14:callToTask_s00002951_output_s00001077 + i3:u14:callToTask_s00002951_input_s00001066 + i3:u12:decision_s00002056_activated + i3:u12:merge_s00001160_input_s00001068 + i3:u44:callToTask_s00002952_inputCriterion_s00001053_used + i3:u44:callToTask_s00002952_output_s00001054 + i3:u44:callToTask_s00002952_input_s00001066 + i3:u15:callToTask_s00002958_inputCriterion_s00001053_used + i3:u15:callToTask_s00002950_inputCriterion_s00001053_used + i3:u15:callToTask_s00002958_output_s00001054 + i3:u15:callToTask_s00002950_output_s00001077 + i3:u40:callToTask_s00002963_inputCriterion_s00001053_used + i3:u40:callToTask_s00002963_output_s00001077 + i3:u40:callToTask_s00002963_input_s00001066 + i3:u50:merge_s00001160_activated + i3:u50:callToTask_s00002950_input_s00001066 + i4:u42:decision_s00003021_activated + i4:u42:callToTask_s00002953_inputCriterion_s00001053_used + i4:u42:callToTask_s00002953_output_s00001077 + i4:u42:callToTask_s00002953_input_s00001066 + i4:u47:callToTask_s00002956_inputCriterion_s00001053_used + i4:u47:callToTask_s00002956_output_s00001077 + i4:u47:callToTask_s00002956_input_s00001066 + i4:u17:callToTask_s00002966_inputCriterion_s00001053_used + i4:u17:callToTask_s00002966_input_s00001066 + i4:u57:callToProcess_s00002943_inputCriterion_s00001053_used + i4:u57:callToTask_s00002966_output_s00001077 + i4:u59:callToTask_s00002254_inputCriterion_s00001053_used + i4:u59:callToTask_s00002254_output_s00001054 + i4:u59:callToProcess_s00002943_output_s00001077 + i6:u32:callToTask_s00002667_inputCriterion_s00001053_used + i6:u32:callToTask_s00002667_output_s00001077 + i6:u33:decision_s00001157_activated + i6:u33:process_s00000343__s00003019_output_s00001249 + i6:u33:callToTask_s00002667_input_s00001066 + i6:u34:callToTask_s00002063_inputCriterion_s00001053_used + i6:u58:callToProcess_s00002802_inputCriterion_s00001053_used + i6:u58:callToTask_s00002063_output_s00001054 + i6:u61:callToTask_s00001852_inputCriterion_s00001053_used + i6:u61:callToProcess_s00002802_output_s00001054 + i6:u61:callToTask_s00001852_output_s00001077 + i7:u6:join_s00001164_activated_s00001062 + i7:u6:join_s00001164_input_s00001068 + i7:u9:merge_s00002240_activated + i7:u9:merge_s00002240_input_s00001066 + i7:u30:decision_s00001123_activated + i7:u30:fork_s00001071_activated_s00001073 + i7:u30:decision_s00001123_input_s00001066 + i7:u35:callToTask_s00001406_inputCriterion_s00001053_used + i7:u35:callToTask_s00001406_input_s00001066 + i7:u38:merge_s00002240_input_s00001052 + i7:u38:decision_s00001158_activated + i7:u38:callToTask_s00001168_input_s00001052 + i7:u60:callToTask_s00002044_inputCriterion_s00001053_used + i7:u60:callToTask_s00001406_output_s00001054 + i7:u60:callToTask_s00002044_output_s00001077 + i8:u13:callToProcess_s00002121_inputCriterion_s00001053_used + i8:u13:callToProcess_s00002121_output_s00001077 + i8:u43:callToTask_s00002962_inputCriterion_s00001053_used + i8:u43:callToTask_s00002962_output_s00001054 + i8:u43:callToTask_s00002962_input_s00001066 + i8:u36:callToTask_s00002955_inputCriterion_s00001053_used + i8:u36:callToTask_s00002955_output_s00001077 + i8:u41:decision_s00002761_activated + i8:u41:callToTask_s00001168_input_s00001127 + i8:u51:callToTask_s00002959_inputCriterion_s00001053_used + i8:u51:callToTask_s00002959_input_s00001052 + i8:u51:callToTask_s00002959_output_s00001077 + i9:u7:callToProcess_s00002882_inputCriterion_s00001053_used + i9:u46:callToTask_s00002965_inputCriterion_s00001053_used + i9:u46:callToTask_s00002965_output_s00001054 + i9:u46:callToTask_s00002965_input_s00001066 + i9:u3:merge_s00002238_activated + i9:u3:merge_s00002238_input_s00001068 + i9:u23:decision_s00002762_activated + i9:u23:callToProcess_s00002499_input_s00001066 + i9:u53:callToProcess_s00002499_output_s00001083 + i9:u53:callToProcess_s00002499_inputCriterion_s00001053_used + i9:u54:callToTask_s00002896_inputCriterion_s00001053_used + i9:u54:callToProcess_s00002882_output_s00001054 + i9:u54:callToTask_s00002896_output_s00001077 + i9:u65:callToTask_s00002870_inputCriterion_s00001053_used + i9:u65:callToTask_s00002870_output_s00001077 + i10:u1:merge_s00001061_activated + i10:u1:callToTask_s00002063_input_s00001066 + i10:u21:merge_s00001061_input_s00001052 + i10:u21:decision_s00002760_activated + i10:u21:callToTask_s00002869_input_s00001066 + i10:u64:callToTask_s00002869_inputCriterion_s00001053_used + i10:u64:callToTask_s00002869_output_s00001077 + i10:u0:alpha + i10:u48:callToTask_s00002960_inputCriterion_s00001053_used + i10:u48:callToTask_s00002960_output_s00001077 + i10:u55:callToProcess_s00002944_inputCriterion_s00001053_used + i10:u55:callToProcess_s00002944_output_s00001077 + i10:u39:fork_s00001403_activated_s00001075 + i10:u39:callToTask_s00002960_input_s00001052 + i10:u39:process_s00000343__s00003019_input_s00001109 + 3'i11:u18:decision_s00003022_activated + 3'i11:u18:endNode_s00001401_input_default + 3'i11:u18:callToProcess_s00001108_input_s00001052 + 3'i11:u62:callToTask_s00001168_inputCriterion_s00001053_used + 3'i11:u62:callToTask_s00001168_output_s00001054 + 3'i11:u63:callToProcess_s00001108_inputCriterion_s00001053_used + 3'i11:u63:callToProcess_s00001108_output_s00001077 + 2'i11:u63:process_s00000343__s00003019_outputCriterion_s00001055_omega + i12:u26:join_s00001163_activated_s00001065 + i12:u26:callToTask_s00002930_inputCriterion_s00001053_used + i12:u26:callToTask_s00002930_output_s00001077 + i12:u29:fork_s00001298_activated_s00001078 + i12:u29:callToTask_s00002930_input_s00001066 = 1
invariant :i4:u17:callToTask_s00002966_input_s00001052 + -1'i4:u17:callToTask_s00002966_input_s00001066 = 0
invariant :i3:u40:callToTask_s00002963_output_s00001054 + -1'i3:u40:callToTask_s00002963_output_s00001077 = 0
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.557834,33128,1,0,24337,488,2734,42716,512,1065,102913
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(("((i9.u54.callToProcess_s00002882_output_s00001054>=1)&&(i9.u7.callToProcess_s00002882_output_s00001077>=1))")U(X("((i2.u8.join_s00001164_input_s00001066>=1)&&(i2.u8.join_s00001164_input_s00001127>=1))")))))
Formula 10 simplified : !G("((i9.u54.callToProcess_s00002882_output_s00001054>=1)&&(i9.u7.callToProcess_s00002882_output_s00001077>=1))" U X"((i2.u8.join_s00001164_input_s00001066>=1)&&(i2.u8.join_s00001164_input_s00001127>=1))")
Computing Next relation with stutter on 20 deadlock states
invariant :i0:u16:callToTask_s00002957_output_s00001077 + -1'i0:u24:callToTask_s00002957_output_s00001054 = 0
invariant :i0:u24:callToTask_s00002954_input_s00001066 + -1'i0:u37:callToTask_s00002954_input_s00001052 = 0
invariant :i10:u0:callToTask_s00002960_input_s00001127 + -1'i10:u39:fork_s00001403_activated_s00001075 + -1'i10:u39:callToTask_s00002960_input_s00001052 + -1'i10:u39:process_s00000343__s00003019_input_s00001109 = 0
invariant :i6:u61:callToTask_s00001852_output_s00001054 + -1'i6:u61:callToTask_s00001852_output_s00001077 = 0
invariant :i5:u2:merge_s00001162_activated + i5:u2:merge_s00001162_input_s00001068 + i5:u25:join_s00001163_activated_s00001064 + i5:u25:join_s00001163_input_s00001066 + i5:u31:decision_s00002055_activated + i5:u31:fork_s00001298_activated_s00001075 + i5:u31:decision_s00002055_input_s00001066 + i5:u68:callToTask_s00002932_output_s00001077 + i5:u68:callToTask_s00002932_inputCriterion_s00001053_used + i5:u68:callToTask_s00002932_input_s00001066 + -1'i12:u26:join_s00001163_activated_s00001065 + -1'i12:u26:callToTask_s00002930_inputCriterion_s00001053_used + -1'i12:u26:callToTask_s00002930_output_s00001077 + -1'i12:u29:fork_s00001298_activated_s00001078 + -1'i12:u29:callToTask_s00002930_input_s00001066 = 0
invariant :i7:u9:merge_s00002240_input_s00001127 + -1'i7:u9:merge_s00002240_input_s00001066 = 0
invariant :i2:u19:callToTask_s00002964_input_s00001052 + -1'i2:u69:callToTask_s00002964_input_s00001066 = 0
invariant :i1:u67:callToTask_s00002931_output_s00001054 + -1'i1:u67:callToTask_s00002931_output_s00001077 = 0
invariant :i8:u51:callToTask_s00002959_output_s00001054 + -1'i8:u51:callToTask_s00002959_output_s00001077 = 0
invariant :i9:u65:callToTask_s00002870_output_s00001054 + -1'i9:u65:callToTask_s00002870_output_s00001077 = 0
invariant :i5:u31:decision_s00002055_input_s00001052 + -1'i5:u31:decision_s00002055_input_s00001066 = 0
invariant :i6:u32:callToTask_s00002667_input_s00001052 + -1'i6:u33:callToTask_s00002667_input_s00001066 = 0
invariant :i4:u42:callToTask_s00002953_input_s00001052 + -1'i4:u42:callToTask_s00002953_input_s00001066 = 0
invariant :i9:u23:callToProcess_s00002499_input_s00001052 + -1'i9:u23:callToProcess_s00002499_input_s00001066 = 0
invariant :i9:u53:callToProcess_s00002499_output_s00001054 + -1'i9:u53:callToProcess_s00002499_output_s00001083 = 0
invariant :i6:u32:callToTask_s00002667_output_s00001054 + -1'i6:u32:callToTask_s00002667_output_s00001077 = 0
invariant :i2:u11:merge_s00002241_input_s00001127 + -1'i2:u19:merge_s00002241_input_s00001066 = 0
invariant :i6:u34:callToTask_s00002063_output_s00001077 + -1'i6:u58:callToTask_s00002063_output_s00001054 = 0
invariant :i3:u14:callToTask_s00002951_output_s00001054 + -1'i3:u14:callToTask_s00002951_output_s00001077 = 0
invariant :i3:u12:callToTask_s00002952_output_s00001077 + -1'i3:u44:callToTask_s00002952_output_s00001054 = 0
invariant :i2:u27:decision_s00001126_input_s00001052 + -1'i2:u27:decision_s00001126_input_s00001066 = 0
invariant :i7:u35:callToTask_s00001406_input_s00001052 + -1'i7:u35:callToTask_s00001406_input_s00001066 = 0
invariant :i3:u10:callToTask_s00002949_output_s00001054 + -1'i3:u10:callToTask_s00002949_output_s00001077 = 0
invariant :i9:u54:callToTask_s00002896_output_s00001054 + -1'i9:u54:callToTask_s00002896_output_s00001077 = 0
invariant :i0:u37:callToTask_s00002954_output_s00001054 + -1'i0:u37:callToTask_s00002954_output_s00001077 = 0
invariant :i5:u68:callToTask_s00002932_input_s00001052 + -1'i5:u68:callToTask_s00002932_input_s00001066 = 0
invariant :i3:u50:callToTask_s00002950_input_s00001052 + -1'i3:u50:callToTask_s00002950_input_s00001066 = 0
invariant :i6:u58:callToProcess_s00002802_output_s00001077 + -1'i6:u61:callToProcess_s00002802_output_s00001054 = 0
invariant :i11:u63:callToProcess_s00001108_output_s00001054 + -1'i11:u63:callToProcess_s00001108_output_s00001077 + i11:u63:process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
invariant :i12:u26:callToTask_s00002930_output_s00001054 + -1'i12:u26:callToTask_s00002930_output_s00001077 = 0
invariant :i0:u45:callToTask_s00002961_input_s00001052 + -1'i0:u45:callToTask_s00002961_input_s00001066 = 0
invariant :i9:u46:callToTask_s00002965_input_s00001052 + -1'i9:u46:callToTask_s00002965_input_s00001066 = 0
invariant :i1:u67:callToTask_s00002931_input_s00001052 + -1'i1:u67:callToTask_s00002931_input_s00001066 = 0
invariant :i8:u41:callToTask_s00002959_input_s00001066 + -1'i8:u51:callToTask_s00002959_input_s00001052 = 0
invariant :i0:u16:callToTask_s00002957_input_s00001052 + -1'i0:u16:callToTask_s00002957_input_s00001066 = 0
invariant :i10:u0:callToTask_s00002960_input_s00001066 + -1'i10:u39:fork_s00001403_activated_s00001075 + -1'i10:u39:callToTask_s00002960_input_s00001052 + -1'i10:u39:process_s00000343__s00003019_input_s00001109 = 0
invariant :i10:u0:callToTask_s00002960_input_s00001068 + -1'i10:u39:fork_s00001403_activated_s00001075 + -1'i10:u39:callToTask_s00002960_input_s00001052 + -1'i10:u39:process_s00000343__s00003019_input_s00001109 = 0
invariant :i10:u48:callToTask_s00002960_output_s00001054 + -1'i10:u48:callToTask_s00002960_output_s00001077 = 0
invariant :i3:u12:merge_s00001160_input_s00001129 + -1'i3:u12:merge_s00001160_input_s00001068 = 0
invariant :i0:u66:callToTask_s00002929_input_s00001052 + -1'i0:u66:callToTask_s00002929_input_s00001066 = 0
invariant :i7:u30:decision_s00001123_input_s00001052 + -1'i7:u30:decision_s00001123_input_s00001066 = 0
invariant :i8:u43:callToTask_s00002962_input_s00001052 + -1'i8:u43:callToTask_s00002962_input_s00001066 = 0
invariant :i4:u47:callToTask_s00002956_output_s00001054 + -1'i4:u47:callToTask_s00002956_output_s00001077 = 0
invariant :i6:u34:callToTask_s00002063_input_s00001052 + -1'i10:u1:callToTask_s00002063_input_s00001066 = 0
134 unique states visited
134 strongly connected components in search stack
135 transitions explored
134 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.569854,33376,1,0,24685,488,2755,43173,515,1065,104674
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G("((i4.u47.callToTask_s00002956_input_s00001052>=1)&&(i4.u47.callToTask_s00002956_input_s00001066>=1))"))U("((i4.u17.callToTask_s00002966_input_s00001052>=1)&&(i4.u17.callToTask_s00002966_input_s00001066>=1))")))
Formula 11 simplified : !(G"((i4.u47.callToTask_s00002956_input_s00001052>=1)&&(i4.u47.callToTask_s00002956_input_s00001066>=1))" U "((i4.u17.callToTask_s00002966_input_s00001052>=1)&&(i4.u17.callToTask_s00002966_input_s00001066>=1))")
Computing Next relation with stutter on 20 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.571375,33376,1,0,24685,488,2780,43173,515,1065,104715
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(i4.u59.callToTask_s00002254_inputCriterion_s00001053_used>=1)"))
Formula 12 simplified : !"(i4.u59.callToTask_s00002254_inputCriterion_s00001053_used>=1)"
Computing Next relation with stutter on 20 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.571791,33376,1,0,24685,488,2784,43173,515,1065,104731
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(F(G(F("(i6.u61.callToTask_s00001852_inputCriterion_s00001053_used>=1)")))))))
Formula 13 simplified : !GXFGF"(i6.u61.callToTask_s00001852_inputCriterion_s00001053_used>=1)"
Computing Next relation with stutter on 20 deadlock states
invariant :i8:u36:callToTask_s00002955_output_s00001054 + -1'i8:u36:callToTask_s00002955_output_s00001077 = 0
invariant :i3:u14:callToTask_s00002951_input_s00001052 + -1'i3:u14:callToTask_s00002951_input_s00001066 = 0
invariant :i3:u44:callToTask_s00002952_input_s00001052 + -1'i3:u44:callToTask_s00002952_input_s00001066 = 0
invariant :i5:u68:callToTask_s00002932_output_s00001054 + -1'i5:u68:callToTask_s00002932_output_s00001077 = 0
invariant :i0:u4:merge_s00002239_input_s00001068 + -1'i0:u20:merge_s00002239_input_s00001129 = 0
invariant :i1:u5:merge_s00001161_input_s00001052 + -1'i1:u5:merge_s00001161_input_s00001068 = 0
invariant :i9:u7:callToProcess_s00002882_output_s00001077 + -1'i9:u54:callToProcess_s00002882_output_s00001054 = 0
invariant :i12:u29:callToTask_s00002930_input_s00001052 + -1'i12:u29:callToTask_s00002930_input_s00001066 = 0
invariant :i2:u8:join_s00001164_activated_s00001064 + i2:u8:join_s00001164_input_s00001066 + i2:u11:merge_s00002241_activated + i2:u11:merge_s00002241_input_s00001052 + i2:u19:decision_s00001126_activated + i2:u19:merge_s00002241_input_s00001066 + i2:u27:fork_s00001071_activated_s00001075 + i2:u27:decision_s00001126_input_s00001066 + i2:u69:callToTask_s00002964_input_s00001066 + i2:u69:callToTask_s00002964_inputCriterion_s00001053_used + i2:u22:decision_s00001159_activated + i2:u22:callToTask_s00001168_input_s00001066 + i2:u49:callToTask_s00002824_inputCriterion_s00001053_used + i2:u49:callToTask_s00002824_output_s00001077 + i2:u49:callToTask_s00002964_output_s00001077 + -1'i7:u6:join_s00001164_activated_s00001062 + -1'i7:u6:join_s00001164_input_s00001068 + -1'i7:u9:merge_s00002240_activated + -1'i7:u9:merge_s00002240_input_s00001066 + -1'i7:u30:decision_s00001123_activated + -1'i7:u30:fork_s00001071_activated_s00001073 + -1'i7:u30:decision_s00001123_input_s00001066 + -1'i7:u35:callToTask_s00001406_inputCriterion_s00001053_used + -1'i7:u35:callToTask_s00001406_input_s00001066 + -1'i7:u38:merge_s00002240_input_s00001052 + -1'i7:u38:decision_s00001158_activated + -1'i7:u38:callToTask_s00001168_input_s00001052 + -1'i7:u60:callToTask_s00002044_inputCriterion_s00001053_used + -1'i7:u60:callToTask_s00001406_output_s00001054 + -1'i7:u60:callToTask_s00002044_output_s00001077 = 0
invariant :i5:u2:merge_s00001162_input_s00001052 + -1'i5:u2:merge_s00001162_input_s00001068 = 0
invariant :i7:u6:join_s00001164_input_s00001052 + -1'i7:u6:join_s00001164_input_s00001068 = 0
invariant :i0:u4:merge_s00002239_input_s00001128 + -1'i0:u4:merge_s00002239_input_s00001066 = 0
invariant :i8:u13:callToProcess_s00002121_output_s00001054 + -1'i8:u13:callToProcess_s00002121_output_s00001077 = 0
invariant :i1:u28:decision_s00001841_input_s00001052 + -1'i1:u28:decision_s00001841_input_s00001066 = 0
133 unique states visited
133 strongly connected components in search stack
134 transitions explored
133 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.589997,33376,1,0,24786,488,2798,43318,515,1066,105475
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((i3.u44.callToTask_s00002952_output_s00001054>=1)&&(i3.u12.callToTask_s00002952_output_s00001077>=1))"))
Formula 14 simplified : !"((i3.u44.callToTask_s00002952_output_s00001054>=1)&&(i3.u12.callToTask_s00002952_output_s00001077>=1))"
Computing Next relation with stutter on 20 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.590709,33608,1,0,24786,488,2798,43318,515,1066,105479
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G(G(G("(i3.u50.merge_s00001160_activated>=1)"))))U(F(X("((i7.u6.join_s00001164_activated_s00001062>=1)&&(i2.u8.join_s00001164_activated_s00001064>=1))")))))
Formula 15 simplified : !(G"(i3.u50.merge_s00001160_activated>=1)" U FX"((i7.u6.join_s00001164_activated_s00001062>=1)&&(i2.u8.join_s00001164_activated_s00001064>=1))")
Computing Next relation with stutter on 20 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.630409,33864,1,0,27621,488,2830,46505,515,1066,113239
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527941391361

--------------------
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 02, 2018 12:09:47 PM 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 02, 2018 12:09:47 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 131 ms
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 253 places.
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 178 transitions.
Jun 02, 2018 12:09:48 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 27 ms
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 126 ms
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 64 ms
Begin: Sat Jun 2 12:09:48 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:09:48 2018
network size: 253 nodes, 708 links, 356 weight
quality increased from -0.00500466 to 0.556089
end computation: Sat Jun 2 12:09:48 2018
level 1:
start computation: Sat Jun 2 12:09:48 2018
network size: 71 nodes, 249 links, 356 weight
quality increased from 0.556089 to 0.799329
end computation: Sat Jun 2 12:09:48 2018
level 2:
start computation: Sat Jun 2 12:09:48 2018
network size: 27 nodes, 103 links, 356 weight
quality increased from 0.799329 to 0.852763
end computation: Sat Jun 2 12:09:48 2018
level 3:
start computation: Sat Jun 2 12:09:48 2018
network size: 13 nodes, 53 links, 356 weight
quality increased from 0.852763 to 0.852763
end computation: Sat Jun 2 12:09:48 2018
End: Sat Jun 2 12:09:48 2018
Total duration: 0 sec
0.852763
Jun 02, 2018 12:09:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:09:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 75 ms
Jun 02, 2018 12:09:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:09:49 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 7 redundant transitions.
Jun 02, 2018 12:09:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 02, 2018 12:09:49 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 12:09:49 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 178 transitions.
Jun 02, 2018 12:09:49 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 84 place invariants in 135 ms
Jun 02, 2018 12:09:50 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
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:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 02, 2018 12:09:50 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 731ms 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="IBM319-PT-none"
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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 IBM319-PT-none, 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 r213-smll-152732264200312"
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 ;