CIVL 0.13 Revision 1506

Downloads, Test and Coverage Reports, and Javadocs

Revision Information

Path: .
Working Copy Root Path: /Users/tester/work/civl/0.13/r1506
URL: svn://vsl.cis.udel.edu/civl/tags/0.13
Relative URL: ^/tags/0.13
Repository Root: svn://vsl.cis.udel.edu/civl
Repository UUID: fb995dde-84ed-4084-dfe6-e5aef3e2452c
Revision: 1506
Node Kind: directory
Schedule: normal
Last Changed Author: ziqing
Last Changed Rev: 1506
Last Changed Date: 2014-08-22 15:39:56 -0400 (Fri, 22 Aug 2014)

Build output

Stdout:

Buildfile: /Users/tester/work/civl/0.13/r1506/build.xml

compile:
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/bin
    [javac] Compiling 352 source files to /Users/tester/work/civl/0.13/r1506/bin
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/state/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/omp/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/common/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/kripke/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/seq/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/type/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/dynamic/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/pointer/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/expression/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/concurrency/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/util/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/pthread/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/predicate/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/bundle/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/transform/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/variable/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/gui/common/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/config/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/string/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/statement/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/asserts/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/gui/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/scope/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/location/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/model/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/run/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/comm/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/library/civlc/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/semantics/IF/package-info.class
    [javac] Creating empty /Users/tester/work/civl/0.13/r1506/bin/edu/udel/cis/vsl/civl/log/IF/package-info.class

jar:
      [jar] Building jar: /Users/tester/work/civl/0.13/r1506/civl.jar

test-init:
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/junit
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/junit/data
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/junit/reports
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/bin-test

test-compile:
    [javac] Compiling 17 source files to /Users/tester/work/civl/0.13/r1506/bin-test

