Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r204-oct2-155274856600196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-155274856600196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 4.1K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 34K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1554169600781

01:47:06.551 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
01:47:06.556 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
invariant :n9_5 + -1'SstopOK_1 + CstopOK_2 = 0
invariant :n6_1 + -1'n6_2 + n5_1 + -1'n5_2 = 0
invariant :n4_1 + -1'n4_2 + n3_1 + -1'n3_2 = 0
invariant :n8_1 + -1'n8_2 + Cstart_1 + -1'Cstart_2 = 0
invariant :n6_0 + -1'n6_2 + n5_0 + -1'n5_2 = 0
invariant :n7_6 + -1'n7_8 + -1'Cstart_0 + Cstart_2 = 0
invariant :n7_4 + -1'n7_5 + -1'Cstart_1 + Cstart_2 = 0
invariant :n9_0 + -1'SstopOK_0 + CstopOK_0 = 0
invariant :n7_3 + -1'n7_5 + -1'Cstart_0 + Cstart_2 = 0
invariant :n9_2 + -1'SstopOK_0 + CstopOK_2 = 0
invariant :n8_0 + -1'n8_2 + Cstart_0 + -1'Cstart_2 = 0
invariant :n8_4 + -1'n8_5 + Cstart_1 + -1'Cstart_2 = 0
invariant :CstopAbort_0 + c1_0 + c1_1 + c1_2 + Cstart_0 + Cstart_1 + Cstart_2 + CstopOK_0 + CstopOK_1 + CstopOK_2 = 3
invariant :n9_6 + -1'SstopOK_2 + CstopOK_0 = 0
invariant :AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
invariant :n9_3 + -1'SstopOK_1 + CstopOK_0 = 0
invariant :n9_1 + -1'SstopOK_0 + CstopOK_1 = 0
invariant :n8_7 + -1'n8_8 + Cstart_1 + -1'Cstart_2 = 0
invariant :n4_0 + -1'n4_2 + n3_0 + -1'n3_2 = 0
invariant :n8_3 + -1'n8_5 + Cstart_0 + -1'Cstart_2 = 0
invariant :malicious_reservoir_0 + -1'c1_0 + -1'c1_1 + -1'c1_2 + -1'Cstart_0 + -1'Cstart_1 + -1'Cstart_2 + -1'Sstart_0 + -1'Sstart_1 + -1'Sstart_2 + -1's2_0 + -1's2_1 + -1's2_2 + -1's3_0 + -1's3_1 + -1's3_2 + -1's4_0 + -1's4_1 + -1's4_2 + -1's5_0 + -1's5_1 + -1's5_2 + -1's6_0 + -1's6_1 + -1's6_2 + -1'SstopOK_0 + -1'SstopOK_1 + -1'SstopOK_2 + -1'CstopOK_0 + -1'CstopOK_1 + -1'CstopOK_2 = -5
invariant :n9_7 + -1'SstopOK_2 + CstopOK_1 = 0
invariant :n7_1 + -1'n7_2 + -1'Cstart_1 + Cstart_2 = 0
invariant :n2_0 + -1'n2_2 + n1_0 + -1'n1_2 = 0
invariant :n9_8 + -1'SstopOK_2 + CstopOK_2 = 0
invariant :SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_0 + SstopOK_1 + SstopOK_2 = 3
invariant :n9_4 + -1'SstopOK_1 + CstopOK_1 = 0
invariant :n8_6 + -1'n8_8 + Cstart_0 + -1'Cstart_2 = 0
invariant :n7_0 + -1'n7_2 + -1'Cstart_0 + Cstart_2 = 0
invariant :n2_1 + -1'n2_2 + n1_1 + -1'n1_2 = 0
invariant :n7_7 + -1'n7_8 + -1'Cstart_1 + Cstart_2 = 0

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(X(F("((((a3_0>=1)&&(n4_0>=1))&&(n4_2>=1))&&(n4_1>=1))"))))))
Formula 0 simplified : !FGXF"((((a3_0>=1)&&(n4_0>=1))&&(n4_2>=1))&&(n4_1>=1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
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
41 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.440344,35164,1,0,199,66203,142,145,2431,59071,311
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X("(a5_0>=1)")))
Formula 1 simplified : !X"(a5_0>=1)"
Computing Next relation with stutter on 47 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.442033,35416,1,0,201,66294,147,147,2432,59182,324
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(F(F("(a2_0>=1)"))))U(X("((((a1_0>=1)&&(n2_0>=1))&&(n2_1>=1))&&(n2_2>=1))"))))
Formula 2 simplified : !(GF"(a2_0>=1)" U X"((((a1_0>=1)&&(n2_0>=1))&&(n2_1>=1))&&(n2_2>=1))")
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.447766,35992,1,0,220,66651,162,166,2442,60473,381
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(("((((s4_0>=1)&&(malicious_reservoir_0>=1))||((s4_1>=1)&&(malicious_reservoir_0>=1)))||((s4_2>=1)&&(malicious_reservoir_0>=1)))")U("((((n5_0>=1)&&(s3_0>=1))||((n5_1>=1)&&(s3_1>=1)))||((n5_2>=1)&&(s3_2>=1)))")))U((F("((((c1_0>=1)&&(malicious_reservoir_0>=1))||((c1_1>=1)&&(malicious_reservoir_0>=1)))||((c1_2>=1)&&(malicious_reservoir_0>=1)))"))U("(a4_0>=1)"))))
Formula 3 simplified : !(G("((((s4_0>=1)&&(malicious_reservoir_0>=1))||((s4_1>=1)&&(malicious_reservoir_0>=1)))||((s4_2>=1)&&(malicious_reservoir_0>=1)))" U "((((n5_0>=1)&&(s3_0>=1))||((n5_1>=1)&&(s3_1>=1)))||((n5_2>=1)&&(s3_2>=1)))") U (F"((((c1_0>=1)&&(malicious_reservoir_0>=1))||((c1_1>=1)&&(malicious_reservoir_0>=1)))||((c1_2>=1)&&(malicious_reservoir_0>=1)))" U "(a4_0>=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
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.565097,40108,1,0,344,79959,197,288,2502,84051,645
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((false))
Formula 4 simplified : 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.565459,40108,1,0,344,79959,197,288,2502,84051,646
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((true))
Formula 5 simplified : 0
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.565546,40108,1,0,344,79959,197,288,2502,84051,646
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(X("(a5_0>=1)")))U(X(G("(a5_0>=1)"))))))
Formula 6 simplified : !X(XX"(a5_0>=1)" U XG"(a5_0>=1)")
Computing Next relation with stutter on 47 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.567592,40344,1,0,345,80009,200,289,2502,84182,657
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((((malicious_reservoir_0>=1)&&(s5_0>=1))||((malicious_reservoir_0>=1)&&(s5_1>=1)))||((malicious_reservoir_0>=1)&&(s5_2>=1)))")))
Formula 7 simplified : !G"((((malicious_reservoir_0>=1)&&(s5_0>=1))||((malicious_reservoir_0>=1)&&(s5_1>=1)))||((malicious_reservoir_0>=1)&&(s5_2>=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.569119,40344,1,0,345,80022,206,289,2512,84198,665
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G("(Astart_0>=1)"))))
Formula 8 simplified : !G"(Astart_0>=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.570256,40344,1,0,351,80088,212,296,2513,84381,688
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("((((malicious_reservoir_0>=1)&&(s6_0>=1))||((malicious_reservoir_0>=1)&&(s6_1>=1)))||((malicious_reservoir_0>=1)&&(s6_2>=1)))")U(F("((((s2_0>=1)&&(malicious_reservoir_0>=1))||((s2_1>=1)&&(malicious_reservoir_0>=1)))||((s2_2>=1)&&(malicious_reservoir_0>=1)))"))))
Formula 9 simplified : !("((((malicious_reservoir_0>=1)&&(s6_0>=1))||((malicious_reservoir_0>=1)&&(s6_1>=1)))||((malicious_reservoir_0>=1)&&(s6_2>=1)))" U F"((((s2_0>=1)&&(malicious_reservoir_0>=1))||((s2_1>=1)&&(malicious_reservoir_0>=1)))||((s2_2>=1)&&(malicious_reservoir_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.573712,40344,1,0,368,80387,221,315,2522,85119,746
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(G(("((((((s5_0>=1)&&(n8_1>=1))&&(n8_2>=1))&&(n8_0>=1))||((((s5_1>=1)&&(n8_4>=1))&&(n8_5>=1))&&(n8_3>=1)))||((((s5_2>=1)&&(n8_7>=1))&&(n8_8>=1))&&(n8_6>=1)))")U("(a2_0>=1)"))))))
Formula 10 simplified : !XFG("((((((s5_0>=1)&&(n8_1>=1))&&(n8_2>=1))&&(n8_0>=1))||((((s5_1>=1)&&(n8_4>=1))&&(n8_5>=1))&&(n8_3>=1)))||((((s5_2>=1)&&(n8_7>=1))&&(n8_8>=1))&&(n8_6>=1)))" U "(a2_0>=1)")
Computing Next relation with stutter on 47 deadlock states
27 unique states visited
27 strongly connected components in search stack
27 transitions explored
27 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.664655,43756,1,0,447,91326,235,378,2557,100305,1018
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("((((n6_2>=1)&&(n6_0>=1))&&(n6_1>=1))&&(a5_0>=1))")))
Formula 11 simplified : !F"((((n6_2>=1)&&(n6_0>=1))&&(n6_1>=1))&&(a5_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
8 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.747277,45340,1,0,582,98445,244,521,2563,114509,1323
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(G(G("((((s3_0>=1)&&(malicious_reservoir_0>=1))||((s3_1>=1)&&(malicious_reservoir_0>=1)))||((s3_2>=1)&&(malicious_reservoir_0>=1)))"))))))
Formula 12 simplified : !GFG"((((s3_0>=1)&&(malicious_reservoir_0>=1))||((s3_1>=1)&&(malicious_reservoir_0>=1)))||((s3_2>=1)&&(malicious_reservoir_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
13 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.868764,49036,1,0,730,113777,257,680,2570,143070,1775
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((false))
Formula 13 simplified : 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.868935,49036,1,0,730,113777,257,680,2570,143070,1775
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("(((s6_0>=1)||(s6_1>=1))||(s6_2>=1))")))
Formula 14 simplified : !G"(((s6_0>=1)||(s6_1>=1))||(s6_2>=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.869787,49300,1,0,730,113777,263,680,2577,143073,1780
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G("((((n5_0>=1)&&(s3_0>=1))||((n5_1>=1)&&(s3_1>=1)))||((n5_2>=1)&&(s3_2>=1)))"))))
Formula 15 simplified : !XG"((((n5_0>=1)&&(s3_0>=1))||((n5_1>=1)&&(s3_1>=1)))||((n5_2>=1)&&(s3_2>=1)))"
Computing Next relation with stutter on 47 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.870881,49560,1,0,730,113777,267,680,2578,143073,1785
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1554169628530

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Apr 02, 2019 1:46:42 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Apr 02, 2019 1:46:42 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Apr 02, 2019 1:46:42 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24614 ms
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Apr 02, 2019 1:47:06 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Apr 02, 2019 1:47:06 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 63 deterministic transitions.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 4 ms.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 86 places.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 56 transitions.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 63 deterministic transitions.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 1 ms.
Apr 02, 2019 1:47:07 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 14 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 109 ms
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Apr 02, 2019 1:47:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 1:47:08 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 70) 1) (= (store (store (store (store (store s0 70 (- (select s0 70) 1)) 6 (+ (select s0 6) 1)) 5 (+ (select s0 5) 1)) 4 (+ (select s0 4) 1)) 73 (+ (select s0 73) 1)) s1))) with error
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.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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)
Apr 02, 2019 1:47:08 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1083ms 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-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is QuasiCertifProtocol-COL-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 r204-oct2-155274856600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;