fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r213-smll-152732264200314
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for IBM5964-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15753.180 5275.00 10694.00 378.90 FFFFFFTFFFFTFFFF normal

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 372K
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.3K 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.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.1K 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 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is IBM5964-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-152732264200314
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527941427500

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/graph6056188494530803467.txt, -o, /tmp/graph6056188494530803467.bin, -w, /tmp/graph6056188494530803467.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/graph6056188494530803467.bin, -l, -1, -v, -w, /tmp/graph6056188494530803467.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 : !(("(((i5.u45.callToTask_s00002190_output_s00000938>=1)&&(i5.u21.callToTask_s00002190_output_s00000956>=1))&&(i5.u21.callToTask_s00002190_output_s00000979>=1))"))
Formula 0 simplified : !"(((i5.u45.callToTask_s00002190_output_s00000938>=1)&&(i5.u21.callToTask_s00002190_output_s00000956>=1))&&(i5.u21.callToTask_s00002190_output_s00000979>=1))"
built 25 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions merge_s00001292_activate_s00000949, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :114/24/1/139
Computing Next relation with stutter on 10 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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.251683,21816,1,0,11787,1591,1674,10164,961,5283,23036
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G("(i7.u3.callToTask_s00005972_output_s00000938>=1)"))))
Formula 1 simplified : !XG"(i7.u3.callToTask_s00005972_output_s00000938>=1)"
Computing Next relation with stutter on 10 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.255251,22348,1,0,11897,1591,1693,10251,962,5284,23478
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(G(G(X("(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)")))))))
Formula 2 simplified : !FGX"(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 139 rows 263 cols
invariant :i2:u12:callToTask_s00002526_output_s00000981 + -1'i2:u18:callToTask_s00002526_output_s00000956 = 0
invariant :i0:u7:callToTask_s00005897_output_s00000938 + -1'i0:u7:callToTask_s00005897_output_s00000979 = 0
invariant :i1:u25:fork_s00001067_input_s00000935 + -1'i1:u25:fork_s00001067_input_s00000952 = 0
invariant :i3:u30:callToTask_s00002427_input_s00000952 + -1'i3:u30:callToTask_s00002427_input_s00000950 = 0
invariant :i6:u48:merge_s00001120_input_s00000950 + -1'i6:u48:merge_s00001120_input_s00001513 = 0
invariant :i6:u8:callToTask_s00005969_output_s00000938 + -1'i6:u8:callToTask_s00005969_output_s00000959 = 0
invariant :i10:u14:callToTask_s00001971_output_s00000938 + -1'i10:u20:callToTask_s00001971_output_s00000956 = 0
invariant :i6:u4:merge_s00000945_input_s00000986 + -1'i6:u4:merge_s00000945_input_s00000935 = 0
invariant :i2:u13:merge_s00001291_input_s00000987 + -1'i2:u13:merge_s00001291_input_s00000950 = 0
invariant :i8:u40:callToTask_s00002185_input_s00000950 + -1'i8:u40:callToTask_s00002185_input_s00000952 = 0
invariant :i4:u32:callToProcess_s00002411_output_s00000938 + -1'i4:u49:callToProcess_s00002411_output_s00000956 = 0
invariant :i6:u22:callToTask_s00005849_input_s00000985 + -1'i6:u22:callToTask_s00005849_input_s00000952 = 0
invariant :i8:u5:join_s00001295_input_s00000986 + -1'i8:u5:join_s00001295_input_s00000935 = 0
invariant :i5:u42:callToTask_s00001746_input_s00000935 + -1'i5:u42:callToTask_s00001746_input_s00000952 = 0
invariant :i6:u36:callToTask_s00005970_input_s00000950 + -1'i6:u36:callToTask_s00005970_input_s00000952 = 0
invariant :i8:u28:callToProcess_s00004075_output_s00000956 + -1'i8:u28:callToProcess_s00004075_output_s00000938 + -1'i9:u34:process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :i8:u46:join_s00001295_input_s00000950 + -1'i8:u46:join_s00001295_input_s00000985 = 0
invariant :i0:u2:merge_s00001292_input_s00000950 + -1'i0:u19:merge_s00001292_input_s00000986 + -1'i0:u19:fork_s00001537_activated_s00000993 + -1'i0:u27:process_s00000383__s00005964_input_s00001512 = 0
invariant :i5:u45:callToTask_s00002183_output_s00000956 + -1'i5:u45:callToTask_s00002183_output_s00000938 = 0
invariant :i10:u20:callToTask_s00001632_output_s00000938 + -1'i10:u20:callToTask_s00001632_output_s00000979 = 0
invariant :i10:u33:callToTask_s00002741_input_s00000935 + -1'i10:u33:callToTask_s00002741_input_s00000985 = 0
invariant :i6:u15:callToTask_s00002186_output_s00000979 + -1'i8:u24:callToTask_s00002186_output_s00000938 = 0
invariant :i8:u28:callToProcess_s00004075_input_s00000935 + -1'i8:u28:callToProcess_s00004075_input_s00000986 = 0
invariant :i2:u9:callToTask_s00005968_input_s00000950 + -1'i2:u9:callToTask_s00005968_input_s00000952 = 0
invariant :i2:u12:callToTask_s00005971_output_s00000938 + -1'i2:u12:callToTask_s00005971_output_s00000959 = 0
invariant :i3:u30:callToTask_s00002427_input_s00001203 + -1'i3:u30:callToTask_s00002427_input_s00000950 = 0
invariant :i8:u28:callToProcess_s00004075_input_s00000950 + -1'i8:u28:callToProcess_s00004075_input_s00000986 = 0
invariant :i0:u7:callToTask_s00005897_input_s00000950 + -1'i0:u7:callToTask_s00005897_input_s00000986 = 0
invariant :i1:u37:callToTask_s00005967_input_s00000950 + -1'i1:u37:callToTask_s00005967_input_s00000952 = 0
invariant :i2:u18:callToTask_s00002526_input_s00000986 + -1'i2:u18:callToTask_s00002526_input_s00000935 = 0
invariant :i10:u43:callToTask_s00002741_output_s00000960 + -1'i10:u43:callToTask_s00002741_output_s00000979 = 0
invariant :i0:u51:callToProcess_s00005925_input_s00000985 + -1'i0:u51:callToProcess_s00005925_input_s00000986 = 0
invariant :i8:u24:fork_s00001293_input_s00000950 + -1'i8:u24:fork_s00001293_input_s00000952 = 0
invariant :i9:u44:callToTask_s00001305_input_s00001009 + -1'i9:u44:callToTask_s00001305_input_s00000950 = 0
invariant :i6:u15:callToTask_s00002186_input_s00001011 + -1'i6:u15:callToTask_s00002186_input_s00001012 = 0
invariant :i2:u12:callToTask_s00002526_output_s00000938 + -1'i2:u18:callToTask_s00002526_output_s00000956 = 0
invariant :i6:u8:callToTask_s00005969_output_s00000960 + -1'i6:u8:callToTask_s00005969_output_s00000959 = 0
invariant :i5:u42:callToTask_s00001746_input_s00000950 + -1'i5:u42:callToTask_s00001746_input_s00000952 = 0
invariant :i6:u15:callToTask_s00002186_output_s00000962 + -1'i8:u24:callToTask_s00002186_output_s00000938 = 0
invariant :i6:u15:callToTask_s00002186_input_s00000935 + -1'i6:u15:callToTask_s00002186_input_s00001012 = 0
invariant :i1:u41:callToTask_s00002181_output_s00000979 + -1'i5:u21:callToTask_s00002181_output_s00000938 = 0
invariant :i10:u20:callToTask_s00001971_output_s00000981 + -1'i10:u20:callToTask_s00001971_output_s00000956 = 0
invariant :i6:u36:callToTask_s00005970_output_s00000956 + -1'i6:u36:callToTask_s00005970_output_s00000979 = 0
invariant :i6:u23:merge_s00001120_input_s00001011 + -1'i6:u23:merge_s00001120_input_s00000935 = 0
invariant :i4:u32:callToProcess_s00002411_output_s00000981 + -1'i4:u49:callToProcess_s00002411_output_s00000956 = 0
invariant :i2:u39:callToTask_s00005965_input_s00000950 + -1'i2:u39:callToTask_s00005965_input_s00000952 = 0
invariant :i6:u22:merge_s00001120_input_s00001013 + -1'i6:u48:merge_s00001120_input_s00000952 = 0
invariant :i2:u18:callToTask_s00002526_input_s00000950 + -1'i2:u18:callToTask_s00002526_input_s00000935 = 0
invariant :i10:u14:callToTask_s00001971_input_s00000985 + -1'i10:u14:callToTask_s00001971_input_s00000952 = 0
invariant :i0:u51:callToProcess_s00005925_output_s00000938 + -1'i0:u51:callToProcess_s00005925_output_s00000959 = 0
invariant :i2:u9:callToTask_s00005968_input_s00000935 + -1'i2:u9:callToTask_s00005968_input_s00000952 = 0
invariant :i4:u32:join_s00001294_activated_s00000946 + i4:u35:fork_s00001536_activated_s00000991 + i4:u49:callToProcess_s00002411_input_s00000935 + i4:u49:callToProcess_s00002411_output_s00000956 + i4:u49:callToProcess_s00002411_inputCriterion_s00000937_used + -1'i10:u33:callToTask_s00002741_inputCriterion_s00000937_used + -1'i10:u33:fork_s00001536_activated_s00000993 + -1'i10:u33:callToTask_s00002741_input_s00000985 + -1'i10:u43:join_s00001294_activated_s00000948 + -1'i10:u43:callToTask_s00002741_output_s00000979 = 0
invariant :i2:u9:callToTask_s00005968_output_s00000979 + -1'i7:u3:merge_s00003354_activated + -1'i7:u3:callToTask_s00005968_output_s00000938 + -1'i7:u3:callToTask_s00005972_output_s00000938 + -1'i7:u3:callToTask_s00002185_output_s00000938 + -1'i7:u3:process_s00000383__s00005964_output_s00001610 + i7:u11:callToTask_s00005972_output_s00000979 + i8:u40:callToTask_s00002185_output_s00000956 + -1'i9:u34:process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :i1:u37:callToTask_s00005967_input_s00000935 + -1'i1:u37:callToTask_s00005967_input_s00000952 = 0
invariant :i0:u27:merge_s00001290_input_s00001009 + i0:u27:fork_s00001537_activated_s00000991 + i0:u27:process_s00000383__s00005964_input_s00001512 + -1'i0:u0:process_s00000383__s00005964_input_s00001431 = 0
invariant :i6:u22:callToTask_s00005849_input_s00000950 + -1'i6:u22:callToTask_s00005849_input_s00000952 = 0
invariant :i1:u41:callToTask_s00002181_output_s00000956 + -1'i5:u21:callToTask_s00002181_output_s00000938 = 0
invariant :i6:u22:merge_s00001120_input_s00001010 + -1'i6:u48:merge_s00001120_input_s00000952 = 0
invariant :i8:u46:join_s00001295_input_s00000987 + -1'i8:u46:join_s00001295_input_s00000985 = 0
invariant :i5:u1:callToTask_s00001746_output_s00000956 + -1'i5:u1:callToTask_s00001746_output_s00000938 = 0
invariant :i0:u0:alpha + i1:u6:callToProcess_s00002316_inputCriterion_s00000937_used + i1:u31:callToTask_s00002189_inputCriterion_s00000937_used + i1:u31:callToProcess_s00002316_output_s00000938 + i1:u41:callToTask_s00002181_inputCriterion_s00000937_used + i1:u41:callToTask_s00002189_output_s00000960 + i1:u25:decision_s00000999_activated + i1:u25:fork_s00001067_input_s00000952 + i1:u37:callToTask_s00005967_inputCriterion_s00000937_used + i1:u37:callToTask_s00005967_output_s00000956 + i1:u37:callToTask_s00005967_input_s00000952 + i1:u38:callToTask_s00005966_inputCriterion_s00000937_used + i1:u38:callToTask_s00005966_output_s00000979 + i2:u9:callToTask_s00005968_inputCriterion_s00000937_used + i2:u9:callToTask_s00005968_input_s00000952 + i2:u13:decision_s00001615_activated + i2:u13:merge_s00001291_input_s00000950 + i2:u39:callToTask_s00005965_inputCriterion_s00000937_used + i2:u39:callToTask_s00005965_input_s00000952 + i2:u47:merge_s00001369_activated + i2:u47:callToTask_s00005968_output_s00000956 + i2:u47:callToTask_s00005965_output_s00000938 + i2:u47:process_s00000383__s00005964_output_s00001463 + i2:u12:callToTask_s00005971_inputCriterion_s00000937_used + i2:u12:callToTask_s00005971_output_s00000959 + i2:u18:callToTask_s00002526_inputCriterion_s00000937_used + i2:u18:callToTask_s00002526_output_s00000956 + i2:u18:callToTask_s00002526_input_s00000935 + i5:u1:merge_s00001066_activated + i5:u1:callToTask_s00001746_output_s00000938 + i5:u1:merge_s00001066_input_s00000985 + i5:u42:callToTask_s00001746_inputCriterion_s00000937_used + i5:u42:decision_s00001288_activated + i5:u42:callToTask_s00001746_input_s00000952 + i5:u21:callToTask_s00002190_inputCriterion_s00000937_used + i5:u21:callToTask_s00002181_output_s00000938 + i5:u45:callToTask_s00002183_inputCriterion_s00000937_used + i5:u45:callToTask_s00002190_output_s00000938 + i5:u45:callToTask_s00002183_output_s00000938 + i6:u10:callToTask_s00005849_inputCriterion_s00000937_used + i6:u10:decision_s00001617_activated + i6:u10:callToTask_s00005849_output_s00000959 + i6:u22:decision_s00001286_activated + i6:u22:callToTask_s00005849_input_s00000952 + i6:u15:callToTask_s00002186_inputCriterion_s00000937_used + i6:u15:callToTask_s00002186_input_s00001012 + i6:u48:merge_s00001120_activated + i6:u48:merge_s00001120_input_s00000952 + i6:u48:merge_s00001120_input_s00001513 + i6:u8:callToTask_s00005969_inputCriterion_s00000937_used + i6:u8:callToTask_s00005969_input_s00000935 + i6:u8:callToTask_s00005969_output_s00000959 + i6:u23:decision_s00001287_activated + i6:u23:merge_s00001120_input_s00000935 + i6:u4:merge_s00000945_activated + i6:u4:merge_s00000945_input_s00000985 + i6:u4:merge_s00000945_input_s00000935 + i6:u36:callToTask_s00005970_inputCriterion_s00000937_used + i6:u36:callToTask_s00005970_output_s00000979 + i6:u36:callToTask_s00005970_input_s00000952 + i7:u11:callToTask_s00005972_inputCriterion_s00000937_used + i7:u11:callToTask_s00005972_output_s00000979 + i7:u11:callToTask_s00005972_input_s00000950 + i7:u26:merge_s00001291_activated + i7:u26:fork_s00001067_activated_s00000991 + i7:u26:merge_s00001291_input_s00000935 + i8:u24:decision_s00001289_activated + i8:u24:callToTask_s00002186_output_s00000938 + i8:u24:fork_s00001293_input_s00000952 + i8:u40:callToTask_s00002185_inputCriterion_s00000937_used + i8:u40:callToTask_s00002185_output_s00000956 + i8:u40:callToTask_s00002185_input_s00000952 + i8:u5:join_s00001295_activated_s00000946 + i8:u5:fork_s00001293_activated_s00000991 + i8:u5:join_s00001295_input_s00000935 + i8:u28:callToProcess_s00004075_input_s00000986 + i8:u28:callToProcess_s00004075_output_s00000938 + i8:u28:callToProcess_s00004075_inputCriterion_s00000937_used + 2'i9:u34:process_s00000383__s00005964_outputCriterion_s00000939_omega + i10:u14:callToTask_s00001971_inputCriterion_s00000937_used + i10:u14:process_s00000383__s00005964_input_s00000936 + i10:u20:callToTask_s00001632_inputCriterion_s00000937_used + i10:u20:callToTask_s00001632_output_s00000979 + i10:u20:callToTask_s00001971_output_s00000956 = 1
invariant :i7:u11:callToTask_s00005972_input_s00000935 + -1'i7:u11:callToTask_s00005972_input_s00000950 = 0
invariant :i0:u51:callToProcess_s00005925_input_s00000952 + -1'i0:u51:callToProcess_s00005925_input_s00000986 = 0
invariant :i3:u17:callToTask_s00002427_output_s00000938 + -1'i3:u17:callToTask_s00002427_output_s00000979 = 0
invariant :i5:u1:callToTask_s00001746_output_s00000960 + -1'i5:u1:callToTask_s00001746_output_s00000938 = 0
invariant :i8:u24:fork_s00001293_input_s00000935 + -1'i8:u24:fork_s00001293_input_s00000952 = 0
invariant :i3:u17:callToTask_s00002427_output_s00000956 + -1'i3:u17:callToTask_s00002427_output_s00000979 = 0
invariant :i2:u39:callToTask_s00005965_input_s00000935 + -1'i2:u39:callToTask_s00005965_input_s00000952 = 0
invariant :i4:u35:callToProcess_s00002411_input_s00000985 + -1'i4:u49:callToProcess_s00002411_input_s00000935 = 0
invariant :i5:u1:merge_s00001066_input_s00000987 + -1'i5:u1:merge_s00001066_input_s00000985 = 0
invariant :i6:u4:merge_s00000945_input_s00000987 + -1'i6:u4:merge_s00000945_input_s00000985 = 0
invariant :i1:u38:callToTask_s00005966_output_s00000938 + -1'i1:u38:callToTask_s00005966_output_s00000979 = 0
invariant :i6:u8:callToTask_s00005969_input_s00000985 + -1'i6:u8:callToTask_s00005969_input_s00000935 = 0
invariant :i6:u15:callToTask_s00002186_input_s00000950 + -1'i6:u15:callToTask_s00002186_input_s00001012 = 0
invariant :i7:u26:merge_s00001291_input_s00000952 + -1'i7:u26:merge_s00001291_input_s00000935 = 0
invariant :i7:u26:merge_s00001291_input_s00000986 + -1'i7:u26:merge_s00001291_input_s00000935 = 0
invariant :i6:u48:merge_s00001120_input_s00001012 + -1'i6:u48:merge_s00001120_input_s00001513 = 0
invariant :i2:u12:callToTask_s00005971_output_s00000956 + -1'i2:u12:callToTask_s00005971_output_s00000959 = 0
invariant :i0:u2:merge_s00001292_activated + i0:u2:merge_s00001292_input_s00000935 + i0:u7:callToTask_s00005897_inputCriterion_s00000937_used + i0:u7:callToTask_s00005897_input_s00000986 + i0:u7:callToTask_s00005897_output_s00000979 + i0:u16:merge_s00001292_input_s00000952 + i0:u16:decision_s00001616_activated + i0:u16:callToProcess_s00002538_input_s00000952 + i0:u19:merge_s00001292_input_s00000986 + i0:u19:fork_s00001537_activated_s00000993 + i0:u27:process_s00000383__s00005964_input_s00001512 + 3'i0:u0:alpha + i0:u0:merge_s00001290_activated + i0:u0:merge_s00001290_input_s00000952 + i0:u0:merge_s00001290_input_s00000935 + i0:u0:process_s00000383__s00005964_input_s00001431 + i0:u51:callToProcess_s00005925_input_s00000986 + i0:u51:callToProcess_s00005925_output_s00000959 + i0:u51:callToProcess_s00005925_inputCriterion_s00000937_used + -2'i3:u50:process_s00000383__s00005964_input_s00001609 = 3
invariant :i5:u1:merge_s00001066_input_s00000950 + -1'i5:u1:merge_s00001066_input_s00000985 = 0
invariant :i8:u40:callToTask_s00002185_input_s00000935 + -1'i8:u40:callToTask_s00002185_input_s00000952 = 0
invariant :i4:u35:callToProcess_s00002411_input_s00000950 + -1'i4:u49:callToProcess_s00002411_input_s00000935 = 0
invariant :i6:u36:callToTask_s00005970_input_s00000935 + -1'i6:u36:callToTask_s00005970_input_s00000952 = 0
invariant :i10:u43:callToTask_s00002741_output_s00000981 + -1'i10:u43:callToTask_s00002741_output_s00000979 = 0
invariant :i0:u7:callToTask_s00005897_output_s00000956 + -1'i0:u7:callToTask_s00005897_output_s00000979 = 0
invariant :i5:u21:callToTask_s00002190_output_s00000979 + -1'i5:u45:callToTask_s00002190_output_s00000938 = 0
invariant :i5:u45:callToTask_s00002183_output_s00000981 + -1'i5:u45:callToTask_s00002183_output_s00000938 = 0
invariant :i2:u39:callToTask_s00005965_output_s00000956 + -1'i2:u47:merge_s00001369_activated + -1'i2:u47:callToTask_s00005968_output_s00000956 + -1'i2:u47:callToTask_s00005965_output_s00000938 + -1'i2:u47:process_s00000383__s00005964_output_s00001463 + i7:u3:merge_s00003354_activated + i7:u3:callToTask_s00005968_output_s00000938 + i7:u3:callToTask_s00005972_output_s00000938 + i7:u3:callToTask_s00002185_output_s00000938 + i7:u3:process_s00000383__s00005964_output_s00001610 + -1'i7:u11:callToTask_s00005972_output_s00000979 + -1'i8:u40:callToTask_s00002185_output_s00000956 = 0
invariant :i10:u14:callToTask_s00001971_input_s00000935 + -1'i10:u14:callToTask_s00001971_input_s00000952 = 0
invariant :i1:u25:fork_s00001067_input_s00000950 + -1'i1:u25:fork_s00001067_input_s00000952 = 0
invariant :i9:u34:callToProcess_s00001273_output_s00000938 + -1'i9:u34:callToProcess_s00001273_output_s00000956 + i9:u34:process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :i10:u14:callToTask_s00001971_input_s00000950 + -1'i10:u14:callToTask_s00001971_input_s00000952 = 0
invariant :i8:u5:join_s00001295_input_s00000952 + -1'i8:u5:join_s00001295_input_s00000935 = 0
invariant :i5:u42:callToTask_s00001746_input_s00000987 + -1'i5:u42:callToTask_s00001746_input_s00000952 = 0
invariant :i6:u10:callToTask_s00005849_output_s00000938 + -1'i6:u10:callToTask_s00005849_output_s00000959 = 0
invariant :i1:u6:callToTask_s00005967_output_s00000979 + -1'i1:u37:callToTask_s00005967_output_s00000956 = 0
invariant :i3:u50:callToProcess_s00002538_output_s00000956 + -1'i3:u50:callToProcess_s00002538_output_s00000938 = 0
invariant :i10:u14:callToTask_s00001971_output_s00000979 + -1'i10:u20:callToTask_s00001971_output_s00000956 = 0
invariant :i10:u33:callToTask_s00002741_input_s00000986 + -1'i10:u33:callToTask_s00002741_input_s00000985 = 0
invariant :i6:u10:callToTask_s00005849_output_s00000960 + -1'i6:u10:callToTask_s00005849_output_s00000959 = 0
invariant :i0:u16:callToProcess_s00002538_input_s00001011 + -1'i0:u16:callToProcess_s00002538_input_s00000952 = 0
invariant :i6:u8:callToTask_s00005969_input_s00000952 + -1'i6:u8:callToTask_s00005969_input_s00000935 = 0
invariant :i7:u11:callToTask_s00005972_input_s00001009 + -1'i7:u11:callToTask_s00005972_input_s00000950 = 0
invariant :i0:u51:callToProcess_s00005925_output_s00000956 + -1'i0:u51:callToProcess_s00005925_output_s00000959 = 0
invariant :i0:u0:merge_s00001290_input_s00000950 + -1'i0:u0:process_s00000383__s00005964_input_s00001431 = 0
invariant :i1:u38:callToTask_s00005970_output_s00000938 + -1'i6:u36:callToTask_s00005970_output_s00000979 = 0
invariant :i7:u11:callToTask_s00005972_input_s00000952 + -1'i7:u11:callToTask_s00005972_input_s00000950 = 0
invariant :i0:u16:callToProcess_s00002538_input_s00000950 + -1'i0:u16:callToProcess_s00002538_input_s00000952 = 0
invariant :i10:u20:callToTask_s00001632_output_s00000959 + -1'i10:u20:callToTask_s00001632_output_s00000979 = 0
invariant :i6:u23:merge_s00001120_input_s00000988 + -1'i6:u23:merge_s00001120_input_s00000935 = 0
invariant :i1:u31:callToTask_s00002189_output_s00000938 + -1'i1:u41:callToTask_s00002189_output_s00000960 = 0
invariant :i8:u46:join_s00001295_activated_s00000948 + i8:u46:fork_s00001293_activated_s00000993 + i8:u46:join_s00001295_input_s00000985 + -1'i8:u5:join_s00001295_activated_s00000946 + -1'i8:u5:fork_s00001293_activated_s00000991 + -1'i8:u5:join_s00001295_input_s00000935 = 0
invariant :i3:u50:callToProcess_s00002538_output_s00000961 + -1'i3:u50:callToProcess_s00002538_output_s00000938 = 0
invariant :i5:u45:callToTask_s00002183_output_s00000962 + -1'i5:u45:callToTask_s00002183_output_s00000938 = 0
invariant :i1:u38:callToTask_s00005970_output_s00000981 + -1'i6:u36:callToTask_s00005970_output_s00000979 = 0
invariant :i1:u38:callToTask_s00005966_output_s00000956 + -1'i1:u38:callToTask_s00005966_output_s00000979 = 0
invariant :i10:u20:callToTask_s00001632_output_s00000956 + -1'i10:u20:callToTask_s00001632_output_s00000979 = 0
invariant :i2:u13:merge_s00001291_input_s00001009 + -1'i2:u13:merge_s00001291_input_s00000950 = 0
invariant :i6:u15:callToTask_s00002186_input_s00001513 + -1'i6:u15:callToTask_s00002186_input_s00001012 = 0
invariant :i6:u23:merge_s00000945_input_s00000950 + -1'i6:u4:merge_s00000945_input_s00000985 = 0
invariant :i6:u4:merge_s00000945_input_s00000952 + -1'i6:u4:merge_s00000945_input_s00000935 = 0
invariant :i1:u6:callToTask_s00005967_output_s00000938 + -1'i1:u37:callToTask_s00005967_output_s00000956 = 0
invariant :i5:u21:callToTask_s00002190_output_s00000956 + -1'i5:u45:callToTask_s00002190_output_s00000938 = 0
invariant :i6:u22:merge_s00001120_input_s00000987 + -1'i6:u48:merge_s00001120_input_s00000952 = 0
invariant :i10:u43:callToTask_s00002741_output_s00000956 + -1'i10:u43:callToTask_s00002741_output_s00000979 = 0
invariant :-1'i0:u0:alpha + 2'i3:u17:callToTask_s00002427_inputCriterion_s00000937_used + 2'i3:u17:callToTask_s00002427_output_s00000979 + i3:u30:decision_s00000989_activated + i3:u30:endNode_s00000942_input_default + i3:u30:callToTask_s00002427_input_s00001013 + i3:u30:callToTask_s00002427_input_s00000950 + i3:u50:process_s00000383__s00005964_input_s00001609 + i3:u50:callToProcess_s00002538_output_s00000938 + i3:u50:callToProcess_s00002538_inputCriterion_s00000937_used + -2'i10:u14:process_s00000383__s00005964_input_s00000936 + 2'i10:u14:callToTask_s00001971_input_s00000952 + 2'i10:u33:callToTask_s00002741_inputCriterion_s00000937_used + 2'i10:u33:fork_s00001536_activated_s00000993 + 2'i10:u33:callToTask_s00002741_input_s00000985 + 2'i10:u43:join_s00001294_activated_s00000948 + 2'i10:u43:callToTask_s00002741_output_s00000979 = -1
invariant :i9:u44:callToTask_s00001305_input_s00000935 + -1'i9:u44:callToTask_s00001305_input_s00000950 = 0
invariant :i1:u6:callToProcess_s00002316_output_s00000959 + -1'i1:u31:callToProcess_s00002316_output_s00000938 = 0
44 unique states visited
43 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.376561,24580,1,0,16017,1878,1724,19527,963,7846,33568
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((("(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)")U("(((((((i0.u16.callToProcess_s00002538_input_s00000950>=1)&&(i0.u16.callToProcess_s00002538_input_s00000952>=1))&&(i0.u16.callToProcess_s00002538_input_s00001011>=1))&&(i0.u7.callToTask_s00005897_output_s00000938>=1))&&(i0.u7.callToTask_s00005897_output_s00000956>=1))&&(i0.u7.callToTask_s00005897_output_s00000979>=1))&&(i3.u50.process_s00000383__s00005964_input_s00001609>=1))"))U(("(i0.u16.decision_s00001616_activated>=1)")U("((i8.u5.join_s00001295_activated_s00000946>=1)&&(i8.u46.join_s00001295_activated_s00000948>=1))")))))
Formula 3 simplified : !X(("(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)" U "(((((((i0.u16.callToProcess_s00002538_input_s00000950>=1)&&(i0.u16.callToProcess_s00002538_input_s00000952>=1))&&(i0.u16.callToProcess_s00002538_input_s00001011>=1))&&(i0.u7.callToTask_s00005897_output_s00000938>=1))&&(i0.u7.callToTask_s00005897_output_s00000956>=1))&&(i0.u7.callToTask_s00005897_output_s00000979>=1))&&(i3.u50.process_s00000383__s00005964_input_s00001609>=1))") U ("(i0.u16.decision_s00001616_activated>=1)" U "((i8.u5.join_s00001295_activated_s00000946>=1)&&(i8.u46.join_s00001295_activated_s00000948>=1))"))
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.3851,25896,1,0,16017,1878,1837,19527,967,7846,33679
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((G("(((i8.u46.join_s00001295_input_s00000950>=1)&&(i8.u46.join_s00001295_input_s00000985>=1))&&(i8.u46.join_s00001295_input_s00000987>=1))"))U(G("((((i1.u38.callToTask_s00005970_output_s00000938>=1)&&(i6.u36.callToTask_s00005970_output_s00000956>=1))&&(i6.u36.callToTask_s00005970_output_s00000979>=1))&&(i1.u38.callToTask_s00005970_output_s00000981>=1))")))U("(i6.u22.decision_s00001286_activated>=1)")))
Formula 4 simplified : !((G"(((i8.u46.join_s00001295_input_s00000950>=1)&&(i8.u46.join_s00001295_input_s00000985>=1))&&(i8.u46.join_s00001295_input_s00000987>=1))" U G"((((i1.u38.callToTask_s00005970_output_s00000938>=1)&&(i6.u36.callToTask_s00005970_output_s00000956>=1))&&(i6.u36.callToTask_s00005970_output_s00000979>=1))&&(i1.u38.callToTask_s00005970_output_s00000981>=1))") U "(i6.u22.decision_s00001286_activated>=1)")
Computing Next relation with stutter on 10 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.392302,26616,1,0,16017,1878,1917,19527,977,7846,33725
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G("(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)"))))
Formula 5 simplified : !XG"(i10.u14.callToTask_s00001971_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 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.39312,26616,1,0,16017,1878,1925,19527,977,7846,33731
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((G("(((i0.u0.merge_s00001290_input_s00000950>=1)&&(i0.u27.merge_s00001290_input_s00001009>=1))&&(i0.u0.process_s00000383__s00005964_input_s00001431>=1))"))U(F("((((i5.u42.callToTask_s00001746_input_s00000935>=1)&&(i5.u42.callToTask_s00001746_input_s00000950>=1))&&(i5.u42.callToTask_s00001746_input_s00000952>=1))&&(i5.u42.callToTask_s00001746_input_s00000987>=1))")))U((F("(i6.u22.decision_s00001286_activated>=1)"))U(F("(i0.u27.fork_s00001537_activated_s00000991>=1)")))))
Formula 6 simplified : !((G"(((i0.u0.merge_s00001290_input_s00000950>=1)&&(i0.u27.merge_s00001290_input_s00001009>=1))&&(i0.u0.process_s00000383__s00005964_input_s00001431>=1))" U F"((((i5.u42.callToTask_s00001746_input_s00000935>=1)&&(i5.u42.callToTask_s00001746_input_s00000950>=1))&&(i5.u42.callToTask_s00001746_input_s00000952>=1))&&(i5.u42.callToTask_s00001746_input_s00000987>=1))") U (F"(i6.u22.decision_s00001286_activated>=1)" U F"(i0.u27.fork_s00001537_activated_s00000991>=1)"))
Computing Next relation with stutter on 10 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.427266,27828,1,0,20371,1916,1965,23102,977,8054,42115
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(i0.u0.merge_s00001290_input_s00000935>=1)"))
Formula 7 simplified : !"(i0.u0.merge_s00001290_input_s00000935>=1)"
Computing Next relation with stutter on 10 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.427907,27828,1,0,20371,1916,1970,23102,978,8054,42132
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(G(F(X("(i7.u3.merge_s00003354_activated>=1)")))))))
Formula 8 simplified : !FXGFX"(i7.u3.merge_s00003354_activated>=1)"
Computing Next relation with stutter on 10 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 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.429292,28092,1,0,20371,1916,1988,23102,978,8054,42156
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(X("(i3.u50.callToProcess_s00002538_inputCriterion_s00000937_used>=1)")))))
Formula 9 simplified : !GFX"(i3.u50.callToProcess_s00002538_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 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.430933,28092,1,0,20371,1916,2024,23102,978,8054,42208
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(X(("((((i6.u48.merge_s00001120_input_s00000952>=1)&&(i6.u22.merge_s00001120_input_s00000987>=1))&&(i6.u22.merge_s00001120_input_s00001010>=1))&&(i6.u22.merge_s00001120_input_s00001013>=1))")U("((i1.u31.callToProcess_s00002316_output_s00000938>=1)&&(i1.u6.callToProcess_s00002316_output_s00000959>=1))"))))))
Formula 10 simplified : !GX("((((i6.u48.merge_s00001120_input_s00000952>=1)&&(i6.u22.merge_s00001120_input_s00000987>=1))&&(i6.u22.merge_s00001120_input_s00001010>=1))&&(i6.u22.merge_s00001120_input_s00001013>=1))" U "((i1.u31.callToProcess_s00002316_output_s00000938>=1)&&(i1.u6.callToProcess_s00002316_output_s00000959>=1))")
Computing Next relation with stutter on 10 deadlock states
46 unique states visited
46 strongly connected components in search stack
47 transitions explored
46 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.43314,28092,1,0,20371,1916,2066,23102,980,8054,42233
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(((i0.u51.callToProcess_s00005925_output_s00000938>=1)&&(i0.u51.callToProcess_s00005925_output_s00000956>=1))&&(i0.u51.callToProcess_s00005925_output_s00000959>=1))")))
Formula 11 simplified : !F"(((i0.u51.callToProcess_s00005925_output_s00000938>=1)&&(i0.u51.callToProcess_s00005925_output_s00000956>=1))&&(i0.u51.callToProcess_s00005925_output_s00000959>=1))"
Computing Next relation with stutter on 10 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.480145,29412,1,0,24828,1988,2095,26388,982,8584,50076
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(i1.u41.callToTask_s00002181_inputCriterion_s00000937_used>=1)")))
Formula 12 simplified : !G"(i1.u41.callToTask_s00002181_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 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.481338,29676,1,0,24828,1988,2113,26388,982,8584,50098
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((((i9.u34.callToProcess_s00001273_output_s00000938>=1)&&(i8.u28.callToProcess_s00004075_output_s00000938>=1))&&(i2.u47.process_s00000383__s00005964_output_s00001463>=1))&&(i7.u3.process_s00000383__s00005964_output_s00001610>=1))"))
Formula 13 simplified : !"((((i9.u34.callToProcess_s00001273_output_s00000938>=1)&&(i8.u28.callToProcess_s00004075_output_s00000938>=1))&&(i2.u47.process_s00000383__s00005964_output_s00001463>=1))&&(i7.u3.process_s00000383__s00005964_output_s00001610>=1))"
Computing Next relation with stutter on 10 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.482145,29676,1,0,24828,1988,2127,26388,982,8584,50104
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X((F("((((i3.u30.callToTask_s00002427_input_s00000950>=1)&&(i3.u30.callToTask_s00002427_input_s00000952>=1))&&(i3.u30.callToTask_s00002427_input_s00001013>=1))&&(i3.u30.callToTask_s00002427_input_s00001203>=1))"))U("(i1.u6.callToProcess_s00002316_inputCriterion_s00000937_used>=1)")))))
Formula 14 simplified : !GX(F"((((i3.u30.callToTask_s00002427_input_s00000950>=1)&&(i3.u30.callToTask_s00002427_input_s00000952>=1))&&(i3.u30.callToTask_s00002427_input_s00001013>=1))&&(i3.u30.callToTask_s00002427_input_s00001203>=1))" U "(i1.u6.callToProcess_s00002316_inputCriterion_s00000937_used>=1)")
Computing Next relation with stutter on 10 deadlock states
44 unique states visited
44 strongly connected components in search stack
45 transitions explored
44 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.484381,29676,1,0,24828,1989,2175,26388,990,8587,50157
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(i8.u46.fork_s00001293_activated_s00000993>=1)"))
Formula 15 simplified : !"(i8.u46.fork_s00001293_activated_s00000993>=1)"
Computing Next relation with stutter on 10 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.485083,29676,1,0,24828,1989,2180,26388,990,8587,50163
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527941432775

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

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:10:30 2018
network size: 263 nodes, 826 links, 278 weight
quality increased from -0.00603014 to 0.593363
end computation: Sat Jun 2 12:10:30 2018
level 1:
start computation: Sat Jun 2 12:10:30 2018
network size: 52 nodes, 188 links, 278 weight
quality increased from 0.593363 to 0.776789
end computation: Sat Jun 2 12:10:30 2018
level 2:
start computation: Sat Jun 2 12:10:30 2018
network size: 21 nodes, 85 links, 278 weight
quality increased from 0.776789 to 0.805752
end computation: Sat Jun 2 12:10:30 2018
level 3:
start computation: Sat Jun 2 12:10:30 2018
network size: 11 nodes, 47 links, 278 weight
quality increased from 0.805752 to 0.805752
end computation: Sat Jun 2 12:10:30 2018
End: Sat Jun 2 12:10:30 2018
Total duration: 0 sec
0.805752
Jun 02, 2018 12:10:30 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:10:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
Jun 02, 2018 12:10:30 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:10:30 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 3 redundant transitions.
Jun 02, 2018 12:10:30 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:10:30 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 12:10:30 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 139 transitions.
Jun 02, 2018 12:10:31 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 128 place invariants in 123 ms
Jun 02, 2018 12:10:31 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 error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
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:10:31 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 678ms 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="IBM5964-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/IBM5964-PT-none.tgz
mv IBM5964-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 IBM5964-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-152732264200314"
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 ;