About the Execution of ITS-Tools.M for Referendum-PT-0020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
330.860 | 3935.00 | 6675.00 | 353.90 | FFFTFFFTFFFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r199-smll-155284912600223.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstoolsm
Input is Referendum-PT-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-155284912600223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.4K Feb 12 12:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 12 12:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 8 14:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 8 14:26 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 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 6.2K Feb 5 01:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 5 01:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 4 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 4 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 1 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 1 11:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 21K 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 Referendum-PT-0020-LTLFireability-00
FORMULA_NAME Referendum-PT-0020-LTLFireability-01
FORMULA_NAME Referendum-PT-0020-LTLFireability-02
FORMULA_NAME Referendum-PT-0020-LTLFireability-03
FORMULA_NAME Referendum-PT-0020-LTLFireability-04
FORMULA_NAME Referendum-PT-0020-LTLFireability-05
FORMULA_NAME Referendum-PT-0020-LTLFireability-06
FORMULA_NAME Referendum-PT-0020-LTLFireability-07
FORMULA_NAME Referendum-PT-0020-LTLFireability-08
FORMULA_NAME Referendum-PT-0020-LTLFireability-09
FORMULA_NAME Referendum-PT-0020-LTLFireability-10
FORMULA_NAME Referendum-PT-0020-LTLFireability-11
FORMULA_NAME Referendum-PT-0020-LTLFireability-12
FORMULA_NAME Referendum-PT-0020-LTLFireability-13
FORMULA_NAME Referendum-PT-0020-LTLFireability-14
FORMULA_NAME Referendum-PT-0020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553616892340
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]
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 : !((G(X(G("(ready>=1)")))))
Formula 0 simplified : !GXG"(ready>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.053714,17712,1,0,28,4941,23,42,1004,4753,83
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G(F(F("(ready>=1)"))))U("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))
Formula 1 simplified : !(GF"(ready>=1)" U "((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
5 unique states visited
4 strongly connected components in search stack
5 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.059771,18400,1,0,29,4952,37,45,1048,5229,148
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))U(X(X(G("(ready>=1)"))))))
Formula 2 simplified : !(X"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))" U XXG"(ready>=1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
11 unique states visited
8 strongly connected components in search stack
11 transitions explored
8 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.066505,18992,1,0,30,5115,37,46,1048,5593,172
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X((X("(ready>=1)"))U(F("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))))))
Formula 3 simplified : !XX(X"(ready>=1)" U F"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.069445,19200,1,0,30,5115,41,46,1048,5593,174
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(G(X(X("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))))))
Formula 4 simplified : !FGXX"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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.078029,19200,1,0,30,5119,41,48,1048,6618,234
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")U("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))
Formula 5 simplified : !"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 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.080807,19200,1,0,30,5119,41,48,1048,6618,235
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(F(X(F(F("(ready>=1)")))))))
Formula 6 simplified : !XFXF"(ready>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106176,19948,1,0,65,9657,41,85,1048,18806,326
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((G("(ready>=1)"))U(X("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))U(X("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))))
Formula 7 simplified : !((G"(ready>=1)" U X"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))") U X"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
0 strongly connected components in search stack
1 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.110416,20616,1,0,65,9657,44,85,1052,18806,332
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G("(voting_12>=1)")))
Formula 8 simplified : !G"(voting_12>=1)"
Computing Next relation with stutter on 1.04858e+06 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.11093,20616,1,0,65,9657,50,85,1052,18806,337
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G("(voting_14>=1)")))
Formula 9 simplified : !G"(voting_14>=1)"
Computing Next relation with stutter on 1.04858e+06 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.111426,20616,1,0,65,9657,56,85,1052,18806,342
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((false))
Formula 10 simplified : 1
Computing Next relation with stutter on 1.04858e+06 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
// Phase 1: matrix 41 rows 61 cols
STATS,0,0.111814,20616,1,0,65,9657,56,85,1052,18806,343
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X("(voting_5>=1)"))))
Formula 11 simplified : !XX"(voting_5>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.116486,20616,1,0,85,10571,59,122,1052,20013,407
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G(G(F("(voting_11>=1)"))))U(X(("(voting_11>=1)")U("(voting_4>=1)")))))
Formula 12 simplified : !(GF"(voting_11>=1)" U X("(voting_11>=1)" U "(voting_4>=1)"))
Computing Next relation with stutter on 1.04858e+06 deadlock states
3 unique states visited
0 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.118146,21024,1,0,85,10571,67,122,1054,20013,411
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((F(F("(voting_6>=1)")))U(F(X("(voting_14>=1)"))))))
Formula 13 simplified : !X(F"(voting_6>=1)" U FX"(voting_14>=1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
invariant :voted_no_10 + -1'voted_no_20 + voted_yes_10 + -1'voted_yes_20 + voting_10 + -1'voting_20 = 0
invariant :voted_no_8 + -1'voted_no_20 + voted_yes_8 + -1'voted_yes_20 + voting_8 + -1'voting_20 = 0
invariant :voted_no_9 + -1'voted_no_20 + voted_yes_9 + -1'voted_yes_20 + voting_9 + -1'voting_20 = 0
invariant :voted_no_19 + -1'voted_no_20 + voted_yes_19 + -1'voted_yes_20 + voting_19 + -1'voting_20 = 0
invariant :voted_no_17 + -1'voted_no_20 + voted_yes_17 + -1'voted_yes_20 + voting_17 + -1'voting_20 = 0
invariant :ready + voted_no_20 + voted_yes_20 + voting_20 = 1
invariant :voted_no_6 + -1'voted_no_20 + voted_yes_6 + -1'voted_yes_20 + voting_6 + -1'voting_20 = 0
invariant :voted_no_11 + -1'voted_no_20 + voted_yes_11 + -1'voted_yes_20 + voting_11 + -1'voting_20 = 0
invariant :voted_no_7 + -1'voted_no_20 + voted_yes_7 + -1'voted_yes_20 + voting_7 + -1'voting_20 = 0
invariant :voted_no_18 + -1'voted_no_20 + voted_yes_18 + -1'voted_yes_20 + voting_18 + -1'voting_20 = 0
invariant :voted_no_14 + -1'voted_no_20 + voted_yes_14 + -1'voted_yes_20 + voting_14 + -1'voting_20 = 0
invariant :voted_no_3 + -1'voted_no_20 + voted_yes_3 + -1'voted_yes_20 + voting_3 + -1'voting_20 = 0
invariant :voted_no_1 + -1'voted_no_20 + voted_yes_1 + -1'voted_yes_20 + voting_1 + -1'voting_20 = 0
invariant :voted_no_15 + -1'voted_no_20 + voted_yes_15 + -1'voted_yes_20 + voting_15 + -1'voting_20 = 0
invariant :voted_no_4 + -1'voted_no_20 + voted_yes_4 + -1'voted_yes_20 + voting_4 + -1'voting_20 = 0
invariant :voted_no_5 + -1'voted_no_20 + voted_yes_5 + -1'voted_yes_20 + voting_5 + -1'voting_20 = 0
invariant :voted_no_2 + -1'voted_no_20 + voted_yes_2 + -1'voted_yes_20 + voting_2 + -1'voting_20 = 0
invariant :voted_no_13 + -1'voted_no_20 + voted_yes_13 + -1'voted_yes_20 + voting_13 + -1'voting_20 = 0
invariant :voted_no_16 + -1'voted_no_20 + voted_yes_16 + -1'voted_yes_20 + voting_16 + -1'voting_20 = 0
invariant :voted_no_12 + -1'voted_no_20 + voted_yes_12 + -1'voted_yes_20 + voting_12 + -1'voting_20 = 0
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.155016,21816,1,0,160,17312,73,198,1054,32319,609
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((F(F(F("(voting_15>=1)"))))U(("(voting_11>=1)")U(F("(voting_19>=1)")))))
Formula 14 simplified : !(F"(voting_15>=1)" U ("(voting_11>=1)" U F"(voting_19>=1)"))
Computing Next relation with stutter on 1.04858e+06 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.155993,22052,1,0,161,17313,82,200,1054,32326,617
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X((G("(voting_3>=1)"))U("(voting_19>=1)")))))
Formula 15 simplified : !FX(G"(voting_3>=1)" U "(voting_19>=1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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.156533,22312,1,0,161,17313,82,200,1054,32326,619
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1553616896275
--------------------
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
Mar 26, 2019 4:14:54 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 38 ms
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 61 places.
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Mar 26, 2019 4:14:54 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Mar 26, 2019 4:14:54 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 14 ms
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 41 transitions.
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 61 places.
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 41 transitions.
Mar 26, 2019 4:14:55 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 26, 2019 4:14:55 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 41 transitions.
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 33 ms
Error adding positive variable constraint (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 7) 0)")
Skipping mayMatrices nes/nds SMT assertion produced unexpected response success
java.lang.RuntimeException: SMT assertion produced unexpected response success
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:145)
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)
Mar 26, 2019 4:14:55 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 249ms 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="Referendum-PT-0020"
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-3957"
echo " Executing tool itstoolsm"
echo " Input is Referendum-PT-0020, 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 r199-smll-155284912600223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 '
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 ;