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 180K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.5K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Referendum-COL-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140200097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528289992071

13:00:16.442 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
13:00:16.447 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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.201805151631/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.201805151631/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 : !(("(ready_0>=3)"))
Formula 0 simplified : !"(ready_0>=3)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.14006,16500,1,0,18,1492,20,23,466,1341,50
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X("(ready_0<=(((((((((voted_yes_0+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))")))
Formula 1 simplified : !X"(ready_0<=(((((((((voted_yes_0+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))"
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.145218,16500,1,0,18,1492,23,23,479,1341,52
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_yes_0+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))")))
Formula 2 simplified : !F"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_yes_0+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))"
Computing Next relation with stutter on 1024 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.14889,16796,1,0,18,1492,32,23,501,1341,56
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)")))))
Formula 3 simplified : !FGF"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)"
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.168696,17092,1,0,20,1508,41,27,557,1687,122
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((X("((((((((((voted_no_0+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)>=2)"))U(G("((((((((((voted_yes_0+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)>=1)")))))
Formula 4 simplified : !G(X"((((((((((voted_no_0+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)>=2)" U G"((((((((((voted_yes_0+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)>=1)")
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.23236,18588,1,0,91,5908,47,106,667,9388,352
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=3)"))U(G(X("((((((((((voted_no_0+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)>=3)")))))
Formula 5 simplified : !(F"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=3)" U GX"((((((((((voted_no_0+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)>=3)")
Computing Next relation with stutter on 1024 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.247825,19176,1,0,94,5997,64,110,781,9654,393
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(F("((((((((((voted_yes_0+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)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))")))U(X(X("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_no_0+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))")))))
Formula 6 simplified : !(F"((((((((((voted_yes_0+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)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))" U XX"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_no_0+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))")
Computing Next relation with stutter on 1024 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.380005,20388,1,0,129,10451,78,141,1603,17907,487
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(G("((((((((((voted_yes_0+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_no_0+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))")))U(X(X("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_no_0+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))")))))
Formula 7 simplified : !(G"((((((((((voted_yes_0+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_no_0+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))" U XX"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)<=(((((((((voted_no_0+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))")
Computing Next relation with stutter on 1024 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 21 rows 31 cols
invariant :voted_no_4 + -1'voted_no_9 + voted_yes_4 + -1'voted_yes_9 + voting_4 + -1'voting_9 = 0
invariant :voted_no_6 + -1'voted_no_9 + voted_yes_6 + -1'voted_yes_9 + voting_6 + -1'voting_9 = 0
invariant :voted_no_3 + -1'voted_no_9 + voted_yes_3 + -1'voted_yes_9 + voting_3 + -1'voting_9 = 0
invariant :voted_no_1 + -1'voted_no_9 + voted_yes_1 + -1'voted_yes_9 + voting_1 + -1'voting_9 = 0
invariant :voted_no_2 + -1'voted_no_9 + voted_yes_2 + -1'voted_yes_9 + voting_2 + -1'voting_9 = 0
invariant :voted_no_8 + -1'voted_no_9 + voted_yes_8 + -1'voted_yes_9 + voting_8 + -1'voting_9 = 0
invariant :voted_no_0 + -1'voted_no_9 + voted_yes_0 + -1'voted_yes_9 + voting_0 + -1'voting_9 = 0
invariant :voted_no_5 + -1'voted_no_9 + voted_yes_5 + -1'voted_yes_9 + voting_5 + -1'voting_9 = 0
invariant :ready_0 + voted_no_9 + voted_yes_9 + voting_9 = 1
invariant :voted_no_7 + -1'voted_no_9 + voted_yes_7 + -1'voted_yes_9 + voting_7 + -1'voting_9 = 0
12 unique states visited
10 strongly connected components in search stack
13 transitions explored
10 items max in DFS search stack
19 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.58693,23644,1,0,169,19473,95,179,2686,35288,619
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("(ready_0>=2)")))
Formula 8 simplified : !G"(ready_0>=2)"
Computing Next relation with stutter on 1024 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.589618,23908,1,0,169,19473,101,179,2688,35288,624
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F("((((((((((voted_yes_0+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)>=2)"))))
Formula 9 simplified : !GF"((((((((((voted_yes_0+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)>=2)"
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.614557,23908,1,0,181,20103,110,201,2744,36666,689
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(F("((((((((((voted_no_0+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)>=3)")))U(("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)")U("(ready_0>=3)"))))
Formula 10 simplified : !(F"((((((((((voted_no_0+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)>=3)" U ("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)" U "(ready_0>=3)"))
Computing Next relation with stutter on 1024 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 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.664831,24424,1,0,217,22145,117,248,2749,41076,849
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F("(ready_0>=3)"))))
Formula 11 simplified : !GF"(ready_0>=3)"
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.669754,24424,1,0,217,22145,121,248,2749,41076,854
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(F("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=1)")))U("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)")))
Formula 12 simplified : !(XF"((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=1)" U "((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=2)")
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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.672331,24688,1,0,217,22145,127,248,2760,41076,863
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(X("((((((((((voted_yes_0+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)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))")))U(("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=3)")U("(ready_0<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))"))))
Formula 13 simplified : !(XX"((((((((((voted_yes_0+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)<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))" U ("((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)>=3)" U "(ready_0<=(((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9))"))
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
0 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.682833,24688,1,0,217,22145,138,248,2795,41076,878
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("((((((((((voted_yes_0+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)<=ready_0)")U("(ready_0>=2)")))
Formula 14 simplified : !("((((((((((voted_yes_0+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)<=ready_0)" U "(ready_0>=2)")
Computing Next relation with stutter on 1024 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.705421,24688,1,0,250,23357,148,284,2846,44233,975
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(X(X("(ready_0>=2)")))))
Formula 15 simplified : !XXX"(ready_0>=2)"
Computing Next relation with stutter on 1024 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.71258,24884,1,0,251,23406,148,285,2846,44285,983
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1528290019795

--------------------
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/ -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/ -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 12:59:55 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/, -smt]
Jun 06, 2018 12:59:55 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 12:59:55 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 21682 ms
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Dot->ready,
Voters->voted_no,voted_yes,voting,

Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 06, 2018 1:00:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Jun 06, 2018 1:00:17 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 06, 2018 1:00:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Jun 06, 2018 1:00:17 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Jun 06, 2018 1:00:18 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 21 transitions.
Jun 06, 2018 1:00:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 14 ms
Jun 06, 2018 1:00:18 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 1:00:18 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 739ms 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-COL-0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-COL-0010.tgz
mv Referendum-COL-0010 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 itstools"
echo " Input is Referendum-COL-0010, 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 r188-qhx2-152732140200097"
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 '' LTLCardinality.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 ;