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 236K
-rw-r--r-- 1 mcc users 4.3K 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 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is QuasiCertifProtocol-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140800056
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528315391784

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/graph1474376783534404722.txt, -o, /tmp/graph1474376783534404722.bin, -w, /tmp/graph1474376783534404722.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/graph1474376783534404722.bin, -l, -1, -v, -w, /tmp/graph1474376783534404722.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(F(F("(i3.u12.Astart>=1)"))))U((X("(i3.u12.Astart>=1)"))U(G("(i7.u7.a4>=1)")))))
Formula 0 simplified : !(F"(i3.u12.Astart>=1)" U (X"(i3.u12.Astart>=1)" U G"(i7.u7.a4>=1)"))
built 22 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions malS6_1, malS6_0, malS5_0, malS6_2, malC1_0, malC1_2, malC1_1, malS3_2, malS4_2, malS4_0, malS4_1, malS5_1, malS5_2, malS1_2, malS2_2, u3.malS3_1, u3.malS3_0, u3.malS1_1, u3.malS1_0, u3.malS2_0, u3.malS2_1, i7.u7.malA5, i7.u7.malA3, i7.u7.malA1, i7.u7.malA2, i7.u7.malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
Computing Next relation with stutter on 47 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
invariant :i1:u2:n8_2_0 + -1'i1:u2:n8_2_2 + -1'i6:u18:n8_0_0 + i6:u18:n8_0_2 = 0
invariant :i2:u6:n7_1_0 + -1'i2:u6:n7_1_2 + i6:u18:n8_0_0 + -1'i6:u18:n8_0_2 = 0
invariant :i0:u9:n9_0_1 + i0:u9:CstopOK_1 + -1'i6:u18:SstopOK_0 = 0
invariant :i3:u12:Astart + i7:u7:a5 + i7:u7:a3 + i7:u7:AstopAbort + i7:u7:a2 + i7:u7:a4 + i7:u7:a1 + i7:u19:AstopOK = 1
invariant :i3:u12:n2_0 + i3:u12:n1_0 + -1'i4:u11:n1_2 + -1'i4:u11:n2_2 = 0
invariant :i1:u2:n8_2_1 + -1'i1:u2:n8_2_2 + i6:u18:n8_0_2 + -1'i6:u18:n8_0_1 = 0
invariant :i7:u14:n4_1 + i7:u14:n3_1 + -1'i7:u17:n3_0 + -1'i7:u17:n4_0 = 0
invariant :i2:u1:n8_1_0 + -1'i2:u1:n8_1_2 + -1'i6:u18:n8_0_0 + i6:u18:n8_0_2 = 0
invariant :i0:u10:n9_0_2 + i0:u10:CstopOK_2 + -1'i6:u18:SstopOK_0 = 0
invariant :i1:u2:Cstart_1 + -1'i6:u18:Cstart_2 + -1'i6:u18:n8_0_2 + i6:u18:n8_0_1 = 0
invariant :i4:u15:n4_2 + i4:u15:n3_2 + -1'i7:u17:n3_0 + -1'i7:u17:n4_0 = 0
invariant :i2:u1:SstopOK_1 + -1'i6:u8:n9_1_0 + -1'i6:u8:CstopOK_0 = 0
invariant :i3:u13:n2_1 + i3:u13:n1_1 + -1'i4:u11:n1_2 + -1'i4:u11:n2_2 = 0
invariant :i1:u5:n7_2_0 + -1'i1:u5:n7_2_2 + i6:u18:n8_0_0 + -1'i6:u18:n8_0_2 = 0
invariant :i6:u4:n7_0_0 + -1'i6:u4:n7_0_1 + i6:u18:n8_0_0 + -1'i6:u18:n8_0_1 = 0
invariant :i7:u16:n5_1 + i7:u16:n6_1 + -1'i7:u20:n5_2 + -1'i7:u20:n6_2 = 0
invariant :i0:u10:n9_1_2 + i0:u10:CstopOK_2 + -1'i6:u8:n9_1_0 + -1'i6:u8:CstopOK_0 = 0
invariant :i1:u2:SstopOK_2 + -1'i6:u8:n9_2_0 + -1'i6:u8:CstopOK_0 = 0
invariant :i6:u8:n9_0_0 + i6:u8:CstopOK_0 + -1'i6:u18:SstopOK_0 = 0
invariant :i2:u6:n7_1_1 + -1'i2:u6:n7_1_2 + -1'i6:u18:n8_0_2 + i6:u18:n8_0_1 = 0
invariant :i1:u5:n7_2_1 + -1'i1:u5:n7_2_2 + -1'i6:u18:n8_0_2 + i6:u18:n8_0_1 = 0
invariant :i0:u0:c1_0 + i0:u0:c1_1 + i0:u0:c1_2 + i0:u0:CstopAbort + i0:u9:CstopOK_1 + i0:u10:CstopOK_2 + i6:u8:CstopOK_0 + -1'i6:u18:n8_0_0 + 3'i6:u18:Cstart_2 + 2'i6:u18:n8_0_2 + -1'i6:u18:n8_0_1 = 3
invariant :i0:u9:n9_2_1 + i0:u9:CstopOK_1 + -1'i6:u8:n9_2_0 + -1'i6:u8:CstopOK_0 = 0
invariant :i0:u9:n9_1_1 + i0:u9:CstopOK_1 + -1'i6:u8:n9_1_0 + -1'i6:u8:CstopOK_0 = 0
invariant :u3:malicious_reservoir + -1'u3:s3_1 + -1'u3:s3_0 + -1'u3:s2_0 + -1'u3:s2_1 + -1'u3:Sstart_1 + -1'u3:Sstart_0 + i0:u0:CstopAbort + -1'i1:u2:s6_2 + -1'i1:u5:s5_2 + -1'i1:u5:s4_2 + -1'i2:u1:s6_1 + -1'i2:u6:s5_1 + -1'i2:u6:s4_1 + -1'i4:u11:s2_2 + -1'i4:u11:Sstart_2 + -1'i4:u15:s3_2 + -1'i6:u4:s5_0 + -1'i6:u4:s4_0 + -1'i6:u8:n9_1_0 + -1'i6:u8:n9_2_0 + -2'i6:u8:CstopOK_0 + -1'i6:u18:s6_0 + -1'i6:u18:SstopOK_0 = -2
invariant :i2:u1:n8_1_1 + -1'i2:u1:n8_1_2 + i6:u18:n8_0_2 + -1'i6:u18:n8_0_1 = 0
invariant :i2:u1:Cstart_0 + i6:u18:n8_0_0 + -1'i6:u18:Cstart_2 + -1'i6:u18:n8_0_2 = 0
invariant :i7:u19:n5_0 + i7:u19:n6_0 + -1'i7:u20:n5_2 + -1'i7:u20:n6_2 = 0
invariant :i0:u10:n9_2_2 + i0:u10:CstopOK_2 + -1'i6:u8:n9_2_0 + -1'i6:u8:CstopOK_0 = 0
invariant :u3:SstopAbort + u3:s3_1 + u3:s3_0 + u3:s2_0 + u3:s2_1 + u3:Sstart_1 + u3:Sstart_0 + i1:u2:s6_2 + i1:u5:s5_2 + i1:u5:s4_2 + i2:u1:s6_1 + i2:u6:s5_1 + i2:u6:s4_1 + i4:u11:s2_2 + i4:u11:Sstart_2 + i4:u15:s3_2 + i6:u4:s5_0 + i6:u4:s4_0 + i6:u8:n9_1_0 + i6:u8:n9_2_0 + 2'i6:u8:CstopOK_0 + i6:u18:s6_0 + i6:u18:SstopOK_0 = 3
invariant :i6:u4:n7_0_2 + -1'i6:u4:n7_0_1 + i6:u18:n8_0_2 + -1'i6:u18:n8_0_1 = 0
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
22 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.335259,22732,1,0,9421,1976,1116,15201,414,5696,30950
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(i7.u7.a2>=1)"))
Formula 1 simplified : !"(i7.u7.a2>=1)"
Computing Next relation with stutter on 47 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.339731,22732,1,0,9465,1976,1125,15304,415,5696,31201
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(("((((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))||((u3.malicious_reservoir>=1)&&(i4.u11.Sstart_2>=1)))||((u3.malicious_reservoir>=1)&&(u3.Sstart_0>=1)))")U(X("(i7.u7.a4>=1)"))))))
Formula 2 simplified : !G("((((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))||((u3.malicious_reservoir>=1)&&(i4.u11.Sstart_2>=1)))||((u3.malicious_reservoir>=1)&&(u3.Sstart_0>=1)))" U X"(i7.u7.a4>=1)")
Computing Next relation with stutter on 47 deadlock states
34 unique states visited
34 strongly connected components in search stack
35 transitions explored
34 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.352197,23136,1,0,9618,1976,1151,15512,418,5697,32151
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(i7.u7.a2>=1)"))
Formula 3 simplified : !"(i7.u7.a2>=1)"
Computing Next relation with stutter on 47 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.352777,23136,1,0,9618,1976,1151,15512,418,5697,32151
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(G(X("(i7.u7.a4>=1)"))))U(G(F(X("(((i2.u1.s6_1>=1)||(i6.u18.s6_0>=1))||(i1.u2.s6_2>=1))"))))))
Formula 4 simplified : !(GX"(i7.u7.a4>=1)" U GFX"(((i2.u1.s6_1>=1)||(i6.u18.s6_0>=1))||(i1.u2.s6_2>=1))")
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 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.359574,23468,1,0,9623,1977,1186,15518,418,5699,32464
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(F((F("((((i6.u4.s5_0>=1)&&(u3.malicious_reservoir>=1))||((u3.malicious_reservoir>=1)&&(i2.u6.s5_1>=1)))||((i1.u5.s5_2>=1)&&(u3.malicious_reservoir>=1)))"))U(X("(i7.u7.a5>=1)"))))))
Formula 5 simplified : !F(F"((((i6.u4.s5_0>=1)&&(u3.malicious_reservoir>=1))||((u3.malicious_reservoir>=1)&&(i2.u6.s5_1>=1)))||((i1.u5.s5_2>=1)&&(u3.malicious_reservoir>=1)))" U X"(i7.u7.a5>=1)")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.365969,23468,1,0,9891,1977,1204,15864,419,5707,33609
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i4.u11.n2_2>=1))&&(i7.u7.a1>=1))")))
Formula 6 simplified : !F"((((i3.u12.n2_0>=1)&&(i3.u13.n2_1>=1))&&(i4.u11.n2_2>=1))&&(i7.u7.a1>=1))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.371831,23620,1,0,10153,1980,1234,16109,419,5719,34471
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(G("((((u3.malicious_reservoir>=1)&&(i1.u5.s4_2>=1))||((i6.u4.s4_0>=1)&&(u3.malicious_reservoir>=1)))||((i2.u6.s4_1>=1)&&(u3.malicious_reservoir>=1)))"))))
Formula 7 simplified : !G"((((u3.malicious_reservoir>=1)&&(i1.u5.s4_2>=1))||((i6.u4.s4_0>=1)&&(u3.malicious_reservoir>=1)))||((i2.u6.s4_1>=1)&&(u3.malicious_reservoir>=1)))"
Computing Next relation with stutter on 47 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.373766,23620,1,0,10153,1980,1267,16109,419,5719,34504
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(i6.u18.s6_0>=1)")))
Formula 8 simplified : !F"(i6.u18.s6_0>=1)"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.402272,24148,1,0,11226,1981,1304,17243,419,5720,38598
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("((u3.malicious_reservoir>=1)&&(u3.s2_0>=1))")U("((i6.u4.s4_0>=1)&&(u3.malicious_reservoir>=1))")))
Formula 9 simplified : !("((u3.malicious_reservoir>=1)&&(u3.s2_0>=1))" U "((i6.u4.s4_0>=1)&&(u3.malicious_reservoir>=1))")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.404093,24404,1,0,11226,1981,1319,17243,422,5720,38616
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(F(F("((i1.u5.s5_2>=1)&&(u3.malicious_reservoir>=1))")))))
Formula 10 simplified : !F"((i1.u5.s5_2>=1)&&(u3.malicious_reservoir>=1))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.431321,24932,1,0,12530,1981,1348,18628,422,5720,43142
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("((u3.s2_0>=1)&&(i7.u17.n3_0>=1))")))
Formula 11 simplified : !F"((u3.s2_0>=1)&&(i7.u17.n3_0>=1))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.437693,25196,1,0,12768,1981,1371,18830,422,5722,44270
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((i6.u4.s5_0>=1)&&(u3.malicious_reservoir>=1))")))
Formula 12 simplified : !F"((i6.u4.s5_0>=1)&&(u3.malicious_reservoir>=1))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.475905,25724,1,0,13976,1981,1397,20114,422,5725,48380
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(G(G(G("((((i6.u4.n7_0_1>=1)&&(i1.u2.Cstart_1>=1))&&(i2.u6.n7_1_1>=1))&&(i1.u5.n7_2_1>=1))")))))))
Formula 13 simplified : !FG"((((i6.u4.n7_0_1>=1)&&(i1.u2.Cstart_1>=1))&&(i2.u6.n7_1_1>=1))&&(i1.u5.n7_2_1>=1))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.526448,26772,1,0,15849,1982,1434,22146,422,5734,54359
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((G(G("(i3.u12.Astart>=1)")))U(G(F(G("((i1.u2.s6_2>=1)&&(u3.malicious_reservoir>=1))"))))))
Formula 14 simplified : !(G"(i3.u12.Astart>=1)" U GFG"((i1.u2.s6_2>=1)&&(u3.malicious_reservoir>=1))")
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.566259,27696,1,0,17069,1982,1456,23604,422,5734,58610
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F((X("((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))"))U(F(F("((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))"))))))
Formula 15 simplified : !F(X"((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))" U F"((u3.malicious_reservoir>=1)&&(u3.Sstart_1>=1))")
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.570079,27960,1,0,17069,1982,1475,23604,424,5734,58621
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-15 TRUE 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 1528315410720

