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-158961510900330.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510900330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.7K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 08:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.5K Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-0010-00
FORMULA_NAME Referendum-COL-0010-01
FORMULA_NAME Referendum-COL-0010-02
FORMULA_NAME Referendum-COL-0010-03
FORMULA_NAME Referendum-COL-0010-04
FORMULA_NAME Referendum-COL-0010-05
FORMULA_NAME Referendum-COL-0010-06
FORMULA_NAME Referendum-COL-0010-07
FORMULA_NAME Referendum-COL-0010-08
FORMULA_NAME Referendum-COL-0010-09
FORMULA_NAME Referendum-COL-0010-10
FORMULA_NAME Referendum-COL-0010-11
FORMULA_NAME Referendum-COL-0010-12
FORMULA_NAME Referendum-COL-0010-13
FORMULA_NAME Referendum-COL-0010-14
FORMULA_NAME Referendum-COL-0010-15

=== Now, execution of the tool begins

BK_START 1590100152294

[2020-05-21 22:29:15] [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-21 22:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 22:29:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 22:29:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1088 ms
[2020-05-21 22:29:16] [INFO ] sort/places :
Voters->voted_no,voted_yes,voting,
Dot->ready,

[2020-05-21 22:29:16] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 19 ms.
[2020-05-21 22:29:16] [INFO ] Computed order based on color domains.
[2020-05-21 22:29:16] [INFO ] Unfolded HLPN to a Petri net with 31 places and 21 transitions in 7 ms.
[2020-05-21 22:29:16] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 523 ms. (steps per millisecond=191 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 21 rows 31 cols
[2020-05-21 22:29:17] [INFO ] Computed 10 place invariants in 6 ms
[2020-05-21 22:29:17] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-21 22:29:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-21 22:29:17] [INFO ] Flatten gal took : 51 ms
FORMULA Referendum-COL-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 22:29:17] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 22:29:17] [INFO ] Applying decomposition
[2020-05-21 22:29:17] [INFO ] Flatten gal took : 12 ms
[2020-05-21 22:29:17] [INFO ] Input system was already deterministic with 21 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/graph4156764877033488031.txt, -o, /tmp/graph4156764877033488031.bin, -w, /tmp/graph4156764877033488031.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/graph4156764877033488031.bin, -l, -1, -v, -w, /tmp/graph4156764877033488031.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 21 rows 31 cols
[2020-05-21 22:29:17] [INFO ] Computed 10 place invariants in 2 ms
inv : ready_0 + voted_no_6 + voted_yes_6 + voting_6 = 1
inv : ready_0 + voted_no_2 + voted_yes_2 + voting_2 = 1
inv : ready_0 + voted_no_1 + voted_yes_1 + voting_1 = 1
inv : ready_0 + voted_no_7 + voted_yes_7 + voting_7 = 1
inv : ready_0 + voted_no_8 + voted_yes_8 + voting_8 = 1
inv : ready_0 + voted_no_0 + voted_yes_0 + voting_0 = 1
inv : ready_0 + voted_no_9 + voted_yes_9 + voting_9 = 1
inv : ready_0 + voted_no_3 + voted_yes_3 + voting_3 = 1
inv : ready_0 + voted_no_5 + voted_yes_5 + voting_5 = 1
inv : ready_0 + voted_no_4 + voted_yes_4 + voting_4 = 1
Total of 10 invariants.
[2020-05-21 22:29:17] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-21 22:29:18] [INFO ] Decomposing Gal with order
[2020-05-21 22:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 22:29:18] [INFO ] Flatten gal took : 71 ms
[2020-05-21 22:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-21 22:29:18] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-21 22:29:18] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 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]
[2020-05-21 22:29:18] [INFO ] Proved 31 variables to be positive in 171 ms
[2020-05-21 22:29:18] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2020-05-21 22:29:18] [INFO ] Computation of disable matrix completed :0/21 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:29:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 22:29:18] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2020-05-21 22:29:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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 14 LTL properties
Checking formula 0 : !((G((!(X(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))&&((!(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))||("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))")))))
Formula 0 simplified : !G(!XF"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" & ("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))" | !F"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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.045062,16436,1,0,397,95,248,276,87,110,927
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))U(X(G(!(X((F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))&&("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))))))
Formula 1 simplified : !(X"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U XG!X("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" & F"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
0 strongly connected components in search stack
22 transitions explored
12 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.072678,17836,1,0,997,95,250,920,87,110,2102
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(G(X("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))||(!(F((("(u3.ready_0>=1)")U("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))||("(u3.ready_0>=1)"))))))
Formula 2 simplified : !(!GX"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" | !F("(u3.ready_0>=1)" | ("(u3.ready_0>=1)" U "((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
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.075648,17836,1,0,1049,95,254,982,87,110,2207
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(F(!((!(G(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))U("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))))))
Formula 3 simplified : !X!F!(!GF"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U "((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.079301,18048,1,0,1049,95,254,983,87,110,2210
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(F(G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))))
Formula 4 simplified : GFG"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
22 unique states visited
0 strongly connected components in search stack
23 transitions explored
12 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.084577,18048,1,0,1116,95,254,1063,87,115,2434
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(G((X("(u3.ready_0>=1)"))&&(("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))")||((("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")U("(u3.ready_0>=1)"))&&("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))))))
Formula 5 simplified : !GFG(X"(u3.ready_0>=1)" & ("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))" | ("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" & ("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U "(u3.ready_0>=1)"))))
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
12 strongly connected components in search stack
14 transitions explored
13 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.096127,18324,1,0,1167,95,279,1213,88,119,3260
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-0010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")U(F(X(F(("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")U(G((G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))U("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))))))))))
Formula 6 simplified : !FXF("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U FXF("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U G(G"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" U "((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.100925,18512,1,0,1167,95,286,1213,88,119,3277
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(((F(!(X("(u3.ready_0>=1)"))))U(X("(u3.ready_0>=1)")))U(X("(u3.ready_0>=1)")))))
Formula 7 simplified : !G((F!X"(u3.ready_0>=1)" U X"(u3.ready_0>=1)") U X"(u3.ready_0>=1)")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.103374,18512,1,0,1167,95,311,1213,88,119,3304
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(!(X(!(((G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))&&("(u3.ready_0>=1)"))U("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))"))))))))
Formula 8 simplified : !FX!X!(("(u3.ready_0>=1)" & G"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))") U "((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))")
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106761,18512,1,0,1167,95,317,1267,88,119,3367
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(((((((((((G(((((((((((X("(u3.ready_0>=1)"))||("(u1.voting_0>=1)"))||("(u2.voting_1>=1)"))||("(u3.voting_2>=1)"))||("(u4.voting_3>=1)"))||("(u5.voting_4>=1)"))||("(u0.voting_5>=1)"))||("(u6.voting_6>=1)"))||("(u7.voting_7>=1)"))||("(u8.voting_8>=1)"))||("(u9.voting_9>=1)")))||("(u1.voting_0>=1)"))||("(u2.voting_1>=1)"))||("(u3.voting_2>=1)"))||("(u4.voting_3>=1)"))||("(u5.voting_4>=1)"))||("(u0.voting_5>=1)"))||("(u6.voting_6>=1)"))||("(u7.voting_7>=1)"))||("(u8.voting_8>=1)"))||("(u9.voting_9>=1)")))||(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))
Formula 9 simplified : !(G("(u0.voting_5>=1)" | "(u1.voting_0>=1)" | "(u2.voting_1>=1)" | "(u3.voting_2>=1)" | "(u4.voting_3>=1)" | "(u5.voting_4>=1)" | "(u6.voting_6>=1)" | "(u7.voting_7>=1)" | "(u8.voting_8>=1)" | "(u9.voting_9>=1)" | G("(u0.voting_5>=1)" | "(u1.voting_0>=1)" | "(u2.voting_1>=1)" | "(u3.voting_2>=1)" | "(u4.voting_3>=1)" | "(u5.voting_4>=1)" | "(u6.voting_6>=1)" | "(u7.voting_7>=1)" | "(u8.voting_8>=1)" | "(u9.voting_9>=1)" | X"(u3.ready_0>=1)")) | F"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
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.181209,20276,1,0,1167,95,427,1267,90,119,3538
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))
Formula 10 simplified : F"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
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.185271,20276,1,0,1167,95,427,1269,90,119,3543
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G((((G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))&&("(u3.ready_0>=1)"))||(!(X(X("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))))||("(u3.ready_0<1)")))))
Formula 11 simplified : G("(u3.ready_0<1)" | ("(u3.ready_0>=1)" & G"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))") | !XX"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.191085,20276,1,0,1167,95,442,1269,92,119,3585
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F(("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")||((G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))&&("(u3.ready_0>=1)"))))U(!(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))))
Formula 12 simplified : !(F("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))" | ("(u3.ready_0>=1)" & G"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")) U !F"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.196389,20276,1,0,1169,95,444,1331,92,119,3624
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(((((((((((!(G("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))")))||("(u1.voting_0>=1)"))||("(u2.voting_1>=1)"))||("(u3.voting_2>=1)"))||("(u4.voting_3>=1)"))||("(u5.voting_4>=1)"))||("(u0.voting_5>=1)"))||("(u6.voting_6>=1)"))||("(u7.voting_7>=1)"))||("(u8.voting_8>=1)"))||("(u9.voting_9>=1)")))U(("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))")U("((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))))
Formula 13 simplified : !(X("(u0.voting_5>=1)" | "(u1.voting_0>=1)" | "(u2.voting_1>=1)" | "(u3.voting_2>=1)" | "(u4.voting_3>=1)" | "(u5.voting_4>=1)" | "(u6.voting_6>=1)" | "(u7.voting_7>=1)" | "(u8.voting_8>=1)" | "(u9.voting_9>=1)" | !G"((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))") U ("((((((((((u1.voting_0<1)&&(u2.voting_1<1))&&(u3.voting_2<1))&&(u4.voting_3<1))&&(u5.voting_4<1))&&(u0.voting_5<1))&&(u6.voting_6<1))&&(u7.voting_7<1))&&(u8.voting_8<1))&&(u9.voting_9<1))" U "((((((((((u1.voting_0>=1)||(u2.voting_1>=1))||(u3.voting_2>=1))||(u4.voting_3>=1))||(u5.voting_4>=1))||(u0.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u9.voting_9>=1))"))
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
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.246625,20276,1,0,1169,95,472,1331,92,119,3650
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 22:29:18] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-21 22:29:18] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-21 22:29:18] [WARNING] Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store s0 25 (+ (select s0 25) 1)) 23 (+ (select s0 23) 1)) 29 (+ (select s0 29) 1)) 21 (+ (select s0 21) 1)) 30 (+ (select s0 30) 1)) 28 (+ (select s0 28) 1)) 0 (- (select s0 0) 1)) 24 (+ (select s0 24) 1)) 27 (+ (select s0 27) 1)) 22 (+ (select s0 22) 1)) 26 (+ (select s0 26) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store s0 25 (+ (select s0 25) 1)) 23 (+ (select s0 23) 1)) 29 (+ (select s0 29) 1)) 21 (+ (select s0 21) 1)) 30 (+ (select s0 30) 1)) 28 (+ (select s0 28) 1)) 0 (- (select s0 0) 1)) 24 (+ (select s0 24) 1)) 27 (+ (select s0 27) 1)) 22 (+ (select s0 22) 1)) 26 (+ (select s0 26) 1)) s1))")
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-21 22:29:18] [INFO ] Built C files in 771ms 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 1590100159657

--------------------
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-COL-0010"
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-COL-0010, 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-158961510900330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0010.tgz
mv Referendum-COL-0010 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 ;