fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r141-smll-158961511000410
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Referendum-PT-0020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.920 6058.00 14688.00 514.10 FTTTFTFTFFTFFFFF 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-158961511000410.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-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961511000410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K Apr 12 08:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 12 08:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 09:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 11 09:50 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 11K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 10 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 10 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 9 21:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.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 23K 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-0020-00
FORMULA_NAME Referendum-PT-0020-01
FORMULA_NAME Referendum-PT-0020-02
FORMULA_NAME Referendum-PT-0020-03
FORMULA_NAME Referendum-PT-0020-04
FORMULA_NAME Referendum-PT-0020-05
FORMULA_NAME Referendum-PT-0020-06
FORMULA_NAME Referendum-PT-0020-07
FORMULA_NAME Referendum-PT-0020-08
FORMULA_NAME Referendum-PT-0020-09
FORMULA_NAME Referendum-PT-0020-10
FORMULA_NAME Referendum-PT-0020-11
FORMULA_NAME Referendum-PT-0020-12
FORMULA_NAME Referendum-PT-0020-13
FORMULA_NAME Referendum-PT-0020-14
FORMULA_NAME Referendum-PT-0020-15

=== Now, execution of the tool begins

BK_START 1590119222054

[2020-05-22 03:47:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 03:47:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 03:47:05] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-05-22 03:47:05] [INFO ] Transformed 61 places.
[2020-05-22 03:47:05] [INFO ] Transformed 41 transitions.
[2020-05-22 03:47:05] [INFO ] Found NUPN structural information;
[2020-05-22 03:47:05] [INFO ] Parsed PT model containing 61 places and 41 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4545 resets, run finished after 446 ms. (steps per millisecond=224 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 41 rows 61 cols
[2020-05-22 03:47:05] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-22 03:47:05] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned unsat
[2020-05-22 03:47:05] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 03:47:06] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-22 03:47:06] [INFO ] Flatten gal took : 60 ms
FORMULA Referendum-PT-0020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 03:47:06] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 03:47:06] [INFO ] Applying decomposition
[2020-05-22 03:47:06] [INFO ] Flatten gal took : 15 ms
[2020-05-22 03:47:06] [INFO ] Input system was already deterministic with 41 transitions.
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/graph126779504300449113.txt, -o, /tmp/graph126779504300449113.bin, -w, /tmp/graph126779504300449113.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/graph126779504300449113.bin, -l, -1, -v, -w, /tmp/graph126779504300449113.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 41 rows 61 cols
[2020-05-22 03:47:06] [INFO ] Computed 20 place invariants in 3 ms
inv : ready + voted_no_15 + voted_yes_15 + voting_15 = 1
inv : ready + voted_no_14 + voted_yes_14 + voting_14 = 1
inv : ready + voted_no_7 + voted_yes_7 + voting_7 = 1
inv : ready + voted_no_6 + voted_yes_6 + voting_6 = 1
inv : ready + voted_no_13 + voted_yes_13 + voting_13 = 1
inv : ready + voted_no_9 + voted_yes_9 + voting_9 = 1
inv : ready + voted_no_8 + voted_yes_8 + voting_8 = 1
inv : ready + voted_no_12 + voted_yes_12 + voting_12 = 1
inv : ready + voted_no_10 + voted_yes_10 + voting_10 = 1
inv : ready + voted_no_2 + voted_yes_2 + voting_2 = 1
inv : ready + voted_no_11 + voted_yes_11 + voting_11 = 1
inv : ready + voted_no_19 + voted_yes_19 + voting_19 = 1
inv : ready + voted_no_20 + voted_yes_20 + voting_20 = 1
inv : ready + voted_no_4 + voted_yes_4 + voting_4 = 1
[2020-05-22 03:47:06] [INFO ] Decomposing Gal with order
inv : ready + voted_no_5 + voted_yes_5 + voting_5 = 1
inv : ready + voted_no_1 + voted_yes_1 + voting_1 = 1
inv : ready + voted_no_3 + voted_yes_3 + voting_3 = 1
inv : ready + voted_no_16 + voted_yes_16 + voting_16 = 1
inv : ready + voted_no_18 + voted_yes_18 + voting_18 = 1
inv : ready + voted_no_17 + voted_yes_17 + voting_17 = 1
Total of 20 invariants.
[2020-05-22 03:47:06] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-22 03:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 03:47:06] [INFO ] Flatten gal took : 57 ms
[2020-05-22 03:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 03:47:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-22 03:47:06] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !(((!(X("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")))&&(G("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))"))))
Formula 0 simplified : !(!X"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))" & G"((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))")
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.043098,17040,1,0,1311,81,501,934,84,95,2671
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(G(X("(u3.ready==1)"))))||(G((G("(u3.ready==1)"))||("(u3.ready==1)")))))
Formula 1 simplified : !(!GX"(u3.ready==1)" | G("(u3.ready==1)" | G"(u3.ready==1)"))
Computing Next relation with stutter on 1.04858e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.044077,17040,1,0,1311,81,506,934,86,95,2690
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(X(X(G((F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))U("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))))))||(!(F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")))))
Formula 2 simplified : !(FXXG(F"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))" U "((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))") | !F"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.056789,17992,1,0,2104,81,514,1847,86,95,4078
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0020-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")U("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))"))||(F(G((F("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))"))U(F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))))))))
Formula 3 simplified : !G(("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))" U "((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))") | FG(F"((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))" U F"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))
Computing Next relation with stutter on 1.04858e+06 deadlock states
22 unique states visited
0 strongly connected components in search stack
22 transitions explored
22 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.079415,19192,1,0,3537,81,519,3647,86,102,7463
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X((!(G((G("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))"))||(F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")))))||("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))")))))
Formula 4 simplified : !XX("((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))" | !G(G"((((((((((((((((((((u3.voting_1!=1)&&(u5.voting_3!=1))&&(u4.voting_2!=1))&&(u6.voting_5!=1))&&(u0.voting_4!=1))&&(u8.voting_7!=1))&&(u7.voting_6!=1))&&(u9.voting_9!=1))&&(u1.voting_8!=1))&&(u2.voting_11!=1))&&(u10.voting_10!=1))&&(u12.voting_13!=1))&&(u11.voting_12!=1))&&(u14.voting_15!=1))&&(u13.voting_14!=1))&&(u16.voting_17!=1))&&(u15.voting_16!=1))&&(u18.voting_19!=1))&&(u17.voting_18!=1))&&(u19.voting_20!=1))" | F"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))
Computing Next relation with stutter on 1.04858e+06 deadlock states
[2020-05-22 03:47:06] [INFO ] Proved 61 variables to be positive in 254 ms
25 unique states visited
24 strongly connected components in search stack
26 transitions explored
24 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106635,20388,1,0,6164,81,595,5903,86,102,12637
an accepting run exists (use option '-e' to print it)
[2020-05-22 03:47:06] [INFO ] Computing symmetric may disable matrix : 41 transitions.
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0020-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(F((X(("(u3.ready==1)")U(!(F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))")))))&&("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))))))
Formula 5 simplified : !F!F("((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))" & X("(u3.ready==1)" U !F"((((((((((((((((((((u3.voting_1==1)||(u5.voting_3==1))||(u4.voting_2==1))||(u6.voting_5==1))||(u0.voting_4==1))||(u8.voting_7==1))||(u7.voting_6==1))||(u9.voting_9==1))||(u1.voting_8==1))||(u2.voting_11==1))||(u10.voting_10==1))||(u12.voting_13==1))||(u11.voting_12==1))||(u14.voting_15==1))||(u13.voting_14==1))||(u16.voting_17==1))||(u15.voting_16==1))||(u18.voting_19==1))||(u17.voting_18==1))||(u19.voting_20==1))"))
[2020-05-22 03:47:06] [INFO ] Computation of disable matrix completed :0/41 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 1.04858e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.107113,20388,1,0,6164,81,595,5903,86,102,12637
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(F("(u11.voting_12==1)")))U((F((X("(u2.voting_11==1)"))&&(X("(u17.voting_18!=1)"))))&&("(u7.voting_6==1)"))))
Formula 6 simplified : !(GF"(u11.voting_12==1)" U ("(u7.voting_6==1)" & F(X"(u2.voting_11==1)" & X"(u17.voting_18!=1)")))
Computing Next relation with stutter on 1.04858e+06 deadlock states
[2020-05-22 03:47:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:47:06] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2020-05-22 03:47:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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,0.124963,21000,1,0,7528,81,672,7377,86,102,15250
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0020-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(X(!(F("(u4.voting_2!=1)")))))))
Formula 7 simplified : GX!F"(u4.voting_2!=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.131092,21264,1,0,8443,81,715,8158,86,102,16847
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((G("(u4.voting_2==1)"))||("(u3.ready!=1)")))))
Formula 8 simplified : X("(u3.ready!=1)" | G"(u4.voting_2==1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.132462,21528,1,0,8443,81,719,8158,86,102,16886
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F((!(("(u13.voting_14==1)")U(G("(u3.ready==1)"))))&&("(u3.ready!=1)")))))
Formula 9 simplified : F("(u3.ready!=1)" & !("(u13.voting_14==1)" U G"(u3.ready==1)"))
Computing Next relation with stutter on 1.04858e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.140637,21768,1,0,9077,81,822,8749,90,103,18241
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0020-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((X(X(X("(u14.voting_15!=1)"))))&&(X("(u3.ready==1)")))&&(F("(u14.voting_15==1)"))))
Formula 10 simplified : !(XXX"(u14.voting_15!=1)" & X"(u3.ready==1)" & F"(u14.voting_15==1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.142443,21768,1,0,9077,81,834,8749,90,103,18258
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0020-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 03:47:06] [WARNING] Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store s0 60 (+ (select s0 60) 1)) 46 (+ (select s0 46) 1)) 57 (+ (select s0 57) 1)) 58 (+ (select s0 58) 1)) 47 (+ (select s0 47) 1)) 42 (+ (select s0 42) 1)) 59 (+ (select s0 59) 1)) 56 (+ (select s0 56) 1)) 52 (+ (select s0 52) 1)) 41 (+ (select s0 41) 1)) 0 (- (select s0 0) 1)) 44 (+ (select s0 44) 1)) 50 (+ (select s0 50) 1)) 49 (+ (select s0 49) 1)) 43 (+ (select s0 43) 1)) 51 (+ (select s0 51) 1)) 53 (+ (select s0 53) 1)) 54 (+ (select s0 54) 1)) 55 (+ (select s0 55) 1)) 45 (+ (select s0 45) 1)) 48 (+ (select s0 48) 1)) s1))) with error
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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:47:06] [INFO ] Built C files in 481ms 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 1590119228112

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -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-0020"
export BK_EXAMINATION="LTLFireability"
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-0020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r141-smll-158961511000410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;