test-run:
[jacoco:coverage] Enhancing junit with coverage
    [junit] objc[43257]: Class JavaLaunchHelper is implemented in both /Library/Java/JavaVirtualMachines/jdk1.7.0_45.jdk/Contents/Home/jre/bin/java and /Library/Java/JavaVirtualMachines/jdk1.7.0_45.jdk/Contents/Home/jre/lib/libinstrument.dylib. One of the two will be used. Which one is undefined.
    [junit] Testsuite: edu.udel.cis.vsl.civl.ArithmeticTest
    [junit] Tests run: 13, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 11.137 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 124
    [junit]    proverCalls         : 20
    [junit]    memory (bytes)      : 257425408
    [junit]    time (s)            : 2.15
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 40724
    [junit]    proverCalls         : 608
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 6.63
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 6.9
    [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.13 of 2014-08-22 -- 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 f0: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 = X_s0v2
    [junit] | | | | y = X_s0v3
    [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, f0: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          : 2
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 7.15
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 295
    [junit]    proverCalls         : 3
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 7.45
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 671
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] civl verify -echo=true examples/arithmetic/math.cvl
    [junit] y=exp(X_s0v2)
    [junit] z=exp(X_s0v2)
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 7.9
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 395
    [junit]    proverCalls         : 67
    [junit]    memory (bytes)      : 466092032
    [junit]    time (s)            : 8.26
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 132
    [junit]    proverCalls         : 69
    [junit]    memory (bytes)      : 627048448
    [junit]    time (s)            : 8.6
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 627048448
    [junit]    time (s)            : 8.8
    [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.13 of 2014-08-22 -- 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 == X_s0v7[0][2]*X_s0v8[2][0]
    [junit] 
    [junit] at f0:68.6-33 "$assert(C[i][j] ... )".
    [junit] State -1:38389
    [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 = X_s0v7
    [junit] | | | | B = X_s0v8
    [junit] | | | | C = CommonSymbolicExpression[ARRAY_LAMBDA; real[3][3]; {CommonSymbolicExpression[LAMBDA; <int>->real[3]; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}]}]}][0:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[0][1]*X_s0v8[1][0]+X_s0v7[0][2]*X_s0v8[2][0]+X_s0v7[0][0]*X_s0v8[0][0], 1:=X_s0v7[0][1]*X_s0v8[1][1]+X_s0v7[0][2]*X_s0v8[2][1]+X_s0v7[0][0]*X_s0v8[0][1], 2:=X_s0v7[0][1]*X_s0v8[1][2]+X_s0v7[0][2]*X_s0v8[2][2]+X_s0v7[0][0]*X_s0v8[0][2]], 1:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[1][1]*X_s0v8[1][0]+X_s0v7[1][2]*X_s0v8[2][0]+X_s0v7[1][0]*X_s0v8[0][0], 1:=X_s0v7[1][1]*X_s0v8[1][1]+X_s0v7[1][2]*X_s0v8[2][1]+X_s0v7[1][0]*X_s0v8[0][1], 2:=X_s0v7[1][1]*X_s0v8[1][2]+X_s0v7[1][2]*X_s0v8[2][2]+X_s0v7[1][0]*X_s0v8[0][2]], 2:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[2][1]*X_s0v8[1][0]+X_s0v7[2][2]*X_s0v8[2][0]+X_s0v7[2][0]*X_s0v8[0][0], 1:=X_s0v7[2][1]*X_s0v8[1][1]+X_s0v7[2][2]*X_s0v8[2][1]+X_s0v7[2][0]*X_s0v8[0][1], 2:=X_s0v7[2][1]*X_s0v8[1][2]+X_s0v7[2][2]*X_s0v8[2][2]+X_s0v7[2][0]*X_s0v8[0][2]]]
    [junit] | | | | D = CommonSymbolicExpression[ARRAY_LAMBDA; real[3][3]; {CommonSymbolicExpression[LAMBDA; <int>->real[3]; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}]}]}][0:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[0][1]*X_s0v8[1][0]+X_s0v7[0][0]*X_s0v8[0][0], 1:=X_s0v7[0][1]*X_s0v8[1][1]+X_s0v7[0][0]*X_s0v8[0][1], 2:=X_s0v7[0][1]*X_s0v8[1][2]+X_s0v7[0][0]*X_s0v8[0][2]], 1:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[1][1]*X_s0v8[1][0]+X_s0v7[1][0]*X_s0v8[0][0], 1:=X_s0v7[1][1]*X_s0v8[1][1]+X_s0v7[1][0]*X_s0v8[0][1], 2:=X_s0v7[1][1]*X_s0v8[1][2]+X_s0v7[1][0]*X_s0v8[0][2]], 2:=CommonSymbolicExpression[ARRAY_LAMBDA; real[3]; {CommonSymbolicExpression[LAMBDA; <int>->real; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; real; {0}]}]}][0:=X_s0v7[2][1]*X_s0v8[1][0]+2*(X_s0v7[2][2]*X_s0v8[2][0])+X_s0v7[2][0]*X_s0v8[0][0], 1:=X_s0v7[2][1]*X_s0v8[1][1]+2*(X_s0v7[2][2]*X_s0v8[2][1])+X_s0v7[2][0]*X_s0v8[0][1], 2:=X_s0v7[2][1]*X_s0v8[1][2]+2*(X_s0v7[2][2]*X_s0v8[2][2])+X_s0v7[2][0]*X_s0v8[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, f0: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          : 892
    [junit]    proverCalls         : 76
    [junit]    memory (bytes)      : 631767040
    [junit]    time (s)            : 9.73
    [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.13 of 2014-08-22 -- 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*X_s0v4[1]+-1/10*X_s0v4[2]+-1/10*X_s0v4[3]+-1/10*X_s0v4[4]+-1/10*X_s0v4[5]+-1/10*X_s0v4[6]+-1/10*X_s0v4[7]+-1/10*X_s0v4[8]+-1/10*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:38637
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/10*X_s0v4[1]+1/10*X_s0v4[2]+1/10*X_s0v4[3]+1/10*X_s0v4[4]+1/10*X_s0v4[5]+1/10*X_s0v4[6]+1/10*X_s0v4[7]+1/10*X_s0v4[8]+1/10*X_s0v4[9]+1/10*X_s0v4[0]
    [junit] | | | | result2 = 1/10*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/9*X_s0v4[2]+-1/9*X_s0v4[3]+-1/9*X_s0v4[4]+-1/9*X_s0v4[5]+-1/9*X_s0v4[6]+-1/9*X_s0v4[7]+-1/9*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:38749
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/9*X_s0v4[1]+1/9*X_s0v4[2]+1/9*X_s0v4[3]+1/9*X_s0v4[4]+1/9*X_s0v4[5]+1/9*X_s0v4[6]+1/9*X_s0v4[7]+1/9*X_s0v4[8]+1/9*X_s0v4[0]
    [junit] | | | | result2 = 1/9*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/8*X_s0v4[2]+-1/8*X_s0v4[3]+-1/8*X_s0v4[4]+-1/8*X_s0v4[5]+-1/8*X_s0v4[6]+-1/8*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:38851
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/8*X_s0v4[1]+1/8*X_s0v4[2]+1/8*X_s0v4[3]+1/8*X_s0v4[4]+1/8*X_s0v4[5]+1/8*X_s0v4[6]+1/8*X_s0v4[7]+1/8*X_s0v4[0]
    [junit] | | | | result2 = 1/8*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/7*X_s0v4[2]+-1/7*X_s0v4[3]+-1/7*X_s0v4[4]+-1/7*X_s0v4[5]+-1/7*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:38943
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/7*X_s0v4[1]+1/7*X_s0v4[2]+1/7*X_s0v4[3]+1/7*X_s0v4[4]+1/7*X_s0v4[5]+1/7*X_s0v4[6]+1/7*X_s0v4[0]
    [junit] | | | | result2 = 1/7*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/6*X_s0v4[2]+-1/6*X_s0v4[3]+-1/6*X_s0v4[4]+-1/6*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:39025
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/6*X_s0v4[1]+1/6*X_s0v4[2]+1/6*X_s0v4[3]+1/6*X_s0v4[4]+1/6*X_s0v4[5]+1/6*X_s0v4[0]
    [junit] | | | | result2 = 1/6*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/5*X_s0v4[2]+-1/5*X_s0v4[3]+-1/5*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:39097
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/5*X_s0v4[1]+1/5*X_s0v4[2]+1/5*X_s0v4[3]+1/5*X_s0v4[4]+1/5*X_s0v4[0]
    [junit] | | | | result2 = 1/5*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/4*X_s0v4[2]+-1/4*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:39159
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/4*X_s0v4[1]+1/4*X_s0v4[2]+1/4*X_s0v4[3]+1/4*X_s0v4[0]
    [junit] | | | | result2 = 1/4*X_s0v4[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*X_s0v4[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, f0: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*X_s0v4[1]+-1/3*X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:39211
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/3*X_s0v4[1]+1/3*X_s0v4[2]+1/3*X_s0v4[0]
    [junit] | | | | result2 = 1/3*X_s0v4[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*X_s0v4[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, f0: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 == X_s0v4[0]
    [junit] 
    [junit] at f0:30.2-27 "$assert(result1==result2)".
    [junit] State -1:39253
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | result1 = 1/2*X_s0v4[1]+1/2*X_s0v4[0]
    [junit] | | | | result2 = 1/2*X_s0v4[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*X_s0v4[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, f0: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          : 421
    [junit]    proverCalls         : 93
    [junit]    memory (bytes)      : 631767040
    [junit]    time (s)            : 10.15
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 54
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 631767040
    [junit]    time (s)            : 10.34
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 246
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] civl verify -echo=true examples/arithmetic/multiplicationInLoopCondition.cvl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 468
    [junit]    proverCalls         : 286
    [junit]    memory (bytes)      : 631767040
    [junit]    time (s)            : 11.49
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 709
    [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: 2, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 5.535 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 24
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 631767040
    [junit]    time (s)            : 0.36
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1336
    [junit]    proverCalls         : 42
    [junit]    memory (bytes)      : 877133824
    [junit]    time (s)            : 5.54
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 4575
    [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: 14.753 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 71433
    [junit]    proverCalls         : 26
    [junit]    memory (bytes)      : 823656448
    [junit]    time (s)            : 5.43
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 201331
    [junit]    statesSaved         : 19144
    [junit]    statesSeen          : 19138
    [junit]    statesMatched       : 14772
    [junit]    steps               : 59789
    [junit]    transitions         : 33909
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 563
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 794296320
    [junit]    time (s)            : 5.52
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 1532
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2514
    [junit]    proverCalls         : 18
    [junit]    memory (bytes)      : 794296320
    [junit]    time (s)            : 5.68
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 1872
    [junit]    statesSaved         : 284
    [junit]    statesSeen          : 280
    [junit]    statesMatched       : 167
    [junit]    steps               : 601
    [junit]    transitions         : 446
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- 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 == X_s0v4[2]
    [junit] 
    [junit] at f0:45.2-21 "$assert(seq == par)".
    [junit] State -1:250068
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | seq = X_s0v4[1]+X_s0v4[2]+X_s0v4[3]+X_s0v4[0]
    [junit] | | | | par = X_s0v4[1]+X_s0v4[3]+X_s0v4[0]
    [junit] | | dyscope d6 (id=2, parent=d5, static=7)
    [junit] | | | variables
    [junit] | | | | s = X_s0v4[1]+X_s0v4[3]+X_s0v4[0]
    [junit] | | | | workers = X_s2v2[0:=UNDEFINED, 1:=UNDEFINED, 2:=UNDEFINED, 3:=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, f0: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 == X_s0v4[1]
    [junit] 
    [junit] at f0:45.2-21 "$assert(seq == par)".
    [junit] State -1:270488
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | seq = X_s0v4[1]+X_s0v4[2]+X_s0v4[0]
    [junit] | | | | par = X_s0v4[2]+X_s0v4[0]
    [junit] | | dyscope d6 (id=2, parent=d17, static=7)
    [junit] | | | variables
    [junit] | | | | s = X_s0v4[2]+X_s0v4[0]
    [junit] | | | | workers = X_s2v2[0:=UNDEFINED, 1:=UNDEFINED, 2:=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, f0: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 == X_s0v4[0]
    [junit] 
    [junit] at f0:45.2-21 "$assert(seq == par)".
    [junit] State -1:272469
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | seq = X_s0v4[1]+X_s0v4[0]
    [junit] | | | | par = X_s0v4[1]
    [junit] | | dyscope d6 (id=2, parent=d27, static=7)
    [junit] | | | variables
    [junit] | | | | s = X_s0v4[1]
    [junit] | | | | workers = X_s2v2[0:=UNDEFINED, 1:=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, f0: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          : 9291
    [junit]    proverCalls         : 38
    [junit]    memory (bytes)      : 794296320
    [junit]    time (s)            : 6.63
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 22986
    [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.13 of 2014-08-22 -- 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, f0:8.0-6 "$input", dyscope=d0]
    [junit] 
    [junit] State 0, p0:
    [junit]   0->1: B = 4 at f0:8.0-12 "$input int B";
    [junit]   1->2: N = InitialValue(N) at f0:9.0-12 "$input int N";
    [junit]   2->3: $assume ((0<=N)&&(N<=B)) at f0:10.0-20 "$assume 0<=N && N ... B";
    [junit]   3->4: a = InitialValue(a) at f0: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 f0:42.15-33 "adderSeq(&a[0],  ... )";
    [junit] --> State 2
    [junit] 
    [junit] Transition 2: State 2, p0:
    [junit]   8->9: s = 0.0 at f0:14.2-16 "double s = 0.0";
    [junit]   9->10: i = 0 at f0:16.7-16 "int i = 0";
    [junit] --> State 3
    [junit] 
    [junit] Transition 3: State 3, p0:
    [junit]   10->11: LOOP_TRUE_BRANCH at f0:16.18-23 "i < n";
    [junit] --> State 5
    [junit] 
    [junit] Transition 4: State 5, p0:
    [junit]   11->12: s = (s+*((p+i))) at f0:17.4-13 "s += p[i]";
    [junit]   12->10: i = (i+1) at f0:16.25-28 "i++";
    [junit] --> State 6
    [junit] 
    [junit] Transition 5: State 6, p0:
    [junit]   10->11: LOOP_TRUE_BRANCH at f0:16.18-23 "i < n";
    [junit] --> State 8
    [junit] 
    [junit] Transition 6: State 8, p0:
    [junit]   11->12: s = (s+*((p+i))) at f0:17.4-13 "s += p[i]";
    [junit]   12->10: i = (i+1) at f0:16.25-28 "i++";
    [junit] --> State 9
    [junit] 
    [junit] Transition 7: State 9, p0:
    [junit]   10->13: LOOP_FALSE_BRANCH at f0:16.18-23 "i < n";
    [junit]   13->RET: return s (adderSeq) at f0: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 f0:43.15-33 "adderPar(&a[0],  ... )";
    [junit] --> State 12
    [junit] 
    [junit] Transition 9: State 12, p0:
    [junit]   14->15: s = 0.0 at f0:23.2-16 "double s = 0.0";
    [junit]   15->16: workers = InitialValue(workers) at f0:24.2-18 "$proc workers[n]";
    [junit]   16->17: j = 0 at f0:34.7-16 "int j = 0";
    [junit] --> State 13
    [junit] 
    [junit] Transition 10: State 13, p0:
    [junit]   17->18: LOOP_TRUE_BRANCH at f0: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 f0:35.17-33 "$spawn worker(j)";
    [junit]   19->17: j = (j+1) at f0:34.25-28 "j++";
    [junit] --> State 15
    [junit] 
    [junit] Transition 12: State 15, p0:
    [junit]   17->18: LOOP_TRUE_BRANCH at f0: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 f0:35.17-33 "$spawn worker(j)";
    [junit]   19->17: j = (j+1) at f0:34.25-28 "j++";
    [junit] --> State 17
    [junit] 
    [junit] Transition 14: State 17, p0:
    [junit]   17->20: LOOP_FALSE_BRANCH at f0:34.18-23 "j < n";
    [junit]   20->21: j = 0 at f0:36.7-16 "int j = 0";
    [junit] --> State 18
    [junit] 
    [junit] Transition 15: State 18, p0:
    [junit]   21->22: LOOP_TRUE_BRANCH at f0:36.18-23 "j < n";
    [junit] --> State 19
    [junit] 
    [junit] Transition 16: State 19, p1:
    [junit]   25->26: t = s at f0:29.4-9 "t = s";
    [junit] --> State 20
    [junit] 
    [junit] Transition 17: State 20, p1:
    [junit]   26->27: t = (t+*((p+i))) at f0:30.4-13 "t += p[i]";
    [junit] --> State 21
    [junit] 
    [junit] Transition 18: State 21, p2:
    [junit]   25->26: t = s at f0:29.4-9 "t = s";
    [junit] --> State 22
    [junit] 
    [junit] Transition 19: State 22, p2:
    [junit]   26->27: t = (t+*((p+i))) at f0:30.4-13 "t += p[i]";
    [junit] --> State 23
    [junit] 
    [junit] Transition 20: State 23, p1:
    [junit]   27->28: s = t at f0:31.4-9 "s = t";
    [junit]   28->RET: return (worker) at f0:32.2-3 "}";
    [junit] --> State 24
    [junit] 
    [junit] Transition 21: State 24, p0:
    [junit]   22->23: $wait(*((&workers[0]+j))) at f0:37.4-21 "$wait(workers[j])";
    [junit]   23->21: j = (j+1) at f0:36.25-28 "j++";
    [junit] --> State 25
    [junit] 
    [junit] Transition 22: State 25, p0:
    [junit]   21->22: LOOP_TRUE_BRANCH at f0:36.18-23 "j < n";
    [junit] --> State 26
    [junit] 
    [junit] Transition 23: State 26, p1:
    [junit]   27->28: s = t at f0:31.4-9 "s = t";
    [junit]   28->RET: return (worker) at f0:32.2-3 "}";
    [junit] --> State 27
    [junit] 
    [junit] Transition 24: State 27, p0:
    [junit]   22->23: $wait(*((&workers[0]+j))) at f0:37.4-21 "$wait(workers[j])";
    [junit]   23->21: j = (j+1) at f0:36.25-28 "j++";
    [junit] --> State 28
    [junit] 
    [junit] Transition 25: State 28, p0:
    [junit]   21->24: LOOP_FALSE_BRANCH at f0:36.18-23 "j < n";
    [junit] --> State 29
    [junit] 
    [junit] Transition 26: State 29, p0:
    [junit]   24->RET: return s (adderPar) at f0: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: true
    [junit]   Assertion: 0 == X_s0v4[0]
    [junit] 
    [junit] at f0:45.2-21 "$assert(seq == par)".
    [junit] State -1:272864
    [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 = X_s0v4
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | seq = X_s0v4[1]+X_s0v4[0]
    [junit] | | | | par = X_s0v4[1]
    [junit] | | dyscope d6 (id=2, parent=d5, static=7)
    [junit] | | | variables
    [junit] | | | | s = X_s0v4[1]
    [junit] | | | | workers = X_s2v2[0:=UNDEFINED, 1:=UNDEFINED]
    [junit] | | dyscope d5 (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, f0:45.2-9 "$assert", dyscope=d1]
    [junit] 
    [junit]   6->7: $assert (seq==par) at f0:45.2-21 "$assert(seq == par)";
    [junit]   7->RET: return (_CIVL_system) at f0:46.0-1 "}";
    [junit] --> State 30
    [junit] 
    [junit] Transition 27: Trace ends after 27 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 81
    [junit]    proverCalls         : 24
    [junit]    memory (bytes)      : 794296320
    [junit]    time (s)            : 6.71
    [junit]    statesInstantiated  : 179
    [junit]    statesSaved         : 31
    [junit]    maxProcs            : 3
    [junit] 
    [junit] 
    [junit] File name list:
    [junit] f0	: adderBad.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: civlc.cvl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 13
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 794296320
    [junit]    time (s)            : 6.75
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 563
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 770703360
    [junit]    time (s)            : 6.84
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 12628
    [junit]    proverCalls         : 25
    [junit]    memory (bytes)      : 770703360
    [junit]    time (s)            : 7.45
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 29164
    [junit]    statesSaved         : 2424
    [junit]    statesSeen          : 2418
    [junit]    statesMatched       : 1708
    [junit]    steps               : 9250
    [junit]    transitions         : 4125
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- 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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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 = X_s1v1[0:=p1, 1:=p2, 2:=p3, 3:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d9]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0:34.4-9 "$wait".
    [junit] State 181
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=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 = X_s1v1[0:=p1, 1:=p2, 2:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0:34.4-9 "$wait".
    [junit] State 181
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=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 = X_s1v1[0:=p1, 1:=p2, 2:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[2]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=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 = X_s1v1[0:=p1, 1:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[2]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=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 = X_s1v1[0:=p1, 1:=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, f0:34.4-9 "$wait", dyscope=d12]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0: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          : 3613
    [junit]    proverCalls         : 18
    [junit]    memory (bytes)      : 770703360
    [junit]    time (s)            : 7.64
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 1911
    [junit]    statesSaved         : 221
    [junit]    statesSeen          : 396
    [junit]    statesMatched       : 155
    [junit]    steps               : 583
    [junit]    transitions         : 550
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/diningBad_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- 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, f0:9.0-6 "$input", dyscope=d0]
    [junit] 
    [junit] State 0, p0:
    [junit]   0->1: B = 4 at f0:9.0-12 "$input int B";
    [junit]   1->2: n = InitialValue(n) at f0:10.0-12 "$input int n";
    [junit]   2->3: $assume ((2<=n)&&(n<=B)) at f0:11.0-20 "$assume 2<=n && n ... B";
    [junit]   3->4: forks = InitialValue(forks) at f0:13.0-12 "int forks[n]";
    [junit]   4->5: philosophers = InitialValue(philosophers) at f0:28.2-23 "$proc philosophers[n]";
    [junit]   5->6: i = 0 at f0:30.7-16 "int i = 0";
    [junit] --> State 1
    [junit] 
    [junit] Transition 1: State 1, p0:
    [junit]   6->7: LOOP_TRUE_BRANCH at f0:30.18-23 "i < n";
    [junit] --> State 2
    [junit] 
    [junit] Transition 2: State 2, p0:
    [junit]   7->8: *((&forks[0]+i)) = 0 at f0:30.30-42 "forks[i] = 0";
    [junit]   8->6: i = (i+1) at f0:30.25-28 "i++";
    [junit] --> State 3
    [junit] 
    [junit] Transition 3: State 3, p0:
    [junit]   6->7: LOOP_TRUE_BRANCH at f0:30.18-23 "i < n";
    [junit] --> State 4
    [junit] 
    [junit] Transition 4: State 4, p0:
    [junit]   7->8: *((&forks[0]+i)) = 0 at f0:30.30-42 "forks[i] = 0";
    [junit]   8->6: i = (i+1) at f0:30.25-28 "i++";
    [junit] --> State 5
    [junit] 
    [junit] Transition 5: State 5, p0:
    [junit]   6->9: LOOP_FALSE_BRANCH at f0:30.18-23 "i < n";
    [junit]   9->10: i = 0 at f0:31.7-16 "int i = 0";
    [junit] --> State 7
    [junit] 
    [junit] Transition 6: State 7, p0:
    [junit]   10->11: LOOP_TRUE_BRANCH at f0: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 f0:32.22-36 "$spawn dine(i)";
    [junit]   12->10: i = (i+1) at f0:31.25-28 "i++";
    [junit] --> State 9
    [junit] 
    [junit] Transition 8: State 9, p0:
    [junit]   10->11: LOOP_TRUE_BRANCH at f0: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 f0:32.22-36 "$spawn dine(i)";
    [junit]   12->10: i = (i+1) at f0:31.25-28 "i++";
    [junit] --> State 11
    [junit] 
    [junit] Transition 10: State 11, p0:
    [junit]   10->13: LOOP_FALSE_BRANCH at f0:31.18-23 "i < n";
    [junit]   13->14: i = 0 at f0:33.7-16 "int i = 0";
    [junit] --> State 12
    [junit] 
    [junit] Transition 11: State 12, p0:
    [junit]   14->15: LOOP_TRUE_BRANCH at f0:33.18-23 "i < n";
    [junit] --> State 13
    [junit] 
    [junit] Transition 12: State 13, p1:
    [junit]   18->19: left = id at f0:16.2-15 "int left = id";
    [junit]   19->20: right = ((id+1)%n) at f0:17.2-26 "int right = (id  ... n";
    [junit] --> State 14
    [junit] 
    [junit] Transition 13: State 14, p1:
    [junit]   20->21: LOOP_TRUE_BRANCH at f0:19.9-10 "1";
    [junit] --> State 15
    [junit] 
    [junit] Transition 14: State 15, p2:
    [junit]   18->19: left = id at f0:16.2-15 "int left = id";
    [junit]   19->20: right = ((id+1)%n) at f0:17.2-26 "int right = (id  ... n";
    [junit] --> State 16
    [junit] 
    [junit] Transition 15: State 16, p2:
    [junit]   20->21: LOOP_TRUE_BRANCH at f0:19.9-10 "1";
    [junit] --> State 17
    [junit] 
    [junit] Transition 16: State 17, p1:
    [junit]   21->22: *((&forks[0]+left)) = 1 at f0:20.29-44 "forks[left] = 1";
    [junit] --> State 18
    [junit] 
    [junit] Transition 17: State 18, p2:
    [junit]   21->22: *((&forks[0]+left)) = 1 at f0:20.29-44 "forks[left] = 1";
    [junit] --> State 19
    [junit] 
    [junit] Transition 18: 
    [junit] State 19
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; int[2]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1]
    [junit] | | dyscope d8 (id=1, parent=d1, static=6)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | philosophers = X_s1v1[0:=p1, 1:=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, f0:34.4-9 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=22, f0:21.30-42 "forks[right]", dyscope=d7]
    [junit] 
    [junit] Violation of Deadlock found in State 19:
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 15, f0:34.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 22, f0:21.30-42 "forks[right]"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 22, f0: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          : 91
    [junit]    proverCalls         : 8
    [junit]    memory (bytes)      : 770703360
    [junit]    time (s)            : 7.7
    [junit]    statesInstantiated  : 120
    [junit]    statesSaved         : 20
    [junit]    maxProcs            : 3
    [junit] 
    [junit] 
    [junit] File name list:
    [junit] f0	: diningBad.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: civlc.cvl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1190
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 770703360
    [junit]    time (s)            : 7.87
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4058
    [junit]    proverCalls         : 39
    [junit]    memory (bytes)      : 749207552
    [junit]    time (s)            : 8.31
    [junit]    maxProcs            : 6
    [junit]    statesInstantiated  : 7847
    [junit]    statesSaved         : 1281
    [junit]    statesSeen          : 1271
    [junit]    statesMatched       : 360
    [junit]    steps               : 2170
    [junit]    transitions         : 1630
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 46
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 749207552
    [junit]    time (s)            : 8.35
    [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.13 of 2014-08-22 -- 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, f0:4.1-6 "$wait"
    [junit]   Enabling predicate: false
    [junit] at f0: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, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 749207552
    [junit]    time (s)            : 8.38
    [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.13 of 2014-08-22 -- 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, f0:44.26-31 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d9]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d11]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d12]
    [junit] | | | | Frame[function=run, location=36, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:368498
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=24, f0:21.2-4 "if", dyscope=d11]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:368543
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=0, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=22, f0:19.2-17 "in_barrier[tid]", dyscope=d106]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:368592
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=0, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d11]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:368715
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=0, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=24, f0:21.2-4 "if", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=29, f0:23.4-18 "num_in_barrier", dyscope=d11]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:369854
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=0, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=24, f0:21.2-4 "if", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:370264
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=24, f0:21.2-4 "if", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:370943
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=0, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=22, f0:19.2-17 "in_barrier[tid]", dyscope=d997]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:371908
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=0, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:372052
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[4]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3, 3:=p4]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[4]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=1, 3:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d6]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d13]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:435891
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[3]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=0, 2:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=22, f0:19.2-17 "in_barrier[tid]", dyscope=d997]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:435940
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[3]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=0, 2:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:436360
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[3]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=0, 2:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d419]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0: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 f0:34.4-25 "$assert(counter == N)".
    [junit] State -1:436483
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[3]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2, 2:=p3]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[3]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=0, 1:=1, 2:=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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run, location=37, f0:34.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d419]
    [junit] | | | | Frame[function=run, location=34, f0:31.4-11 "barrier", dyscope=d5]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=27, f0:22.28-41 "in_barrier[i]", dyscope=d415]
    [junit] | | | | Frame[function=run, location=34, f0: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, f0:44.26-31 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[2]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[2]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 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, f0:44.26-31 "$wait", dyscope=d8]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d9]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d10]
    [junit] | | | | Frame[function=run, location=36, f0: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          : 84488
    [junit]    proverCalls         : 25
    [junit]    memory (bytes)      : 669515776
    [junit]    time (s)            : 12.5
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 126772
    [junit]    statesSaved         : 13979
    [junit]    statesSeen          : 13976
    [junit]    statesMatched       : 13823
    [junit]    steps               : 39706
    [junit]    transitions         : 27798
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/barrierBad_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- 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, f0:6.0-6 "$input", dyscope=d0]
    [junit] 
    [junit] State 0, p0:
    [junit]   0->1: B = 4 at f0:6.0-12 "$input int B";
    [junit]   1->2: N = InitialValue(N) at f0:7.0-12 "$input int N";
    [junit]   2->3: $assume ((1<=N)&&(N<=B)) at f0:8.0-20 "$assume 1<=N && N ... B";
    [junit]   3->4: threads = InitialValue(threads) at f0:9.0-16 "$proc threads[N]";
    [junit]   4->5: in_barrier = InitialValue(in_barrier) at f0:10.0-17 "int in_barrier[N]";
    [junit]   5->6: num_in_barrier = 0 at f0:11.0-22 "int num_in_barrier = 0";
    [junit]   6->7: counter = 0 at f0:12.0-15 "int counter = 0";
    [junit]   7->17: init() at f0:42.2-8 "init()";
    [junit] --> State 1
    [junit] 
    [junit] Transition 1: State 1, p0:
    [junit]   17->18: i = 0 at f0:15.7-14 "int i=0";
    [junit] --> State 2
    [junit] 
    [junit] Transition 2: State 2, p0:
    [junit]   18->19: LOOP_TRUE_BRANCH at f0:15.16-19 "i<N";
    [junit] --> State 3
    [junit] 
    [junit] Transition 3: State 3, p0:
    [junit]   19->20: *((&in_barrier[0]+i)) = 0 at f0:15.26-43 "in_barrier[i] = 0";
    [junit]   20->18: i = (i+1) at f0:15.21-24 "i++";
    [junit] --> State 4
    [junit] 
    [junit] Transition 4: State 4, p0:
    [junit]   18->19: LOOP_TRUE_BRANCH at f0:15.16-19 "i<N";
    [junit] --> State 6
    [junit] 
    [junit] Transition 5: State 6, p0:
    [junit]   19->20: *((&in_barrier[0]+i)) = 0 at f0:15.26-43 "in_barrier[i] = 0";
    [junit]   20->18: i = (i+1) at f0:15.21-24 "i++";
    [junit] --> State 7
    [junit] 
    [junit] Transition 6: State 7, p0:
    [junit]   18->21: LOOP_FALSE_BRANCH at f0:15.16-19 "i<N";
    [junit]   21->RET: return (init) at f0:16.0-1 "}";
    [junit]   8->9: i = 0 at f0:43.7-14 "int i=0";
    [junit] --> State 9
    [junit] 
    [junit] Transition 7: State 9, p0:
    [junit]   9->10: LOOP_TRUE_BRANCH at f0: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 f0:43.39-52 "$spawn run(i)";
    [junit]   11->9: i = (i+1) at f0:43.21-24 "i++";
    [junit] --> State 11
    [junit] 
    [junit] Transition 9: State 11, p0:
    [junit]   9->10: LOOP_TRUE_BRANCH at f0: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 f0:43.39-52 "$spawn run(i)";
    [junit]   11->9: i = (i+1) at f0:43.21-24 "i++";
    [junit] --> State 13
    [junit] 
    [junit] Transition 11: State 13, p0:
    [junit]   9->12: LOOP_FALSE_BRANCH at f0:43.16-19 "i<N";
    [junit]   12->13: i = 0 at f0:44.7-14 "int i=0";
    [junit] --> State 14
    [junit] 
    [junit] Transition 12: State 14, p0:
    [junit]   13->14: LOOP_TRUE_BRANCH at f0:44.16-19 "i<N";
    [junit] --> State 15
    [junit] 
    [junit] Transition 13: State 15, p1:
    [junit]   32->33: LOOP_TRUE_BRANCH at f0:29.9-14 "$true";
    [junit] --> State 16
    [junit] 
    [junit] Transition 14: State 16, p2:
    [junit]   32->33: LOOP_TRUE_BRANCH at f0:29.9-14 "$true";
    [junit] --> State 17
    [junit] 
    [junit] Transition 15: State 17, p1:
    [junit]   33->34: $assert (counter==0) at f0:30.4-25 "$assert(counter == 0)";
    [junit]   34->22: barrier(tid) at f0:31.4-16 "barrier(tid)";
    [junit] --> State 18
    [junit] 
    [junit] Transition 16: State 18, p1:
    [junit]   22->23: *((&in_barrier[0]+tid)) = 1 at f0: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 f0:20.2-18 "num_in_barrier++";
    [junit] --> State 20
    [junit] 
    [junit] Transition 18: State 20, p1:
    [junit]   24->30: ELSE_BRANCH at f0:24.2-3 "}";
    [junit] --> State 21
    [junit] 
    [junit] Transition 19: State 21, p2:
    [junit]   33->34: $assert (counter==0) at f0:30.4-25 "$assert(counter == 0)";
    [junit]   34->22: barrier(tid) at f0:31.4-16 "barrier(tid)";
    [junit] --> State 22
    [junit] 
    [junit] Transition 20: State 22, p2:
    [junit]   22->23: *((&in_barrier[0]+tid)) = 1 at f0: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 f0:20.2-18 "num_in_barrier++";
    [junit] --> State 24
    [junit] 
    [junit] Transition 22: State 24, p2:
    [junit]   24->25: IF_BRANCH at f0:21.27-28 "{";
    [junit]   25->26: i = 0 at f0:22.9-16 "int i=0";
    [junit] --> State 25
    [junit] 
    [junit] Transition 23: State 25, p2:
    [junit]   26->27: LOOP_TRUE_BRANCH at f0:22.18-21 "i<N";
    [junit] --> State 26
    [junit] 
    [junit] Transition 24: State 26, p2:
    [junit]   27->28: *((&in_barrier[0]+i)) = 0 at f0:22.28-45 "in_barrier[i] = 0";
    [junit]   28->26: i = (i+1) at f0:22.23-26 "i++";
    [junit] --> State 27
    [junit] 
    [junit] Transition 25: State 27, p2:
    [junit]   26->27: LOOP_TRUE_BRANCH at f0:22.18-21 "i<N";
    [junit] --> State 28
    [junit] 
    [junit] Transition 26: State 28, p1:
    [junit]   30->31: NO_OP at f0:25.30-31 ";";
    [junit]   31->RET: return (barrier) at f0:26.0-1 "}";
    [junit] --> State 29
    [junit] 
    [junit] Transition 27: State 29, p1:
    [junit]   35->36: counter = (counter+1) at f0:32.4-13 "counter++";
    [junit]   36->22: barrier(tid) at f0:33.4-16 "barrier(tid)";
    [junit] --> State 30
    [junit] 
    [junit] Transition 28: State 30, p1:
    [junit]   22->23: *((&in_barrier[0]+tid)) = 1 at f0: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 f0:20.2-18 "num_in_barrier++";
    [junit] --> State 32
    [junit] 
    [junit] Transition 30: State 32, p1:
    [junit]   24->30: ELSE_BRANCH at f0:24.2-3 "}";
    [junit] --> State 33
    [junit] 
    [junit] Transition 31: State 33, p2:
    [junit]   27->28: *((&in_barrier[0]+i)) = 0 at f0:22.28-45 "in_barrier[i] = 0";
    [junit]   28->26: i = (i+1) at f0:22.23-26 "i++";
    [junit] --> State 34
    [junit] 
    [junit] Transition 32: State 34, p2:
    [junit]   26->29: LOOP_FALSE_BRANCH at f0:22.18-21 "i<N";
    [junit] --> State 35
    [junit] 
    [junit] Transition 33: State 35, p2:
    [junit]   29->30: num_in_barrier = 0 at f0:23.4-22 "num_in_barrier = 0";
    [junit] --> State 36
    [junit] 
    [junit] Transition 34: State 36, p2:
    [junit]   30->31: NO_OP at f0:25.30-31 ";";
    [junit]   31->RET: return (barrier) at f0:26.0-1 "}";
    [junit] --> State 37
    [junit] 
    [junit] Transition 35: State 37, p2:
    [junit]   35->36: counter = (counter+1) at f0:32.4-13 "counter++";
    [junit]   36->22: barrier(tid) at f0:33.4-16 "barrier(tid)";
    [junit] --> State 38
    [junit] 
    [junit] Transition 36: State 38, p2:
    [junit]   22->23: *((&in_barrier[0]+tid)) = 1 at f0: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 f0:20.2-18 "num_in_barrier++";
    [junit] --> State 40
    [junit] 
    [junit] Transition 38: State 40, p2:
    [junit]   24->30: ELSE_BRANCH at f0:24.2-3 "}";
    [junit] --> State 41
    [junit] 
    [junit] Transition 39: 
    [junit] State 41
    [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 = CommonSymbolicExpression[ARRAY_LAMBDA; process[2]; {CommonSymbolicExpression[LAMBDA; <int>->process; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],CommonSymbolicExpression[CONCRETE; process; {Sequence<-2>}]}]}][0:=p1, 1:=p2]
    [junit] | | | | in_barrier = CommonSymbolicExpression[ARRAY_LAMBDA; int[2]; {CommonSymbolicExpression[LAMBDA; <int>->int; {IdealSymbolicConstant[SYMBOLIC_CONSTANT; int; {i}],NTConstant[CONCRETE; int; {0}]}]}][0:=1, 1:=1]
    [junit] | | | | num_in_barrier = 1
    [junit] | | | | counter = 2
    [junit] | | dyscope d6 (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 d7 (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 d8 (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, f0:44.26-31 "$wait", dyscope=d6]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d7]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, f0:25.30-31 ";", dyscope=d8]
    [junit] | | | | Frame[function=run, location=36, f0:33.4-11 "barrier", dyscope=d5]
    [junit] 
    [junit] Violation of Deadlock found in State 41:
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 14, f0:44.26-31 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 30, f0:25.30-31 ";"
    [junit]   Enabling predicate: false
    [junit] 
    [junit] Trace ends after 39 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 174
    [junit]    proverCalls         : 15
    [junit]    memory (bytes)      : 669515776
    [junit]    time (s)            : 12.57
    [junit]    statesInstantiated  : 227
    [junit]    statesSaved         : 42
    [junit]    maxProcs            : 3
    [junit] 
    [junit] 
    [junit] File name list:
    [junit] f0	: barrierBad.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: civlc.cvl
    [junit] CIVL v0.13 of 2014-08-22 -- 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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1, 2:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[1]+X_s0v6[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 = X_s0v6[2]+X_s0v6[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 = X_s0v6[4]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0:38.20-24 "lock", dyscope=d10]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] ProcessState 3: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2, 2:=p3]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[2]+X_s0v6[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 = X_s0v6[1]+X_s0v6[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 = X_s0v6[4]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[1]+X_s0v6[2]+X_s0v6[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 = X_s0v6[3]+X_s0v6[4]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[3]+X_s0v6[4]+X_s0v6[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 = X_s0v6[1]+X_s0v6[2]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[1]+X_s0v6[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 = X_s0v6[2]+X_s0v6[3]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[2]+X_s0v6[3]+X_s0v6[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 = X_s0v6[1]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[1]+X_s0v6[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 = X_s0v6[2]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[2]+X_s0v6[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 = X_s0v6[1]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[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 = X_s0v6[1]+X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[1]+X_s0v6[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 = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=p1]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[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 = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[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 = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[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 = X_s2v1[0:=UNDEFINED, 1:=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 = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0:38.20-24 "lock"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] at f0: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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[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 = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d15]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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          : 4141
    [junit]    proverCalls         : 138
    [junit]    memory (bytes)      : 676855808
    [junit]    time (s)            : 13.14
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 7522
    [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.13 of 2014-08-22 -- 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, f0:9.0-6 "$input", dyscope=d0]
    [junit] 
    [junit] State 0, p0:
    [junit]   0->1: B = 6 at f0:9.0-12 "$input int B";
    [junit]   1->2: W = 3 at f0:10.0-12 "$input int W";
    [junit]   2->3: N = InitialValue(N) at f0:12.0-12 "$input int N";
    [junit]   3->4: $assume ((1<=N)&&(N<=B)) at f0:13.0-20 "$assume N>=1 && N ... B";
    [junit]   4->5: P = InitialValue(P) at f0:14.0-12 "$input int P";
    [junit]   5->6: $assume ((1<=P)&&(P<=W)) at f0:15.0-20 "$assume P>=1 && P ... W";
    [junit]   6->7: a = InitialValue(a) at f0:16.0-18 "$input double a[N]";
    [junit]   7->11: sum_seq = adder_seq() at f0:52.19-30 "adder_seq()";
    [junit] --> State 1
    [junit] 
    [junit] Transition 1: State 1, p0:
    [junit]   11->12: s = 0.0 at f0:19.2-16 "double s = 0.0";
    [junit]   12->13: i = 0 at f0:21.7-14 "int i=0";
    [junit] --> State 2
    [junit] 
    [junit] Transition 2: State 2, p0:
    [junit]   13->14: LOOP_TRUE_BRANCH at f0:21.16-19 "i<N";
    [junit] --> State 3
    [junit] 
    [junit] Transition 3: State 3, p0:
    [junit]   14->15: s = (s+*((&a[0]+i))) at f0:22.4-13 "s += a[i]";
    [junit]   15->13: i = (i+1) at f0:21.21-24 "i++";
    [junit] --> State 4
    [junit] 
    [junit] Transition 4: State 4, p0:
    [junit]   13->16: LOOP_FALSE_BRANCH at f0:21.16-19 "i<N";
    [junit]   16->RET: return s (adder_seq) at f0:23.2-11 "return s;";
    [junit]   8->17: sum_par = adder_par() at f0:53.19-30 "adder_par()";
    [junit] --> State 6
    [junit] 
    [junit] Transition 5: State 6, p0:
    [junit]   17->18: workers = InitialValue(workers) at f0:27.2-18 "$proc workers[P]";
    [junit]   18->19: lock = 0 at f0:28.2-14 "int lock = 0";
    [junit]   19->20: result = 0.0 at f0:29.2-21 "double result = 0.0";
    [junit]   20->21: i = 0 at f0:43.7-14 "int i=0";
    [junit] --> State 7
    [junit] 
    [junit] Transition 6: State 7, p0:
    [junit]   21->22: LOOP_TRUE_BRANCH at f0:43.16-19 "i<P";
    [junit] --> State 8
    [junit] 
    [junit] Transition 7: State 8, p0:
    [junit]   22->21: i = (i+1) at f0:43.21-24 "i++";
    [junit] --> State 9
    [junit] 
    [junit] Transition 8: State 9, p0:
    [junit]   21->22: LOOP_TRUE_BRANCH at f0:43.16-19 "i<P";
    [junit] --> State 11
    [junit] 
    [junit] Transition 9: State 11, p0:
    [junit]   22->21: i = (i+1) at f0:43.21-24 "i++";
    [junit] --> State 12
    [junit] 
    [junit] Transition 10: State 12, p0:
    [junit]   21->23: LOOP_FALSE_BRANCH at f0:43.16-19 "i<P";
    [junit]   23->24: i = 0 at f0:44.7-14 "int i=0";
    [junit] --> State 14
    [junit] 
    [junit] Transition 11: State 14, p0:
    [junit]   24->25: LOOP_TRUE_BRANCH at f0: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 f0:45.17-37 "$spawn run_worker(i)";
    [junit]   26->24: i = (i+1) at f0:44.21-24 "i++";
    [junit] --> State 16
    [junit] 
    [junit] Transition 13: State 16, p0:
    [junit]   24->25: LOOP_TRUE_BRANCH at f0: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 f0:45.17-37 "$spawn run_worker(i)";
    [junit]   26->24: i = (i+1) at f0:44.21-24 "i++";
    [junit] --> State 18
    [junit] 
    [junit] Transition 15: State 18, p0:
    [junit]   24->27: LOOP_FALSE_BRANCH at f0:44.16-19 "i<P";
    [junit]   27->28: i = 0 at f0:46.7-14 "int i=0";
    [junit] --> State 19
    [junit] 
    [junit] Transition 16: State 19, p0:
    [junit]   28->29: LOOP_TRUE_BRANCH at f0:46.16-19 "i<P";
    [junit] --> State 20
    [junit] 
    [junit] Transition 17: State 20, p1:
    [junit]   32->33: start = ((id*N)/P) at f0:32.4-24 "int start = (id* ... P";
    [junit]   33->34: stop = (((id+1)*N)/P) at f0:33.4-27 "int stop = ((id ... P";
    [junit]   34->35: localSum = 0.0 at f0:34.4-25 "double localSum = 0.0";
    [junit]   35->36: i = start at f0:36.9-20 "int i=start";
    [junit] --> State 21
    [junit] 
    [junit] Transition 18: State 21, p1:
    [junit]   36->39: LOOP_FALSE_BRANCH at f0:36.22-28 "i<stop";
    [junit] --> State 22
    [junit] 
    [junit] Transition 19: State 22, p2:
    [junit]   32->33: start = ((id*N)/P) at f0:32.4-24 "int start = (id* ... P";
    [junit]   33->34: stop = (((id+1)*N)/P) at f0:33.4-27 "int stop = ((id ... P";
    [junit]   34->35: localSum = 0.0 at f0:34.4-25 "double localSum = 0.0";
    [junit]   35->36: i = start at f0:36.9-20 "int i=start";
    [junit] --> State 23
    [junit] 
    [junit] Transition 20: State 23, p2:
    [junit]   36->37: LOOP_TRUE_BRANCH at f0:36.22-28 "i<stop";
    [junit] --> State 24
    [junit] 
    [junit] Transition 21: State 24, p2:
    [junit]   37->38: localSum = (localSum+*((&a[0]+i))) at f0:37.6-22 "localSum += a[i]";
    [junit]   38->36: i = (i+1) at f0:36.30-33 "i++";
    [junit] --> State 25
    [junit] 
    [junit] Transition 22: State 25, p2:
    [junit]   36->39: LOOP_FALSE_BRANCH at f0:36.22-28 "i<stop";
    [junit] --> State 26
    [junit] 
    [junit] Transition 23: State 26, p2:
    [junit]   39->40: lock = 1 at f0:38.20-28 "lock = 1";
    [junit] --> State 27
    [junit] 
    [junit] Transition 24: State 27, p2:
    [junit]   40->41: result = (result+localSum) at f0:39.4-22 "result += localSum";
    [junit]   41->RET: return (run_worker) at f0:41.2-3 "}";
    [junit] --> State 28
    [junit] 
    [junit] Transition 25: 
    [junit] State 28
    [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 = X_s0v6
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | sum_seq = X_s0v6[0]
    [junit] | | | | sum_par = NULL
    [junit] | | dyscope d13 (id=2, parent=d6, static=11)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d6 (id=3, parent=d5, static=7)
    [junit] | | | variables
    [junit] | | | | workers = X_s2v1[0:=p1, 1:=p2]
    [junit] | | | | lock = 1
    [junit] | | | | result = X_s0v6[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, f0:47.4-9 "$wait", dyscope=d13]
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:53.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=39, f0: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: true
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 29, f0:47.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 39, f0: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          : 94
    [junit]    proverCalls         : 27
    [junit]    memory (bytes)      : 676855808
    [junit]    time (s)            : 13.23
    [junit]    statesInstantiated  : 193
    [junit]    statesSaved         : 29
    [junit]    maxProcs            : 3
    [junit] 
    [junit] 
    [junit] File name list:
    [junit] f0	: blockAdderBad.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: civlc.cvl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 14149
    [junit]    proverCalls         : 138
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 14.32
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 44445
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 136
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 14.58
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 2005
    [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.13 of 2014-08-22 -- 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, f0:32.2-7 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 12, f0:12.17-18 "y"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 20, f0:21.17-18 "x"
    [junit]   Enabling predicate: false
    [junit] at f0: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, f0:32.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f, location=12, f0:12.17-18 "y", dyscope=d3]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=g, location=20, f0: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          : 110
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 14.64
    [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.13 of 2014-08-22 -- 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, f0:31.2-7 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 9, f0:12.19-24 "lock1"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 15, f0:21.19-24 "lock0"
    [junit]   Enabling predicate: false
    [junit] at f0: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, f0:31.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=proc0, location=9, f0:12.19-24 "lock1", dyscope=d2]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=proc1, location=15, f0: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          : 7
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 14.67
    [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.13 of 2014-08-22 -- 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 f0:23.2-17 "$assert(s1==s2)".
    [junit] State -1:504451
    [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, f0:23.2-9 "$assert", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f1, location=12, f0:11.26-28 "s1", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f2, location=15, f0: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          : 575
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 14.76
    [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: 1.291 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 551
    [junit]    proverCalls         : 18
    [junit]    memory (bytes)      : 634388480
    [junit]    time (s)            : 0.36
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 1371
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 10390
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 620232704
    [junit]    time (s)            : 1.3
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 38640
    [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: 0.655 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 0
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 620232704
    [junit]    time (s)            : 0.17
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 53
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 620232704
    [junit]    time (s)            : 0.48
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 276
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 23
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 620232704
    [junit]    time (s)            : 0.66
    [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: 90, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 15.283 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- 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 f0:14.8-9 "p".
    [junit] State -1:544885
    [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, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 620232704
    [junit]    time (s)            : 0.05
    [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.13 of 2014-08-22 -- 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] The lhs a cannot be updated because the invocaion of the function f returns without any expression.
    [junit] at f0:18.10-13 "f()".
    [junit] State -1:544907
    [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, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.23
    [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.13 of 2014-08-22 -- 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 f0:11.10-14 "p[4]".
    [junit] State -1:544933
    [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, f0: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          : 4
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.27
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 26
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.3
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 28
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 13
    [junit]    proverCalls         : 3
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.34
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 30
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.5
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 101
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 0
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.51
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.67
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 14
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.72
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 42
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.75
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 4:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (*((pc+0))==*((pc+1)))
    [junit]   Path condition: (0 <= -1*X_s0v2+254) && (0 <= -1*X_s0v3+254) && (0 <= X_s0v2+-1) && (0 <= SIZEOF_CHAR+-1) && (0 <= X_s0v3+-1)
    [junit]   Assertion: int2char(X_s0v2) == int2char(X_s0v3)
    [junit] 
    [junit] at f0:15.2-25 "$assert(pc[0] ==  ... )".
    [junit] State -1:545266
    [junit] | Path condition
    [junit] | | (0 <= -1*X_s0v2+254) && (0 <= -1*X_s0v3+254) && (0 <= X_s0v2+-1) && (0 <= SIZEOF_CHAR+-1) && (0 <= X_s0v3+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(CHAR[1][])<Hop0s0f0o0[0:=int2char(X_s0v2), 1:=int2char(X_s0v3)]>>
    [junit] | | | | num1 = X_s0v2
    [junit] | | | | num2 = X_s0v3
    [junit] | | dyscope d1 (id=1, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | pc = &<d0>heap<0,0>[0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, f0:15.2-9 "$assert", dyscope=d1]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/int2charBad_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 14
    [junit]    proverCalls         : 7
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.94
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 42
    [junit]    statesSaved         : 5
    [junit]    statesSeen          : 4
    [junit]    statesMatched       : 0
    [junit]    steps               : 8
    [junit]    transitions         : 3
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/int2charBad_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 0.97
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.14
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 5
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.18
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 34
    [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.13 of 2014-08-22 -- 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 f0:10.2-12 "$assert(p)".
    [junit] State -1:545378
    [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, f0: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          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.21
    [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.13 of 2014-08-22 -- 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 f0:23.2-5 "*gp".
    [junit] State -1:545448
    [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, f0:31.2-7 "$wait", dyscope=d1]
    [junit] | | process p2(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=goo, location=14, f0: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          : 5
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.25
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 70
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] I'm not null.
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.42
    [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.13 of 2014-08-22 -- 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 f0:13.9-20 "x[1] - x[ ... ]".
    [junit] State -1:545547
    [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 = $heap<(pointer[1][])<Ho0[0:=&<d0>heap<1,0>[0], 1:=&<d0>heap<1,1>[0], 2:=&<d0>heap<1,2>[0]]>,(real[3][])<Ho1,Ho2,Ho3>>
    [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, f0: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          : 22
    [junit]    proverCalls         : 5
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.68
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 77
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.71
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.75
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 86
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.8
    [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.13 of 2014-08-22 -- 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 f0: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          : 344
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 1.97
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 1020
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 11
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 2.0
    [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.13 of 2014-08-22 -- 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 f0:13.2-48 "$assert b > a : ... a".
    [junit] State -1:547011
    [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, f0: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          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 2.17
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] x=colorOf(X_s1v1[2])
    [junit] x=colorOf(X_s1v1[1])
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 2.35
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 45
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 66
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 2.36
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 32
    [junit]    proverCalls         : 11
    [junit]    memory (bytes)      : 598736896
    [junit]    time (s)            : 4.1
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 90
    [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.13 of 2014-08-22 -- 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 f0:9.10-30 "(&a[0][0] ... )"
    [junit] at f0:9.10-30 "(&a[0][0] ... )".
    [junit] State -1:547423
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | a = X_s0v2
    [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, f0: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          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.29
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] i=0
    [junit] i=1
    [junit] i=2
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 13
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.48
    [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.13 of 2014-08-22 -- 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 f0:16.9-24 "(&p[0][0] ... )"
    [junit] at f0:16.9-24 "(&p[0][0] ... )".
    [junit] State -1:549237
    [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 = $heap<(pointer[1][])<Ho0[0:=&<d0>heap<1,0>[0], 1:=&<d0>heap<1,1>[0], 2:=&<d0>heap<1,2>[0], 3:=&<d0>heap<1,3>[0], 4:=&<d0>heap<1,4>[0], 5:=&<d0>heap<1,5>[0], 6:=&<d0>heap<1,6>[0], 7:=&<d0>heap<1,7>[0], 8:=&<d0>heap<1,8>[0], 9:=&<d0>heap<1,9>[0]]>,(int[10][])<Ho1[0:=0, 1:=0, 2:=0, 3:=0, 4:=0, 5:=0, 6:=0, 7:=0, 8:=0, 9:=0],Ho2[0:=1, 1:=1, 2:=1, 3:=1, 4:=1, 5:=1, 6:=1, 7:=1, 8:=1, 9:=1],Ho3[0:=2, 1:=2, 2:=2, 3:=2, 4:=2, 5:=2, 6:=2, 7:=2, 8:=2, 9:=2],Ho4[0:=3, 1:=3, 2:=3, 3:=3, 4:=3, 5:=3, 6:=3, 7:=3, 8:=3, 9:=3],Ho5[0:=4, 1:=4, 2:=4, 3:=4, 4:=4, 5:=4, 6:=4, 7:=4, 8:=4, 9:=4],Ho6[0:=5, 1:=5, 2:=5, 3:=5, 4:=5, 5:=5, 6:=5, 7:=5, 8:=5, 9:=5],Ho7[0:=6, 1:=6, 2:=6, 3:=6, 4:=6, 5:=6, 6:=6, 7:=6, 8:=6, 9:=6],Ho8[0:=7, 1:=7, 2:=7, 3:=7, 4:=7, 5:=7, 6:=7, 7:=7, 8:=7, 9:=7],Ho9[0:=8, 1:=8, 2:=8, 3:=8, 4:=8, 5:=8, 6:=8, 7:=8, 8:=8, 9:=8],Ho10[0:=9, 1:=9, 2:=9, 3:=9, 4:=9, 5:=9, 6:=9, 7:=9, 8:=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, f0: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          : 478
    [junit]    proverCalls         : 12
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.74
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 1696
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 28
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.78
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 37
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.81
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 0
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 4.82
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 3
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.47
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.5
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.53
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] b is true
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.71
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 16
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.74
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 100
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.78
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 196
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.81
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 7
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 5.85
    [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.13 of 2014-08-22 -- 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 f0:11.9-14 "p - b".
    [junit] State -1:549849
    [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 = X_s1v2
    [junit] | | | | b = X_s1v3
    [junit] | | | | diff = NULL
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.01
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 18
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.04
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 86
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.07
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 266
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1077
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.29
    [junit]    maxProcs            : 9
    [junit]    statesInstantiated  : 6475
    [junit]    statesSaved         : 259
    [junit]    statesSeen          : 259
    [junit]    statesMatched       : 769
    [junit]    steps               : 2057
    [junit]    transitions         : 1027
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 70
    [junit]    proverCalls         : 27
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.37
    [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.13 of 2014-08-22 -- 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 f0:20.0-1 "}".
    [junit] State -1:556748
    [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, f0:20.0-1 "}", dyscope=d0]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=4, f0: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)      : 596115456
    [junit]    time (s)            : 6.4
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v0.13 of 2014-08-22 -- 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
    [junit] at f0:10.2-3 "p".
    [junit] State -1:556755
    [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, f0: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)      : 596115456
    [junit]    time (s)            : 6.46
    [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.13 of 2014-08-22 -- 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 f0:11.6-12 "n.next".
    [junit] State -1:556764
    [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, f0: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          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.5
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 47
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.55
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 231
    [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.13 of 2014-08-22 -- 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 f0:15.2-5 "*ka".
    [junit] State -1:557015
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | k = X_s0v2
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | | | | p = &<d0>k
    [junit] | | | | q = X_s1v2
    [junit] | | | | ka = &<d0>k.a
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=4, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 596115456
    [junit]    time (s)            : 6.59
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 20
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 45
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.03
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 237
    [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.13 of 2014-08-22 -- 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] 
    [junit] File name list:
    [junit] f0	: int2charBad2.cvl
    [junit] f1	: stdio.h
    [junit] f2	: civlc.cvh
    [junit] f3	: op.h
    [junit] f4	: stdio.cvl
    [junit] f5	: stdio-common.h
    [junit] f6	: stdio-c.cvl
    [junit] f7	: civlc.cvl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 21
    [junit]    proverCalls         : 3
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.38
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 86
    [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.13 of 2014-08-22 -- 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 f0:13.4-11 "$choose".
    [junit] State -1:557365
    [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, f0: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          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.39
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.42
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 39
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 135
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.47
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 7.5
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1731
    [junit]    proverCalls         : 700
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.55
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 56
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.59
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 468
    [junit]    statesSaved         : 48
    [junit]    statesSeen          : 48
    [junit]    statesMatched       : 0
    [junit]    steps               : 147
    [junit]    transitions         : 47
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 5
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.62
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 32
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 102
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.65
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.68
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 0
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 9.72
    [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.13 of 2014-08-22 -- 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)      : 658505728
    [junit]    time (s)            : 9.89
    [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.13 of 2014-08-22 -- 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 f0:12.6-13 "n->next".
    [junit] State -1:561710
    [junit] | Path condition
    [junit] | | 0 < SIZEOF(dynamicType<108>)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(node_t[1][])<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, f0: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          : 3
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 10.02
    [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.13 of 2014-08-22 -- 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 f0:19.4-9 "$wait".
    [junit] State -1:561718
    [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, f0: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          : 1
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 10.06
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 658505728
    [junit]    time (s)            : 10.09
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 7522
    [junit]    proverCalls         : 121
    [junit]    memory (bytes)      : 853540864
    [junit]    time (s)            : 13.07
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 19673
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 58
    [junit]    proverCalls         : 4
    [junit]    memory (bytes)      : 853540864
    [junit]    time (s)            : 13.33
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 182
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 349
    [junit]    proverCalls         : 34
    [junit]    memory (bytes)      : 853540864
    [junit]    time (s)            : 13.44
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 675
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 13
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 853540864
    [junit]    time (s)            : 13.48
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1036
    [junit]    proverCalls         : 6
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 13.76
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 2176
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 20
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 13.79
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 68
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] The char value is 'b'
    [junit] =================== Stats ===================
    [junit]    validCalls          : 0
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 13.95
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 132
    [junit]    proverCalls         : 6
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.01
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 257
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2256
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.38
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 47
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.42
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 62
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 18
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.74
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 160
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 289
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.82
    [junit]    maxProcs            : 6
    [junit]    statesInstantiated  : 2389
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 5
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.85
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 38
    [junit]    proverCalls         : 5
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.91
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 128
    [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.13 of 2014-08-22 -- 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][])<Hop1s2f1o0[0:=10]>,(real[0][])<>>.
    [junit] at f0:10.14-21.1 "{\n  int * p  ... }".
    [junit] State -1:591806
    [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 = $heap<(real[1][])<Hop0s1f0o0[0:=11/10]>,(int[0][])>,(real[0][])>>
    [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 = $heap<(real[0][])>,(int[1][])<Hop1s2f1o0[0:=10]>,(real[0][])>>
    [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, f0: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          : 27
    [junit]    proverCalls         : 7
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 14.96
    [junit]    maxProcs            : 2
    [junit]    statesInstantiated  : 198
    [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.13 of 2014-08-22 -- 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 f0:4.2-17 "$assert($false)".
    [junit] State -1:591820
    [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, f0:10.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=foo, location=3, f0: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          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 15.11
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 53
    [junit]    proverCalls         : 29
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 15.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.13 of 2014-08-22 -- 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 f0:14.10-13 "x/y".
    [junit] State -1:591905
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X_s0v2
    [junit] | | | | y = X_s0v3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=2, f0: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          : 2
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 15.25
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 774
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 15.3
    [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] edu.udel.cis.vsl.abc.token.IF.SyntaxException: 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 f0:4.0-26 "$abstract int random(void)".
    [junit] 
    [junit] File name list:
    [junit] f0	: abstractFunNoArg.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: assert.h
    [junit] f4	: civlc.cvl
    [junit] Syntax error: attempt to modify the input variable N
    [junit] at f0:9.2-3 "N".
    [junit] 
    [junit] File name list:
    [junit] f0	: assignInput.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: civlc.cvl
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.LibraryTest
    [junit] Tests run: 23, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 2.436 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 8
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.21
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 85
    [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.13 of 2014-08-22 -- 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 f0:8.2-4 "*a".
    [junit] State -1:594321
    [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, f0: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          : 5
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.24
    [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.13 of 2014-08-22 -- 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 f0:8.2-10 "$free(a)".
    [junit] State -1:594340
    [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 = $heap<(int[1][])<INVALID>>
    [junit] | | | | a = UNDEFINED
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, f0: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          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.27
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 510
    [junit]    proverCalls         : 39
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.69
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 1370
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 43
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.72
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 111
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.76
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 50
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 156
    [junit]    proverCalls         : 5
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 0.83
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 335
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 50
    [junit]    proverCalls         : 3
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 1.01
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 235
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 1.15
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 58
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 1.15
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 27
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 967311360
    [junit]    time (s)            : 1.19
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 96
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1434
    [junit]    proverCalls         : 23
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.56
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 6902
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 25
    [junit]    proverCalls         : 2
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.6
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 46
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 15
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.65
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 89
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.68
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 23
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 383
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.72
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 527
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.84
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 31
    [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.13 of 2014-08-22 -- 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, f0:21.2-7 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 8, f0:14.2-15 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] at f0: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 = $heap<(__gcomm__[1][])<(__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])>>>>>>>,(__comm__[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 = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__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, f0:21.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=worker, location=8, f0: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          : 8
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.96
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 40
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 1.99
    [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.13 of 2014-08-22 -- 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 f5:82.2-83.75 "$assert message.size <= size ... size".
    [junit] State -1:604636
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(int[1][])<(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(3,(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(3,(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, f5:82.2-9 "$assert", dyscope=d7]
    [junit] | | | | Frame[function=_CIVL_system, location=7, f0: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          : 52
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 2.11
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 120
    [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.13 of 2014-08-22 -- 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 f5: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          : 52
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 2.24
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 120
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 111
    [junit]    proverCalls         : 26
    [junit]    memory (bytes)      : 1100480512
    [junit]    time (s)            : 2.44
    [junit]    maxProcs            : 1
    [junit]    statesInstantiated  : 519
    [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 f0:0.-1-7.15 ""x=%l"".
    [junit] 
    [junit] File name list:
    [junit] f0	: printfBad.cvl
    [junit] f1	: civlc.cvh
    [junit] f2	: op.h
    [junit] f3	: stdio.h
    [junit] f4	: stdio.cvl
    [junit] f5	: stdio-common.h
    [junit] f6	: stdio-c.cvl
    [junit] f7	: civlc.cvl
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.MPITranslationTest
    [junit] Tests run: 8, Failures: 0, Errors: 0, Skipped: 2, Time elapsed: 48.091 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4078
    [junit]    proverCalls         : 83
    [junit]    memory (bytes)      : 1118306304
    [junit]    time (s)            : 5.44
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 10454
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 915
    [junit]    proverCalls         : 15
    [junit]    memory (bytes)      : 1118306304
    [junit]    time (s)            : 9.36
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 1965
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 29s: mem=1525Mb steps=30930 trans=13212 seen=12909 saved=13811 prove=906
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 109983
    [junit]    proverCalls         : 1269
    [junit]    memory (bytes)      : 1647312896
    [junit]    time (s)            : 34.11
    [junit]    maxProcs            : 5
    [junit]    statesInstantiated  : 251160
    [junit]    statesSaved         : 19499
    [junit]    statesSeen          : 18234
    [junit]    statesMatched       : 456
    [junit]    steps               : 43730
    [junit]    transitions         : 18689
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 642
    [junit]    proverCalls         : 11
    [junit]    memory (bytes)      : 1647312896
    [junit]    time (s)            : 37.83
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 1412
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 3369
    [junit]    proverCalls         : 67
    [junit]    memory (bytes)      : 1647312896
    [junit]    time (s)            : 42.91
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 8026
    [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.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 8258
    [junit]    proverCalls         : 14
    [junit]    memory (bytes)      : 1674051584
    [junit]    time (s)            : 48.1
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 14870
    [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] ------------- ---------------- ---------------
    [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] Tests run: 10, Failures: 0, Errors: 0, Skipped: 2, Time elapsed: 57.288 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 90:
    [junit] CIVL execution error in  (kind: DEADLOCK, certainty: PROVEABLE)
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 10, f0:41.4-9 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 86, f18:102.18-31 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: terminated
    [junit] ProcessState 3: terminated
    [junit] at f0:41.4-9 "$wait".
    [junit] State 92
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gbarrier__[1][])<(__gbarrier__[1])<__gbarrier__<3,(process[3])<p1,p2,p3>,(boolean[3])<false,false,false>,0>>>,(__barrier__[0][])>,(__gcomm__[2][])<(__gcomm__[1])<__gcomm__<3,(boolean[3])<true,true,true>,(__queue__[3][3])<(__queue__[3])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[3])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[3])<__queue__<1,(__message__[1])<__message__<2,0,1,inject(1,(int[1])<2>),SIZEOF_INT>>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>,(__gcomm__[1])<__gcomm__<3,(boolean[3])<true,true,true>,(__queue__[3][3])<(__queue__[3])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[3])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[3])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>>,(__comm__[0][])>>
    [junit] | | | | NPROCS = 3
    [junit] | | | | __MPI_COMM_WORLD = __CMPI_Gcomm<&<d0>heap<2,0>[0],&<d0>heap<2,1>[0],&<d0>heap<0,0>[0]>
    [junit] | | dyscope d11 (id=1, parent=d1, static=37)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=35)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2, 2:=p3]
    [junit] | | dyscope d6 (id=3, parent=d5, static=47)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gbarrier__[0][])>,(__barrier__[1][])<(__barrier__[1])<__barrier__<0,&<d0>heap<0,0>[0]>>>,(__gcomm__[0][])>,(__comm__[2][])<(__comm__[1])<__comm__<0,&<d0>heap<2,0>[0]>>,(__comm__[1])<__comm__<0,&<d0>heap<2,1>[0]>>>>
    [junit] | | | | MPI_COMM_WORLD = MPI_Comm<&<d6>heap<3,0>[0],&<d6>heap<3,1>[0],&<d6>heap<1,0>[0],1>
    [junit] | | | | nprocs = 3
    [junit] | | | | rank = 0
    [junit] | | | | msg = 1
    [junit] | | | | status = MPI_Status<1,1,0,SIZEOF_INT>
    [junit] | | | | _anon_6 = "I'm process %d :\n"
    [junit] | | dyscope d5 (id=4, parent=d0, static=34)
    [junit] | | | variables
    [junit] | | | | place = 0
    [junit] | | dyscope d19 (id=5, parent=d60, static=39)
    [junit] | | | variables
    [junit] | | | | _TEMP_2 = NULL
    [junit] | | | | _TEMP_3 = NULL
    [junit] | | dyscope d60 (id=6, parent=d0, static=18)
    [junit] | | | variables
    [junit] | | | | buf = &<d6>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 7
    [junit] | | | | source = 1
    [junit] | | | | tag = 1
    [junit] | | | | comm = MPI_Comm<&<d6>heap<3,0>[0],&<d6>heap<3,1>[0],&<d6>heap<1,0>[0],1>
    [junit] | | | | status = &<d6>status
    [junit] | | | | _anon_3 = "MPI_Recv() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | dyscope d63 (id=7, parent=d62, static=45)
    [junit] | | | variables
    [junit] | | | | in = X_s8v1
    [junit] | | | | size = NULL
    [junit] | | dyscope d62 (id=8, parent=d0, static=32)
    [junit] | | | variables
    [junit] | | | | buf = &<d6>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 7
    [junit] | | | | source = 1
    [junit] | | | | tag = 1
    [junit] | | | | comm = &<d6>heap<3,0>[0]
    [junit] | | | | status = &<d6>status
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=10, f0:41.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=CMPI_Recv, location=86, f18:102.18-31 "$comm_dequeue", dyscope=d63]
    [junit] | | | | Frame[function=MPI_Recv, location=29, f11:61.9-18 "CMPI_Recv", dyscope=d61]
    [junit] | | | | Frame[function=MPI_Process, location=111, f0:27.4-12 "MPI_Recv", dyscope=d6]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/wildcardBad_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1091
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1674051584
    [junit]    time (s)            : 3.8
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 1050
    [junit]    statesSaved         : 93
    [junit]    statesSeen          : 90
    [junit]    statesMatched       : 0
    [junit]    steps               : 192
    [junit]    transitions         : 89
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/wildcardBad_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 8258
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1674051584
    [junit]    time (s)            : 8.29
    [junit]    maxProcs            : 6
    [junit]    statesInstantiated  : 8346
    [junit]    statesSaved         : 783
    [junit]    statesSeen          : 727
    [junit]    statesMatched       : 23
    [junit]    steps               : 1546
    [junit]    transitions         : 749
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 24s: mem=1698Mb steps=34512 trans=18226 seen=18226 saved=19166 prove=1208
    [junit] 39s: mem=1688Mb steps=70988 trans=37353 seen=37354 saved=39343 prove=2553
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 259709
    [junit]    proverCalls         : 3923
    [junit]    memory (bytes)      : 1765801984
    [junit]    time (s)            : 53.33
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 586672
    [junit]    statesSaved         : 58911
    [junit]    statesSeen          : 55834
    [junit]    statesMatched       : 0
    [junit]    steps               : 106446
    [junit]    transitions         : 55833
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 107:
    [junit] CIVL execution error in  (kind: DEADLOCK, certainty: PROVEABLE)
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 8, f0:41.31-36 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 5: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] at f0:41.31-36 "$wait".
    [junit] State 1155
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>>,(__comm__[0][])>>
    [junit] | | | | gcomm = &<d0>heap<0,0>[0]
    [junit] | | dyscope d7 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2]
    [junit] | | dyscope d13 (id=3, parent=d4, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d4 (id=4, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<0,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d4>heap<1,0>[0]
    [junit] | | | | threads = X_s3v2[0:=p3, 1:=p4]
    [junit] | | dyscope d3 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 0
    [junit] | | dyscope d19 (id=6, parent=d6, static=18)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d6 (id=7, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<1,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d6>heap<1,0>[0]
    [junit] | | | | threads = X_s6v2[0:=UNDEFINED, 1:=p5]
    [junit] | | dyscope d5 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 1
    [junit] | | dyscope d23 (id=9, parent=d22, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d22 (id=10, parent=d10, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d10 (id=11, parent=d9, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d9 (id=12, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d27 (id=13, parent=d26, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d26 (id=14, parent=d12, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d12 (id=15, parent=d11, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d11 (id=16, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d34 (id=17, parent=d30, static=22)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d30 (id=18, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d18 (id=19, parent=d17, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = X_s21v2
    [junit] | | | | out = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d17 (id=20, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:41.31-36 "$wait", dyscope=d7]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d13]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d19]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d23]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d27]
    [junit] | | process p5(id=5)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d34]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
    [junit] Restricting search depth to 106
    [junit] Error 1 encountered at depth 103:
    [junit] CIVL execution error in  (kind: DEADLOCK, certainty: PROVEABLE)
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 8, f0:41.31-36 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 5: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 6: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] at f0:41.31-36 "$wait".
    [junit] State 1157
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>>,(__comm__[0][])>>
    [junit] | | | | gcomm = &<d0>heap<0,0>[0]
    [junit] | | dyscope d7 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2]
    [junit] | | dyscope d13 (id=3, parent=d4, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d4 (id=4, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<0,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d4>heap<1,0>[0]
    [junit] | | | | threads = X_s3v2[0:=p3, 1:=p4]
    [junit] | | dyscope d3 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 0
    [junit] | | dyscope d19 (id=6, parent=d6, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d6 (id=7, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<1,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d6>heap<1,0>[0]
    [junit] | | | | threads = X_s6v2[0:=p5, 1:=p6]
    [junit] | | dyscope d5 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 1
    [junit] | | dyscope d23 (id=9, parent=d22, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d22 (id=10, parent=d10, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d10 (id=11, parent=d9, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d9 (id=12, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d27 (id=13, parent=d26, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d26 (id=14, parent=d12, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d12 (id=15, parent=d11, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d11 (id=16, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d37 (id=17, parent=d30, static=22)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d30 (id=18, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d18 (id=19, parent=d15, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | | | out = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d15 (id=20, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d37 (id=21, parent=d35, static=22)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d35 (id=22, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d18 (id=23, parent=d17, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | | | out = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d17 (id=24, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:41.31-36 "$wait", dyscope=d7]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d13]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d19]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d23]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d27]
    [junit] | | process p5(id=5)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d34]
    [junit] | | process p6(id=6)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d37]
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (103) is less than length of old (107): replacing old with new...
    [junit] Restricting search depth to 102
    [junit] Error 2 encountered at depth 77:
    [junit] CIVL execution error in  (kind: DEADLOCK, certainty: PROVEABLE)
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 8, f0:41.31-36 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 5: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 6: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] at f0:41.31-36 "$wait".
    [junit] State 1163
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>>,(__comm__[0][])>>
    [junit] | | | | gcomm = &<d0>heap<0,0>[0]
    [junit] | | dyscope d7 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2]
    [junit] | | dyscope d13 (id=3, parent=d4, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d4 (id=4, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<0,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d4>heap<1,0>[0]
    [junit] | | | | threads = X_s3v2[0:=p3, 1:=p4]
    [junit] | | dyscope d3 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 0
    [junit] | | dyscope d19 (id=6, parent=d6, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d6 (id=7, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<1,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d6>heap<1,0>[0]
    [junit] | | | | threads = X_s6v2[0:=p5, 1:=p6]
    [junit] | | dyscope d5 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 1
    [junit] | | dyscope d23 (id=9, parent=d22, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d22 (id=10, parent=d10, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d10 (id=11, parent=d9, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d9 (id=12, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d27 (id=13, parent=d26, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d26 (id=14, parent=d12, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d12 (id=15, parent=d11, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d11 (id=16, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d37 (id=17, parent=d30, static=22)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d30 (id=18, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d18 (id=19, parent=d15, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | | | out = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d15 (id=20, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d37 (id=21, parent=d35, static=22)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d35 (id=22, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d18 (id=23, parent=d17, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = __message__<0,1,0,inject(2,(int[1])<0>),SIZEOF_INT>
    [junit] | | | | out = __message__<1,0,0,inject(2,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d17 (id=24, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:41.31-36 "$wait", dyscope=d7]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d13]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d19]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d23]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d27]
    [junit] | | process p5(id=5)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d34]
    [junit] | | process p6(id=6)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d37]
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (77) is less than length of old (103): replacing old with new...
    [junit] Restricting search depth to 76
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 17165
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1769996288
    [junit]    time (s)            : 54.23
    [junit]    maxProcs            : 7
    [junit]    statesInstantiated  : 13730
    [junit]    statesSaved         : 1277
    [junit]    statesSeen          : 1273
    [junit]    statesMatched       : 172
    [junit]    steps               : 2192
    [junit]    transitions         : 1444
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/mpi-pthreads_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 19976
    [junit]    proverCalls         : 345
    [junit]    memory (bytes)      : 1769996288
    [junit]    time (s)            : 56.34
    [junit]    maxProcs            : 9
    [junit]    statesInstantiated  : 34365
    [junit]    statesSaved         : 2965
    [junit]    statesSeen          : 2416
    [junit]    statesMatched       : 0
    [junit]    steps               : 6024
    [junit]    transitions         : 2415
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 204
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1772093440
    [junit]    time (s)            : 56.51
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 583
    [junit]    statesSaved         : 55
    [junit]    statesSeen          : 49
    [junit]    statesMatched       : 0
    [junit]    steps               : 117
    [junit]    transitions         : 48
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 107:
    [junit] CIVL execution error in  (kind: DEADLOCK, certainty: PROVEABLE)
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 8, f0:41.31-36 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 2: at location 27, f0:33.33-38 "$wait"
    [junit]   Enabling predicate: false
    [junit] ProcessState 3: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 4: at location 49, f0:26.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] ProcessState 5: at location 44, f0:24.37-50 "$comm_dequeue"
    [junit]   Enabling predicate: false
    [junit] at f0:41.31-36 "$wait".
    [junit] State 1155
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>,(__queue__[2])<__queue__<0,(__message__[0])>>,__queue__<0,(__message__[0])>>>>>>>,(__comm__[0][])>>
    [junit] | | | | gcomm = &<d0>heap<0,0>[0]
    [junit] | | dyscope d7 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2]
    [junit] | | dyscope d13 (id=3, parent=d4, static=18)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d4 (id=4, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<0,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d4>heap<1,0>[0]
    [junit] | | | | threads = X_s3v2[0:=p3, 1:=p4]
    [junit] | | dyscope d3 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 0
    [junit] | | dyscope d19 (id=6, parent=d6, static=18)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d6 (id=7, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(__gcomm__[0][])>,(__comm__[1][])<(__comm__[1])<__comm__<1,&<d0>heap<0,0>[0]>>>>
    [junit] | | | | comm = &<d6>heap<1,0>[0]
    [junit] | | | | threads = X_s6v2[0:=UNDEFINED, 1:=p5]
    [junit] | | dyscope d5 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | rank = 1
    [junit] | | dyscope d23 (id=9, parent=d22, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d22 (id=10, parent=d10, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d10 (id=11, parent=d9, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(3,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(3,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d9 (id=12, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d27 (id=13, parent=d26, static=23)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d26 (id=14, parent=d12, static=20)
    [junit] | | | variables
    [junit] | | | | j = 1
    [junit] | | dyscope d12 (id=15, parent=d11, static=19)
    [junit] | | | variables
    [junit] | | | | x = 0
    [junit] | | | | in = __message__<1,0,0,inject(3,(int[1])<1>),SIZEOF_INT>
    [junit] | | | | out = __message__<0,1,0,inject(3,(int[1])<0>),SIZEOF_INT>
    [junit] | | dyscope d11 (id=16, parent=d4, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d34 (id=17, parent=d30, static=22)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d30 (id=18, parent=d18, static=20)
    [junit] | | | variables
    [junit] | | | | j = 0
    [junit] | | dyscope d18 (id=19, parent=d17, static=19)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | in = X_s21v2
    [junit] | | | | out = __message__<1,0,0,inject(3,(int[1])<1>),SIZEOF_INT>
    [junit] | | dyscope d17 (id=20, parent=d6, static=16)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, f0:41.31-36 "$wait", dyscope=d7]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d13]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=MPI_Process, location=27, f0:33.33-38 "$wait", dyscope=d19]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d23]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=49, f0:26.37-50 "$comm_dequeue", dyscope=d27]
    [junit] | | process p5(id=5)
    [junit] | | | call stack
    [junit] | | | | Frame[function=Thread, location=44, f0:24.37-50 "$comm_dequeue", dyscope=d34]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 15077
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1772093440
    [junit]    time (s)            : 57.29
    [junit]    maxProcs            : 7
    [junit]    statesInstantiated  : 12401
    [junit]    statesSaved         : 1156
    [junit]    statesSeen          : 1152
    [junit]    statesMatched       : 155
    [junit]    steps               : 1983
    [junit]    transitions         : 1306
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/mpi-pthreads_log.txt
    [junit] ------------- ---------------- ---------------
    [junit] ------------- Standard Error -----------------
    [junit] edu.udel.cis.vsl.abc.token.IF.SyntaxException: Syntax error: Structure or union type __comm__ is incomplete at mp_proc2.cvh:11.10-21 "comm->place"
    [junit] ------------- ---------------- ---------------
    [junit] Testcase: ring2(edu.udel.cis.vsl.civl.MessagePassingTest):SKIPPED
    [junit] Testcase: hybridMin(edu.udel.cis.vsl.civl.MessagePassingTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.OmpSimplifierTest
    [junit] Tests run: 19, Failures: 0, Errors: 0, Skipped: 19, Time elapsed: 0.01 sec
    [junit] 
    [junit] Testcase: raceCond1(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: raceCond2(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: nested(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: dotProduct_critical1(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: dotProduct_orphan(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: poisson(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: matProduct1(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: matProduct2(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: dotProduct_critical(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: md(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: fft(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: quad(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: dijkstra(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: fig310_mxv_omp(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: dotProduct1(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: parallelfor(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: fig498_threadprivate(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: vecAdd_fix(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testcase: vecAdd_deadlock(edu.udel.cis.vsl.civl.OmpSimplifierTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.OmpTransformerTest
    [junit] Tests run: 21, Failures: 0, Errors: 0, Skipped: 17, Time elapsed: 1.73 sec
    [junit] 
    [junit] Testcase: raceCond1(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: raceCond2(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: nested(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: dotProduct_critical1(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: nested_run(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: poisson(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: matProduct1(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: matProduct2(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: dotProduct_critical(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: md(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: fft(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: quad(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: fig310_mxv_omp(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: dotProduct1(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: parallelfor(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: fig498_threadprivate(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testcase: dotProduct_critical1_run(edu.udel.cis.vsl.civl.OmpTransformerTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest
    [junit] Tests run: 5, Failures: 0, Errors: 0, Skipped: 5, Time elapsed: 0.005 sec
    [junit] 
    [junit] Testcase: raceCond1(edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest):SKIPPED
    [junit] Testcase: matProduct1(edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest):SKIPPED
    [junit] Testcase: dotProduct(edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest):SKIPPED
    [junit] Testcase: parallelfor(edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest):SKIPPED
    [junit] Testcase: dotProductCritical(edu.udel.cis.vsl.civl.OpenMP2CIVLTransformerTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.OpenMPTest
    [junit] Tests run: 1, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 54.007 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] 16s: mem=1711Mb steps=89698 trans=59738 seen=46140 saved=46321 prove=38
    [junit] 31s: mem=1739Mb steps=179734 trans=119608 seen=90753 saved=91136 prove=38
    [junit] 46s: mem=1750Mb steps=270205 trans=179806 seen=136410 saved=137154 prove=47
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 1136684
    [junit]    proverCalls         : 65
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 54.01
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 1471786
    [junit]    statesSaved         : 164146
    [junit]    statesSeen          : 163157
    [junit]    statesMatched       : 52163
    [junit]    steps               : 323607
    [junit]    transitions         : 215319
    [junit] 
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.PORTest
    [junit] Tests run: 10, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 0.443 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 6:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (*(p)==5)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:22.2-16 "$assert(*p==5)".
    [junit] State -1:3022166
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 15
    [junit] | | | | p = &<d0>x
    [junit] | | dyscope d1 (id=1, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | fp = p1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=4, f0:22.2-9 "$assert", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerShare_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 8
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.17
    [junit]    maxProcs            : 2
    [junit]    statesInstantiated  : 71
    [junit]    statesSaved         : 10
    [junit]    statesSeen          : 10
    [junit]    statesMatched       : 1
    [junit]    steps               : 19
    [junit]    transitions         : 10
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerShare_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 6:
    [junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (v==0)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:12.2-17 "$assert(v == 0)".
    [junit] State -1:3022248
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | y = 1
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2]
    [junit] | | dyscope d3 (id=2, parent=d2, static=5)
    [junit] | | | variables
    [junit] | | | | v = 1
    [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=6, f0:26.2-10 "$waitall", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f, location=10, f0:12.2-9 "$assert", dyscope=d3]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/guard1_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 34
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.2
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 82
    [junit]    statesSaved         : 11
    [junit]    statesSeen          : 11
    [junit]    statesMatched       : 1
    [junit]    steps               : 21
    [junit]    transitions         : 11
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/guard1_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 7:
    [junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (v==0)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:12.2-17 "$assert(v == 0)".
    [junit] State -1:3022365
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | u = 1
    [junit] | | dyscope d1 (id=1, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2, 2:=p3]
    [junit] | | dyscope d3 (id=2, parent=d2, static=6)
    [junit] | | | variables
    [junit] | | | | v = 1
    [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=8, f0:31.2-10 "$waitall", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f, location=12, f0:12.2-9 "$assert", dyscope=d3]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/guard2_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 49
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.23
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 117
    [junit]    statesSaved         : 14
    [junit]    statesSeen          : 14
    [junit]    statesMatched       : 2
    [junit]    steps               : 30
    [junit]    transitions         : 15
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/guard2_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 11:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (x==3)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:25.2-15 "$assert(x==3)".
    [junit] State -1:3022434
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 4
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | proc1 = UNDEFINED
    [junit] | | | | proc2 = UNDEFINED
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=5, f0:25.2-9 "$assert", dyscope=d1]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/trade3_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 5
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.26
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 69
    [junit]    statesSaved         : 11
    [junit]    statesSeen          : 11
    [junit]    statesMatched       : 0
    [junit]    steps               : 16
    [junit]    transitions         : 10
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/trade3_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 10:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (x==4)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:31.2-15 "$assert(x==4)".
    [junit] State -1:3022549
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 3
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | proc1 = UNDEFINED
    [junit] | | | | proc2 = UNDEFINED
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=5, f0:31.2-9 "$assert", dyscope=d1]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/trade4_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.29
    [junit]    maxProcs            : 3
    [junit]    statesInstantiated  : 115
    [junit]    statesSaved         : 17
    [junit]    statesSeen          : 17
    [junit]    statesMatched       : 1
    [junit]    steps               : 29
    [junit]    transitions         : 17
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/trade4_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 3:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (x==0)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:13.4-17 "$assert(x==0)".
    [junit] State -1:3022600
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __atomic_lock_var = p0
    [junit] | | | | x = 1
    [junit] | | dyscope d1 (id=1, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | fp = p1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, f0:13.4-11 "$assert", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/atomic0_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 4
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.32
    [junit]    maxProcs            : 2
    [junit]    statesInstantiated  : 51
    [junit]    statesSaved         : 6
    [junit]    statesSeen          : 6
    [junit]    statesMatched       : 0
    [junit]    steps               : 13
    [junit]    transitions         : 5
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/atomic0_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- 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 (x==1)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:12.4-17 "$assert(x==1)".
    [junit] State -1:3022619
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __atomic_lock_var = p0
    [junit] | | | | x = 0
    [junit] | | dyscope d1 (id=1, parent=d0, static=1)
    [junit] | | | variables
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, f0:12.4-11 "$assert", dyscope=d0]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f, location=6, f0:6.2-3 "x", dyscope=d1]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/atomic1_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 2
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.35
    [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/atomic1_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 6:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (*(p)==0)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:18.2-16 "$assert(*p==0)".
    [junit] State -1:3022687
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 15
    [junit] | | | | p = &<d0>x
    [junit] | | dyscope d1 (id=1, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | fp = p1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, f0:18.2-9 "$assert", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerShare1_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 6
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.38
    [junit]    maxProcs            : 2
    [junit]    statesInstantiated  : 68
    [junit]    statesSaved         : 10
    [junit]    statesSeen          : 10
    [junit]    statesMatched       : 1
    [junit]    steps               : 17
    [junit]    transitions         : 10
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerShare1_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 7:
    [junit] CIVL execution error in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (*(p)==0)
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:22.2-16 "$assert(*p==0)".
    [junit] State -1:3022794
    [junit] | Path condition
    [junit] | | 0 <= SIZEOF_INT+-1
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | __heap = $heap<(int[1][])<Hop0s0f0o0[0:=15]>>
    [junit] | | | | x = &<d0>heap<0,0>[0]
    [junit] | | | | p = &<d0>heap<0,0>[0]
    [junit] | | dyscope d1 (id=1, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | fp = p1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=6, f0:22.2-9 "$assert", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerShare2_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 8
    [junit]    proverCalls         : 1
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.41
    [junit]    maxProcs            : 2
    [junit]    statesInstantiated  : 107
    [junit]    statesSaved         : 12
    [junit]    statesSeen          : 11
    [junit]    statesMatched       : 1
    [junit]    steps               : 21
    [junit]    transitions         : 11
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerShare2_log.txt
    [junit] CIVL v0.13 of 2014-08-22 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0 encountered at depth 8:
    [junit] CIVL execution error in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
    [junit] Cannot prove assertion holds: $assert (v==0)
    [junit]   Path condition: true
    [junit]   Assertion: false
    [junit] 
    [junit] at f0:13.2-17 "$assert(v == 0)".
    [junit] State -1:3022935
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = 1
    [junit] | | | | u = 1
    [junit] | | | | hp = UNDEFINED
    [junit] | | dyscope d1 (id=1, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | procs = X_s1v1[0:=p1, 1:=p2, 2:=UNDEFINED]
    [junit] | | dyscope d3 (id=2, parent=d2, static=7)
    [junit] | | | variables
    [junit] | | | | v = 1
    [junit] | | dyscope d2 (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=10, f0:34.2-10 "$waitall", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=f, location=14, f0:13.2-9 "$assert", dyscope=d3]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/wait_0.trace
    [junit] 
    [junit] Error bound exceeded: search terminated
    [junit] 
    [junit] =================== Stats ===================
    [junit]    validCalls          : 60
    [junit]    proverCalls         : 0
    [junit]    memory (bytes)      : 1838153728
    [junit]    time (s)            : 0.45
    [junit]    maxProcs            : 4
    [junit]    statesInstantiated  : 141
    [junit]    statesSaved         : 17
    [junit]    statesSeen          : 17
    [junit]    statesMatched       : 3
    [junit]    steps               : 37
    [junit]    transitions         : 19
    [junit] 
    [junit] The program MAY NOT be correct.  See CIVLREP/wait_log.txt
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.PthreadCProverTest
    [junit] Tests run: 45, Failures: 0, Errors: 0, Skipped: 45, Time elapsed: 0.02 sec
    [junit] 
    [junit] Testcase: incdec_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: barrier_vf_false(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: buggy_simple_loop1_vf_false(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: rand_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: dekker_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: double_lock_p1_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: peterson_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: inc_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: simple_loop5_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: pthread5_vs_false(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: rand_lock_p0_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: double_lock_p3_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: rand_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: fmaxsymopt_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: read_write_lock_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: Boop_simple_vf_false(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: tas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: szymanski_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: stack_lock_p0_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: rand_cas_vs_concur_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: lamport_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: fmaxsym_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: FreeBSD__abd_kbd__sliced_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: Solaris__space_map__sliced_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: ticket_lock_hc_backoff_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: inc_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: monabsex2_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: lu_fig2_fixed_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: ticket_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: conditionals_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: stack_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: NetBSD__sysmon_power__sliced_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: double_lock_p2_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: time_var_mutex_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: unverif_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: spin2003_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: Function_Pointer3_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: stack_cas_p0_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: ticket_lock_low_contention_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: incdec_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: fmaxsym_cas_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: FreeBSD__rdma_addr__sliced_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: fmaxsymopt_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: monabsex1_vs_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testcase: stack_true(edu.udel.cis.vsl.civl.PthreadCProverTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.PthreadTest
    [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:stack_true:	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 /Users/tester/work/civl/0.13/r1506/junit/data/TESTS-TestSuites.xml to /var/folders/tb/t0f_d_29043c_qts86hdnb1h0000gt/T/null1316711913
[junitreport] Loading stylesheet jar:file:/opt/local/share/java/apache-ant/lib/ant-junit.jar!/org/apache/tools/ant/taskdefs/optional/junit/xsl/junit-frames.xsl
[junitreport] Transform time: 692ms
[junitreport] Deleting: /var/folders/tb/t0f_d_29043c_qts86hdnb1h0000gt/T/null1316711913

test:
[jacoco:report] Loading execution data file /Users/tester/work/civl/0.13/r1506/jacoco.exec
[jacoco:report] Writing group "Test Coverage Report for CIVL 0.13 r1506" with 295 classes

javadoc:
    [mkdir] Created dir: /Users/tester/work/civl/0.13/r1506/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_45
  [javadoc] Building tree for all the packages and classes...
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/dynamic/IF/Dynamics.java:26: warning - @param argument "errLogger" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:35: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/dynamic/IF/SymbolicUtility.java:63: warning - Tag @link: can't find getType in edu.udel.cis.vsl.civl.dynamic.IF.SymbolicUtility
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/gui/IF/CIVL_GUI.java:102: warning - @param argument "transitions" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/kripke/IF/LibraryEnabler.java:58: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/kripke/IF/LibraryEnabler.java:28: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:216: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:223: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:231: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/CIVLSource.java:41: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "out" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "debug" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:664: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:687: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:876: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:897: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:976: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:987: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1465: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1552: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:507: warning - Tag @link: reference not found: CIVLDynamicType
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:75: warning - @param argument "A" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:174: warning - @param argument "des" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/Expression.java:123: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:40: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/DynamicTypeOfExpression.java:23: warning - Tag @link: reference not found: CIVLDynamicType
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/FunctionGuardExpression.java:21: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/FunctionGuardExpression.java:29: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @param argument "scope" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:18: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:25: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:32: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/expression/WaitGuardExpression.java:15: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:261: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:270: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:278: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:290: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/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] /Users/tester/work/civl/0.13/r1506/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] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:185: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:192: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/statement/CallOrSpawnStatement.java:79: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/statement/MallocStatement.java:76: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:58: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLEnumType.java:17: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:58: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/model/IF/variable/Variable.java:119: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/run/IF/UserInterface.java:1067: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/run/IF/UserInterface.java:216: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:354: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:386: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:400: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/LibraryEvaluator.java:21: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/LibraryExecutor.java:17: warning - Tag @link: reference not found: CommonLibraryLoader#CLASS_PREFIX
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:33: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:33: warning - @param argument "assumption" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/semantics/IF/SymbolicAnalyzer.java:128: warning - @param argument "array" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/state/IF/State.java:167: warning - @return tag has no arguments.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/state/IF/State.java:297: warning - @param argument "scopeID" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/state/IF/StateFactory.java:119: warning - @param argument "scopeID" is not a parameter name.
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/state/IF/StateFactory.java:535: warning - Tag @see: reference not found: malloc
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/edu/udel/cis/vsl/civl/transform/IF/CIVLTransform.java:34: warning - Tag @link: can't find applyTransformer(Program, String, List, ASTBuilder) in edu.udel.cis.vsl.civl.transform.IF.CIVLTransform
  [javadoc] /Users/tester/work/civl/0.13/r1506/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] Building index for all classes...
  [javadoc] Generating /Users/tester/work/civl/0.13/r1506/doc/javadoc/help-doc.html...
  [javadoc] 65 warnings
  [javadoc] /Users/tester/work/civl/0.13/r1506/src/overview.html: warning - Tag @link: reference not found: edu.udel.cis.vsl.civl.library.IF

bench-compile:
    [javac] Compiling 5 source files to /Users/tester/work/civl/0.13/r1506/bin

all:

BUILD SUCCESSFUL
Total time: 5 minutes 12 seconds

Stderr:

    [junit] Tests FAILED (timeout)