Processing 326 files... ...................................................................................................................................................................................................................................................................................................................................... 50 of valid (0 tried bit-precise analysis, 0 succeeded) 24 safe 26 unsafe 263 exceptions 178 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) 18 : Unable to prove that all allocated memory was freed 15 : SyntaxErrorResult 12 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: ldv_malloc: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 10 : UnsupportedSyntaxResult 5 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) 5 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_item: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 4 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: hid_register_report: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : TypeErrorResult 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_tree: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_sl_with_head_and_tail: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: calloc_model: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_21: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 2 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_16: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: dll_create_master: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: create_sll: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 1 : CACSL2BoogieTranslator: UndeclaredFunctionException: a function that is called in the program is not declared in the program: alloc_unsafe_16: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.calculateTransitiveModifiesClause(FunctionHandler.java:500) 4 timeouts 1 : Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). 1 : Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. 1 : Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (662states) and interpolant automaton (currently 48 states, 49 states before enhancement), while ReachableStatesComputation was computing reachable states (726 states constructedinput type IntersectNwa). 1 : Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 73 states, 73 states before enhancement), while ReachableStatesComputation was computing reachable states (617 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (662states) and interpolant automaton (currently 48 states, 49 states before enhancement), while ReachableStatesComputation was computing reachable states (726 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (662states) and interpolant automaton (currently 48 states, 49 states before enhancement), while ReachableStatesComputation was computing reachable states (726 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (662states) and interpolant automaton (currently 48 states, 49 states before enhancement), while ReachableStatesComputation was computing reachable states (726 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 73 states, 73 states before enhancement), while ReachableStatesComputation was computing reachable states (617 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (303states) and interpolant automaton (currently 44 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 16. Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (602states) and interpolant automaton (currently 16 states, 52 states before enhancement), while ReachableStatesComputation was computing reachable states (106 states constructedinput type IntersectNwa). 9 unknowns 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0237_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0236_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0235_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0235_false-valid-memtrack.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0235_false-valid-deref.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0234_true-valid-memsafety.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.test-0234_false-valid-memtrack.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.mult_array_unsafe_false-valid-deref.i.log 1 : 20180202/smtinterpol-cav18-memsafety-32.2018-02-02_0839.logfiles/SmtInterpol-NoArray.mult_array-alloca_true-valid-memsafety_true-termination.i.log