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-158961511000401.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-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961511000401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 9.1K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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 13K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 9 21:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K 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-PT-0015-00
FORMULA_NAME Referendum-PT-0015-01
FORMULA_NAME Referendum-PT-0015-02
FORMULA_NAME Referendum-PT-0015-03
FORMULA_NAME Referendum-PT-0015-04
FORMULA_NAME Referendum-PT-0015-05
FORMULA_NAME Referendum-PT-0015-06
FORMULA_NAME Referendum-PT-0015-07
FORMULA_NAME Referendum-PT-0015-08
FORMULA_NAME Referendum-PT-0015-09
FORMULA_NAME Referendum-PT-0015-10
FORMULA_NAME Referendum-PT-0015-11
FORMULA_NAME Referendum-PT-0015-12
FORMULA_NAME Referendum-PT-0015-13
FORMULA_NAME Referendum-PT-0015-14
FORMULA_NAME Referendum-PT-0015-15

=== Now, execution of the tool begins

BK_START 1590119102042

[2020-05-22 03:45:04] [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-22 03:45:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 03:45:05] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-22 03:45:05] [INFO ] Transformed 46 places.
[2020-05-22 03:45:05] [INFO ] Transformed 31 transitions.
[2020-05-22 03:45:05] [INFO ] Found NUPN structural information;
[2020-05-22 03:45:05] [INFO ] Parsed PT model containing 46 places and 31 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 488 ms. (steps per millisecond=204 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 31 rows 46 cols
[2020-05-22 03:45:05] [INFO ] Computed 15 place invariants in 6 ms
[2020-05-22 03:45:05] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-05-22 03:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:45:05] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-05-22 03:45:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:45:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned unsat
[2020-05-22 03:45:06] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned unsat
[2020-05-22 03:45:06] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-05-22 03:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:45:06] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-22 03:45:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:45:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned unsat
[2020-05-22 03:45:06] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-05-22 03:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 03:45:06] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-22 03:45:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 03:45:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-05-22 03:45:06] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 03:45:06] [INFO ] Flatten gal took : 55 ms
FORMULA Referendum-PT-0015-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 03:45:06] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 03:45:06] [INFO ] Applying decomposition
[2020-05-22 03:45:06] [INFO ] Flatten gal took : 20 ms
[2020-05-22 03:45:06] [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-22 03:45:07] [INFO ] Computed 15 place invariants in 3 ms
inv : ready + voting_3 + voted_yes_3 + voted_no_3 = 1
inv : ready + voting_2 + voted_yes_2 + voted_no_2 = 1
inv : ready + voting_10 + voted_yes_10 + voted_no_10 = 1
inv : ready + voting_12 + voted_yes_12 + voted_no_12 = 1
inv : ready + voting_4 + voted_yes_4 + voted_no_4 = 1
inv : ready + voting_11 + voted_yes_11 + voted_no_11 = 1
inv : ready + voting_14 + voted_yes_14 + voted_no_14 = 1
inv : ready + voting_13 + voted_yes_13 + voted_no_13 = 1
inv : ready + voting_1 + voted_yes_1 + voted_no_1 = 1
inv : ready + voting_15 + voted_yes_15 + voted_no_15 = 1
inv : ready + voting_7 + voted_yes_7 + voted_no_7 = 1
inv : ready + voting_9 + voted_yes_9 + voted_no_9 = 1
inv : ready + voting_5 + voted_yes_5 + voted_no_5 = 1
inv : ready + voting_6 + voted_yes_6 + voted_no_6 = 1
inv : ready + voting_8 + voted_yes_8 + voted_no_8 = 1
Total of 15 invariants.
[2020-05-22 03:45:07] [INFO ] Computed 15 place invariants in 4 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/graph9153170057700641924.txt, -o, /tmp/graph9153170057700641924.bin, -w, /tmp/graph9153170057700641924.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/graph9153170057700641924.bin, -l, -1, -v, -w, /tmp/graph9153170057700641924.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 03:45:07] [INFO ] Decomposing Gal with order
[2020-05-22 03:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 03:45:07] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-22 03:45:07] [INFO ] Proved 46 variables to be positive in 252 ms
[2020-05-22 03:45:07] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2020-05-22 03:45:07] [INFO ] Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:07] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2020-05-22 03:45:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:07] [INFO ] Flatten gal took : 63 ms
[2020-05-22 03:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-22 03:45:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-22 03:45:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 4 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 12 LTL properties
Checking formula 0 : !((G(!(X((X("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))"))&&("(((((((((((((((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_15)<=((((((((((((((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.voting_15))"))))))
Formula 0 simplified : !G!X("(((((((((((((((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_15)<=((((((((((((((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.voting_15))" & X"(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))")
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
111 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.12858,32484,1,0,123,55565,34,134,4969,114325,380
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0015-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X("(((((((((((((((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.voting_15)<=((((((((((((((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_15))"))))
Formula 1 simplified : !GX"(((((((((((((((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.voting_15)<=((((((((((((((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_15))"
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
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.14087,32712,1,0,137,56862,40,162,5029,116205,440
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0015-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((X(X(F(!(G("(((((((((((((((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)+gu1.voted_yes_15)>=3)"))))))||("(((((((((((((((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)+gu1.voted_yes_15)>=2)"))))
Formula 2 simplified : !F("(((((((((((((((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)+gu1.voted_yes_15)>=2)" | XXF!G"(((((((((((((((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)+gu1.voted_yes_15)>=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
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.1448,33256,1,0,137,56862,54,162,5091,116206,448
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((G(X(!(G(F("(((((((((((((((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_15)<=((((((((((((((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)+gu1.voted_yes_15))"))))))&&(X("(((((((((((((((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.voting_15)>=1)")))&&("(((((((((((((((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_15)<=((((((((((((((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)+gu1.voted_yes_15))"))))
Formula 3 simplified : !F("(((((((((((((((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_15)<=((((((((((((((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)+gu1.voted_yes_15))" & GX!GF"(((((((((((((((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_15)<=((((((((((((((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)+gu1.voted_yes_15))" & X"(((((((((((((((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.voting_15)>=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
88 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.03009,48800,1,0,293,109786,67,312,8056,249064,787
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(X(G(X(G(!((G("(((((((((((((((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)+gu1.voted_yes_15)>=2)"))U(X("(((((((((((((((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.voting_15)<=((((((((((((((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_15))")))))))))))
Formula 4 simplified : !GFXGXG!(G"(((((((((((((((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)+gu1.voted_yes_15)>=2)" U X"(((((((((((((((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.voting_15)<=((((((((((((((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_15))")
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
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.04603,50164,1,0,293,109799,67,314,8310,249763,840
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0015-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))")U((F("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))"))U(("(gu2.ready<=((((((((((((((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_15))")U("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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.voting_15))")))))&&(X(("(gu2.ready<=((((((((((((((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_15))")U(F("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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.voting_15))"))))))
Formula 5 simplified : !(F("(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))" U (F"(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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_15))" U ("(gu2.ready<=((((((((((((((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_15))" U "(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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.voting_15))"))) & X("(gu2.ready<=((((((((((((((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_15))" U F"(((((((((((((((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)+gu1.voted_yes_15)<=((((((((((((((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.voting_15))"))
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.0487,50424,1,0,293,109799,76,314,8340,249763,844
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(F(G(X("((gu2.voted_no_15==0)||(gu2.ready==1))")))))))
Formula 6 simplified : XFGX"((gu2.voted_no_15==0)||(gu2.ready==1))"
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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.04978,50424,1,0,294,109799,85,316,8346,249766,857
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0015-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(F(G(X(((("(((gu0.voting_8==0)||(gu2.voted_no_9==1))&&(gu2.ready==1))")U(X("((gu0.voting_8==0)||(gu2.voted_no_9==1))")))&&("(gu2.voted_no_13!=0)"))&&("(gu2.ready!=1)"))))))))
Formula 7 simplified : !XXFGX("(gu2.ready!=1)" & "(gu2.voted_no_13!=0)" & ("(((gu0.voting_8==0)||(gu2.voted_no_9==1))&&(gu2.ready==1))" U X"((gu0.voting_8==0)||(gu2.voted_no_9==1))"))
Computing Next relation with stutter on 32768 deadlock states
20 unique states visited
19 strongly connected components in search stack
22 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,2.05976,50560,1,0,310,110470,95,361,8351,251901,959
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0015-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(!(X("((gu2.ready==0)||(gu1.voted_yes_9==1))"))))&&((F("((gu2.ready==0)||(gu1.voted_yes_9==1))"))U(G("((((gu2.ready!=0)&&(gu0.voting_10!=1))||(gu2.voted_no_4==0))||(gu0.voting_5==1))")))))
Formula 8 simplified : !(X!X"((gu2.ready==0)||(gu1.voted_yes_9==1))" & (F"((gu2.ready==0)||(gu1.voted_yes_9==1))" U G"((((gu2.ready!=0)&&(gu0.voting_10!=1))||(gu2.voted_no_4==0))||(gu0.voting_5==1))"))
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.07538,50780,1,0,352,112094,106,392,8373,255770,1047
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("((gu2.ready!=0)&&(gu1.voted_yes_6!=1))")U(X(G("((gu2.ready==0)||(gu1.voted_yes_6==1))")))))
Formula 9 simplified : !("((gu2.ready!=0)&&(gu1.voted_yes_6!=1))" U XG"((gu2.ready==0)||(gu1.voted_yes_6==1))")
Computing Next relation with stutter on 32768 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 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,2.09084,51300,1,0,364,112904,123,419,8382,259020,1205
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!((((F("((gu2.ready==0)||(gu0.voting_12==1))"))||("(gu2.ready==0)"))||("(gu2.voted_no_9==1)"))U(F((G("((gu2.ready==0)||(gu1.voted_yes_2==1))"))U(G(X(X("((gu2.ready==0)||(gu0.voting_12==1))"))))))))))
Formula 10 simplified : !X!(("(gu2.ready==0)" | "(gu2.voted_no_9==1)" | F"((gu2.ready==0)||(gu0.voting_12==1))") U F(G"((gu2.ready==0)||(gu1.voted_yes_2==1))" U GXX"((gu2.ready==0)||(gu0.voting_12==1))"))
Computing Next relation with stutter on 32768 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 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.09416,51556,1,0,364,112904,132,419,8386,259020,1211
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0015-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((!(X(X(!(G("((gu0.voting_14!=0)&&(gu1.voted_yes_13!=1))"))))))U("(gu2.voted_no_15!=1)"))))
Formula 11 simplified : !G(!XX!G"((gu0.voting_14!=0)&&(gu1.voted_yes_13!=1))" U "(gu2.voted_no_15!=1)")
Computing Next relation with stutter on 32768 deadlock states
18 unique states visited
18 strongly connected components in search stack
19 transitions explored
18 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,2.0962,51816,1,0,379,112916,142,447,8394,259075,1296
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0015-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 03:45:09] [INFO ] Computing symmetric co enabling matrix : 31 transitions.
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
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-22 03:45:09] [INFO ] Built C files in 2830ms 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 1590119110815

--------------------
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-PT-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-PT-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-158961511000401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;