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 348K
-rw-r--r-- 1 mcc users 4.4K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.3K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 5 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 166K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is MAPKbis-PT-5320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176100303
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527991629323

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/graph3423931486462894285.txt, -o, /tmp/graph3423931486462894285.bin, -w, /tmp/graph3423931486462894285.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/graph3423931486462894285.bin, -l, -1, -v, -w, /tmp/graph3423931486462894285.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 : !((F((X(X("(((i6.u18.DUSP1_equals_0>=1)&&(i6.u18.JNK_equals_0>=1))&&(i6.u39.TAK1_equals_1>=1))")))U(G(X("((i2.u9.ERK_equals_1>=1)&&(i2.u33.RAF_equals_1>=1))"))))))
Formula 0 simplified : !F(XX"(((i6.u18.DUSP1_equals_0>=1)&&(i6.u18.JNK_equals_0>=1))&&(i6.u39.TAK1_equals_1>=1))" U GX"((i2.u9.ERK_equals_1>=1)&&(i2.u33.RAF_equals_1>=1))")
built 33 ordering constraints for composite.
built 12 ordering constraints for composite.
built 63 ordering constraints for composite.
built 28 ordering constraints for composite.
built 41 ordering constraints for composite.
built 36 ordering constraints for composite.
built 26 ordering constraints for composite.
built 38 ordering constraints for composite.
built 9 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 95
// Phase 1: matrix 95 rows 98 cols
invariant :i1:u42:p14_equals_0 + i1:u42:p14_equals_1 = 1
invariant :i2:u33:RAF_equals_0 + i2:u33:RAF_equals_1 = 1
invariant :i4:u26:PDK1_equals_0 + i4:u26:PDK1_equals_1 = 1
invariant :i3:u36:SMAD_equals_0 + i3:u36:SMAD_equals_1 = 1
invariant :i6:u24:MTK1_equals_0 + i6:u24:MTK1_equals_1 = 1
invariant :i2:u30:PPP2CA_equals_0 + i2:u30:PPP2CA_equals_1 = 1
invariant :i3:u16:GRB2_equals_0 + i3:u16:GRB2_equals_1 = 1
invariant :i3:u7:EGFR_equals_0 + i3:u7:EGFR_equals_1 = 1
invariant :i6:u44:MAP3K1_3_equals_0 + i6:u44:MAP3K1_3_equals_1 = 1
invariant :i7:u21:MDM2_equals_0 + i7:u21:MDM2_equals_1 = 1
invariant :i2:u35:RSK_equals_0 + i2:u35:RSK_equals_1 = 1
invariant :i3:u41:TGFBR_equals_0 + i3:u41:TGFBR_equals_1 = 1
invariant :i6:u18:JNK_equals_0 + i6:u18:JNK_equals_1 = 1
invariant :i3:u28:PKC_equals_0 + i3:u28:PKC_equals_1 = 1
invariant :i1:u23:MSK_equals_0 + i1:u23:MSK_equals_1 = 1
invariant :i7:u0:AKT_0 + i7:u0:AKT_equals_1 = 1
invariant :i7:u12:FOXO3_equals_0 + i7:u12:FOXO3_equals_1 = 1
invariant :i5:u32:Proliferation_equals_0 + i5:u32:Proliferation_equals_1 = 1
invariant :i4:u14:GAB1_equals_0 + i4:u14:GAB1_equals_1 = 1
invariant :i4:u37:SOS_equals_0 + i4:u37:SOS_equals_1 = 1
invariant :i2:u8:ELK1_equals_0 + i2:u8:ELK1_equals_1 = 1
invariant :i4:u46:p70_equals_0 + i4:u46:p70_equals_1 = 1
invariant :i6:u39:TAK1_equals_0 + i6:u39:TAK1_equals_1 = 1
invariant :i6:u18:DUSP1_equals_0 + i6:u18:DUSP1_equals_1 = 1
invariant :i0:u1:AP1_equals_0 + i0:u1:AP1_equals_1 = 1
invariant :i0:u19:JUN_equals_0 + i0:u19:JUN_equals_1 = 1
invariant :i6:u44:p38_equals_0 + i6:u44:p38_equals_1 = 1
invariant :i2:u38:SPRY_equals_0 + i2:u38:SPRY_equals_1 = 1
invariant :i3:u13:FRS2_equals_0 + i3:u13:FRS2_equals_1 = 1
invariant :i5:u17:Growth_Arrest_equals_0 + i5:u17:Growth_Arrest_equals_1 = 1
invariant :i2:u22:MEK1_2_equals_0 + i2:u22:MEK1_2_equals_1 = 1
invariant :i1:u6:CREB_equals_0 + i1:u6:CREB_equals_1 = 1
invariant :i1:u25:MYC_equals_0 + i1:u25:MYC_equals_1 = 1
invariant :i4:u34:RAS_equals_0 + i4:u34:RAS_equals_1 = 1
invariant :i2:u9:ERK_equals_0 + i2:u9:ERK_equals_1 = 1
invariant :i5:u43:p21_equals_0 + i5:u43:p21_equals_1 = 1
invariant :i3:u10:FGFR3_equals_0 + i3:u10:FGFR3_equals_1 = 1
invariant :i7:u31:PTEN_equals_0 + i7:u31:PTEN_equals_1 = 1
invariant :i7:u45:p53_equals_0 + i7:u45:p53_equals_1 = 1
invariant :i4:u27:PI3K_equals_0 + i4:u27:PI3K_equals_1 = 1
invariant :i7:u3:ATM_equals_0 + i7:u3:ATM_equals_1 = 1
invariant :i0:u2:ATF2_equals_0 + i0:u2:ATF2_equals_1 = 1
invariant :i6:u40:TAOK_equals_0 + i6:u40:TAOK_equals_1 = 1
Reverse transition relation is NOT exact ! Due to transitions AP1_equals_1_to_AP1_equals_0_when_ATF2_equals_0_and_FOS_equals_0, AP1_equals_1_to_AP1_equals_0_when_JUN_equals_0, ATF2_equals_1_to_ATF2_equals_0_when_JNK_equals_0_and_p38_equals_0, Apoptosis_equals_1_to_Apoptosis_equals_0_when_FOXO3_equals_0, Apoptosis_equals_1_to_Apoptosis_equals_0_when_p53_equals_0, CREB_equals_1_to_CREB_equals_0_when_MSK_equals_0, DUSP1_equals_1_to_DUSP1_equals_0_when_CREB_equals_0, ELK1_equals_1_to_ELK1_equals_0_when_ERK_equals_0_and_JNK_equals_0_and_p38_equals_0, FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_equals_0, GADD45_equals_1_to_GADD45_equals_0_when_SMAD_equals_0_and_p53_equals_0, Growth_Arrest_equals_1_to_Growth_Arrest_equals_0_when_p21_equals_0, JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_0_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAK1_equals_0_and_TAOK_equals_0, JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0, MAX_equals_1_to_MAX_equals_0_when_p38_equals_0, MDM2_equals_1_to_MDM2_equals_0_when_AKT_equals_0_and_p53_equals_0, MSK_equals_1_to_MSK_equals_0_when_ERK_equals_0_and_p38_equals_0, MTK1_equals_0_to_MTK1_equals_1_when_GADD45_equals_1, MTK1_equals_1_to_MTK1_equals_0_when_GADD45_equals_0, MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_equals_0, MYC_equals_1_to_MYC_equals_0_when_MSK_equals_0, PPP2CA_equals_1_to_PPP2CA_equals_0_when_p38_equals_0, PTEN_equals_1_to_PTEN_equals_0_when_p53_equals_0, TAOK_equals_0_to_TAOK_equals_1_when_ATM_equals_1, p14_equals_1_to_p14_equals_0_when_MYC_equals_0, p21_equals_1_to_p21_equals_0_when_p53_equals_0, p38_equals_1_to_p38_equals_0_when_DUSP1_equals_0_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAK1_equals_0_and_TAOK_equals_0, p38_equals_1_to_p38_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAK1_equals_0, p38_equals_1_to_p38_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAOK_equals_0, p53_equals_0_to_p53_equals_1_when_ATM_equals_1_and_MDM2_equals_0, p53_equals_0_to_p53_equals_1_when_ATM_equals_1_and_p38_equals_1, i7.u3.ATM_equals_0_to_ATM_equals_1_when_DNA_damage_equals_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :106/32/31/169
invariant :i1:u5:BCL2_equals_0 + i1:u5:BCL2_equals_1 = 1
invariant :i2:u11:FOS_equals_0 + i2:u11:FOS_equals_1 = 1
invariant :i3:u29:PLCG_equals_0 + i3:u29:PLCG_equals_1 = 1
invariant :i7:u4:Apoptosis_equals_0 + i7:u4:Apoptosis_equals_1 = 1
invariant :i3:u15:GADD45_equals_0 + i3:u15:GADD45_equals_1 = 1
invariant :i1:u20:MAX_equals_0 + i1:u20:MAX_equals_1 = 1
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
32 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.368559,24792,1,0,12172,102,2129,34108,107,235,38252
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(F(F(X("(i3.u41.TGFBR_equals_1>=1)")))))))
Formula 1 simplified : !FXFX"(i3.u41.TGFBR_equals_1>=1)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
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.426415,26372,1,0,15282,102,2161,41961,108,235,46891
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(F(F("(((i6.u18.DUSP1_equals_0>=1)&&(i6.u24.MTK1_equals_1>=1))&&(i6.u44.p38_equals_0>=1))")))))))
Formula 2 simplified : !FGXF"(((i6.u18.DUSP1_equals_0>=1)&&(i6.u24.MTK1_equals_1>=1))&&(i6.u44.p38_equals_0>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
324 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.66872,109756,1,0,155433,102,2206,409839,108,235,181515
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("((i3.u36.SMAD_equals_0>=1)&&(i3.u41.TGFBR_equals_1>=1))")U("((i1.u25.MYC_equals_1>=1)&&(i1.u42.p14_equals_0>=1))")))
Formula 3 simplified : !("((i3.u36.SMAD_equals_0>=1)&&(i3.u41.TGFBR_equals_1>=1))" U "((i1.u25.MYC_equals_1>=1)&&(i1.u42.p14_equals_0>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.67358,109992,1,0,155472,102,2228,409912,108,235,181750
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((("((i6.u18.JNK_equals_1>=1)&&(i0.u19.JUN_equals_0>=1))")U("(i3.u10.FGFR3_equals_1>=1)"))U(("((i2.u9.ERK_equals_1>=1)&&(i2.u22.MEK1_2_equals_0>=1))")U("(((i6.u18.DUSP1_equals_0>=1)&&(i6.u24.MTK1_equals_1>=1))&&(i6.u44.p38_equals_0>=1))")))))
Formula 4 simplified : !X(("((i6.u18.JNK_equals_1>=1)&&(i0.u19.JUN_equals_0>=1))" U "(i3.u10.FGFR3_equals_1>=1)") U ("((i2.u9.ERK_equals_1>=1)&&(i2.u22.MEK1_2_equals_0>=1))" U "(((i6.u18.DUSP1_equals_0>=1)&&(i6.u24.MTK1_equals_1>=1))&&(i6.u44.p38_equals_0>=1))"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.72291,111532,1,0,156694,102,2302,413365,108,235,185254
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("((((i7.u3.ATM_equals_1>=1)&&(i7.u21.MDM2_equals_1>=1))&&(i6.u44.p38_equals_0>=1))&&(i7.u45.p53_equals_1>=1))")))
Formula 5 simplified : !F"((((i7.u3.ATM_equals_1>=1)&&(i7.u21.MDM2_equals_1>=1))&&(i6.u44.p38_equals_0>=1))&&(i7.u45.p53_equals_1>=1))"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
57 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,4.30016,123940,1,0,180665,102,2332,464040,108,235,229855
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(G(G("(((i4.u27.PI3K_equals_0>=1)&&(i4.u34.RAS_equals_1>=1))&&(i4.u37.SOS_equals_1>=1))"))))U(F(("(((i3.u29.PLCG_equals_0>=1)&&(i4.u34.RAS_equals_1>=1))&&(i4.u37.SOS_equals_0>=1))")U("(((i3.u16.GRB2_equals_1>=1)&&(i2.u35.RSK_equals_0>=1))&&(i4.u37.SOS_equals_0>=1))")))))
Formula 6 simplified : !(FG"(((i4.u27.PI3K_equals_0>=1)&&(i4.u34.RAS_equals_1>=1))&&(i4.u37.SOS_equals_1>=1))" U F("(((i3.u29.PLCG_equals_0>=1)&&(i4.u34.RAS_equals_1>=1))&&(i4.u37.SOS_equals_0>=1))" U "(((i3.u16.GRB2_equals_1>=1)&&(i2.u35.RSK_equals_0>=1))&&(i4.u37.SOS_equals_0>=1))"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.53303,131284,1,0,193503,102,2358,500723,108,235,260378
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(X(("((i0.u1.AP1_equals_1>=1)&&(i2.u22.MEK1_2_equals_1>=1))")U("((i4.u14.GAB1_equals_1>=1)&&(i4.u27.PI3K_equals_0>=1))"))))))
Formula 7 simplified : !XGX("((i0.u1.AP1_equals_1>=1)&&(i2.u22.MEK1_2_equals_1>=1))" U "((i4.u14.GAB1_equals_1>=1)&&(i4.u27.PI3K_equals_0>=1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
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,4.53515,132032,1,0,193514,102,2380,500723,108,235,260431
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X("((i3.u15.GADD45_equals_1>=1)&&(i6.u24.MTK1_equals_0>=1))"))U((false)U("((((i1.u25.MYC_equals_1>=1)&&(i5.u32.Proliferation_equals_0>=1))&&(i5.u43.p21_equals_0>=1))&&(i4.u46.p70_equals_1>=1))")))))
Formula 8 simplified : !X(X"((i3.u15.GADD45_equals_1>=1)&&(i6.u24.MTK1_equals_0>=1))" U "((((i1.u25.MYC_equals_1>=1)&&(i5.u32.Proliferation_equals_0>=1))&&(i5.u43.p21_equals_0>=1))&&(i4.u46.p70_equals_1>=1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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,4.55976,132032,1,0,194654,102,2406,502891,108,235,263893
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(G(G(X("((i3.u15.GADD45_equals_0>=1)&&(i7.u45.p53_equals_1>=1))")))))))
Formula 9 simplified : !XGX"((i3.u15.GADD45_equals_0>=1)&&(i7.u45.p53_equals_1>=1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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,4.59495,132816,1,0,196260,102,2425,507068,108,235,268931
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(X(X(F("((i3.u7.EGFR_equals_1>=1)&&(i3.u16.GRB2_equals_1>=1))")))))))
Formula 10 simplified : !XFXXF"((i3.u7.EGFR_equals_1>=1)&&(i3.u16.GRB2_equals_1>=1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
5 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,4.65305,134400,1,0,199118,102,2444,513923,108,235,277006
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("((i6.u39.TAK1_equals_1>=1)&&(i3.u41.TGFBR_equals_0>=1))"))
Formula 11 simplified : !"((i6.u39.TAK1_equals_1>=1)&&(i3.u41.TGFBR_equals_0>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.65368,134664,1,0,199118,102,2449,513923,108,235,277018
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(G(F("((i3.u13.FRS2_equals_1>=1)&&(i2.u38.SPRY_equals_1>=1))")))))
Formula 12 simplified : !FGF"((i3.u13.FRS2_equals_1>=1)&&(i2.u38.SPRY_equals_1>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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,4.65496,134928,1,0,199118,102,2474,513923,108,235,277061
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA MAPKbis-PT-5320-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G("((i7.u12.FOXO3_equals_1>=1)&&(i6.u18.JNK_equals_0>=1))"))))
Formula 13 simplified : !FG"((i7.u12.FOXO3_equals_1>=1)&&(i6.u18.JNK_equals_0>=1))"
Computing Next relation with stutter on 1 deadlock states
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]
Compilation finished in 2519 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>([]((LTLAP21==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 58 ms.
FORMULA MAPKbis-PT-5320-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ([](<>((LTLAP22==true))))U([](((LTLAP23==true))U((LTLAP7==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 37 ms.
FORMULA MAPKbis-PT-5320-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP18==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 142 ms.
FORMULA MAPKbis-PT-5320-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527991640175

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 80 ms
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 106 places.
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 173 transitions.
Jun 03, 2018 2:07:11 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 23 ms
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 8 fixed domain variables (out of 106 variables) in GAL type MAPKbis_PT_5320
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 8 constant array cells/variables (out of 106 variables) in type MAPKbis_PT_5320
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: DNA_damage_equals_0,TGFBR_stimulus_equals_1,DNA_damage_equals_1,FGFR3_stimulus_equals_0,TGFBR_stimulus_equals_0,EGFR_stimulus_equals_0,FGFR3_stimulus_equals_1,EGFR_stimulus_equals_1,
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 8 constant variables :DNA_damage_equals_0=0, TGFBR_stimulus_equals_1=0, DNA_damage_equals_1=1, FGFR3_stimulus_equals_0=1, TGFBR_stimulus_equals_0=1, EGFR_stimulus_equals_0=1, FGFR3_stimulus_equals_1=0, EGFR_stimulus_equals_1=0
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 13 expressions due to constant valuations.
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 4 false transitions.
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 79 ms
Jun 03, 2018 2:07:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Begin: Sun Jun 3 02:07:12 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 02:07:12 2018
network size: 98 nodes, 528 links, 338 weight
quality increased from -0.0134869 to 0.410311
end computation: Sun Jun 3 02:07:12 2018
level 1:
start computation: Sun Jun 3 02:07:12 2018
network size: 47 nodes, 233 links, 338 weight
quality increased from 0.410311 to 0.621215
end computation: Sun Jun 3 02:07:12 2018
level 2:
start computation: Sun Jun 3 02:07:12 2018
network size: 14 nodes, 88 links, 338 weight
quality increased from 0.621215 to 0.631857
end computation: Sun Jun 3 02:07:12 2018
level 3:
start computation: Sun Jun 3 02:07:12 2018
network size: 8 nodes, 44 links, 338 weight
quality increased from 0.631857 to 0.636295
end computation: Sun Jun 3 02:07:12 2018
End: Sun Jun 3 02:07:12 2018
Total duration: 0 sec
0.636295
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 256 redundant transitions.
Jun 03, 2018 2:07:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Jun 03, 2018 2:07:12 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 169 transitions.
Jun 03, 2018 2:07:12 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 49 place invariants in 22 ms
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 98 variables to be positive in 538 ms
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 169 transitions.
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/169 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 169 transitions.
Jun 03, 2018 2:07:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:07:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 169 transitions.
Jun 03, 2018 2:07:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(92/169) took 2032 ms. Total solver calls (SAT/UNSAT): 1709(711/998)
Jun 03, 2018 2:07:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 2916 ms. Total solver calls (SAT/UNSAT): 2219(907/1312)
Jun 03, 2018 2:07:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 169 transitions.
Jun 03, 2018 2:07:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:07:17 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4737ms 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="MAPKbis-PT-5320"
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/MAPKbis-PT-5320.tgz
mv MAPKbis-PT-5320 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 MAPKbis-PT-5320, 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 r285-csrt-152749176100303"
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 ;