--------------------
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 06, 2018 8:03:27 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 06, 2018 8:03:27 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 8:03:27 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 77 ms
Jun 06, 2018 8:03:27 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 06, 2018 8:03:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 71 ms
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 37 ms
Begin: Wed Jun 6 20:03:28 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 20:03:28 2018
network size: 86 nodes, 368 links, 112 weight
quality increased from -0.0453205 to 0.44041
end computation: Wed Jun 6 20:03:28 2018
level 1:
start computation: Wed Jun 6 20:03:28 2018
network size: 21 nodes, 149 links, 112 weight
quality increased from 0.44041 to 0.486527
end computation: Wed Jun 6 20:03:28 2018
level 2:
start computation: Wed Jun 6 20:03:28 2018
network size: 9 nodes, 55 links, 112 weight
quality increased from 0.486527 to 0.488162
end computation: Wed Jun 6 20:03:28 2018
level 3:
start computation: Wed Jun 6 20:03:28 2018
network size: 8 nodes, 48 links, 112 weight
quality increased from 0.488162 to 0.488162
end computation: Wed Jun 6 20:03:28 2018
End: Wed Jun 6 20:03:28 2018
Total duration: 0 sec
0.488162
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 8:03:28 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Jun 06, 2018 8:03:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Jun 06, 2018 8:03:28 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 8:03:29 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Jun 06, 2018 8:03:29 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 40 ms
Jun 06, 2018 8:03:29 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 06, 2018 8:03:29 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 653ms 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="QuasiCertifProtocol-PT-02"
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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 QuasiCertifProtocol-PT-02, 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 r189-qhx2-152732140800056"
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 ;