About the Execution of ITS-Tools for Referendum-COL-0015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.560 | 11935.00 | 24987.00 | 1276.40 | FFTFFTTTFFTTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510900337.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510900337
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.6K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.7K Mar 24 05:38 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-COL-0015-00
FORMULA_NAME Referendum-COL-0015-01
FORMULA_NAME Referendum-COL-0015-02
FORMULA_NAME Referendum-COL-0015-03
FORMULA_NAME Referendum-COL-0015-04
FORMULA_NAME Referendum-COL-0015-05
FORMULA_NAME Referendum-COL-0015-06
FORMULA_NAME Referendum-COL-0015-07
FORMULA_NAME Referendum-COL-0015-08
FORMULA_NAME Referendum-COL-0015-09
FORMULA_NAME Referendum-COL-0015-10
FORMULA_NAME Referendum-COL-0015-11
FORMULA_NAME Referendum-COL-0015-12
FORMULA_NAME Referendum-COL-0015-13
FORMULA_NAME Referendum-COL-0015-14
FORMULA_NAME Referendum-COL-0015-15
=== Now, execution of the tool begins
BK_START 1590100359946
[2020-05-21 22:32:42] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 22:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 22:32:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 22:32:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1232 ms
[2020-05-21 22:32:44] [INFO ] sort/places :
Dot->ready,
Voters->voting,voted_yes,voted_no,
[2020-05-21 22:32:44] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 20 ms.
[2020-05-21 22:32:44] [INFO ] Computed order based on color domains.
[2020-05-21 22:32:44] [INFO ] Unfolded HLPN to a Petri net with 46 places and 31 transitions in 8 ms.
[2020-05-21 22:32:44] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 834 ms. (steps per millisecond=119 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 31 rows 46 cols
[2020-05-21 22:32:45] [INFO ] Computed 15 place invariants in 8 ms
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned unsat
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned unsat
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned unsat
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned unsat
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-05-21 22:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:32:46] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-21 22:32:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 22:32:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-05-21 22:32:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 22:32:46] [INFO ] Flatten gal took : 51 ms
FORMULA Referendum-COL-0015-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 22:32:46] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 22:32:47] [INFO ] Applying decomposition
[2020-05-21 22:32:47] [INFO ] Flatten gal took : 17 ms
[2020-05-21 22:32:47] [INFO ] Input system was already deterministic with 31 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 31 rows 46 cols
[2020-05-21 22:32:47] [INFO ] Computed 15 place invariants in 19 ms
inv : voting_6 + voted_yes_6 + voted_no_6 + ready_0 = 1
inv : voting_9 + voted_yes_9 + voted_no_9 + ready_0 = 1
inv : voting_8 + voted_yes_8 + voted_no_8 + ready_0 = 1
inv : voting_7 + voted_yes_7 + voted_no_7 + ready_0 = 1
inv : voting_4 + voted_yes_4 + voted_no_4 + ready_0 = 1
inv : voting_5 + voted_yes_5 + voted_no_5 + ready_0 = 1
inv : voting_3 + voted_yes_3 + voted_no_3 + ready_0 = 1
inv : voting_2 + voted_yes_2 + voted_no_2 + ready_0 = 1
inv : voting_0 + voted_yes_0 + voted_no_0 + ready_0 = 1
inv : voting_1 + voted_yes_1 + voted_no_1 + ready_0 = 1
inv : voting_13 + voted_yes_13 + voted_no_13 + ready_0 = 1
inv : voting_10 + voted_yes_10 + voted_no_10 + ready_0 = 1
inv : voting_11 + voted_yes_11 + voted_no_11 + ready_0 = 1
inv : voting_12 + voted_yes_12 + voted_no_12 + ready_0 = 1
inv : voting_14 + voted_yes_14 + voted_no_14 + ready_0 = 1
Total of 15 invariants.
[2020-05-21 22:32:47] [INFO ] Computed 15 place invariants in 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11845293188813921834.txt, -o, /tmp/graph11845293188813921834.bin, -w, /tmp/graph11845293188813921834.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11845293188813921834.bin, -l, -1, -v, -w, /tmp/graph11845293188813921834.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 22:32:47] [INFO ] Decomposing Gal with order
[2020-05-21 22:32:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 22:32:47] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-21 22:32:47] [INFO ] Proved 46 variables to be positive in 224 ms
[2020-05-21 22:32:47] [INFO ] Flatten gal took : 64 ms
[2020-05-21 22:32:47] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2020-05-21 22:32:47] [INFO ] Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:32:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:32:47] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2020-05-21 22:32:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:32:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-21 22:32:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-21 22:32:47] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 13 LTL properties
Checking formula 0 : !((G(!(X((X("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))"))&&("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))"))))))
Formula 0 simplified : !G!X("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))" & X"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 32768 deadlock states
31 unique states visited
14 strongly connected components in search stack
38 transitions explored
18 items max in DFS search stack
104 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,1.07381,32592,1,0,123,55530,34,134,4970,113479,380
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0015-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))"))))
Formula 1 simplified : !GX"(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))"
Computing Next relation with stutter on 32768 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,1.08564,32820,1,0,137,56827,40,162,5030,115359,440
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-COL-0015-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((X(X(F(!(G("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=3)"))))))||("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)"))))
Formula 2 simplified : !F("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)" | XXF!G"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=3)")
Computing Next relation with stutter on 32768 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,1.09026,33120,1,0,137,56827,54,162,5092,115361,448
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((G(X(!(G(F("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"))))))&&(X("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)>=1)")))&&("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"))))
Formula 3 simplified : !F("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))" & GX!GF"(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))" & X"(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)>=1)")
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
84 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,1.92666,48812,1,0,293,109747,67,312,8057,246293,787
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(X(G(X(G(!((G("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)"))U(X("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")))))))))))
Formula 4 simplified : !GFXGXG!(G"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)" U X"(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")
Computing Next relation with stutter on 32768 deadlock states
20 unique states visited
19 strongly connected components in search stack
23 transitions explored
20 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,1.94204,49912,1,0,293,109760,67,314,8311,246991,840
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-0015-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")U((F("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))"))U(("(gu0.ready_0<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")U("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))")))))&&(X(("(gu0.ready_0<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")U(F("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))"))))))
Formula 5 simplified : !(F("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" U (F"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" U ("(gu0.ready_0<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" U "(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))"))) & X("(gu0.ready_0<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" U F"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))"))
Computing Next relation with stutter on 32768 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,1.9442,49912,1,0,293,109760,76,314,8341,246991,844
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F((!(F((X(!(X("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)"))))&&(G("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=1)")))))&&("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=gu0.ready_0)")))))
Formula 6 simplified : !XF("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=gu0.ready_0)" & !F(X!X"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)" & G"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=1)"))
Computing Next relation with stutter on 32768 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
21 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,2.14402,55292,1,0,346,125340,99,387,8836,289477,1026
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0015-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")U("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"))U(!(G(X(F("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)")))))))
Formula 7 simplified : !(("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" U "(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))") U !GXF"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>=2)")
Computing Next relation with stutter on 32768 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 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,2.27034,57968,1,0,484,134891,109,548,8955,322968,1383
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0015-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((!(X("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))")))&&(((X(G("(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)>((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))")))||("(gu0.ready_0<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))"))||("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)")))))
Formula 8 simplified : !F(!X"(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))" & ("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)" | "(gu0.ready_0<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))" | XG"(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)>((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"))
Computing Next relation with stutter on 32768 deadlock states
4 unique states visited
0 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,2.29101,58736,1,0,484,134891,147,548,9257,322968,1403
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F("(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"))))
Formula 9 simplified : !XF"(((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)<=((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14))"
Computing Next relation with stutter on 32768 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,2.29194,58736,1,0,484,134891,151,548,9257,322968,1404
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(G("(gu0.ready_0>((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))")))||(G(F("(gu0.ready_0<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))")))))
Formula 10 simplified : !(!G"(gu0.ready_0>((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))" | GF"(gu0.ready_0<=((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14))")
Computing Next relation with stutter on 32768 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,2.29372,58736,1,0,484,134891,163,549,9259,322971,1418
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(!(X((G(X(F(G(F(G("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))")))))))||(X("((((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)||(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)))")))))))
Formula 11 simplified : !G!X(GXFGFG"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14))" | X"((((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)||(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)<=((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)))")
Computing Next relation with stutter on 32768 deadlock states
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 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,2.31509,58736,1,0,485,134897,169,550,9646,323186,1430
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-0015-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(F(X(!(G((G("(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>gu0.ready_0)"))&&(G("(gu0.ready_0>=1)"))))))))U("((((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)&&(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=gu0.ready_0))")))
Formula 12 simplified : !(GFX!G(G"(((((((((((((((gu1.voted_yes_0+gu1.voted_yes_1)+gu1.voted_yes_2)+gu1.voted_yes_3)+gu1.voted_yes_4)+gu1.voted_yes_5)+gu1.voted_yes_6)+gu1.voted_yes_7)+gu1.voted_yes_8)+gu1.voted_yes_9)+gu1.voted_yes_10)+gu1.voted_yes_11)+gu1.voted_yes_12)+gu1.voted_yes_13)+gu1.voted_yes_14)>gu0.ready_0)" & G"(gu0.ready_0>=1)") U "((((((((((((((((gu2.voted_no_0+gu2.voted_no_1)+gu2.voted_no_2)+gu2.voted_no_3)+gu2.voted_no_4)+gu2.voted_no_5)+gu2.voted_no_6)+gu2.voted_no_7)+gu2.voted_no_8)+gu2.voted_no_9)+gu2.voted_no_10)+gu2.voted_no_11)+gu2.voted_no_12)+gu2.voted_no_13)+gu2.voted_no_14)>=2)&&(((((((((((((((gu0.voting_0+gu0.voting_1)+gu0.voting_2)+gu0.voting_3)+gu0.voting_4)+gu0.voting_5)+gu0.voting_6)+gu0.voting_7)+gu0.voting_8)+gu0.voting_9)+gu0.voting_10)+gu0.voting_11)+gu0.voting_12)+gu0.voting_13)+gu0.voting_14)<=gu0.ready_0))")
Computing Next relation with stutter on 32768 deadlock states
18 unique states visited
18 strongly connected components in search stack
18 transitions explored
18 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,2.38548,60312,1,0,526,138271,174,623,9774,331930,1606
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-0015-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 22:32:50] [INFO ] Computing symmetric co enabling matrix : 31 transitions.
[2020-05-21 22:32:50] [INFO ] Computation of co-enabling matrix(2/31) took 70 ms. Total solver calls (SAT/UNSAT): 6(3/3)
[2020-05-21 22:32:50] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-21 22:32:50] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 8) (select s0 23) (select s0 38) (select s0 45)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 8) (select s0 23) (select s0 38) (select s0 45)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 8) (select s0 23) (select s0 38) (select s0 45)))), (assert (>= (select s0 8) 1)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 23) 0)), (assert (>= (select s0 38) 0)), (assert (>= (select s0 45) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@323a4c1
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@323a4c1
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 22:32:50] [INFO ] Built C files in 3556ms conformant to PINS in folder :/home/mcc/execution
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 1590100371881
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLCardinality -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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-0015"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0015, 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 r141-smll-158961510900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0015.tgz
mv Referendum-COL-0015 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;