About the Execution of ITS-Tools.L for Referendum-PT-0020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.750 | 6567.00 | 14102.00 | 295.30 | FFFTTTFFTFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
........................................................................................................
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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 6.1K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Referendum-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900117
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME Referendum-PT-0020-LTLCardinality-01
FORMULA_NAME Referendum-PT-0020-LTLCardinality-02
FORMULA_NAME Referendum-PT-0020-LTLCardinality-03
FORMULA_NAME Referendum-PT-0020-LTLCardinality-04
FORMULA_NAME Referendum-PT-0020-LTLCardinality-05
FORMULA_NAME Referendum-PT-0020-LTLCardinality-06
FORMULA_NAME Referendum-PT-0020-LTLCardinality-07
FORMULA_NAME Referendum-PT-0020-LTLCardinality-08
FORMULA_NAME Referendum-PT-0020-LTLCardinality-09
FORMULA_NAME Referendum-PT-0020-LTLCardinality-10
FORMULA_NAME Referendum-PT-0020-LTLCardinality-11
FORMULA_NAME Referendum-PT-0020-LTLCardinality-12
FORMULA_NAME Referendum-PT-0020-LTLCardinality-13
FORMULA_NAME Referendum-PT-0020-LTLCardinality-14
FORMULA_NAME Referendum-PT-0020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528321839344
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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(G("((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=1)"))))
Formula 0 simplified : !XG"((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=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
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.153347,17304,1,0,28,5358,23,42,956,4792,83
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20))")U("((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=1)")))))
Formula 1 simplified : !GF("((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20))" U "((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+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
7 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.232087,18304,1,0,31,5370,32,48,1167,6108,202
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(F(X("((((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3)")))))
Formula 2 simplified : !FX"((((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 41 rows 61 cols
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
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15 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.382337,22000,1,0,127,26138,41,129,1242,41795,412
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("(ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20))")))
Formula 3 simplified : !X"(ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20))"
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.384474,22000,1,0,127,26138,44,129,1264,41795,414
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(("(ready>=2)")U("(ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20))")))))
Formula 4 simplified : !GX("(ready>=2)" U "(ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
43 unique states visited
0 strongly connected components in search stack
44 transitions explored
23 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.431411,22660,1,0,127,26138,54,129,1482,41795,498
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X("((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=2)")))U(F(F("((((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)<=ready)")))))
Formula 5 simplified : !(GX"((((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=2)" U F"((((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)<=ready)")
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.435629,22872,1,0,127,26138,63,129,1504,41795,502
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(X(F("(ready>=1)"))))))
Formula 6 simplified : !XXXF"(ready>=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
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.49718,23876,1,0,162,31726,72,167,1505,56374,639
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((G("((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20))"))U(G("((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20))")))))
Formula 7 simplified : !G(G"((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20))" U G"((((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20))")
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.528366,25040,1,0,163,31726,90,169,1791,56377,657
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F(X(X("(voting_1<=voting_3)"))))))
Formula 8 simplified : !FXX"(voting_1<=voting_3)"
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
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.571273,26096,1,0,255,40474,99,226,1796,70179,848
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(("(voting_10<=voted_yes_5)")U("(voting_15<=voted_no_17)")))))
Formula 9 simplified : !XG("(voting_10<=voted_yes_5)" U "(voting_15<=voted_no_17)")
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
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.575085,26556,1,0,255,40474,115,226,1811,70179,855
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(voted_yes_8<=voting_9)"))
Formula 10 simplified : !"(voted_yes_8<=voting_9)"
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.575455,26556,1,0,255,40474,118,226,1815,70180,857
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(X(X("(voting_3<=voting_20)"))))))
Formula 11 simplified : !GFXX"(voting_3<=voting_20)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
63 unique states visited
0 strongly connected components in search stack
65 transitions explored
24 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.597697,26812,1,0,292,42626,127,263,1820,76021,1030
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F("(voted_yes_9<=voting_10)"))U(X("(voted_no_12<=voted_yes_16)")))))
Formula 12 simplified : !X(F"(voted_yes_9<=voting_10)" U X"(voted_no_12<=voted_yes_16)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.648681,27824,1,0,373,49212,141,342,1834,87991,1231
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(X(X("(voted_no_6<=voting_15)"))))))
Formula 13 simplified : !FXXX"(voted_no_6<=voting_15)"
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
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.729537,29408,1,0,445,56654,150,415,1840,102837,1422
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X("(voting_13<=voted_no_12)"))))
Formula 14 simplified : !XX"(voting_13<=voted_no_12)"
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
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.733225,29408,1,0,448,56856,153,418,1845,103078,1435
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(voting_18<=voted_yes_7)"))
Formula 15 simplified : !"(voting_18<=voted_yes_7)"
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.734656,29672,1,0,448,56856,156,418,1848,103079,1437
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-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 1528321845911
--------------------
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 LTLCardinality -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 LTLCardinality -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 9:50:42 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 9:50:42 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 9:50:42 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 47 ms
Jun 06, 2018 9:50:42 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 61 places.
Jun 06, 2018 9:50:43 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Jun 06, 2018 9:50:43 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 9:50:43 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 85 ms
Jun 06, 2018 9:50:43 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Jun 06, 2018 9:50:43 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Jun 06, 2018 9:50:43 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 41 transitions.
Jun 06, 2018 9:50:44 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 30 ms
Jun 06, 2018 9:50:44 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 exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
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 9:50:44 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 916ms 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="LTLCardinality"
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/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 Referendum-PT-0020, examination is LTLCardinality"
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-152732140900117"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;