Path: . Working Copy Root Path: /home/svn/work/civl/0.14/r1680 URL: svn://vsl.cis.udel.edu/civl/tags/0.14 Relative URL: ^/tags/0.14 Repository Root: svn://vsl.cis.udel.edu/civl Repository UUID: fb995dde-84ed-4084-dfe6-e5aef3e2452c Revision: 1680 Node Kind: directory Schedule: normal Last Changed Author: zmanchun Last Changed Rev: 1680 Last Changed Date: 2014-10-31 19:25:17 -0400 (Fri, 31 Oct 2014)
Stdout:
Buildfile: /home/svn/work/civl/0.14/r1680/build.xml
checkCommandParserChanges:
CommandParser:
[move] Moving 1 file to /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/common
[move] Moving 1 file to /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/common
[move] Moving 1 file to /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/common
[move] Moving 1 file to /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/common
compile:
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/bin
[javac] Compiling 380 source files to /home/svn/work/civl/0.14/r1680/bin
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/state/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/omp/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/common/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/kripke/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/seq/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/type/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/dynamic/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/pointer/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/expression/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/concurrency/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/util/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/pthread/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/predicate/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/bundle/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/transform/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/variable/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/gui/common/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/config/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/string/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/statement/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/asserts/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/domain/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/gui/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/scope/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/location/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/model/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/run/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/comm/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/library/civlc/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/semantics/IF/package-info.class
[javac] Creating empty /home/svn/work/civl/0.14/r1680/bin/edu/udel/cis/vsl/civl/log/IF/package-info.class
jar:
[jar] Building jar: /home/svn/work/civl/0.14/r1680/civl.jar
test-init:
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/junit
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/junit/data
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/junit/reports
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/bin-test/regress
test-compile:
[javac] Compiling 14 source files to /home/svn/work/civl/0.14/r1680/bin-test/regress
test-run:
[jacoco:coverage] Enhancing junit with coverage
[junit] Testsuite: edu.udel.cis.vsl.civl.ArithmeticTest
[junit] Tests run: 13, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 31.116 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 110100480
[junit] time (s) : 6.21
[junit] maxProcs : 1
[junit] statesInstantiated : 260
[junit] statesSaved : 51
[junit] statesSeen : 46
[junit] statesMatched : 0
[junit] steps : 75
[junit] transitions : 45
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 361758720
[junit] time (s) : 19.11
[junit] maxProcs : 1
[junit] statesInstantiated : 34422
[junit] statesSaved : 6747
[junit] statesSeen : 6747
[junit] statesMatched : 0
[junit] steps : 12305
[junit] transitions : 6746
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 361758720
[junit] time (s) : 19.76
[junit] maxProcs : 1
[junit] statesInstantiated : 48
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 15
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE)
[junit] Division by zero
[junit] at divisionBad.cvl:12.13-16 "x/y".
[junit] State -1:34742
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | x = I2
[junit] | | | | y = I3
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | z = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, divisionBad.cvl:11.12-13 "{", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/divisionBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 361758720
[junit] time (s) : 20.32
[junit] maxProcs : 0
[junit] statesInstantiated : 13
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/divisionBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 361758720
[junit] time (s) : 21.4
[junit] maxProcs : 1
[junit] statesInstantiated : 672
[junit] statesSaved : 110
[junit] statesSeen : 110
[junit] statesMatched : 0
[junit] steps : 192
[junit] transitions : 109
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] verify -echo examples/arithmetic/math.cvl
[junit]
[junit] y=exp(I2)
[junit] z=exp(I2)
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 361758720
[junit] time (s) : 22.46
[junit] maxProcs : 1
[junit] statesInstantiated : 33
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 23.98
[junit] maxProcs : 1
[junit] statesInstantiated : 892
[junit] statesSaved : 161
[junit] statesSeen : 143
[junit] statesMatched : 0
[junit] steps : 262
[junit] transitions : 142
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 24.64
[junit] maxProcs : 1
[junit] statesInstantiated : 236
[junit] statesSaved : 58
[junit] statesSeen : 39
[junit] statesMatched : 0
[junit] steps : 73
[junit] transitions : 38
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 25.08
[junit] maxProcs : 1
[junit] statesInstantiated : 24
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 295:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert ((*((&((C)[0])+i)))[j]==(*((&((D)[0])+i)))[j])
[junit] Path condition: true
[junit] Assertion: 0 == I7[0][2]*I8[2][0]
[junit]
[junit] at matmatBad.cvl:68.6-33 "$assert(C[i][j] ... )".
[junit] State -1:38390
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | BOUND = 3
[junit] | | | | L = 3
[junit] | | | | M = 3
[junit] | | | | N = 3
[junit] | | | | TILE_SIZE = 2
[junit] | | | | A = I7
[junit] | | | | B = I8
[junit] | | | | C = (real[3][])<(real[3])<I7[0][1]*I8[1][0]+I7[0][2]*I8[2][0]+I7[0][0]*I8[0][0],I7[0][1]*I8[1][1]+I7[0][2]*I8[2][1]+I7[0][0]*I8[0][1],I7[0][1]*I8[1][2]+I7[0][2]*I8[2][2]+I7[0][0]*I8[0][2]>,(real[3])<I7[1][1]*I8[1][0]+I7[1][2]*I8[2][0]+I7[1][0]*I8[0][0],I7[1][1]*I8[1][1]+I7[1][2]*I8[2][1]+I7[1][0]*I8[0][1],I7[1][1]*I8[1][2]+I7[1][2]*I8[2][2]+I7[1][0]*I8[0][2]>,(real[3])<I7[2][1]*I8[1][0]+I7[2][2]*I8[2][0]+I7[2][0]*I8[0][0],I7[2][1]*I8[1][1]+I7[2][2]*I8[2][1]+I7[2][0]*I8[0][1],I7[2][1]*I8[1][2]+I7[2][2]*I8[2][2]+I7[2][0]*I8[0][2]>>
[junit] | | | | D = (real[3][])<(real[3])<I7[0][1]*I8[1][0]+I7[0][0]*I8[0][0],I7[0][1]*I8[1][1]+I7[0][0]*I8[0][1],I7[0][1]*I8[1][2]+I7[0][0]*I8[0][2]>,(real[3])<I7[1][1]*I8[1][0]+I7[1][0]*I8[0][0],I7[1][1]*I8[1][1]+I7[1][0]*I8[0][1],I7[1][1]*I8[1][2]+I7[1][0]*I8[0][2]>,(real[3])<I7[2][1]*I8[1][0]+2*(I7[2][2]*I8[2][0])+I7[2][0]*I8[0][0],I7[2][1]*I8[1][1]+2*(I7[2][2]*I8[2][1])+I7[2][0]*I8[0][1],I7[2][1]*I8[1][2]+2*(I7[2][2]*I8[2][2])+I7[2][0]*I8[0][2]>>
[junit] | | dyscope d67 (id=1, parent=d66, static=4)
[junit] | | | variables
[junit] | | | | j = 0
[junit] | | dyscope d66 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, matmatBad.cvl:68.6-13 "$assert", dyscope=d67]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/matmatBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 382730240
[junit] time (s) : 28.41
[junit] maxProcs : 1
[junit] statesInstantiated : 1791
[junit] statesSaved : 303
[junit] statesSeen : 295
[junit] statesMatched : 0
[junit] steps : 529
[junit] transitions : 294
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/matmatBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 43:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/10*I4[1]+-1/10*I4[2]+-1/10*I4[3]+-1/10*I4[4]+-1/10*I4[5]+-1/10*I4[6]+-1/10*I4[7]+-1/10*I4[8]+-1/10*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:38638
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 10
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/10*I4[1]+1/10*I4[2]+1/10*I4[3]+1/10*I4[4]+1/10*I4[5]+1/10*I4[6]+1/10*I4[7]+1/10*I4[8]+1/10*I4[9]+1/10*I4[0]
[junit] | | | | result2 = 1/10*I4[9]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 10
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/10*I4[9]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/meanBad_0.trace
[junit] Restricting search depth to 42
[junit] Error 1 encountered at depth 39:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/9*I4[1]+-1/9*I4[2]+-1/9*I4[3]+-1/9*I4[4]+-1/9*I4[5]+-1/9*I4[6]+-1/9*I4[7]+-1/9*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:38750
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 9
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/9*I4[1]+1/9*I4[2]+1/9*I4[3]+1/9*I4[4]+1/9*I4[5]+1/9*I4[6]+1/9*I4[7]+1/9*I4[8]+1/9*I4[0]
[junit] | | | | result2 = 1/9*I4[8]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 9
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/9*I4[8]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (39) is less than length of old (43): replacing old with new...
[junit] Restricting search depth to 38
[junit] Error 2 encountered at depth 35:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/8*I4[1]+-1/8*I4[2]+-1/8*I4[3]+-1/8*I4[4]+-1/8*I4[5]+-1/8*I4[6]+-1/8*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:38852
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 8
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/8*I4[1]+1/8*I4[2]+1/8*I4[3]+1/8*I4[4]+1/8*I4[5]+1/8*I4[6]+1/8*I4[7]+1/8*I4[0]
[junit] | | | | result2 = 1/8*I4[7]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 8
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/8*I4[7]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (35) is less than length of old (39): replacing old with new...
[junit] Restricting search depth to 34
[junit] Error 3 encountered at depth 31:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/7*I4[1]+-1/7*I4[2]+-1/7*I4[3]+-1/7*I4[4]+-1/7*I4[5]+-1/7*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:38944
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 7
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/7*I4[1]+1/7*I4[2]+1/7*I4[3]+1/7*I4[4]+1/7*I4[5]+1/7*I4[6]+1/7*I4[0]
[junit] | | | | result2 = 1/7*I4[6]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 7
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/7*I4[6]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (31) is less than length of old (35): replacing old with new...
[junit] Restricting search depth to 30
[junit] Error 4 encountered at depth 27:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/6*I4[1]+-1/6*I4[2]+-1/6*I4[3]+-1/6*I4[4]+-1/6*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:39026
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 6
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/6*I4[1]+1/6*I4[2]+1/6*I4[3]+1/6*I4[4]+1/6*I4[5]+1/6*I4[0]
[junit] | | | | result2 = 1/6*I4[5]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 6
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/6*I4[5]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (27) is less than length of old (31): replacing old with new...
[junit] Restricting search depth to 26
[junit] Error 5 encountered at depth 23:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/5*I4[1]+-1/5*I4[2]+-1/5*I4[3]+-1/5*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:39098
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 5
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/5*I4[1]+1/5*I4[2]+1/5*I4[3]+1/5*I4[4]+1/5*I4[0]
[junit] | | | | result2 = 1/5*I4[4]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 5
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/5*I4[4]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (23) is less than length of old (27): replacing old with new...
[junit] Restricting search depth to 22
[junit] Error 6 encountered at depth 19:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/4*I4[1]+-1/4*I4[2]+-1/4*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:39160
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 4
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/4*I4[1]+1/4*I4[2]+1/4*I4[3]+1/4*I4[0]
[junit] | | | | result2 = 1/4*I4[3]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 4
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/4*I4[3]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (19) is less than length of old (23): replacing old with new...
[junit] Restricting search depth to 18
[junit] Error 7 encountered at depth 15:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == -1/3*I4[1]+-1/3*I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:39212
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 3
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/3*I4[1]+1/3*I4[2]+1/3*I4[0]
[junit] | | | | result2 = 1/3*I4[2]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 3
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/3*I4[2]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (15) is less than length of old (19): replacing old with new...
[junit] Restricting search depth to 14
[junit] Error 8 encountered at depth 11:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (result1==result2)
[junit] Path condition: true
[junit] Assertion: 0 == I4[0]
[junit]
[junit] at meanBad.cvl:30.2-27 "$assert(result1==result2)".
[junit] State -1:39254
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 10
[junit] | | | | n = 2
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | result1 = 1/2*I4[1]+1/2*I4[0]
[junit] | | | | result2 = 1/2*I4[1]
[junit] | | dyscope d7 (id=2, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d6 (id=3, parent=d5, static=6)
[junit] | | | variables
[junit] | | | | result = 1/2*I4[1]
[junit] | | dyscope d5 (id=4, parent=d1, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, meanBad.cvl:30.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (11) is less than length of old (15): replacing old with new...
[junit] Restricting search depth to 10
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 29.41
[junit] maxProcs : 1
[junit] statesInstantiated : 901
[junit] statesSaved : 169
[junit] statesSeen : 143
[junit] statesMatched : 0
[junit] steps : 262
[junit] transitions : 142
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/meanBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 29.84
[junit] maxProcs : 1
[junit] statesInstantiated : 248
[junit] statesSaved : 37
[junit] statesSeen : 37
[junit] statesMatched : 0
[junit] steps : 70
[junit] transitions : 36
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] verify -echo examples/arithmetic/multiplicationInLoopCondition.cvl
[junit]
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 384827392
[junit] time (s) : 32.01
[junit] maxProcs : 1
[junit] statesInstantiated : 710
[junit] statesSaved : 215
[junit] statesSeen : 145
[junit] statesMatched : 0
[junit] steps : 221
[junit] transitions : 144
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.CompareTest
[junit] Tests run: 3, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 20.804 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 50:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert _isEqual
[junit] Path condition: (0 <= I3[0]+-1) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[1]+I3[2]+-1)
[junit] Assertion: 0 == I3[1]+-1*I3[2]
[junit]
[junit] at max.cvl:5.0-18 "$output int result".
[junit] State -1:40680
[junit] | Path condition
[junit] | | (0 <= I3[0]+-1) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[1]+I3[2]+-1)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 3
[junit] | | | | a = I3
[junit] | | | | B = 4
[junit] | | | | BLOCK_SIZE = 2
[junit] | | | | NPROCS = 2
[junit] | | | | result_spec = I3[2]
[junit] | | | | result = I3[1]
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | _isEqual = 0 == I3[1]+-1*I3[2]
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:5.0-7 "$output", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/Composite_max_max_0.trace
[junit] Restricting search depth to 49
[junit] Error 1 encountered at depth 47:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert _isEqual
[junit] Path condition: (0 <= -1*I3[0]) && (0 <= -1*I3[1]+I3[2]+-1) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[2]) && (0 <= -1*I3[1])
[junit] Assertion: 0 == I3[2]
[junit]
[junit] at max.cvl:5.0-18 "$output int result".
[junit] State -1:41191
[junit] | Path condition
[junit] | | (0 <= -1*I3[0]) && (0 <= -1*I3[1]+I3[2]+-1) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[2]) && (0 <= -1*I3[1])
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 3
[junit] | | | | a = I3
[junit] | | | | B = 4
[junit] | | | | BLOCK_SIZE = 2
[junit] | | | | NPROCS = 2
[junit] | | | | result_spec = I3[2]
[junit] | | | | result = 0
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | _isEqual = 0 == I3[2]
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:5.0-7 "$output", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (47) is less than length of old (50): replacing old with new...
[junit] Restricting search depth to 46
[junit] Error 2 encountered at depth 39:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert _isEqual
[junit] Path condition: (0 <= -1*I3[1]) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[0])
[junit] Assertion: 0 == I3[1]
[junit]
[junit] at max.cvl:5.0-18 "$output int result".
[junit] State -1:44252
[junit] | Path condition
[junit] | | (0 <= -1*I3[1]) && (0 <= I3[1]+-1*I3[0]+-1) && (0 <= -1*I3[0])
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 2
[junit] | | | | a = I3
[junit] | | | | B = 4
[junit] | | | | BLOCK_SIZE = 2
[junit] | | | | NPROCS = 2
[junit] | | | | result_spec = I3[1]
[junit] | | | | result = 0
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | _isEqual = 0 == I3[1]
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:5.0-7 "$output", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (39) is less than length of old (47): replacing old with new...
[junit] Restricting search depth to 38
[junit] Error 3 encountered at depth 32:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert _isEqual
[junit] Path condition: 0 <= -1*I3[0]
[junit] Assertion: 0 == I3[0]
[junit]
[junit] at max.cvl:5.0-18 "$output int result".
[junit] State -1:46029
[junit] | Path condition
[junit] | | 0 <= -1*I3[0]
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 1
[junit] | | | | a = I3
[junit] | | | | B = 4
[junit] | | | | BLOCK_SIZE = 2
[junit] | | | | NPROCS = 2
[junit] | | | | result_spec = I3[0]
[junit] | | | | result = 0
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | _isEqual = 0 == I3[0]
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:5.0-7 "$output", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (32) is less than length of old (39): replacing old with new...
[junit] Restricting search depth to 31
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9879
[junit] proverCalls : 294
[junit] memory (bytes) : 384827392
[junit] time (s) : 2.54
[junit] maxProcs : 3
[junit] statesInstantiated : 5786
[junit] statesSaved : 1187
[junit] statesSeen : 1145
[junit] statesMatched : 36
[junit] steps : 1508
[junit] transitions : 1180
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/Composite_max_max_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = NULL
[junit] | | | | a = NULL
[junit] | | | | B = NULL
[junit] | | | | BLOCK_SIZE = NULL
[junit] | | | | NPROCS = NULL
[junit] | | | | result_spec = NULL
[junit] | | | | result = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, max.cvl:2.0-6 "$input", dyscope=d0]
[junit]
[junit] State 0, p0:
[junit] 0->1: N = InitialValue(N) at max.cvl:2.0-12 "$input int N";
[junit] 1->2: a = InitialValue(a) at max.cvl:3.0-15 "$input int a[N]";
[junit] 2->3: B = 4 at max.cvl:4.0-12 "$input int B";
[junit] 3->4: BLOCK_SIZE = 2 at max_par.cvl:3.0-21 "$input int BLOCK_SIZE";
[junit] 4->5: NPROCS = 2 at max_par.cvl:4.0-17 "$input int NPROCS";
[junit] 5->6: result_spec = InitialValue(result_spec) at max.cvl:5.0-18 "$output int result";
[junit] 6->7: result = InitialValue(result) at max.cvl:5.0-18 "$output int result";
[junit] 7->12: system_spec() at max.cvl:10.0-12.1 "void main(){\n result ... }";
[junit] --> State 1
[junit]
[junit] Transition 1: State 1, p0:
[junit] 12->13: $assume ((0<N)&&(N<B)) at max.cvl:6.0-22 "$assume 0 < N && ... B";
[junit] --> State 3
[junit]
[junit] Transition 2: State 3, p0:
[junit] 13->18: result_spec = getMax(&((a)[0]), N) at max.cvl:11.2-23 "result = getMax(a, ... )";
[junit] --> State 4
[junit]
[junit] Transition 3: State 4, p0:
[junit] 18->19: max = *((array+0)) at max_seq.cvl:2.2-20 "int max = array[0]";
[junit] 19->20: i = 1 at max_seq.cvl:4.6-15 "int i = 1";
[junit] --> State 5
[junit]
[junit] Transition 4: State 5, p0:
[junit] 20->24: LOOP_BODY_EXIT at max_seq.cvl:4.17-27 "i < length";
[junit] 24->RET: return max (getMax) at max_seq.cvl:8.2-13 "return max;";
[junit] 14->RET: return (system_spec) at max.cvl:12.0-1 "}";
[junit] 8->15: system_impl() at max.cvl:10.0-12.1 "void main(){\n result ... }";
[junit] --> State 7
[junit]
[junit] Transition 5: State 7, p0:
[junit] 15->16: $assume ((0<N)&&(N<B)) at max.cvl:6.0-22 "$assume 0 < N && ... B";
[junit] --> State 8
[junit]
[junit] Transition 6: State 8, p0:
[junit] 16->25: result = getMax(&((a)[0]), N) at max.cvl:11.2-23 "result = getMax(a, ... )";
[junit] --> State 9
[junit]
[junit] Transition 7: State 9, p0:
[junit] 25->26: myMax = 0 at max_par.cvl:7.2-15 "int myMax = 0";
[junit] 26->27: procs = InitialValue(procs) at max_par.cvl:8.2-21 "$proc procs[NPROCS]";
[junit] 27->28: i = 0 at max_par.cvl:20.6-15 "int i = 0";
[junit] --> State 10
[junit]
[junit] Transition 8: State 10, p0:
[junit] 28->29: LOOP_BODY_ENTER at max_par.cvl:20.17-27 "i < NPROCS";
[junit] --> State 11
[junit]
[junit] Transition 9: State 11, p0:
[junit] 29->30: *((&((procs)[0])+i)) = $spawn max_worker(i) at max_par.cvl:21.4-35 "procs[i] = $spawn ... )";
[junit] 30->28: i = (i+1) at max_par.cvl:20.29-32 "i++";
[junit] --> State 12
[junit]
[junit] Transition 10: State 12, p0:
[junit] 28->29: LOOP_BODY_ENTER at max_par.cvl:20.17-27 "i < NPROCS";
[junit] --> State 13
[junit]
[junit] Transition 11: State 13, p0:
[junit] 29->30: *((&((procs)[0])+i)) = $spawn max_worker(i) at max_par.cvl:21.4-35 "procs[i] = $spawn ... )";
[junit] 30->28: i = (i+1) at max_par.cvl:20.29-32 "i++";
[junit] --> State 14
[junit]
[junit] Transition 12: State 14, p0:
[junit] 28->31: LOOP_BODY_EXIT at max_par.cvl:20.17-27 "i < NPROCS";
[junit] 31->32: i = 0 at max_par.cvl:23.6-15 "int i = 0";
[junit] --> State 15
[junit]
[junit] Transition 13: State 15, p0:
[junit] 32->33: LOOP_BODY_ENTER at max_par.cvl:23.17-27 "i < NPROCS";
[junit] --> State 16
[junit]
[junit] Transition 14: State 16, p1:
[junit] 36->37: i = 0 at max_par.cvl:11.8-17 "int i = 0";
[junit] --> State 17
[junit]
[junit] Transition 15: State 17, p1:
[junit] 37->38: LOOP_BODY_ENTER at max_par.cvl:11.19-33 "i < BLOCK_SIZE";
[junit] 38->39: currentIndex = ((BLOCK_SIZE*id)+i) at max_par.cvl:12.6-44 "int currentIndex = BLOCK_SIZE * ... i";
[junit] --> State 18
[junit]
[junit] Transition 16: State 18, p1:
[junit] 39->40: ELSE_BRANCH at max_par.cvl:15.13-14 ";";
[junit] --> State 19
[junit]
[junit] Transition 17: State 19, p2:
[junit] 36->37: i = 0 at max_par.cvl:11.8-17 "int i = 0";
[junit] --> State 20
[junit]
[junit] Transition 18: State 20, p2:
[junit] 37->38: LOOP_BODY_ENTER at max_par.cvl:11.19-33 "i < BLOCK_SIZE";
[junit] 38->39: currentIndex = ((BLOCK_SIZE*id)+i) at max_par.cvl:12.6-44 "int currentIndex = BLOCK_SIZE * ... i";
[junit] --> State 21
[junit]
[junit] Transition 19: State 21, p2:
[junit] 39->43: IF_BRANCH at max_par.cvl:15.8-13 "break";
[junit] --> State 22
[junit]
[junit] Transition 20: State 22, p2:
[junit] 43->RET: return (max_worker) at max_par.cvl:19.2-3 "}";
[junit] --> State 23
[junit]
[junit] Transition 21: State 23, p1:
[junit] 40->42: ELSE_BRANCH at max_par.cvl:17.35-36 ";";
[junit] --> State 24
[junit]
[junit] Transition 22: State 24, p1:
[junit] 42->37: i = (i+1) at max_par.cvl:11.35-38 "i++";
[junit] --> State 25
[junit]
[junit] Transition 23: State 25, p1:
[junit] 37->38: LOOP_BODY_ENTER at max_par.cvl:11.19-33 "i < BLOCK_SIZE";
[junit] 38->39: currentIndex = ((BLOCK_SIZE*id)+i) at max_par.cvl:12.6-44 "int currentIndex = BLOCK_SIZE * ... i";
[junit] --> State 26
[junit]
[junit] Transition 24: State 26, p1:
[junit] 39->43: IF_BRANCH at max_par.cvl:15.8-13 "break";
[junit] --> State 27
[junit]
[junit] Transition 25: State 27, p1:
[junit] 43->RET: return (max_worker) at max_par.cvl:19.2-3 "}";
[junit] --> State 28
[junit]
[junit] Transition 26: State 28, p0:
[junit] 33->34: $wait(*((&((procs)[0])+i))) at max_par.cvl:24.4-19 "$wait(procs[i])";
[junit] 34->32: i = (i+1) at max_par.cvl:23.29-32 "i++";
[junit] --> State 29
[junit]
[junit] Transition 27: State 29, p0:
[junit] 32->33: LOOP_BODY_ENTER at max_par.cvl:23.17-27 "i < NPROCS";
[junit] --> State 30
[junit]
[junit] Transition 28: State 30, p0:
[junit] 33->34: $wait(*((&((procs)[0])+i))) at max_par.cvl:24.4-19 "$wait(procs[i])";
[junit] 34->32: i = (i+1) at max_par.cvl:23.29-32 "i++";
[junit] --> State 31
[junit]
[junit] Transition 29: State 31, p0:
[junit] 32->35: LOOP_BODY_EXIT at max_par.cvl:23.17-27 "i < NPROCS";
[junit] --> State 32
[junit]
[junit] Transition 30: State 32, p0:
[junit] 35->RET: return myMax (getMax) at max_par.cvl:26.2-15 "return myMax;";
[junit] 17->RET: return (system_impl) at max.cvl:12.0-1 "}";
[junit] --> State 33
[junit]
[junit] Transition 31: State 33, p0:
[junit] 9->10: _isEqual = $equals(&(result_spec), &(result)) at max.cvl:5.0-18 "$output int result";
[junit] Error 0:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert _isEqual
[junit] Path condition: 0 <= -1*I3[0]
[junit] Assertion: 0 == I3[0]
[junit]
[junit] at max.cvl:5.0-18 "$output int result".
[junit] State -1:46229
[junit] | Path condition
[junit] | | 0 <= -1*I3[0]
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 1
[junit] | | | | a = I3
[junit] | | | | B = 4
[junit] | | | | BLOCK_SIZE = 2
[junit] | | | | NPROCS = 2
[junit] | | | | result_spec = I3[0]
[junit] | | | | result = 0
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | _isEqual = 0 == I3[0]
[junit] | | dyscope d2 (id=2, parent=d0, static=2)
[junit] | | | variables
[junit] | | dyscope d3 (id=3, parent=d2, static=5)
[junit] | | | variables
[junit] | | | | array = &<d0>a[0]
[junit] | | | | length = 1
[junit] | | dyscope d4 (id=4, parent=d3, static=8)
[junit] | | | variables
[junit] | | | | max = I3[0]
[junit] | | dyscope d5 (id=5, parent=d4, static=9)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d7 (id=7, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | array = &<d0>a[0]
[junit] | | | | length = 1
[junit] | | dyscope d8 (id=8, parent=d7, static=10)
[junit] | | | variables
[junit] | | | | myMax = 0
[junit] | | | | procs = (process[2])<UNDEFINED,UNDEFINED>
[junit] | | dyscope d9 (id=9, parent=d8, static=12)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d10 (id=10, parent=d8, static=11)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d11 (id=11, parent=d10, static=14)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=12, parent=d8, static=11)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d13 (id=13, parent=d12, static=14)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d14 (id=14, parent=d8, static=13)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d15 (id=15, parent=d11, static=15)
[junit] | | | variables
[junit] | | | | currentIndex = 0
[junit] | | dyscope d16 (id=16, parent=d13, static=15)
[junit] | | | variables
[junit] | | | | currentIndex = 2
[junit] | | dyscope d17 (id=17, parent=d11, static=15)
[junit] | | | variables
[junit] | | | | currentIndex = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:5.0-7 "$output", dyscope=d1]
[junit] | | process - (id=1): null
[junit] | | process - (id=2): null
[junit]
[junit] 10->11: $assert _isEqual at max.cvl:5.0-18 "$output int result";
[junit] 11->RET: return (_CIVL_system) at max.cvl:12.0-1 "}";
[junit] --> State 35
[junit]
[junit] Transition 32: Trace ends after 32 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 131
[junit] proverCalls : 15
[junit] memory (bytes) : 384827392
[junit] time (s) : 2.79
[junit] statesInstantiated : 199
[junit] statesSaved : 36
[junit] maxProcs : 3
[junit]
[junit] Source files:
[junit] f0 : examples/compare/max/max.cvl
[junit] f1 : examples/compare/max/max_seq.cvl
[junit] f2 : examples/compare/max/max_par.cvl
[junit] f3 : civlc.cvh
[junit] f4 : op.h
[junit] f5 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 24
[junit] proverCalls : 0
[junit] memory (bytes) : 381681664
[junit] time (s) : 3.6
[junit] maxProcs : 1
[junit] statesInstantiated : 150
[junit] statesSaved : 17
[junit] statesSeen : 17
[junit] statesMatched : 0
[junit] steps : 45
[junit] transitions : 16
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 1865
[junit] proverCalls : 42
[junit] memory (bytes) : 381681664
[junit] time (s) : 20.81
[junit] maxProcs : 3
[junit] statesInstantiated : 4603
[junit] statesSaved : 467
[junit] statesSeen : 450
[junit] statesMatched : 3
[junit] steps : 896
[junit] transitions : 452
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.ConcurrencyTest
[junit] Tests run: 19, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 46.63 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] 16s: mem=409Mb steps=52617 trans=29718 seen=16321 saved=16326 prove=26
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 430440448
[junit] time (s) : 17.16
[junit] maxProcs : 5
[junit] statesInstantiated : 208275
[junit] statesSaved : 19508
[junit] statesSeen : 19502
[junit] statesMatched : 15487
[junit] steps : 62058
[junit] transitions : 34988
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 430440448
[junit] time (s) : 17.39
[junit] maxProcs : 5
[junit] statesInstantiated : 1534
[junit] statesSaved : 174
[junit] statesSeen : 174
[junit] statesMatched : 51
[junit] steps : 450
[junit] transitions : 224
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 430440448
[junit] time (s) : 17.81
[junit] maxProcs : 5
[junit] statesInstantiated : 1900
[junit] statesSaved : 288
[junit] statesSeen : 284
[junit] statesMatched : 170
[junit] steps : 610
[junit] transitions : 453
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 45:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (seq==par)
[junit] Path condition: true
[junit] Assertion: 0 == I4[2]
[junit]
[junit] at adderBad.cvl:45.2-21 "$assert(seq == par)".
[junit] State -1:263060
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | seq = I4[1]+I4[2]+I4[3]+I4[0]
[junit] | | | | par = I4[1]+I4[3]+I4[0]
[junit] | | dyscope d6 (id=2, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | s = I4[1]+I4[3]+I4[0]
[junit] | | | | workers = (process[4])<UNDEFINED,UNDEFINED,UNDEFINED,UNDEFINED>
[junit] | | dyscope d5 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = &<d0>a[0]
[junit] | | | | n = 4
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, adderBad.cvl:45.2-9 "$assert", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/adderBad_0.trace
[junit] Restricting search depth to 44
[junit] Error 1 encountered at depth 36:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (seq==par)
[junit] Path condition: true
[junit] Assertion: 0 == I4[1]
[junit]
[junit] at adderBad.cvl:45.2-21 "$assert(seq == par)".
[junit] State -1:283481
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | seq = I4[1]+I4[2]+I4[0]
[junit] | | | | par = I4[2]+I4[0]
[junit] | | dyscope d6 (id=2, parent=d17, static=7)
[junit] | | | variables
[junit] | | | | s = I4[2]+I4[0]
[junit] | | | | workers = (process[3])<UNDEFINED,UNDEFINED,UNDEFINED>
[junit] | | dyscope d17 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = &<d0>a[0]
[junit] | | | | n = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, adderBad.cvl:45.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (36) is less than length of old (45): replacing old with new...
[junit] Restricting search depth to 35
[junit] Error 2 encountered at depth 27:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (seq==par)
[junit] Path condition: true
[junit] Assertion: 0 == I4[0]
[junit]
[junit] at adderBad.cvl:45.2-21 "$assert(seq == par)".
[junit] State -1:285463
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | seq = I4[1]+I4[0]
[junit] | | | | par = I4[1]
[junit] | | dyscope d6 (id=2, parent=d27, static=7)
[junit] | | | variables
[junit] | | | | s = I4[1]
[junit] | | | | workers = (process[2])<UNDEFINED,UNDEFINED>
[junit] | | dyscope d27 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = &<d0>a[0]
[junit] | | | | n = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, adderBad.cvl:45.2-9 "$assert", dyscope=d1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (27) is less than length of old (36): replacing old with new...
[junit] Restricting search depth to 26
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 434110464
[junit] time (s) : 21.21
[junit] maxProcs : 5
[junit] statesInstantiated : 22991
[junit] statesSaved : 2763
[junit] statesSeen : 2755
[junit] statesMatched : 1506
[junit] steps : 6719
[junit] transitions : 4260
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/adderBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = NULL
[junit] | | | | N = NULL
[junit] | | | | a = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, adderBad.cvl:8.0-6 "$input", dyscope=d0]
[junit]
[junit] State 0, p0:
[junit] 0->1: B = InitialValue(B) at adderBad.cvl:8.0-12 "$input int B";
[junit] 1->2: N = InitialValue(N) at adderBad.cvl:9.0-12 "$input int N";
[junit] 2->3: $assume ((0<=N)&&(N<=B)) at adderBad.cvl:10.0-20 "$assume 0<=N && N ... B";
[junit] 3->4: a = InitialValue(a) at adderBad.cvl:11.0-18 "$input double a[N]";
[junit] --> State 1
[junit]
[junit] Transition 1: State 1, p0:
[junit] 4->8: seq = adderSeq(&(*((&((a)[0])+0))), N) at adderBad.cvl:42.9-33 "seq = adderSeq(&a[ ... )";
[junit] --> State 2
[junit]
[junit] Transition 2: State 2, p0:
[junit] 8->9: s = 0.0 at adderBad.cvl:14.2-16 "double s = 0.0";
[junit] 9->10: i = 0 at adderBad.cvl:16.7-16 "int i = 0";
[junit] --> State 3
[junit]
[junit] Transition 3: State 3, p0:
[junit] 10->11: LOOP_BODY_ENTER at adderBad.cvl:16.18-23 "i < n";
[junit] --> State 5
[junit]
[junit] Transition 4: State 5, p0:
[junit] 11->12: s = (s+*((p+i))) at adderBad.cvl:17.4-13 "s += p[i]";
[junit] 12->10: i = (i+1) at adderBad.cvl:16.25-28 "i++";
[junit] --> State 6
[junit]
[junit] Transition 5: State 6, p0:
[junit] 10->11: LOOP_BODY_ENTER at adderBad.cvl:16.18-23 "i < n";
[junit] --> State 8
[junit]
[junit] Transition 6: State 8, p0:
[junit] 11->12: s = (s+*((p+i))) at adderBad.cvl:17.4-13 "s += p[i]";
[junit] 12->10: i = (i+1) at adderBad.cvl:16.25-28 "i++";
[junit] --> State 9
[junit]
[junit] Transition 7: State 9, p0:
[junit] 10->13: LOOP_BODY_EXIT at adderBad.cvl:16.18-23 "i < n";
[junit] 13->RET: return s (adderSeq) at adderBad.cvl:19.2-11 "return s;";
[junit] --> State 11
[junit]
[junit] Transition 8: State 11, p0:
[junit] 5->14: par = adderPar(&(*((&((a)[0])+0))), N) at adderBad.cvl:43.9-33 "par = adderPar(&a[ ... )";
[junit] --> State 12
[junit]
[junit] Transition 9: State 12, p0:
[junit] 14->15: s = 0.0 at adderBad.cvl:23.2-16 "double s = 0.0";
[junit] 15->16: workers = InitialValue(workers) at adderBad.cvl:24.2-18 "$proc workers[n]";
[junit] 16->17: j = 0 at adderBad.cvl:34.7-16 "int j = 0";
[junit] --> State 13
[junit]
[junit] Transition 10: State 13, p0:
[junit] 17->18: LOOP_BODY_ENTER at adderBad.cvl:34.18-23 "j < n";
[junit] --> State 14
[junit]
[junit] Transition 11: State 14, p0:
[junit] 18->19: *((&((workers)[0])+j)) = $spawn worker(j) at adderBad.cvl:35.4-33 "workers[j] = $spawn ... )";
[junit] 19->17: j = (j+1) at adderBad.cvl:34.25-28 "j++";
[junit] --> State 15
[junit]
[junit] Transition 12: State 15, p0:
[junit] 17->18: LOOP_BODY_ENTER at adderBad.cvl:34.18-23 "j < n";
[junit] --> State 16
[junit]
[junit] Transition 13: State 16, p0:
[junit] 18->19: *((&((workers)[0])+j)) = $spawn worker(j) at adderBad.cvl:35.4-33 "workers[j] = $spawn ... )";
[junit] 19->17: j = (j+1) at adderBad.cvl:34.25-28 "j++";
[junit] --> State 17
[junit]
[junit] Transition 14: State 17, p0:
[junit] 17->20: LOOP_BODY_EXIT at adderBad.cvl:34.18-23 "j < n";
[junit] 20->21: j = 0 at adderBad.cvl:36.7-16 "int j = 0";
[junit] --> State 18
[junit]
[junit] Transition 15: State 18, p0:
[junit] 21->22: LOOP_BODY_ENTER at adderBad.cvl:36.18-23 "j < n";
[junit] --> State 19
[junit]
[junit] Transition 16: State 19, p1:
[junit] 25->26: t = s at adderBad.cvl:29.4-9 "t = s";
[junit] --> State 20
[junit]
[junit] Transition 17: State 20, p1:
[junit] 26->27: t = (t+*((p+i))) at adderBad.cvl:30.4-13 "t += p[i]";
[junit] --> State 21
[junit]
[junit] Transition 18: State 21, p2:
[junit] 25->26: t = s at adderBad.cvl:29.4-9 "t = s";
[junit] --> State 22
[junit]
[junit] Transition 19: State 22, p2:
[junit] 26->27: t = (t+*((p+i))) at adderBad.cvl:30.4-13 "t += p[i]";
[junit] --> State 23
[junit]
[junit] Transition 20: State 23, p1:
[junit] 27->28: s = t at adderBad.cvl:31.4-9 "s = t";
[junit] 28->RET: return (worker) at adderBad.cvl:32.2-3 "}";
[junit] --> State 24
[junit]
[junit] Transition 21: State 24, p0:
[junit] 22->23: $wait(*((&((workers)[0])+j))) at adderBad.cvl:37.4-21 "$wait(workers[j])";
[junit] 23->21: j = (j+1) at adderBad.cvl:36.25-28 "j++";
[junit] --> State 25
[junit]
[junit] Transition 22: State 25, p0:
[junit] 21->22: LOOP_BODY_ENTER at adderBad.cvl:36.18-23 "j < n";
[junit] --> State 26
[junit]
[junit] Transition 23: State 26, p2:
[junit] 27->28: s = t at adderBad.cvl:31.4-9 "s = t";
[junit] 28->RET: return (worker) at adderBad.cvl:32.2-3 "}";
[junit] --> State 27
[junit]
[junit] Transition 24: State 27, p0:
[junit] 22->23: $wait(*((&((workers)[0])+j))) at adderBad.cvl:37.4-21 "$wait(workers[j])";
[junit] 23->21: j = (j+1) at adderBad.cvl:36.25-28 "j++";
[junit] --> State 28
[junit]
[junit] Transition 25: State 28, p0:
[junit] 21->24: LOOP_BODY_EXIT at adderBad.cvl:36.18-23 "j < n";
[junit] --> State 29
[junit]
[junit] Transition 26: State 29, p0:
[junit] 24->RET: return s (adderPar) at adderBad.cvl:38.2-11 "return s;";
[junit] Error 0:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (seq==par)
[junit] Path condition: 0 <= I2+-2
[junit] Assertion: 0 == I4[0]
[junit]
[junit] at adderBad.cvl:45.2-21 "$assert(seq == par)".
[junit] State -1:285848
[junit] | Path condition
[junit] | | 0 <= I2+-2
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = I2
[junit] | | | | N = 2
[junit] | | | | a = I4
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | seq = I4[1]+I4[0]
[junit] | | | | par = I4[1]
[junit] | | dyscope d2 (id=2, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | p = &<d0>a[0]
[junit] | | | | n = 2
[junit] | | dyscope d3 (id=3, parent=d2, static=5)
[junit] | | | variables
[junit] | | | | s = I4[1]+I4[0]
[junit] | | dyscope d4 (id=4, parent=d3, static=6)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d5 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = &<d0>a[0]
[junit] | | | | n = 2
[junit] | | dyscope d6 (id=6, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | s = I4[1]
[junit] | | | | workers = (process[2])<UNDEFINED,UNDEFINED>
[junit] | | dyscope d7 (id=7, parent=d6, static=9)
[junit] | | | variables
[junit] | | | | j = 2
[junit] | | dyscope d8 (id=8, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d9 (id=9, parent=d8, static=11)
[junit] | | | variables
[junit] | | | | t = I4[0]
[junit] | | dyscope d10 (id=10, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=11, parent=d10, static=11)
[junit] | | | variables
[junit] | | | | t = I4[1]
[junit] | | dyscope d12 (id=12, parent=d6, static=10)
[junit] | | | variables
[junit] | | | | j = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, adderBad.cvl:45.2-9 "$assert", dyscope=d1]
[junit] | | process - (id=1): null
[junit] | | process - (id=2): null
[junit]
[junit] 6->7: $assert (seq==par) at adderBad.cvl:45.2-21 "$assert(seq == par)";
[junit] 7->RET: return (_CIVL_system) at adderBad.cvl:46.0-1 "}";
[junit] --> State 31
[junit]
[junit] Transition 27: Trace ends after 27 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 110
[junit] proverCalls : 25
[junit] memory (bytes) : 434110464
[junit] time (s) : 21.39
[junit] statesInstantiated : 166
[junit] statesSaved : 32
[junit] maxProcs : 3
[junit]
[junit] Source files:
[junit] f0 : examples/concurrency/adderBad.cvl
[junit] f1 : civlc.cvh
[junit] f2 : op.h
[junit] f3 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 434110464
[junit] time (s) : 21.47
[junit] maxProcs : 3
[junit] statesInstantiated : 61
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 2
[junit] steps : 16
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 434110464
[junit] time (s) : 21.72
[junit] maxProcs : 3
[junit] statesInstantiated : 2820
[junit] statesSaved : 434
[junit] statesSeen : 434
[junit] statesMatched : 132
[junit] steps : 871
[junit] transitions : 565
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425197568
[junit] time (s) : 23.55
[junit] maxProcs : 5
[junit] statesInstantiated : 29473
[junit] statesSaved : 2441
[junit] statesSeen : 2435
[junit] statesMatched : 1728
[junit] steps : 9356
[junit] transitions : 4162
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 73:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/diningBad_0.trace
[junit] Restricting search depth to 72
[junit] Error 1 encountered at depth 68:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (68) is less than length of old (73): replacing old with new...
[junit] Restricting search depth to 67
[junit] Error 2 encountered at depth 63:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (63) is less than length of old (68): replacing old with new...
[junit] Restricting search depth to 62
[junit] Error 3 encountered at depth 58:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (58) is less than length of old (63): replacing old with new...
[junit] Restricting search depth to 57
[junit] Error 4 encountered at depth 53:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (53) is less than length of old (58): replacing old with new...
[junit] Restricting search depth to 52
[junit] Error 5 encountered at depth 48:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (48) is less than length of old (53): replacing old with new...
[junit] Restricting search depth to 47
[junit] Error 6 encountered at depth 43:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (43) is less than length of old (48): replacing old with new...
[junit] Restricting search depth to 42
[junit] Error 7 encountered at depth 38:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (38) is less than length of old (43): replacing old with new...
[junit] Restricting search depth to 37
[junit] Error 8 encountered at depth 33:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 78
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = (int[4])<1,1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[4])<p1,p2,p3,p4>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | dyscope d11 (id=9, parent=d10, static=7)
[junit] | | | variables
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope d10 (id=10, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d11]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (33) is less than length of old (38): replacing old with new...
[junit] Restricting search depth to 32
[junit] Error 9 encountered at depth 31:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 180
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 3
[junit] | | | | forks = (int[3])<1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[3])<p1,p2,p3>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 0
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (31) is less than length of old (33): replacing old with new...
[junit] Restricting search depth to 30
[junit] Error 10 encountered at depth 26:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 180
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 3
[junit] | | | | forks = (int[3])<1,1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[3])<p1,p2,p3>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d9 (id=7, parent=d8, static=7)
[junit] | | | variables
[junit] | | | | left = 2
[junit] | | | | right = 0
[junit] | | dyscope d8 (id=8, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d9]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (26) is less than length of old (31): replacing old with new...
[junit] Restricting search depth to 25
[junit] Error 11 encountered at depth 24:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 220
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 2
[junit] | | | | forks = (int[2])<1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[2])<p1,p2>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (24) is less than length of old (26): replacing old with new...
[junit] Restricting search depth to 23
[junit] Error 12 encountered at depth 19:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at diningBad.cvl:34.4-9 "$wait".
[junit] State 220
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | n = 2
[junit] | | | | forks = (int[2])<1,1>
[junit] | | dyscope d12 (id=1, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d1 (id=2, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[2])<p1,p2>
[junit] | | dyscope d5 (id=3, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d7 (id=5, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d12]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (19) is less than length of old (24): replacing old with new...
[junit] Restricting search depth to 18
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425197568
[junit] time (s) : 24.11
[junit] maxProcs : 5
[junit] statesInstantiated : 1929
[junit] statesSaved : 223
[junit] statesSeen : 398
[junit] statesMatched : 158
[junit] steps : 588
[junit] transitions : 555
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/diningBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = NULL
[junit] | | | | n = NULL
[junit] | | | | forks = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, diningBad.cvl:9.0-6 "$input", dyscope=d0]
[junit]
[junit] State 0, p0:
[junit] 0->1: B = InitialValue(B) at diningBad.cvl:9.0-12 "$input int B";
[junit] 1->2: n = InitialValue(n) at diningBad.cvl:10.0-12 "$input int n";
[junit] 2->3: $assume ((2<=n)&&(n<=B)) at diningBad.cvl:11.0-20 "$assume 2<=n && n ... B";
[junit] 3->4: forks = InitialValue(forks) at diningBad.cvl:13.0-12 "int forks[n]";
[junit] 4->5: philosophers = InitialValue(philosophers) at diningBad.cvl:28.2-23 "$proc philosophers[n]";
[junit] 5->6: i = 0 at diningBad.cvl:30.7-16 "int i = 0";
[junit] --> State 1
[junit]
[junit] Transition 1: State 1, p0:
[junit] 6->7: LOOP_BODY_ENTER at diningBad.cvl:30.18-23 "i < n";
[junit] --> State 2
[junit]
[junit] Transition 2: State 2, p0:
[junit] 7->8: *((&((forks)[0])+i)) = 0 at diningBad.cvl:30.30-42 "forks[i] = 0";
[junit] 8->6: i = (i+1) at diningBad.cvl:30.25-28 "i++";
[junit] --> State 3
[junit]
[junit] Transition 3: State 3, p0:
[junit] 6->7: LOOP_BODY_ENTER at diningBad.cvl:30.18-23 "i < n";
[junit] --> State 4
[junit]
[junit] Transition 4: State 4, p0:
[junit] 7->8: *((&((forks)[0])+i)) = 0 at diningBad.cvl:30.30-42 "forks[i] = 0";
[junit] 8->6: i = (i+1) at diningBad.cvl:30.25-28 "i++";
[junit] --> State 5
[junit]
[junit] Transition 5: State 5, p0:
[junit] 6->9: LOOP_BODY_EXIT at diningBad.cvl:30.18-23 "i < n";
[junit] 9->10: i = 0 at diningBad.cvl:31.7-16 "int i = 0";
[junit] --> State 7
[junit]
[junit] Transition 6: State 7, p0:
[junit] 10->11: LOOP_BODY_ENTER at diningBad.cvl:31.18-23 "i < n";
[junit] --> State 8
[junit]
[junit] Transition 7: State 8, p0:
[junit] 11->12: *((&((philosophers)[0])+i)) = $spawn dine(i) at diningBad.cvl:32.4-36 "philosophers[i] = $spawn ... )";
[junit] 12->10: i = (i+1) at diningBad.cvl:31.25-28 "i++";
[junit] --> State 9
[junit]
[junit] Transition 8: State 9, p0:
[junit] 10->11: LOOP_BODY_ENTER at diningBad.cvl:31.18-23 "i < n";
[junit] --> State 10
[junit]
[junit] Transition 9: State 10, p0:
[junit] 11->12: *((&((philosophers)[0])+i)) = $spawn dine(i) at diningBad.cvl:32.4-36 "philosophers[i] = $spawn ... )";
[junit] 12->10: i = (i+1) at diningBad.cvl:31.25-28 "i++";
[junit] --> State 11
[junit]
[junit] Transition 10: State 11, p0:
[junit] 10->13: LOOP_BODY_EXIT at diningBad.cvl:31.18-23 "i < n";
[junit] 13->14: i = 0 at diningBad.cvl:33.7-16 "int i = 0";
[junit] --> State 12
[junit]
[junit] Transition 11: State 12, p0:
[junit] 14->15: LOOP_BODY_ENTER at diningBad.cvl:33.18-23 "i < n";
[junit] --> State 13
[junit]
[junit] Transition 12: State 13, p1:
[junit] 18->19: left = id at diningBad.cvl:16.2-15 "int left = id";
[junit] 19->20: right = ((id+1)%n) at diningBad.cvl:17.2-26 "int right = (id ... n";
[junit] --> State 14
[junit]
[junit] Transition 13: State 14, p1:
[junit] 20->21: LOOP_BODY_ENTER at diningBad.cvl:19.9-10 "1";
[junit] --> State 15
[junit]
[junit] Transition 14: State 15, p2:
[junit] 18->19: left = id at diningBad.cvl:16.2-15 "int left = id";
[junit] 19->20: right = ((id+1)%n) at diningBad.cvl:17.2-26 "int right = (id ... n";
[junit] --> State 16
[junit]
[junit] Transition 15: State 16, p2:
[junit] 20->21: LOOP_BODY_ENTER at diningBad.cvl:19.9-10 "1";
[junit] --> State 17
[junit]
[junit] Transition 16: State 17, p1:
[junit] 21->22: *((&((forks)[0])+left)) = 1 at diningBad.cvl:20.29-44 "forks[left] = 1";
[junit] --> State 18
[junit]
[junit] Transition 17: State 18, p2:
[junit] 21->22: *((&((forks)[0])+left)) = 1 at diningBad.cvl:20.29-44 "forks[left] = 1";
[junit] --> State 19
[junit]
[junit] Transition 18:
[junit] State 19
[junit] | Path condition
[junit] | | 0 <= I2+-2
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = I2
[junit] | | | | n = 2
[junit] | | | | forks = (int[2])<1,1>
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | philosophers = (process[2])<p1,p2>
[junit] | | dyscope d2 (id=2, parent=d1, static=4)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d3 (id=3, parent=d1, static=5)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d4 (id=4, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d5 (id=5, parent=d4, static=7)
[junit] | | | variables
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d7 (id=7, parent=d6, static=7)
[junit] | | | variables
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope d8 (id=8, parent=d1, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=15, diningBad.cvl:34.4-9 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d5]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=22, diningBad.cvl:21.30-42 "forks[right]", dyscope=d7]
[junit]
[junit] Violation of Deadlock found in State 19:
[junit] A deadlock is possible:
[junit] Path condition: 0 <= I2+-2
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 15, diningBad.cvl:34.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 22, diningBad.cvl:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit]
[junit] Trace ends after 18 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 136
[junit] proverCalls : 9
[junit] memory (bytes) : 425197568
[junit] time (s) : 24.24
[junit] statesInstantiated : 116
[junit] statesSaved : 20
[junit] maxProcs : 3
[junit]
[junit] Source files:
[junit] f0 : examples/concurrency/diningBad.cvl
[junit] f1 : civlc.cvh
[junit] f2 : op.h
[junit] f3 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425197568
[junit] time (s) : 24.67
[junit] maxProcs : 3
[junit] statesInstantiated : 4436
[junit] statesSaved : 427
[junit] statesSeen : 427
[junit] statesMatched : 96
[junit] steps : 1290
[junit] transitions : 522
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425197568
[junit] time (s) : 25.41
[junit] maxProcs : 6
[junit] statesInstantiated : 3741
[junit] statesSaved : 642
[junit] statesSeen : 632
[junit] statesMatched : 72
[junit] steps : 1000
[junit] transitions : 703
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 433061888
[junit] time (s) : 25.54
[junit] maxProcs : 3
[junit] statesInstantiated : 224
[junit] statesSaved : 49
[junit] statesSeen : 49
[junit] statesMatched : 0
[junit] steps : 62
[junit] transitions : 48
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 0, waitSelf.cvl:4.1-6 "$wait"
[junit] Enabling predicate: false
[junit] at waitSelf.cvl:4.1-6 "$wait".
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, waitSelf.cvl:4.1-6 "$wait", dyscope=d0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/waitSelf_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 433061888
[junit] time (s) : 25.61
[junit] maxProcs : 0
[junit] statesInstantiated : 6
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 0
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/waitSelf_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 72:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 14, barrierBad.cvl:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] at barrierBad.cvl:44.26-31 "$wait".
[junit] State 74
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<1,1,1,1>
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 4
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d9 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=4, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d12 (id=9, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d9]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d11]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d12]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d7]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/barrierBad_0.trace
[junit] Restricting search depth to 71
[junit] Error 1 encountered at depth 70:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:377698
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,1,0>
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 3
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d11 (id=6, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=7, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=8, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=9, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=24, barrierBad.cvl:21.2-4 "if", dyscope=d11]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] Logging new entry 1, writing trace to CIVLREP/barrierBad_1.trace
[junit] Restricting search depth to 69
[junit] Error 2 encountered at depth 68:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:377744
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,0,0>
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 3
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d11 (id=6, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=7, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=8, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=9, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=22, barrierBad.cvl:19.2-17 "in_barrier[tid]", dyscope=d106]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (68) is less than length of old (70): replacing old with new...
[junit] Restricting search depth to 67
[junit] Error 3 encountered at depth 66:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:377794
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,0,0>
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d11 (id=6, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=7, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=8, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=9, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d11]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (66) is less than length of old (68): replacing old with new...
[junit] Restricting search depth to 65
[junit] Error 4 encountered at depth 64:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:377918
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,0,0>
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d11 (id=6, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=7, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=8, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=9, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=24, barrierBad.cvl:21.2-4 "if", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=29, barrierBad.cvl:23.4-18 "num_in_barrier", dyscope=d11]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (64) is less than length of old (66): replacing old with new...
[junit] Restricting search depth to 63
[junit] Error 5 encountered at depth 62:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:379058
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,0,1>
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 3
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=9, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=24, barrierBad.cvl:21.2-4 "if", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (62) is less than length of old (64): replacing old with new...
[junit] Restricting search depth to 61
[junit] Error 6 encountered at depth 60:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:379469
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,1,1>
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=9, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=24, barrierBad.cvl:21.2-4 "if", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (60) is less than length of old (62): replacing old with new...
[junit] Restricting search depth to 59
[junit] Error 7 encountered at depth 58:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:380149
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,0,1,1>
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=9, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=22, barrierBad.cvl:19.2-17 "in_barrier[tid]", dyscope=d997]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (58) is less than length of old (60): replacing old with new...
[junit] Restricting search depth to 57
[junit] Error 8 encountered at depth 56:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:381115
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,0,1,1>
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 1
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=9, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (56) is less than length of old (58): replacing old with new...
[junit] Restricting search depth to 55
[junit] Error 9 encountered at depth 54:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:381260
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = (process[4])<p1,p2,p3,p4>
[junit] | | | | in_barrier = (int[4])<0,1,1,1>
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 1
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d7 (id=8, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | dyscope d13 (id=9, parent=d12, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d12 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit] | | process p4(id=4)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d13]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (54) is less than length of old (56): replacing old with new...
[junit] Restricting search depth to 53
[junit] Error 10 encountered at depth 52:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:445100
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = (process[3])<p1,p2,p3>
[junit] | | | | in_barrier = (int[3])<0,0,0>
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=22, barrierBad.cvl:19.2-17 "in_barrier[tid]", dyscope=d997]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (52) is less than length of old (54): replacing old with new...
[junit] Restricting search depth to 51
[junit] Error 11 encountered at depth 50:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:445150
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = (process[3])<p1,p2,p3>
[junit] | | | | in_barrier = (int[3])<0,0,0>
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 1
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=6, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (50) is less than length of old (52): replacing old with new...
[junit] Restricting search depth to 49
[junit] Error 12 encountered at depth 47:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:445571
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = (process[3])<p1,p2,p3>
[junit] | | | | in_barrier = (int[3])<0,0,1>
[junit] | | | | num_in_barrier = 4
[junit] | | | | counter = 1
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d419 (id=4, parent=d10, static=8)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d10 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=7, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=8, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d419]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (47) is less than length of old (50): replacing old with new...
[junit] Restricting search depth to 46
[junit] Error 13 encountered at depth 45:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (counter==N)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at barrierBad.cvl:34.4-25 "$assert(counter == N)".
[junit] State -1:445695
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = (process[3])<p1,p2,p3>
[junit] | | | | in_barrier = (int[3])<0,1,1>
[junit] | | | | num_in_barrier = 4
[junit] | | | | counter = 1
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=3, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d419 (id=4, parent=d10, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d10 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | dyscope d415 (id=7, parent=d11, static=8)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d11 (id=8, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=37, barrierBad.cvl:34.4-11 "$assert", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d419]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d5]
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=27, barrierBad.cvl:22.28-41 "in_barrier[i]", dyscope=d415]
[junit] | | | | Frame[function=run, location=34, barrierBad.cvl:31.4-11 "barrier", dyscope=d6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (45) is less than length of old (47): replacing old with new...
[junit] Restricting search depth to 44
[junit] Error 14 encountered at depth 40:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 14, barrierBad.cvl:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] at barrierBad.cvl:44.26-31 "$wait".
[junit] State 13733
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | threads = (process[2])<p1,p2>
[junit] | | | | in_barrier = (int[2])<1,1>
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 2
[junit] | | dyscope d8 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=2, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d9 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=4, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d10 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d8]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d9]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d10]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (40) is less than length of old (72): replacing old with new...
[junit] Restricting search depth to 39
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 426246144
[junit] time (s) : 39.55
[junit] maxProcs : 5
[junit] statesInstantiated : 126785
[junit] statesSaved : 13979
[junit] statesSeen : 13989
[junit] statesMatched : 13810
[junit] steps : 39706
[junit] transitions : 27798
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/barrierBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = NULL
[junit] | | | | N = NULL
[junit] | | | | threads = NULL
[junit] | | | | in_barrier = NULL
[junit] | | | | num_in_barrier = NULL
[junit] | | | | counter = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, barrierBad.cvl:6.0-6 "$input", dyscope=d0]
[junit]
[junit] State 0, p0:
[junit] 0->1: B = InitialValue(B) at barrierBad.cvl:6.0-12 "$input int B";
[junit] 1->2: N = InitialValue(N) at barrierBad.cvl:7.0-12 "$input int N";
[junit] 2->3: $assume ((1<=N)&&(N<=B)) at barrierBad.cvl:8.0-20 "$assume 1<=N && N ... B";
[junit] 3->4: threads = InitialValue(threads) at barrierBad.cvl:9.0-16 "$proc threads[N]";
[junit] 4->5: in_barrier = InitialValue(in_barrier) at barrierBad.cvl:10.0-17 "int in_barrier[N]";
[junit] 5->6: num_in_barrier = 0 at barrierBad.cvl:11.0-22 "int num_in_barrier = 0";
[junit] 6->7: counter = 0 at barrierBad.cvl:12.0-15 "int counter = 0";
[junit] 7->17: init() at barrierBad.cvl:42.2-8 "init()";
[junit] --> State 1
[junit]
[junit] Transition 1: State 1, p0:
[junit] 17->18: i = 0 at barrierBad.cvl:15.7-14 "int i=0";
[junit] --> State 2
[junit]
[junit] Transition 2: State 2, p0:
[junit] 18->19: LOOP_BODY_ENTER at barrierBad.cvl:15.16-19 "i<N";
[junit] --> State 3
[junit]
[junit] Transition 3: State 3, p0:
[junit] 19->20: *((&((in_barrier)[0])+i)) = 0 at barrierBad.cvl:15.26-43 "in_barrier[i] = 0";
[junit] 20->18: i = (i+1) at barrierBad.cvl:15.21-24 "i++";
[junit] --> State 4
[junit]
[junit] Transition 4: State 4, p0:
[junit] 18->19: LOOP_BODY_ENTER at barrierBad.cvl:15.16-19 "i<N";
[junit] --> State 6
[junit]
[junit] Transition 5: State 6, p0:
[junit] 19->20: *((&((in_barrier)[0])+i)) = 0 at barrierBad.cvl:15.26-43 "in_barrier[i] = 0";
[junit] 20->18: i = (i+1) at barrierBad.cvl:15.21-24 "i++";
[junit] --> State 7
[junit]
[junit] Transition 6: State 7, p0:
[junit] 18->21: LOOP_BODY_EXIT at barrierBad.cvl:15.16-19 "i<N";
[junit] 21->RET: return (init) at barrierBad.cvl:16.0-1 "}";
[junit] 8->9: i = 0 at barrierBad.cvl:43.7-14 "int i=0";
[junit] --> State 9
[junit]
[junit] Transition 7: State 9, p0:
[junit] 9->10: LOOP_BODY_ENTER at barrierBad.cvl:43.16-19 "i<N";
[junit] --> State 10
[junit]
[junit] Transition 8: State 10, p0:
[junit] 10->11: *((&((threads)[0])+i)) = $spawn run(i) at barrierBad.cvl:43.26-52 "threads[i] = $spawn ... )";
[junit] 11->9: i = (i+1) at barrierBad.cvl:43.21-24 "i++";
[junit] --> State 11
[junit]
[junit] Transition 9: State 11, p0:
[junit] 9->10: LOOP_BODY_ENTER at barrierBad.cvl:43.16-19 "i<N";
[junit] --> State 12
[junit]
[junit] Transition 10: State 12, p0:
[junit] 10->11: *((&((threads)[0])+i)) = $spawn run(i) at barrierBad.cvl:43.26-52 "threads[i] = $spawn ... )";
[junit] 11->9: i = (i+1) at barrierBad.cvl:43.21-24 "i++";
[junit] --> State 13
[junit]
[junit] Transition 11: State 13, p0:
[junit] 9->12: LOOP_BODY_EXIT at barrierBad.cvl:43.16-19 "i<N";
[junit] 12->13: i = 0 at barrierBad.cvl:44.7-14 "int i=0";
[junit] --> State 14
[junit]
[junit] Transition 12: State 14, p0:
[junit] 13->14: LOOP_BODY_ENTER at barrierBad.cvl:44.16-19 "i<N";
[junit] --> State 15
[junit]
[junit] Transition 13: State 15, p1:
[junit] 32->33: LOOP_BODY_ENTER at barrierBad.cvl:29.9-14 "$true";
[junit] --> State 16
[junit]
[junit] Transition 14: State 16, p2:
[junit] 32->33: LOOP_BODY_ENTER at barrierBad.cvl:29.9-14 "$true";
[junit] --> State 17
[junit]
[junit] Transition 15: State 17, p1:
[junit] 33->34: $assert (counter==0) at barrierBad.cvl:30.4-25 "$assert(counter == 0)";
[junit] 34->22: barrier(tid) at barrierBad.cvl:31.4-16 "barrier(tid)";
[junit] --> State 18
[junit]
[junit] Transition 16: State 18, p1:
[junit] 22->23: *((&((in_barrier)[0])+tid)) = 1 at barrierBad.cvl:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 19
[junit]
[junit] Transition 17: State 19, p1:
[junit] 23->24: num_in_barrier = (num_in_barrier+1) at barrierBad.cvl:20.2-18 "num_in_barrier++";
[junit] --> State 20
[junit]
[junit] Transition 18: State 20, p1:
[junit] 24->30: ELSE_BRANCH at barrierBad.cvl:24.2-3 "}";
[junit] --> State 21
[junit]
[junit] Transition 19: State 21, p2:
[junit] 33->34: $assert (counter==0) at barrierBad.cvl:30.4-25 "$assert(counter == 0)";
[junit] 34->22: barrier(tid) at barrierBad.cvl:31.4-16 "barrier(tid)";
[junit] --> State 22
[junit]
[junit] Transition 20: State 22, p2:
[junit] 22->23: *((&((in_barrier)[0])+tid)) = 1 at barrierBad.cvl:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 23
[junit]
[junit] Transition 21: State 23, p2:
[junit] 23->24: num_in_barrier = (num_in_barrier+1) at barrierBad.cvl:20.2-18 "num_in_barrier++";
[junit] --> State 24
[junit]
[junit] Transition 22: State 24, p2:
[junit] 24->25: IF_BRANCH at barrierBad.cvl:21.27-28 "{";
[junit] 25->26: i = 0 at barrierBad.cvl:22.9-16 "int i=0";
[junit] --> State 25
[junit]
[junit] Transition 23: State 25, p2:
[junit] 26->27: LOOP_BODY_ENTER at barrierBad.cvl:22.18-21 "i<N";
[junit] --> State 26
[junit]
[junit] Transition 24: State 26, p2:
[junit] 27->28: *((&((in_barrier)[0])+i)) = 0 at barrierBad.cvl:22.28-45 "in_barrier[i] = 0";
[junit] 28->26: i = (i+1) at barrierBad.cvl:22.23-26 "i++";
[junit] --> State 27
[junit]
[junit] Transition 25: State 27, p2:
[junit] 26->27: LOOP_BODY_ENTER at barrierBad.cvl:22.18-21 "i<N";
[junit] --> State 28
[junit]
[junit] Transition 26: State 28, p1:
[junit] 30->31: NO_OP at barrierBad.cvl:25.30-31 ";";
[junit] 31->RET: return (barrier) at barrierBad.cvl:26.0-1 "}";
[junit] --> State 29
[junit]
[junit] Transition 27: State 29, p1:
[junit] 35->36: counter = (counter+1) at barrierBad.cvl:32.4-13 "counter++";
[junit] 36->22: barrier(tid) at barrierBad.cvl:33.4-16 "barrier(tid)";
[junit] --> State 30
[junit]
[junit] Transition 28: State 30, p1:
[junit] 22->23: *((&((in_barrier)[0])+tid)) = 1 at barrierBad.cvl:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 31
[junit]
[junit] Transition 29: State 31, p1:
[junit] 23->24: num_in_barrier = (num_in_barrier+1) at barrierBad.cvl:20.2-18 "num_in_barrier++";
[junit] --> State 32
[junit]
[junit] Transition 30: State 32, p1:
[junit] 24->30: ELSE_BRANCH at barrierBad.cvl:24.2-3 "}";
[junit] --> State 33
[junit]
[junit] Transition 31: State 33, p2:
[junit] 27->28: *((&((in_barrier)[0])+i)) = 0 at barrierBad.cvl:22.28-45 "in_barrier[i] = 0";
[junit] 28->26: i = (i+1) at barrierBad.cvl:22.23-26 "i++";
[junit] --> State 34
[junit]
[junit] Transition 32: State 34, p2:
[junit] 26->29: LOOP_BODY_EXIT at barrierBad.cvl:22.18-21 "i<N";
[junit] --> State 35
[junit]
[junit] Transition 33: State 35, p2:
[junit] 29->30: num_in_barrier = 0 at barrierBad.cvl:23.4-22 "num_in_barrier = 0";
[junit] --> State 36
[junit]
[junit] Transition 34: State 36, p2:
[junit] 30->31: NO_OP at barrierBad.cvl:25.30-31 ";";
[junit] 31->RET: return (barrier) at barrierBad.cvl:26.0-1 "}";
[junit] --> State 37
[junit]
[junit] Transition 35: State 37, p2:
[junit] 35->36: counter = (counter+1) at barrierBad.cvl:32.4-13 "counter++";
[junit] 36->22: barrier(tid) at barrierBad.cvl:33.4-16 "barrier(tid)";
[junit] --> State 38
[junit]
[junit] Transition 36: State 38, p2:
[junit] 22->23: *((&((in_barrier)[0])+tid)) = 1 at barrierBad.cvl:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 39
[junit]
[junit] Transition 37: State 39, p2:
[junit] 23->24: num_in_barrier = (num_in_barrier+1) at barrierBad.cvl:20.2-18 "num_in_barrier++";
[junit] --> State 40
[junit]
[junit] Transition 38: State 40, p2:
[junit] 24->30: ELSE_BRANCH at barrierBad.cvl:24.2-3 "}";
[junit] --> State 41
[junit]
[junit] Transition 39:
[junit] State 41
[junit] | Path condition
[junit] | | 0 <= I2+-2
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = I2
[junit] | | | | N = 2
[junit] | | | | threads = (process[2])<p1,p2>
[junit] | | | | in_barrier = (int[2])<1,1>
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 2
[junit] | | dyscope d1 (id=1, parent=d0, static=2)
[junit] | | | variables
[junit] | | dyscope d2 (id=2, parent=d1, static=7)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d3 (id=3, parent=d0, static=5)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d4 (id=4, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d5 (id=5, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d6 (id=6, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d7 (id=7, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d8 (id=8, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | dyscope d9 (id=9, parent=d8, static=8)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d7 (id=10, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | dyscope d8 (id=11, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d6]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d7]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d8]
[junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
[junit]
[junit] Violation of Deadlock found in State 41:
[junit] A deadlock is possible:
[junit] Path condition: 0 <= I2+-2
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 14, barrierBad.cvl:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 30, barrierBad.cvl:25.30-31 ";"
[junit] Enabling predicate: false
[junit]
[junit] Trace ends after 39 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 213
[junit] proverCalls : 16
[junit] memory (bytes) : 426246144
[junit] time (s) : 39.75
[junit] statesInstantiated : 218
[junit] statesSaved : 42
[junit] maxProcs : 3
[junit]
[junit] Source files:
[junit] f0 : examples/concurrency/barrierBad.cvl
[junit] f1 : civlc.cvh
[junit] f2 : op.h
[junit] f3 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 54:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 60
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 3
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[5]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[3])<UNDEFINED,p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]+I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 2
[junit] | | | | stop = 4
[junit] | | | | localSum = I6[2]+I6[3]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d14 (id=7, parent=d13, static=12)
[junit] | | | variables
[junit] | | | | start = 4
[junit] | | | | stop = 6
[junit] | | | | localSum = I6[4]+I6[5]
[junit] | | dyscope d13 (id=8, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d14]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/blockAdderBad_0.trace
[junit] Restricting search depth to 53
[junit] Error 1 encountered at depth 52:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] ProcessState 3: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 130
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 3
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[5]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[3])<p1,p2,p3>
[junit] | | | | lock = 1
[junit] | | | | result = I6[2]+I6[3]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = I6[1]+I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d14 (id=7, parent=d13, static=12)
[junit] | | | variables
[junit] | | | | start = 4
[junit] | | | | stop = 6
[junit] | | | | localSum = I6[4]+I6[5]
[junit] | | dyscope d13 (id=8, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | process p3(id=3)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d14]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (52) is less than length of old (54): replacing old with new...
[junit] Restricting search depth to 51
[junit] Error 2 encountered at depth 48:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 307
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[5]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]+I6[2]+I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 3
[junit] | | | | stop = 6
[junit] | | | | localSum = I6[3]+I6[4]+I6[5]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (48) is less than length of old (52): replacing old with new...
[junit] Restricting search depth to 47
[junit] Error 3 encountered at depth 46:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 330
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[5]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[3]+I6[4]+I6[5]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 3
[junit] | | | | localSum = I6[1]+I6[2]+I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (46) is less than length of old (48): replacing old with new...
[junit] Restricting search depth to 45
[junit] Error 4 encountered at depth 44:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 580
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 5
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]+I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 2
[junit] | | | | stop = 5
[junit] | | | | localSum = I6[2]+I6[3]+I6[4]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (44) is less than length of old (46): replacing old with new...
[junit] Restricting search depth to 43
[junit] Error 5 encountered at depth 42:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 603
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 5
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[4]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[2]+I6[3]+I6[4]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = I6[1]+I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (42) is less than length of old (44): replacing old with new...
[junit] Restricting search depth to 41
[junit] Error 6 encountered at depth 40:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 782
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 4
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]+I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 2
[junit] | | | | stop = 4
[junit] | | | | localSum = I6[2]+I6[3]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (40) is less than length of old (42): replacing old with new...
[junit] Restricting search depth to 39
[junit] Error 7 encountered at depth 38:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 798
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 4
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[3]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[2]+I6[3]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = I6[1]+I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (38) is less than length of old (40): replacing old with new...
[junit] Restricting search depth to 37
[junit] Error 8 encountered at depth 36:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 930
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 3
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 1
[junit] | | | | stop = 3
[junit] | | | | localSum = I6[1]+I6[2]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (36) is less than length of old (38): replacing old with new...
[junit] Restricting search depth to 35
[junit] Error 9 encountered at depth 34:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 946
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 3
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[2]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]+I6[2]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (34) is less than length of old (36): replacing old with new...
[junit] Restricting search depth to 33
[junit] Error 10 encountered at depth 32:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 1038
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 2
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d12 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 1
[junit] | | | | stop = 2
[junit] | | | | localSum = I6[1]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (32) is less than length of old (34): replacing old with new...
[junit] Restricting search depth to 31
[junit] Error 11 encountered at depth 30:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 1047
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 2
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[1]+I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[1]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = I6[0]
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (30) is less than length of old (32): replacing old with new...
[junit] Restricting search depth to 29
[junit] Error 12 encountered at depth 28:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 1118
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<UNDEFINED,p1>
[junit] | | | | lock = 1
[junit] | | | | result = 0
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = I6[0]
[junit] | | dyscope d11 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (28) is less than length of old (30): replacing old with new...
[junit] Restricting search depth to 27
[junit] Error 13 encountered at depth 26:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at blockAdderBad.cvl:47.4-9 "$wait".
[junit] State 1127
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d15 (id=2, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d6 (id=3, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[0]
[junit] | | dyscope d5 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d10 (id=5, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 0
[junit] | | | | localSum = 0
[junit] | | dyscope d9 (id=6, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d15]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (26) is less than length of old (28): replacing old with new...
[junit] Restricting search depth to 25
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425197568
[junit] time (s) : 41.52
[junit] maxProcs : 4
[junit] statesInstantiated : 7528
[junit] statesSaved : 1143
[junit] statesSeen : 1109
[junit] statesMatched : 251
[junit] steps : 2162
[junit] transitions : 1359
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/blockAdderBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = NULL
[junit] | | | | W = NULL
[junit] | | | | N = NULL
[junit] | | | | P = NULL
[junit] | | | | a = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, blockAdderBad.cvl:9.0-6 "$input", dyscope=d0]
[junit]
[junit] State 0, p0:
[junit] 0->1: B = InitialValue(B) at blockAdderBad.cvl:9.0-12 "$input int B";
[junit] 1->2: W = InitialValue(W) at blockAdderBad.cvl:10.0-12 "$input int W";
[junit] 2->3: N = InitialValue(N) at blockAdderBad.cvl:12.0-12 "$input int N";
[junit] 3->4: $assume ((1<=N)&&(N<=B)) at blockAdderBad.cvl:13.0-20 "$assume N>=1 && N ... B";
[junit] 4->5: P = InitialValue(P) at blockAdderBad.cvl:14.0-12 "$input int P";
[junit] 5->6: $assume ((1<=P)&&(P<=W)) at blockAdderBad.cvl:15.0-20 "$assume P>=1 && P ... W";
[junit] 6->7: a = InitialValue(a) at blockAdderBad.cvl:16.0-18 "$input double a[N]";
[junit] 7->11: sum_seq = adder_seq() at blockAdderBad.cvl:52.9-30 "sum_seq = adder_seq()";
[junit] --> State 1
[junit]
[junit] Transition 1: State 1, p0:
[junit] 11->12: s = 0.0 at blockAdderBad.cvl:19.2-16 "double s = 0.0";
[junit] 12->13: i = 0 at blockAdderBad.cvl:21.7-14 "int i=0";
[junit] --> State 2
[junit]
[junit] Transition 2: State 2, p0:
[junit] 13->14: LOOP_BODY_ENTER at blockAdderBad.cvl:21.16-19 "i<N";
[junit] --> State 3
[junit]
[junit] Transition 3: State 3, p0:
[junit] 14->15: s = (s+*((&((a)[0])+i))) at blockAdderBad.cvl:22.4-13 "s += a[i]";
[junit] 15->13: i = (i+1) at blockAdderBad.cvl:21.21-24 "i++";
[junit] --> State 4
[junit]
[junit] Transition 4: State 4, p0:
[junit] 13->16: LOOP_BODY_EXIT at blockAdderBad.cvl:21.16-19 "i<N";
[junit] 16->RET: return s (adder_seq) at blockAdderBad.cvl:23.2-11 "return s;";
[junit] 8->17: sum_par = adder_par() at blockAdderBad.cvl:53.9-30 "sum_par = adder_par()";
[junit] --> State 6
[junit]
[junit] Transition 5: State 6, p0:
[junit] 17->18: workers = InitialValue(workers) at blockAdderBad.cvl:27.2-18 "$proc workers[P]";
[junit] 18->19: lock = 0 at blockAdderBad.cvl:28.2-14 "int lock = 0";
[junit] 19->20: result = 0.0 at blockAdderBad.cvl:29.2-21 "double result = 0.0";
[junit] 20->21: i = 0 at blockAdderBad.cvl:43.7-14 "int i=0";
[junit] --> State 7
[junit]
[junit] Transition 6: State 7, p0:
[junit] 21->22: LOOP_BODY_ENTER at blockAdderBad.cvl:43.16-19 "i<P";
[junit] --> State 8
[junit]
[junit] Transition 7: State 8, p0:
[junit] 22->21: i = (i+1) at blockAdderBad.cvl:43.21-24 "i++";
[junit] --> State 9
[junit]
[junit] Transition 8: State 9, p0:
[junit] 21->22: LOOP_BODY_ENTER at blockAdderBad.cvl:43.16-19 "i<P";
[junit] --> State 11
[junit]
[junit] Transition 9: State 11, p0:
[junit] 22->21: i = (i+1) at blockAdderBad.cvl:43.21-24 "i++";
[junit] --> State 12
[junit]
[junit] Transition 10: State 12, p0:
[junit] 21->23: LOOP_BODY_EXIT at blockAdderBad.cvl:43.16-19 "i<P";
[junit] 23->24: i = 0 at blockAdderBad.cvl:44.7-14 "int i=0";
[junit] --> State 14
[junit]
[junit] Transition 11: State 14, p0:
[junit] 24->25: LOOP_BODY_ENTER at blockAdderBad.cvl:44.16-19 "i<P";
[junit] --> State 15
[junit]
[junit] Transition 12: State 15, p0:
[junit] 25->26: *((&((workers)[0])+i)) = $spawn run_worker(i) at blockAdderBad.cvl:45.4-37 "workers[i] = $spawn ... )";
[junit] 26->24: i = (i+1) at blockAdderBad.cvl:44.21-24 "i++";
[junit] --> State 16
[junit]
[junit] Transition 13: State 16, p0:
[junit] 24->25: LOOP_BODY_ENTER at blockAdderBad.cvl:44.16-19 "i<P";
[junit] --> State 17
[junit]
[junit] Transition 14: State 17, p0:
[junit] 25->26: *((&((workers)[0])+i)) = $spawn run_worker(i) at blockAdderBad.cvl:45.4-37 "workers[i] = $spawn ... )";
[junit] 26->24: i = (i+1) at blockAdderBad.cvl:44.21-24 "i++";
[junit] --> State 18
[junit]
[junit] Transition 15: State 18, p0:
[junit] 24->27: LOOP_BODY_EXIT at blockAdderBad.cvl:44.16-19 "i<P";
[junit] 27->28: i = 0 at blockAdderBad.cvl:46.7-14 "int i=0";
[junit] --> State 19
[junit]
[junit] Transition 16: State 19, p0:
[junit] 28->29: LOOP_BODY_ENTER at blockAdderBad.cvl:46.16-19 "i<P";
[junit] --> State 20
[junit]
[junit] Transition 17: State 20, p1:
[junit] 32->33: start = ((id*N)/P) at blockAdderBad.cvl:32.4-24 "int start = (id* ... P";
[junit] 33->34: stop = (((id+1)*N)/P) at blockAdderBad.cvl:33.4-27 "int stop = ((id ... P";
[junit] 34->35: localSum = 0.0 at blockAdderBad.cvl:34.4-25 "double localSum = 0.0";
[junit] 35->36: i = start at blockAdderBad.cvl:36.9-20 "int i=start";
[junit] --> State 21
[junit]
[junit] Transition 18: State 21, p1:
[junit] 36->39: LOOP_BODY_EXIT at blockAdderBad.cvl:36.22-28 "i<stop";
[junit] --> State 22
[junit]
[junit] Transition 19: State 22, p2:
[junit] 32->33: start = ((id*N)/P) at blockAdderBad.cvl:32.4-24 "int start = (id* ... P";
[junit] 33->34: stop = (((id+1)*N)/P) at blockAdderBad.cvl:33.4-27 "int stop = ((id ... P";
[junit] 34->35: localSum = 0.0 at blockAdderBad.cvl:34.4-25 "double localSum = 0.0";
[junit] 35->36: i = start at blockAdderBad.cvl:36.9-20 "int i=start";
[junit] --> State 23
[junit]
[junit] Transition 20: State 23, p2:
[junit] 36->37: LOOP_BODY_ENTER at blockAdderBad.cvl:36.22-28 "i<stop";
[junit] --> State 24
[junit]
[junit] Transition 21: State 24, p2:
[junit] 37->38: localSum = (localSum+*((&((a)[0])+i))) at blockAdderBad.cvl:37.6-22 "localSum += a[i]";
[junit] 38->36: i = (i+1) at blockAdderBad.cvl:36.30-33 "i++";
[junit] --> State 25
[junit]
[junit] Transition 22: State 25, p2:
[junit] 36->39: LOOP_BODY_EXIT at blockAdderBad.cvl:36.22-28 "i<stop";
[junit] --> State 26
[junit]
[junit] Transition 23: State 26, p2:
[junit] 39->40: lock = 1 at blockAdderBad.cvl:38.20-28 "lock = 1";
[junit] --> State 27
[junit]
[junit] Transition 24: State 27, p2:
[junit] 40->41: result = (result+localSum) at blockAdderBad.cvl:39.4-22 "result += localSum";
[junit] 41->RET: return (run_worker) at blockAdderBad.cvl:41.2-3 "}";
[junit] --> State 28
[junit]
[junit] Transition 25:
[junit] State 28
[junit] | Path condition
[junit] | | (0 <= I2+-1) && (0 <= I3+-2)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | B = I2
[junit] | | | | W = I3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = I6
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | sum_seq = I6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope d2 (id=2, parent=d0, static=2)
[junit] | | | variables
[junit] | | dyscope d3 (id=3, parent=d2, static=5)
[junit] | | | variables
[junit] | | | | s = I6[0]
[junit] | | dyscope d4 (id=4, parent=d3, static=6)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | | dyscope d5 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | dyscope d6 (id=6, parent=d5, static=7)
[junit] | | | variables
[junit] | | | | workers = (process[2])<p1,p2>
[junit] | | | | lock = 1
[junit] | | | | result = I6[0]
[junit] | | dyscope d7 (id=7, parent=d6, static=9)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d8 (id=8, parent=d6, static=10)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d9 (id=9, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | dyscope d10 (id=10, parent=d9, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 0
[junit] | | | | localSum = 0
[junit] | | dyscope d11 (id=11, parent=d6, static=8)
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | dyscope d12 (id=12, parent=d11, static=12)
[junit] | | | variables
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = I6[0]
[junit] | | dyscope d13 (id=13, parent=d6, static=11)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d14 (id=14, parent=d10, static=13)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d15 (id=15, parent=d12, static=13)
[junit] | | | variables
[junit] | | | | i = 1
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=29, blockAdderBad.cvl:47.4-9 "$wait", dyscope=d13]
[junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:53.19-28 "adder_par", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=39, blockAdderBad.cvl:38.20-24 "lock", dyscope=d10]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit]
[junit] Violation of Deadlock found in State 28:
[junit] A deadlock is possible:
[junit] Path condition: (0 <= I2+-1) && (0 <= I3+-2)
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 29, blockAdderBad.cvl:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 39, blockAdderBad.cvl:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit]
[junit] Trace ends after 25 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 97
[junit] proverCalls : 25
[junit] memory (bytes) : 425197568
[junit] time (s) : 41.72
[junit] statesInstantiated : 181
[junit] statesSaved : 29
[junit] maxProcs : 3
[junit]
[junit] Source files:
[junit] f0 : examples/concurrency/blockAdderBad.cvl
[junit] f1 : civlc.cvh
[junit] f2 : op.h
[junit] f3 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 424673280
[junit] time (s) : 45.65
[junit] maxProcs : 4
[junit] statesInstantiated : 44451
[junit] statesSaved : 4962
[junit] statesSeen : 4928
[junit] statesMatched : 1704
[junit] steps : 13009
[junit] transitions : 6631
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 424673280
[junit] time (s) : 46.17
[junit] maxProcs : 3
[junit] statesInstantiated : 2025
[junit] statesSaved : 245
[junit] statesSeen : 227
[junit] statesMatched : 68
[junit] steps : 350
[junit] transitions : 294
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 55:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 6, locksBad10.cvl:32.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 12, locksBad10.cvl:12.17-18 "y"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 20, locksBad10.cvl:21.17-18 "x"
[junit] Enabling predicate: false
[junit] at locksBad10.cvl:32.2-7 "$wait".
[junit] State 162
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | x = 1
[junit] | | | | y = 1
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | p = p1
[junit] | | | | q = p2
[junit] | | dyscope d3 (id=2, parent=d2, static=5)
[junit] | | | variables
[junit] | | | | i = 9
[junit] | | dyscope d2 (id=3, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | n = 10
[junit] | | dyscope d5 (id=4, parent=d4, static=6)
[junit] | | | variables
[junit] | | | | i = 0
[junit] | | dyscope d4 (id=5, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | m = 10
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, locksBad10.cvl:32.2-7 "$wait", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=f, location=12, locksBad10.cvl:12.17-18 "y", dyscope=d3]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=g, location=20, locksBad10.cvl:21.17-18 "x", dyscope=d5]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/locksBad10_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 424673280
[junit] time (s) : 46.3
[junit] maxProcs : 3
[junit] statesInstantiated : 916
[junit] statesSaved : 163
[junit] statesSeen : 163
[junit] statesMatched : 41
[junit] steps : 244
[junit] transitions : 203
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/locksBad10_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 6:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 4, locksBad.cvl:31.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 9, locksBad.cvl:12.19-24 "lock1"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 15, locksBad.cvl:21.19-24 "lock0"
[junit] Enabling predicate: false
[junit] at locksBad.cvl:31.2-7 "$wait".
[junit] State 8
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | lock0 = true
[junit] | | | | lock1 = true
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | p0 = p1
[junit] | | | | p1 = p2
[junit] | | dyscope d2 (id=2, parent=d0, static=2)
[junit] | | | variables
[junit] | | dyscope d3 (id=3, parent=d0, static=3)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=4, locksBad.cvl:31.2-7 "$wait", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=proc0, location=9, locksBad.cvl:12.19-24 "lock1", dyscope=d2]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=proc1, location=15, locksBad.cvl:21.19-24 "lock0", dyscope=d3]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/locksBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 424673280
[junit] time (s) : 46.39
[junit] maxProcs : 3
[junit] statesInstantiated : 53
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 1
[junit] steps : 12
[junit] transitions : 9
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/locksBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 8:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (s1==s2)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at spawnBad.cvl:23.2-17 "$assert(s1==s2)".
[junit] State -1:513675
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | N = 10
[junit] | | | | s1 = 1
[junit] | | | | s2 = 0
[junit] | | dyscope d1 (id=1, parent=d0, static=4)
[junit] | | | variables
[junit] | | | | p = p1
[junit] | | | | q = p2
[junit] | | dyscope d4 (id=2, parent=d2, static=5)
[junit] | | | variables
[junit] | | | | i = 2
[junit] | | dyscope d2 (id=3, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | n = 10
[junit] | | dyscope d3 (id=4, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | n = 10
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, spawnBad.cvl:23.2-9 "$assert", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=f1, location=12, spawnBad.cvl:11.26-28 "s1", dyscope=d4]
[junit] | | process p2(id=2)
[junit] | | | call stack
[junit] | | | | Frame[function=f2, location=15, spawnBad.cvl:15.2-4 "s2", dyscope=d3]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/spawnBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 424673280
[junit] time (s) : 46.64
[junit] maxProcs : 3
[junit] statesInstantiated : 2859
[junit] statesSaved : 440
[junit] statesSeen : 440
[junit] statesMatched : 134
[junit] steps : 884
[junit] transitions : 573
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/spawnBad_log.txt
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.CudaTest
[junit] Tests run: 2, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 3.668 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 0.81
[junit] maxProcs : 4
[junit] statesInstantiated : 1380
[junit] statesSaved : 134
[junit] statesSeen : 128
[junit] statesMatched : 2
[junit] steps : 255
[junit] transitions : 129
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 3.67
[junit] maxProcs : 5
[junit] statesInstantiated : 38642
[junit] statesSaved : 3707
[junit] statesSeen : 3707
[junit] statesMatched : 5795
[junit] steps : 11311
[junit] transitions : 9501
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.IOTransformerTest
[junit] Tests run: 3, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 1.291 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.33
[junit] maxProcs : 1
[junit] statesInstantiated : 31
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.96
[junit] maxProcs : 1
[junit] statesInstantiated : 277
[junit] statesSaved : 26
[junit] statesSeen : 24
[junit] statesMatched : 0
[junit] steps : 54
[junit] transitions : 23
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 1.3
[junit] maxProcs : 1
[junit] statesInstantiated : 102
[junit] statesSaved : 11
[junit] statesSeen : 10
[junit] statesMatched : 0
[junit] steps : 20
[junit] transitions : 9
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.LanguageFeaturesTest
[junit] Tests run: 91, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 36.415 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0 (id = 0) (kind: OUTPUT_READ, certainty: PROVEABLE)
[junit] Attempt to read output variable k
[junit] at outputBad.cvl:14.8-9 "p".
[junit] State -1:554121
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | k = A<0,0>
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | p = &<d0>k.a
[junit] | | | | ka = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, outputBad.cvl:14.2-4 "ka", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/outputBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.14
[junit] maxProcs : 1
[junit] statesInstantiated : 14
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/outputBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 3:
[junit] CIVL execution error in p0 (id = 0) (kind: OTHER, certainty: PROVEABLE)
[junit] functionBad.cvl:18.6-13 "a = f()" : Attempt to use the return value of function f when f has returned without a return value.
[junit] at functionBad.cvl:18.6-13 "a = f()".
[junit] State -1:554143
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | a = NULL
[junit] | | | | _anon_0 = NULL
[junit] | | dyscope d3 (id=2, parent=d2, static=4)
[junit] | | | variables
[junit] | | | | k = 19
[junit] | | dyscope d2 (id=3, parent=d0, static=2)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, functionBad.cvl:18.10-11 "f", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/functionBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.46
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 2
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/functionBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 3:
[junit] CIVL execution error in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
[junit] at mallocBad.cvl:11.10-14 "p[4]".
[junit] State -1:554170
[junit] | Path condition
[junit] | | 0 <= SIZEOF_REAL+-1
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = UNDEFINED
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, mallocBad.cvl:11.2-9 "$assert", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mallocBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.53
[junit] maxProcs : 1
[junit] statesInstantiated : 27
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 2
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mallocBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.6
[junit] maxProcs : 1
[junit] statesInstantiated : 29
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 0.69
[junit] maxProcs : 1
[junit] statesInstantiated : 77
[junit] statesSaved : 6
[junit] statesSeen : 5
[junit] statesMatched : 1
[junit] steps : 23
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 1.02
[junit] maxProcs : 1
[junit] statesInstantiated : 104
[junit] statesSaved : 9
[junit] statesSeen : 7
[junit] statesMatched : 0
[junit] steps : 22
[junit] transitions : 6
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 1.03
[junit] maxProcs : 1
[junit] statesInstantiated : 9
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 1.39
[junit] maxProcs : 1
[junit] statesInstantiated : 15
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 427294720
[junit] time (s) : 1.49
[junit] maxProcs : 1
[junit] statesInstantiated : 43
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 11
[junit] transitions : 8
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 1.62
[junit] maxProcs : 1
[junit] statesInstantiated : 19
[junit] statesSaved : 5
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Error: This feature is not yet implemented: non-concrete character in string at position 0
[junit] at Program:0.-1-6 "Program"Program.
[junit] Source files:
[junit] f0 : examples/languageFeatures/int2charBad.cvl
[junit] f1 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.h
[junit] f2 : civlc.cvh
[junit] f3 : op.h
[junit] f4 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.cvl
[junit] f5 : stdio-common.h
[junit] f6 : /home/svn/work/civl/0.14/r1680/./text/include/stdio-c.cvl
[junit] f7 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.07
[junit] maxProcs : 1
[junit] statesInstantiated : 19
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.39
[junit] maxProcs : 1
[junit] statesInstantiated : 49
[junit] statesSaved : 8
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 13
[junit] transitions : 7
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.46
[junit] maxProcs : 1
[junit] statesInstantiated : 35
[junit] statesSaved : 5
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (p!=(($real)*) 0)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at assertNullPointer.cvl:10.2-12 "$assert(p)".
[junit] State -1:554622
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | p = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=1, assertNullPointer.cvl:10.2-9 "$assert", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/assertNullPointer_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.53
[junit] maxProcs : 0
[junit] statesInstantiated : 10
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/assertNullPointer_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 9:
[junit] CIVL execution error in p2 (id = 1) (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
[junit] at removedHeapPointer.cvl:23.2-5 "*gp".
[junit] State -1:554693
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | gp = UNDEFINED
[junit] | | | | gStart = true
[junit] | | dyscope d1 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | f = UNDEFINED
[junit] | | | | g = p2
[junit] | | dyscope d4 (id=2, parent=d0, static=5)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, removedHeapPointer.cvl:31.2-7 "$wait", dyscope=d1]
[junit] | | process p2(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=goo, location=14, removedHeapPointer.cvl:23.2-5 "*gp", dyscope=d4]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/removedHeapPointer_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.63
[junit] maxProcs : 3
[junit] statesInstantiated : 71
[junit] statesSaved : 10
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 13
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/removedHeapPointer_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] I'm not null.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 2.94
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 9:
[junit] CIVL execution error in p0 (id = 0) (kind: POINTER, certainty: PROVEABLE)
[junit] Operands of pointer subtraction point to different heap obejcts
[junit] at pointerSubtractionBad2.cvl:13.9-20 "x[1] - x[ ... ]".
[junit] State -1:554796
[junit] | Path condition
[junit] | | (0 <= SIZEOF(dynamicType<81>)+-1) && (0 <= SIZEOF_REAL+-1)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at pointerSubtractionBad2.cvl:9.2-53 "x = (double ** ... )":
[junit] | | | | | | 0: (pointer[3])<&<d0>heap<1,0>[0],&<d0>heap<1,1>[0],&<d0>heap<1,2>[0]>
[junit] | | | | | objects of malloc 1 at pointerSubtractionBad2.cvl:11.4-55 "x[i] = (double ... )":
[junit] | | | | | | 0: V0
[junit] | | | | | | 1: V0
[junit] | | | | | | 2: V0
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | diff = NULL
[junit] | | | | x = &<d0>heap<0,0>[0]
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, pointerSubtractionBad2.cvl:13.2-6 "diff", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerSubtractionBad2_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 3.45
[junit] maxProcs : 1
[junit] statesInstantiated : 81
[junit] statesSaved : 13
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 13
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerSubtractionBad2_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 3.53
[junit] maxProcs : 1
[junit] statesInstantiated : 34
[junit] statesSaved : 3
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 3.63
[junit] maxProcs : 1
[junit] statesInstantiated : 31
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 3.74
[junit] maxProcs : 1
[junit] statesInstantiated : 308
[junit] statesSaved : 35
[junit] statesSeen : 35
[junit] statesMatched : 0
[junit] steps : 95
[junit] transitions : 34
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 154:
[junit] CIVL execution error in p0(id=0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE)
[junit] Unpacking data from bundle to pointer: &<d1>a4d[1][0][1]
[junit] at bundleTestBad.cvl:20.2-36 "$bundle_unpack(bun, &a4d[1 ... )".
[junit] Logging new entry 0, writing trace to CIVLREP/bundleTestBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 4.12
[junit] maxProcs : 1
[junit] statesInstantiated : 1022
[junit] statesSaved : 155
[junit] statesSeen : 154
[junit] statesMatched : 0
[junit] steps : 307
[junit] transitions : 153
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/bundleTestBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 4.2
[junit] maxProcs : 1
[junit] statesInstantiated : 49
[junit] statesSaved : 6
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 14
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] hello!2 is smaller than 10!Error 0 encountered at depth 2:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (a<b)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at assertPrintf.cvl:13.2-48 "$assert b > a : ... a".
[junit] State -1:556262
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | a = 10
[junit] | | | | b = 2
[junit] | | | | _anon_0 = "hello!"
[junit] | | | | _anon_1 = "%d is smaller than %d!"
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, assertPrintf.cvl:13.2-9 "$assert", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/assertPrintf_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 4.51
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/assertPrintf_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] x=colorOf(V0[2])
[junit] x=colorOf(V0[1])
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 4.83
[junit] maxProcs : 1
[junit] statesInstantiated : 46
[junit] statesSaved : 6
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 12
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 4.85
[junit] maxProcs : 1
[junit] statesInstantiated : 263
[junit] statesSaved : 55
[junit] statesSeen : 55
[junit] statesMatched : 0
[junit] steps : 78
[junit] transitions : 54
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 10.06
[junit] maxProcs : 1
[junit] statesInstantiated : 91
[junit] statesSaved : 13
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 24
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Illegal pointer dereference: Array index out of bounds in method arrayRead.
[junit] array: I2
[junit] extent: 10
[junit] index: 10pointerAddBad.cvl:9.10-30 "(&a[0][0] ... )"
[junit] at pointerAddBad.cvl:9.10-30 "(&a[0][0] ... )".
[junit] State -1:556676
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | a = I2
[junit] | | | | _anon_0 = "*(&a[0][0][0] + 1000) is out of bound: %.4f\n"
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, pointerAddBad.cvl:8.0-6 "printf", dyscope=d0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 425721856
[junit] time (s) : 10.37
[junit] maxProcs : 1
[junit] statesInstantiated : 14
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerAddBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] i=0
[junit] i=1
[junit] i=2
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 10.8
[junit] maxProcs : 1
[junit] statesInstantiated : 118
[junit] statesSaved : 14
[junit] statesSeen : 14
[junit] statesMatched : 0
[junit] steps : 32
[junit] transitions : 13
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 233:
[junit] CIVL execution error in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Illegal pointer dereference: Array index out of bounds in method arrayRead.
[junit] array: (int[10])<0,0,0,0,0,0,0,0,0,0>
[junit] extent: 10
[junit] index: 10pointerAddBad2.cvl:16.9-24 "(&p[0][0] ... )"
[junit] at pointerAddBad2.cvl:16.9-24 "(&p[0][0] ... )".
[junit] State -1:558501
[junit] | Path condition
[junit] | | (0 <= SIZEOF(dynamicType<81>)+-1) && (0 <= SIZEOF_INT+-1)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at pointerAddBad2.cvl:9.2-48 "p = (int ** ... )":
[junit] | | | | | | 0: (pointer[10])<&<d0>heap<1,0>[0],&<d0>heap<1,1>[0],&<d0>heap<1,2>[0],&<d0>heap<1,3>[0],&<d0>heap<1,4>[0],&<d0>heap<1,5>[0],&<d0>heap<1,6>[0],&<d0>heap<1,7>[0],&<d0>heap<1,8>[0],&<d0>heap<1,9>[0]>
[junit] | | | | | objects of malloc 1 at pointerAddBad2.cvl:11.4-50 "p[i] = (int ... )":
[junit] | | | | | | 0: (int[10])<0,0,0,0,0,0,0,0,0,0>
[junit] | | | | | | 1: (int[10])<1,1,1,1,1,1,1,1,1,1>
[junit] | | | | | | 2: (int[10])<2,2,2,2,2,2,2,2,2,2>
[junit] | | | | | | 3: (int[10])<3,3,3,3,3,3,3,3,3,3>
[junit] | | | | | | 4: (int[10])<4,4,4,4,4,4,4,4,4,4>
[junit] | | | | | | 5: (int[10])<5,5,5,5,5,5,5,5,5,5>
[junit] | | | | | | 6: (int[10])<6,6,6,6,6,6,6,6,6,6>
[junit] | | | | | | 7: (int[10])<7,7,7,7,7,7,7,7,7,7>
[junit] | | | | | | 8: (int[10])<8,8,8,8,8,8,8,8,8,8>
[junit] | | | | | | 9: (int[10])<9,9,9,9,9,9,9,9,9,9>
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = &<d0>heap<0,0>[0]
[junit] | | | | ret = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=9, pointerAddBad2.cvl:16.2-5 "ret", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad2_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 11.3
[junit] maxProcs : 1
[junit] statesInstantiated : 1707
[junit] statesSaved : 244
[junit] statesSeen : 233
[junit] statesMatched : 0
[junit] steps : 354
[junit] transitions : 232
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerAddBad2_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 11.39
[junit] maxProcs : 1
[junit] statesInstantiated : 39
[junit] statesSaved : 7
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 11.47
[junit] maxProcs : 1
[junit] statesInstantiated : 46
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 14
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 11.48
[junit] maxProcs : 1
[junit] statesInstantiated : 31
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.01
[junit] maxProcs : 1
[junit] statesInstantiated : 30
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.07
[junit] maxProcs : 1
[junit] statesInstantiated : 18
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.15
[junit] maxProcs : 2
[junit] statesInstantiated : 37
[junit] statesSaved : 6
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] b is true
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.46
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert (0<=n)
[junit] Path condition: true
[junit] Assertion: 0 <= I2
[junit]
[junit] at include3.cvl:3.2-14 "$assert n>=0" included from include2.cvl:1.9-23 ""include3.cvl"" included from include1.cvl:2.9-23 ""include2.cvl"".
[junit] State -1:558738
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | n = I2
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | n = I2
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=f2, location=3, include3.cvl:3.2-9 "$assert" included from include2.cvl:1.9-23 ""include3.cvl"" included from include1.cvl:2.9-23 ""include2.cvl"", dyscope=d1]
[junit] | | | | Frame[function=_CIVL_system, location=1, include1.cvl:7.2-4 "f2", dyscope=d0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/include1_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.5
[junit] maxProcs : 1
[junit] statesInstantiated : 14
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/include1_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.57
[junit] maxProcs : 1
[junit] statesInstantiated : 99
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 31
[junit] transitions : 8
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.67
[junit] maxProcs : 1
[junit] statesInstantiated : 197
[junit] statesSaved : 30
[junit] statesSeen : 30
[junit] statesMatched : 0
[junit] steps : 59
[junit] transitions : 29
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.75
[junit] maxProcs : 1
[junit] statesInstantiated : 30
[junit] statesSaved : 7
[junit] statesSeen : 7
[junit] statesMatched : 0
[junit] steps : 7
[junit] transitions : 6
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 13.83
[junit] maxProcs : 1
[junit] statesInstantiated : 48
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 16
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 3:
[junit] CIVL execution error in p0 (id = 0) (kind: POINTER, certainty: PROVEABLE)
[junit] Operands of pointer subtraction point to the same obejct
[junit] at pointerSubtractionBad.cvl:11.9-14 "p - b".
[junit] State -1:559132
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | p = &<d1>a[0]
[junit] | | | | a = V0
[junit] | | | | b = V0
[junit] | | | | diff = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, pointerSubtractionBad.cvl:11.2-6 "diff", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerSubtractionBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 14.14
[junit] maxProcs : 1
[junit] statesInstantiated : 20
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 2
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerSubtractionBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 14.21
[junit] maxProcs : 1
[junit] statesInstantiated : 20
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 406847488
[junit] time (s) : 14.3
[junit] maxProcs : 4
[junit] statesInstantiated : 267
[junit] statesSaved : 30
[junit] statesSeen : 30
[junit] statesMatched : 10
[junit] steps : 75
[junit] transitions : 39
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.27
[junit] maxProcs : 9
[junit] statesInstantiated : 6531
[junit] statesSaved : 275
[junit] statesSeen : 275
[junit] statesMatched : 769
[junit] steps : 2073
[junit] transitions : 1043
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.44
[junit] maxProcs : 1
[junit] statesInstantiated : 119
[junit] statesSaved : 18
[junit] statesSeen : 11
[junit] statesMatched : 0
[junit] steps : 41
[junit] transitions : 10
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0 (id = 0) (kind: PROCESS_LEAK, certainty: CONCRETE)
[junit] Attempt to terminate the main process while process 1(process<1>) is still running
[junit] at processLeak.cvl:20.0-1 "}".
[junit] State -1:566088
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | mainP = p0
[junit] | | dyscope d1 (id=1, parent=d0, static=2)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, processLeak.cvl:20.0-1 "}", dyscope=d0]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=process, location=4, processLeak.cvl:13.28-29 ";", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/processLeak_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.51
[junit] maxProcs : 2
[junit] statesInstantiated : 19
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/processLeak_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to read uninitialized variable p
[junit] at mallocBad2.cvl:10.2-3 "p".
[junit] State -1:566095
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | p = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, mallocBad2.cvl:10.2-6 "p[4]", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mallocBad2_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.64
[junit] maxProcs : 0
[junit] statesInstantiated : 7
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mallocBad2_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to use undefined pointer
[junit] at undefPointer.cvl:11.6-12 "n.next".
[junit] State -1:566104
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | n = X_s1v1
[junit] | | | | x = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=1, undefPointer.cvl:11.2-4 "if", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/undefPointer_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.73
[junit] maxProcs : 0
[junit] statesInstantiated : 9
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/undefPointer_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.87
[junit] maxProcs : 1
[junit] statesInstantiated : 243
[junit] statesSaved : 36
[junit] statesSeen : 33
[junit] statesMatched : 0
[junit] steps : 45
[junit] transitions : 32
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0 (id = 0) (kind: INPUT_WRITE, certainty: PROVEABLE)
[junit] Attempt to write to input variable k
[junit] at inputBad.cvl:15.2-5 "*ka".
[junit] State -1:566368
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | k = I2
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | p = &<d0>k
[junit] | | | | q = V0
[junit] | | | | ka = &<d0>k.a
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=4, inputBad.cvl:15.2-5 "*ka", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/inputBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 15.95
[junit] maxProcs : 1
[junit] statesInstantiated : 21
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/inputBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 16.16
[junit] maxProcs : 4
[junit] statesInstantiated : 240
[junit] statesSaved : 35
[junit] statesSeen : 35
[junit] statesMatched : 0
[junit] steps : 64
[junit] transitions : 34
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Error: This feature is not yet implemented: Converting integer whose value is larger than UCHAR_MAX or is less than UCHAR_MIN to char type
[junit]
[junit] Source files:
[junit] f0 : examples/languageFeatures/int2charBad2.cvl
[junit] f1 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.h
[junit] f2 : civlc.cvh
[junit] f3 : op.h
[junit] f4 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.cvl
[junit] f5 : stdio-common.h
[junit] f6 : /home/svn/work/civl/0.14/r1680/./text/include/stdio-c.cvl
[junit] f7 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 16.79
[junit] maxProcs : 1
[junit] statesInstantiated : 88
[junit] statesSaved : 12
[junit] statesSeen : 11
[junit] statesMatched : 0
[junit] steps : 16
[junit] transitions : 10
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: OTHER, certainty: CONCRETE)
[junit] Non-determinism is encountered in $atom block.
[junit] at atomChooseBad.cvl:13.4-11 "$choose".
[junit] State -1:566723
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | n = 3
[junit] | | dyscope d1 (id=1, parent=d0, static=1)
[junit] | | | variables
[junit] | | | | x = 3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, atomChooseBad.cvl:13.4-11 "$choose", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomChooseBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 16.81
[junit] maxProcs : 0
[junit] statesInstantiated : 14
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomChooseBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 16.9
[junit] maxProcs : 1
[junit] statesInstantiated : 41
[junit] statesSaved : 9
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 7
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 17.0
[junit] maxProcs : 3
[junit] statesInstantiated : 170
[junit] statesSaved : 21
[junit] statesSeen : 21
[junit] statesMatched : 3
[junit] steps : 44
[junit] transitions : 23
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 416808960
[junit] time (s) : 17.06
[junit] maxProcs : 1
[junit] statesInstantiated : 15
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.31
[junit] maxProcs : 1
[junit] statesInstantiated : 3262
[junit] statesSaved : 540
[junit] statesSeen : 389
[junit] statesMatched : 0
[junit] steps : 1006
[junit] transitions : 388
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.7
[junit] maxProcs : 1
[junit] statesInstantiated : 796
[junit] statesSaved : 93
[junit] statesSeen : 93
[junit] statesMatched : 0
[junit] steps : 233
[junit] transitions : 92
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.77
[junit] maxProcs : 1
[junit] statesInstantiated : 34
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.85
[junit] maxProcs : 1
[junit] statesInstantiated : 275
[junit] statesSaved : 39
[junit] statesSeen : 39
[junit] statesMatched : 0
[junit] steps : 99
[junit] transitions : 38
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.91
[junit] maxProcs : 1
[junit] statesInstantiated : 17
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 22.98
[junit] maxProcs : 1
[junit] statesInstantiated : 9
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Function prototype test: f(y) = 2 * y, then f(4) = 8.
[junit] Function prototype test: g() = 10.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 23.31
[junit] maxProcs : 1
[junit] statesInstantiated : 43
[junit] statesSaved : 6
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 10
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to use undefined pointer
[junit] at undefHeapPointer.cvl:12.6-13 "n->next".
[junit] State -1:571400
[junit] | Path condition
[junit] | | 0 < SIZEOF(dynamicType<108>)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at undefHeapPointer.cvl:9.10-46 "n = (node_t *) ... )":
[junit] | | | | | | 0: Hop0s0f0o0
[junit] | | | | CIVL_root = d0
[junit] | | dyscope d1 (id=1, parent=d0, static=2)
[junit] | | | variables
[junit] | | | | n = &<d0>heap<0,0>[0]
[junit] | | | | x = NULL
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, undefHeapPointer.cvl:12.2-4 "if", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/undefHeapPointer_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 23.54
[junit] maxProcs : 0
[junit] statesInstantiated : 15
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/undefHeapPointer_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: OTHER, certainty: CONCRETE)
[junit] Blocked location is encountered in $atom block.
[junit] at atomWaitBad.cvl:19.4-9 "$wait".
[junit] State -1:571408
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=1, atomWaitBad.cvl:19.4-9 "$wait", dyscope=d0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomWaitBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 23.61
[junit] maxProcs : 0
[junit] statesInstantiated : 8
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomWaitBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 447217664
[junit] time (s) : 23.72
[junit] maxProcs : 1
[junit] statesInstantiated : 15
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 31.54
[junit] maxProcs : 1
[junit] statesInstantiated : 19796
[junit] statesSaved : 2827
[junit] statesSeen : 2706
[junit] statesMatched : 0
[junit] steps : 4057
[junit] transitions : 2705
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 32.05
[junit] maxProcs : 1
[junit] statesInstantiated : 192
[junit] statesSaved : 27
[junit] statesSeen : 23
[junit] statesMatched : 0
[junit] steps : 36
[junit] transitions : 22
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 32.3
[junit] maxProcs : 1
[junit] statesInstantiated : 685
[junit] statesSaved : 94
[junit] statesSeen : 85
[junit] statesMatched : 0
[junit] steps : 137
[junit] transitions : 84
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 32.39
[junit] maxProcs : 1
[junit] statesInstantiated : 30
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 7
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 32.98
[junit] maxProcs : 1
[junit] statesInstantiated : 2193
[junit] statesSaved : 261
[junit] statesSeen : 255
[junit] statesMatched : 0
[junit] steps : 498
[junit] transitions : 254
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 33.06
[junit] maxProcs : 1
[junit] statesInstantiated : 70
[junit] statesSaved : 13
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 18
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] The char value is 'b'
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 33.37
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522190848
[junit] time (s) : 33.51
[junit] maxProcs : 3
[junit] statesInstantiated : 266
[junit] statesSaved : 34
[junit] statesSeen : 28
[junit] statesMatched : 0
[junit] steps : 50
[junit] transitions : 27
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 34.41
[junit] maxProcs : 4
[junit] statesInstantiated : 4007
[junit] statesSaved : 449
[junit] statesSeen : 449
[junit] statesMatched : 308
[junit] steps : 1227
[junit] transitions : 756
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 34.5
[junit] maxProcs : 1
[junit] statesInstantiated : 63
[junit] statesSaved : 12
[junit] statesSeen : 11
[junit] statesMatched : 0
[junit] steps : 17
[junit] transitions : 10
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] foo done.
[junit] goo done.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.11
[junit] maxProcs : 1
[junit] statesInstantiated : 161
[junit] statesSaved : 18
[junit] statesSeen : 18
[junit] statesMatched : 0
[junit] steps : 39
[junit] transitions : 17
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.28
[junit] maxProcs : 6
[junit] statesInstantiated : 2390
[junit] statesSaved : 140
[junit] statesSeen : 140
[junit] statesMatched : 80
[junit] steps : 807
[junit] transitions : 219
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.37
[junit] maxProcs : 1
[junit] statesInstantiated : 46
[junit] statesSaved : 3
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 11
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.49
[junit] maxProcs : 1
[junit] statesInstantiated : 129
[junit] statesSaved : 25
[junit] statesSeen : 24
[junit] statesMatched : 0
[junit] steps : 36
[junit] transitions : 23
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 15:
[junit] CIVL execution error in p1 (id = 1) (kind: MEMORY_LEAK, certainty: CONCRETE)
[junit] The unreachable dyscope d3(id=3) has a non-empty heap $heap<(real[0][])<>,(int[1][])<(int[1])<10>>,(real[0][])<>>.
[junit] at memoryLeak.cvl:10.14-21.1 "{\n int * p ... }".
[junit] State -1:601678
[junit] | Path condition
[junit] | | (0 <= SIZEOF_INT+-1) && (0 <= SIZEOF_REAL+-1)
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=5)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at memoryLeak.cvl:25.11-56 "q = (double *) ... )":
[junit] | | | | | | 0: (real[1])<11/10>
[junit] | | | | p = p1
[junit] | | | | q = &<d1>heap<0,0>[0]
[junit] | | dyscope d4 (id=2, parent=d3, static=7)
[junit] | | | variables
[junit] | | | | i = 5
[junit] | | dyscope d3 (id=3, parent=d2, static=6)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 1 at memoryLeak.cvl:11.8-47 "p = (int *) ... )":
[junit] | | | | | | 0: (int[1])<10>
[junit] | | | | p = &<d3>heap<1,0>[0]
[junit] | | | | q = UNDEFINED
[junit] | | dyscope d2 (id=4, parent=d0, static=4)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, memoryLeak.cvl:28.2-7 "$wait", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/memoryLeak_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.62
[junit] maxProcs : 2
[junit] statesInstantiated : 205
[junit] statesSaved : 22
[junit] statesSeen : 15
[junit] statesMatched : 0
[junit] steps : 33
[junit] transitions : 14
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/memoryLeak_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert false
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at spawnFoo.cvl:4.2-17 "$assert($false)".
[junit] State -1:601692
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | p = p1
[junit] | | dyscope d2 (id=2, parent=d0, static=2)
[junit] | | | variables
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=1, spawnFoo.cvl:10.2-7 "$wait", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=foo, location=3, spawnFoo.cvl:4.2-9 "$assert", dyscope=d2]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/spawnFoo_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 35.94
[junit] maxProcs : 2
[junit] statesInstantiated : 14
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/spawnFoo_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 36.22
[junit] maxProcs : 1
[junit] statesInstantiated : 73
[junit] statesSaved : 18
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 14
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE)
[junit] Division by zero
[junit] at badGuard.cvl:14.10-13 "x/y".
[junit] State -1:601777
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | x = I2
[junit] | | | | y = I3
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, badGuard.cvl:13.2-9 "$choose", dyscope=d0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/badGuard_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 481820672
[junit] time (s) : 36.28
[junit] maxProcs : 0
[junit] statesInstantiated : 12
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/badGuard_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 36.45
[junit] maxProcs : 1
[junit] statesInstantiated : 2295
[junit] statesSaved : 443
[junit] statesSeen : 443
[junit] statesMatched : 0
[junit] steps : 775
[junit] transitions : 442
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] ------------- Standard Error -----------------
[junit] errors encountered when linking input program with the implementation of system libraries:
[junit] Syntax error: The parameters for the function have not been specified.
[junit] Note that a prototype for a function with 0 parameters must have the form "f(void)" at functionPrototypeBad.cvl:8.6-9 "f()"
[junit] Syntax error: $abstract functions must have at least one input.
[junit] An abstract function with 0 inputs is a constant.
[junit] It can be declared as an unconstrained input variable instead, e.g.
[junit] $input int N;
[junit] at abstractFunNoArg.cvl:4.0-26 "$abstract int random(void)".
[junit] Syntax error: attempt to modify the input variable N
[junit] at assignInput.cvl:9.2-3 "N".
[junit] line 1:52 extraneous input '-enablePrintf' expecting {PATH, NEWLINE}
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.LibraryTest
[junit] Tests run: 24, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 5.794 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 0.45
[junit] maxProcs : 1
[junit] statesInstantiated : 929
[junit] statesSaved : 106
[junit] statesSeen : 106
[junit] statesMatched : 0
[junit] steps : 259
[junit] transitions : 105
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 0.85
[junit] maxProcs : 1
[junit] statesInstantiated : 92
[junit] statesSaved : 11
[junit] statesSeen : 10
[junit] statesMatched : 0
[junit] steps : 18
[junit] transitions : 9
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
[junit] at freeBad1.cvl:8.2-4 "*a".
[junit] State -1:605129
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | a = UNDEFINED
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, freeBad1.cvl:8.2-4 "*a", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/freeBad1_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 0.92
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 3
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/freeBad1_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error in p0(id=0) (kind: MEMORY_LEAK, certainty: PROVEABLE)
[junit] Attempt to free a memory space that is already freed
[junit] at freeBad2.cvl:8.2-10 "$free(a)".
[junit] State -1:605148
[junit] | Path condition
[junit] | | 0 < SIZEOF_INT
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | dyscope d1 (id=1, parent=d0, static=3)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at freeBad2.cvl:4.8-46 "a = (int*) ... )":
[junit] | | | | | | 0: INVALID
[junit] | | | | a = UNDEFINED
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, freeBad2.cvl:8.2-7 "$free", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/freeBad2_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 0.99
[junit] maxProcs : 0
[junit] statesInstantiated : 19
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/freeBad2_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 1.82
[junit] maxProcs : 3
[junit] statesInstantiated : 1380
[junit] statesSaved : 139
[junit] statesSeen : 120
[junit] statesMatched : 0
[junit] steps : 290
[junit] transitions : 119
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 1.89
[junit] maxProcs : 4
[junit] statesInstantiated : 112
[junit] statesSaved : 19
[junit] statesSeen : 19
[junit] statesMatched : 0
[junit] steps : 27
[junit] transitions : 18
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 1.97
[junit] maxProcs : 1
[junit] statesInstantiated : 51
[junit] statesSaved : 6
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 10
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 2.16
[junit] maxProcs : 1
[junit] statesInstantiated : 340
[junit] statesSaved : 62
[junit] statesSeen : 57
[junit] statesMatched : 0
[junit] steps : 101
[junit] transitions : 56
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 2.51
[junit] maxProcs : 1
[junit] statesInstantiated : 237
[junit] statesSaved : 38
[junit] statesSeen : 37
[junit] statesMatched : 0
[junit] steps : 71
[junit] transitions : 36
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 2.78
[junit] maxProcs : 1
[junit] statesInstantiated : 59
[junit] statesSaved : 5
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 13
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 521142272
[junit] time (s) : 2.79
[junit] maxProcs : 1
[junit] statesInstantiated : 25
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 7
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 2.97
[junit] maxProcs : 1
[junit] statesInstantiated : 97
[junit] statesSaved : 17
[junit] statesSeen : 17
[junit] statesMatched : 0
[junit] steps : 27
[junit] transitions : 16
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 3.92
[junit] maxProcs : 5
[junit] statesInstantiated : 6903
[junit] statesSaved : 501
[junit] statesSeen : 494
[junit] statesMatched : 119
[junit] steps : 1034
[junit] transitions : 612
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.01
[junit] maxProcs : 1
[junit] statesInstantiated : 48
[junit] statesSaved : 6
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.12
[junit] maxProcs : 1
[junit] statesInstantiated : 91
[junit] statesSaved : 16
[junit] statesSeen : 16
[junit] statesMatched : 0
[junit] steps : 25
[junit] transitions : 15
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.18
[junit] maxProcs : 1
[junit] statesInstantiated : 24
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.29
[junit] maxProcs : 5
[junit] statesInstantiated : 528
[junit] statesSaved : 92
[junit] statesSeen : 92
[junit] statesMatched : 0
[junit] steps : 174
[junit] transitions : 91
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.5
[junit] maxProcs : 1
[junit] statesInstantiated : 32
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 5:
[junit] CIVL execution error in (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 4, commBad.cvl:21.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 8, commBad.cvl:14.2-15 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at commBad.cvl:21.2-7 "$wait".
[junit] State 4
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0:
[junit] | | | | | | 0: (__gcomm__[1])<__gcomm__<2,(boolean[2])<true,false>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>
[junit] | | | | gcomm = &<d0>heap<0,0>[0]
[junit] | | | | start = true
[junit] | | dyscope d1 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | worker_proc = p1
[junit] | | dyscope d3 (id=2, parent=d2, static=7)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 1:
[junit] | | | | | | 0: (__comm__[1])<__comm__<0,&<d0>heap<0,0>[0]>>
[junit] | | | | comm = &<d3>heap<1,0>[0]
[junit] | | dyscope d2 (id=3, parent=d0, static=5)
[junit] | | | variables
[junit] | | | | me = 0
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=4, commBad.cvl:21.2-7 "$wait", dyscope=d1]
[junit] | | process p1(id=1)
[junit] | | | call stack
[junit] | | | | Frame[function=worker, location=8, commBad.cvl:14.2-15 "$comm_dequeue", dyscope=d3]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/commBad_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.74
[junit] maxProcs : 2
[junit] statesInstantiated : 45
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 4
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/commBad_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 518520832
[junit] time (s) : 4.81
[junit] maxProcs : 1
[junit] statesInstantiated : 233
[junit] statesSaved : 22
[junit] statesSeen : 22
[junit] statesMatched : 4
[junit] steps : 70
[junit] transitions : 25
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Message of size 2*SIZEOF_INT exceeds the specified size SIZEOF_INT.Error 0 encountered at depth 8:
[junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert ((message).4<=size)
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Assertion: 0 <= -1*SIZEOF_INT
[junit]
[junit] at comm.cvl:82.2-83.75 "$assert message.size <= size ... size".
[junit] State -1:615475
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope d0 (id=0, parent=NULL, static=0)
[junit] | | | variables
[junit] | | | | __heap =
[junit] | | | | | objects of malloc 0 at messageUnpackBad1.cvl:8.2-42 "y = (int *) ... )":
[junit] | | | | | | 0: (int[2])<1,2>
[junit] | | dyscope d1 (id=1, parent=d0, static=6)
[junit] | | | variables
[junit] | | | | x = (int[2])<1,2>
[junit] | | | | y = &<d0>heap<0,0>[0]
[junit] | | | | m = __message__<0,1,2,inject(2,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | dyscope d7 (id=2, parent=d0, static=5)
[junit] | | | variables
[junit] | | | | message = __message__<0,1,2,inject(2,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | | | buf = &<d0>heap<0,0>[0]
[junit] | | | | size = SIZEOF_INT
[junit] | | | | _anon_0 = "Message of size %d exceeds the specified size %d."
[junit] | Process states
[junit] | | process p0(id=0)
[junit] | | | call stack
[junit] | | | | Frame[function=$message_unpack, location=18, comm.cvl:82.2-9 "$assert", dyscope=d7]
[junit] | | | | Frame[function=_CIVL_system, location=7, messageUnpackBad1.cvl:12.2-17 "$message_unpack", dyscope=d1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/messageUnpackBad1_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 523763712
[junit] time (s) : 5.16
[junit] maxProcs : 1
[junit] statesInstantiated : 122
[junit] statesSaved : 12
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 29
[junit] transitions : 7
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/messageUnpackBad1_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 8:
[junit] CIVL execution error in p0(id=0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE)
[junit] Unpacking data from bundle to pointer: &<d0>heap<1,0>[0]
[junit] at comm.cvl:81.2-35 "$bundle_unpack(message.data, buf)".
[junit] Logging new entry 0, writing trace to CIVLREP/messageUnpackBad2_0.trace
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 523763712
[junit] time (s) : 5.42
[junit] maxProcs : 1
[junit] statesInstantiated : 123
[junit] statesSaved : 12
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 28
[junit] transitions : 7
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/messageUnpackBad2_log.txt
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 523763712
[junit] time (s) : 5.8
[junit] maxProcs : 1
[junit] statesInstantiated : 520
[junit] statesSaved : 53
[junit] statesSeen : 46
[junit] statesMatched : 0
[junit] steps : 140
[junit] transitions : 45
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] ------------- Standard Error -----------------
[junit] Syntax error: The format %l is not allowed.
[junit] at printfBad.cvl:0.-1-7.15 ""x=%l"" from concatenation of the following 1 tokens:
[junit] printfBad.cvl:7.9-15 ""x=%l"".
[junit] Source files:
[junit] f0 : examples/library/stdio/printfBad.cvl
[junit] f1 : civlc.cvh
[junit] f2 : op.h
[junit] f3 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.h
[junit] f4 : /home/svn/work/civl/0.14/r1680/./text/include/stdio.cvl
[junit] f5 : stdio-common.h
[junit] f6 : /home/svn/work/civl/0.14/r1680/./text/include/stdio-c.cvl
[junit] f7 : /home/svn/work/civl/0.14/r1680/./text/include/civlc.cvl
[junit]
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.MPITranslationTest
[junit] Tests run: 11, Failures: 0, Errors: 0, Skipped: 2, Time elapsed: 145.717 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 522715136
[junit] time (s) : 15.4
[junit] maxProcs : 5
[junit] statesInstantiated : 4120
[junit] statesSaved : 412
[junit] statesSeen : 398
[junit] statesMatched : 0
[junit] steps : 747
[junit] transitions : 397
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5468
[junit] proverCalls : 83
[junit] memory (bytes) : 630194176
[junit] time (s) : 35.07
[junit] maxProcs : 3
[junit] statesInstantiated : 10496
[junit] statesSaved : 1042
[junit] statesSeen : 1006
[junit] statesMatched : 12
[junit] steps : 1724
[junit] transitions : 1017
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 630194176
[junit] time (s) : 49.24
[junit] maxProcs : 3
[junit] statesInstantiated : 1977
[junit] statesSaved : 184
[junit] statesSeen : 173
[junit] statesMatched : 0
[junit] steps : 374
[junit] transitions : 172
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 608174080
[junit] time (s) : 65.19
[junit] maxProcs : 5
[junit] statesInstantiated : 4325
[junit] statesSaved : 429
[junit] statesSeen : 412
[junit] statesMatched : 0
[junit] steps : 785
[junit] transitions : 411
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 617611264
[junit] time (s) : 78.87
[junit] maxProcs : 3
[junit] statesInstantiated : 1420
[junit] statesSaved : 134
[junit] statesSeen : 127
[junit] statesMatched : 0
[junit] steps : 269
[junit] transitions : 126
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 623902720
[junit] time (s) : 93.96
[junit] maxProcs : 5
[junit] statesInstantiated : 3806
[junit] statesSaved : 383
[junit] statesSeen : 366
[junit] statesMatched : 0
[junit] steps : 711
[junit] transitions : 365
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 726138880
[junit] time (s) : 112.8
[junit] maxProcs : 3
[junit] statesInstantiated : 8054
[junit] statesSaved : 776
[junit] statesSeen : 741
[junit] statesMatched : 12
[junit] steps : 1238
[junit] transitions : 752
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 743440384
[junit] time (s) : 130.89
[junit] maxProcs : 3
[junit] statesInstantiated : 14885
[junit] statesSaved : 1772
[junit] statesSeen : 1762
[junit] statesMatched : 0
[junit] steps : 2502
[junit] transitions : 1761
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.14 of 2014-10-31 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 0
[junit] proverCalls : 0
[junit] memory (bytes) : 749731840
[junit] time (s) : 145.73
[junit] maxProcs : 5
[junit] statesInstantiated : 3620
[junit] statesSaved : 370
[junit] statesSeen : 356
[junit] statesMatched : 0
[junit] steps : 672
[junit] transitions : 355
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testcase: pi_comp(edu.udel.cis.vsl.civl.MPITranslationTest):SKIPPED
[junit] Testcase: mpi_pi_send(edu.udel.cis.vsl.civl.MPITranslationTest):SKIPPED
[junit] Testsuite: edu.udel.cis.vsl.civl.MessagePassingTest
[junit] Testsuite: edu.udel.cis.vsl.civl.Batch-With-Multiple-Tests
[junit] Tests run: 1, Failures: 0, Errors: 1, Skipped: 0, Time elapsed: 0 sec
[junit]
[junit] Testcase: edu.udel.cis.vsl.civl.Batch-With-Multiple-Tests:wildcardBad: Caused an ERROR
[junit] Timeout occurred. Please note the time in the report does not reflect the time until the timeout.
[junit] junit.framework.AssertionFailedError: Timeout occurred. Please note the time in the report does not reflect the time until the timeout.
[junit] at org.jacoco.ant.CoverageTask.execute(CoverageTask.java:102)
[junit]
[junit]
[junitreport] Processing /home/svn/work/civl/0.14/r1680/junit/data/TESTS-TestSuites.xml to /tmp/null1195970213
[junitreport] Loading stylesheet jar:file:/usr/share/ant/lib/ant-junit.jar!/org/apache/tools/ant/taskdefs/optional/junit/xsl/junit-frames.xsl
[junitreport] Warning: org.apache.xerces.jaxp.SAXParserImpl$JAXPSAXParser: Property 'http://javax.xml.XMLConstants/property/accessExternalDTD' is not recognized.
[junitreport] Warning: org.apache.xerces.jaxp.SAXParserImpl$JAXPSAXParser: Property 'http://www.oracle.com/xml/jaxp/properties/entityExpansionLimit' is not recognized.
[junitreport] Transform time: 1526ms
[junitreport] Deleting: /tmp/null1195970213
test:
[jacoco:report] Loading execution data file /home/svn/work/civl/0.14/r1680/jacoco.exec
[jacoco:report] Writing group "Test Coverage Report for CIVL 0.14 r1680 Regression Suite" with 328 classes
javadoc:
[mkdir] Created dir: /home/svn/work/civl/0.14/r1680/doc/javadoc
[javadoc] Generating Javadoc
[javadoc] Javadoc execution
[javadoc] Loading source files for package edu.udel.cis.vsl.civl...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.config.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.dynamic.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.gui.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.kripke.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.log.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.expression...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.location...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.statement...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.type...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.variable...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.predicate.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.run.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.semantics.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.state.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.transform.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.util.IF...
[javadoc] Constructing Javadoc information...
[javadoc] Standard Doclet version 1.7.0_65
[javadoc] Building tree for all the packages and classes...
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/Dynamics.java:26: warning - @param argument "errLogger" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:38: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:408: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:547: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:557: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:566: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:598: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:612: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:627: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:660: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:677: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:691: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:66: warning - Tag @link: can't find getType in edu.udel.cis.vsl.civl.dynamic.IF.SymbolicUtility
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:297: warning - @param argument "domain" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:297: warning - @param argument "index" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:612: warning - @param argument "domValue" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/gui/IF/CIVL_GUI.java:103: warning - @param argument "transitions" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/kripke/IF/LibraryEnabler.java:58: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/kripke/IF/LibraryEnabler.java:28: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:216: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:223: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:231: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/CIVLSource.java:41: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "out" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "debug" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:663: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:673: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:697: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:886: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:907: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:986: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:997: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1475: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1536: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1562: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1577: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1598: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:113: warning - Tag @link: can't find model(CIVLSource, CIVLFunction) in edu.udel.cis.vsl.civl.model.IF.ModelFactory
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:506: warning - Tag @link: reference not found: CIVLDynamicType
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:673: warning - @param argument "fields" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1170: warning - @param argument "expressionNode" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:75: warning - @param argument "A" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:182: warning - @param argument "des" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/Expression.java:155: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/Expression.java:163: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:40: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/DynamicTypeOfExpression.java:23: warning - Tag @link: reference not found: CIVLDynamicType
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/FunctionGuardExpression.java:21: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/FunctionGuardExpression.java:29: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @param argument "scope" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:18: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:25: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:32: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/expression/WaitGuardExpression.java:15: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:261: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:270: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:278: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:290: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:261: warning - @return tag cannot be used in method with void return type.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:278: warning - @return tag cannot be used in method with void return type.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:180: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:187: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/statement/CallOrSpawnStatement.java:79: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/statement/MallocStatement.java:76: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:193: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:58: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLDomainType.java:36: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLEnumType.java:17: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:74: warning - Tag @link: can't find setDynamicTypeIndex(int) in edu.udel.cis.vsl.civl.model.IF.type.CIVLType
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:58: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/model/IF/variable/Variable.java:119: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/IF/CommandLine.java:33: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/run/IF/UserInterface.java:240: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:250: warning - Tag @link: can't find evaluatePointerAdd(State, String, SymbolicExpression, NumericExpresion, boolean, CIVLSource) in edu.udel.cis.vsl.civl.semantics.IF.Evaluator
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/LibraryEvaluator.java:21: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/LibraryExecutor.java:17: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:36: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:155: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:36: warning - @param argument "assumption" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:131: warning - @param argument "array" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:176: warning - @param argument "process" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/state/IF/State.java:167: warning - @return tag has no arguments.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/state/IF/State.java:49: warning - Tag @link: can't find canonic(State) in edu.udel.cis.vsl.civl.state.IF.StateFactory
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/state/IF/StateFactory.java:127: warning - @param argument "scopeID" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/state/IF/StateFactory.java:543: warning - Tag @see: reference not found: malloc
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/transform/IF/IOTransformer.java:48: warning - @param argument "inputVariables" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/transform/IF/IOTransformer.java:48: warning - @param argument "config" is not a parameter name.
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/transform/IF/TransformerFactory.java:25: warning - Tag @link: can't find applyTransformer(Program, String, List, ASTBuilder) in edu.udel.cis.vsl.civl.transform.IF.TransformerFactory
[javadoc] /home/svn/work/civl/0.14/r1680/src/edu/udel/cis/vsl/civl/util/IF/Transmuter.java:57: warning - @param argument "m" is not a parameter name.
[javadoc] Building index for all the packages and classes...
[javadoc] /home/svn/work/civl/0.14/r1680/src/overview.html: warning - Tag @link: reference not found: edu.udel.cis.vsl.civl.library.IF
[javadoc] Building index for all classes...
[javadoc] Generating /home/svn/work/civl/0.14/r1680/doc/javadoc/help-doc.html...
[javadoc] 91 warnings
bench-compile:
[javac] Compiling 5 source files to /home/svn/work/civl/0.14/r1680/bin
all:
BUILD SUCCESSFUL
Total time: 5 minutes 36 seconds
Stderr:
[junit] Tests FAILED (timeout)