About the Execution of ITS-Tools for Referendum-PT-0015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.100 | 24337.00 | 35602.00 | 414.40 | FTTFTFFFFTFFFTTF | 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-158961511000402.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961511000402
=====================================================================
--------------------
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 1590119113772
[2020-05-22 03:45:16] [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:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 03:45:16] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-05-22 03:45:16] [INFO ] Transformed 46 places.
[2020-05-22 03:45:16] [INFO ] Transformed 31 transitions.
[2020-05-22 03:45:16] [INFO ] Found NUPN structural information;
[2020-05-22 03:45:16] [INFO ] Parsed PT model containing 46 places and 31 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 5 steps, including 0 resets, run visited all 21 properties in 2 ms. (steps per millisecond=2 )
[2020-05-22 03:45:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 03:45:17] [INFO ] Flatten gal took : 50 ms
FORMULA Referendum-PT-0015-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 03:45:17] [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:17] [INFO ] Applying decomposition
[2020-05-22 03:45:17] [INFO ] Flatten gal took : 26 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/graph8626727627787558614.txt, -o, /tmp/graph8626727627787558614.bin, -w, /tmp/graph8626727627787558614.weights], workingDir=null]
[2020-05-22 03:45:17] [INFO ] Input system was already deterministic with 31 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8626727627787558614.bin, -l, -1, -v, -w, /tmp/graph8626727627787558614.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 03:45:17] [INFO ] Decomposing Gal with order
[2020-05-22 03:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 03:45:17] [INFO ] Flatten gal took : 49 ms
[2020-05-22 03:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 03:45:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-22 03:45:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 31 rows 46 cols
[2020-05-22 03:45:17] [INFO ] Computed 15 place invariants in 9 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.
its-ltl command run as :
[2020-05-22 03:45:17] [INFO ] Computed 15 place invariants in 14 ms
/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 14 LTL properties
Checking formula 0 : !((G(X(!(F((X("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))||((!(G("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))&&("(u14.ready==1)"))))))))
Formula 0 simplified : !GX!F(X"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))" | ("(u14.ready==1)" & !G"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
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.045519,17140,1,0,489,63,309,498,82,72,1358
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 : !((X(("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")U(F(X(!(G(!(G((((((((((((((((G(!(F("(u14.ready==1)"))))||("(u0.voting_1==1)"))||("(u10.voting_2==1)"))||("(u11.voting_3==1)"))||("(u12.voting_4==1)"))||("(u1.voting_5==1)"))||("(u2.voting_6==1)"))||("(u3.voting_7==1)"))||("(u4.voting_8==1)"))||("(u5.voting_9==1)"))||("(u6.voting_10==1)"))||("(u13.voting_11==1)"))||("(u7.voting_12==1)"))||("(u8.voting_13==1)"))||("(u9.voting_14==1)"))||("(u14.voting_15==1)")))))))))))
Formula 1 simplified : !X("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))" U FX!G!G("(u0.voting_1==1)" | "(u1.voting_5==1)" | "(u2.voting_6==1)" | "(u3.voting_7==1)" | "(u4.voting_8==1)" | "(u5.voting_9==1)" | "(u6.voting_10==1)" | "(u7.voting_12==1)" | "(u8.voting_13==1)" | "(u9.voting_14==1)" | "(u10.voting_2==1)" | "(u11.voting_3==1)" | "(u12.voting_4==1)" | "(u13.voting_11==1)" | "(u14.voting_15==1)" | G!F"(u14.ready==1)"))
[2020-05-22 03:45:18] [INFO ] Proved 46 variables to be positive in 228 ms
[2020-05-22 03:45:18] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2020-05-22 03:45:18] [INFO ] Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:18] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2020-05-22 03:45:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:19] [INFO ] Computing symmetric co enabling matrix : 31 transitions.
[2020-05-22 03:45:19] [INFO ] Computation of Finished co-enabling matrix. took 621 ms. Total solver calls (SAT/UNSAT): 45(15/30)
[2020-05-22 03:45:19] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2020-05-22 03:45:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 03:45:19] [INFO ] Built C files in 2232ms 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]
Compilation finished in 817 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(((LTLAP0==true))U(<>(X(!( [](!( [](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( [](!( <>((LTLAP1==true))) )) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) ) || ( (LTLAP10==true)) ) || ( (LTLAP11==true)) ) || ( (LTLAP12==true)) ) || ( (LTLAP13==true)) ) || ( (LTLAP14==true)) ) || ( (LTLAP15==true)) ) || ( (LTLAP16==true)) )) )) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Computing Next relation with stutter on 32768 deadlock states
18 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 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,18.9526,58360,1,0,5003,63,485,2734,88,74,6947
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(((X(G("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))||(F("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))U(X("(u14.ready==1)"))))))
Formula 2 simplified : X((XG"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))" | F"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))") U X"(u14.ready==1)")
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
0 strongly connected components in search stack
33 transitions explored
19 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,18.9758,58360,1,0,5731,63,496,3958,88,74,8823
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 : !(((!(X(F("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))))U((!(G("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))&&("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))))
Formula 3 simplified : !(!XF"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))" U ("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))" & !G"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.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
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,18.9801,58360,1,0,5731,63,496,3958,88,74,8854
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 : !((X(G(F(!(F((("(u14.ready==1)")U("(u14.ready==1)"))&&(G("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))))))))
Formula 4 simplified : !XGF!F("(u14.ready==1)" & G"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==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
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,18.9858,58360,1,0,5812,63,499,4082,88,74,9236
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F("(u14.ready==1)"))))
Formula 5 simplified : !GF"(u14.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,18.9868,58360,1,0,5812,63,503,4082,88,74,9257
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0015-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X((G(((G("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))&&("(u14.ready==1)"))U("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))&&(F(("(u14.ready==1)")U("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))))))
Formula 6 simplified : !FX(G(("(u14.ready==1)" & G"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))") U "(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))") & F("(u14.ready==1)" U "(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))"))
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
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,18.9927,58360,1,0,5867,63,512,4277,88,74,9495
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0015-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(G((("(u14.ready==1)")U("(u14.ready==1)"))&&(X("(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")))))))
Formula 7 simplified : !XFG("(u14.ready==1)" & X"(((((((((((((((u0.voting_1==1)||(u10.voting_2==1))||(u11.voting_3==1))||(u12.voting_4==1))||(u1.voting_5==1))||(u2.voting_6==1))||(u3.voting_7==1))||(u4.voting_8==1))||(u5.voting_9==1))||(u6.voting_10==1))||(u13.voting_11==1))||(u7.voting_12==1))||(u8.voting_13==1))||(u9.voting_14==1))||(u14.voting_15==1))")
Computing Next relation with stutter on 32768 deadlock states
16 unique states visited
16 strongly connected components in search stack
16 transitions explored
16 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,18.9944,58360,1,0,5867,63,519,4279,88,74,9514
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0015-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G((G("(u14.ready==1)"))||(!(F("(u14.ready==1)")))))&&(!(X("((u0.voting_1==1)&&(u14.ready!=1))")))))
Formula 8 simplified : !(G(G"(u14.ready==1)" | !F"(u14.ready==1)") & !X"((u0.voting_1==1)&&(u14.ready!=1))")
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
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,18.9965,58360,1,0,5867,63,524,4279,88,74,9532
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0015-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("((u14.ready==1)||(u13.voting_11==1))"))U(X("(u14.ready==1)"))))
Formula 9 simplified : !(F"((u14.ready==1)||(u13.voting_11==1))" U X"(u14.ready==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,18.9999,58360,1,0,5896,63,539,4347,88,74,9776
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((("(u9.voting_14==1)")U("(u11.voting_3==1)"))||(X(G("(u11.voting_3==1)")))))
Formula 10 simplified : !(("(u9.voting_14==1)" U "(u11.voting_3==1)") | XG"(u11.voting_3==1)")
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
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,19.0034,58360,1,0,5958,63,561,4512,88,74,10080
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0015-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G("(u9.voting_14==1)"))))
Formula 11 simplified : !XG"(u9.voting_14==1)"
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
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,19.0066,58360,1,0,6034,63,581,4756,88,74,10475
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0015-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X((X("(u6.voting_10==1)"))U("((u14.ready==1)||(u6.voting_10==1))")))&&(F("(u14.ready==1)"))))
Formula 12 simplified : !(X(X"(u6.voting_10==1)" U "((u14.ready==1)||(u6.voting_10==1))") & F"(u14.ready==1)")
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
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,19.0083,58360,1,0,6034,63,594,4756,88,74,10490
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(!(X((F(G(X(F("(u0.voting_1==1)")))))||(G("(u9.voting_14==1)")))))))
Formula 13 simplified : !F!X(FGXF"(u0.voting_1==1)" | G"(u9.voting_14==1)")
Computing Next relation with stutter on 32768 deadlock states
33 unique states visited
0 strongly connected components in search stack
34 transitions explored
17 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,19.0376,58360,1,0,6889,63,642,6851,88,74,13406
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1590119138109
--------------------
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-0015"
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-0015, 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-158961511000402"
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 [ "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 '
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 ;