java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:39:08,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:39:08,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:39:08,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:39:08,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:39:08,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:39:08,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:39:08,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:39:08,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:39:08,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:39:08,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:39:08,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:39:08,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:39:08,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:39:08,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:39:08,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:39:08,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:39:08,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:39:08,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:39:08,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:39:08,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:39:08,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:39:08,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:39:08,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:39:08,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:39:08,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:39:08,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:39:08,663 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:39:08,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:39:08,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:39:08,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:39:08,663 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:39:08,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:39:08,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:39:08,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:39:08,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:39:08,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:39:08,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:39:08,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:39:08,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:39:08,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:39:08,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:39:08,676 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:39:08,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:39:08,712 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:39:08,715 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:39:08,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:39:08,716 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:39:08,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-02-02 10:39:08,834 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:39:08,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:39:08,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:39:08,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:39:08,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:39:08,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:08,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f62d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08, skipping insertion in model container [2018-02-02 10:39:08,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:08,854 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:39:08,883 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:39:08,966 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:39:08,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:39:08,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08 WrapperNode [2018-02-02 10:39:08,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:39:08,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:39:08,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:39:08,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:39:08,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:08,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... [2018-02-02 10:39:09,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:39:09,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:39:09,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:39:09,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:39:09,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-02-02 10:39:09,050 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-02-02 10:39:09,051 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-02-02 10:39:09,051 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-02-02 10:39:09,051 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:39:09,051 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:39:09,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:39:09,288 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:39:09,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:39:09 BoogieIcfgContainer [2018-02-02 10:39:09,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:39:09,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:39:09,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:39:09,291 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:39:09,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:39:08" (1/3) ... [2018-02-02 10:39:09,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fb0410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:39:09, skipping insertion in model container [2018-02-02 10:39:09,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:39:08" (2/3) ... [2018-02-02 10:39:09,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fb0410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:39:09, skipping insertion in model container [2018-02-02 10:39:09,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:39:09" (3/3) ... [2018-02-02 10:39:09,295 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-02-02 10:39:09,304 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:39:09,311 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 10:39:09,340 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:39:09,340 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:39:09,340 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:39:09,340 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:39:09,340 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:39:09,340 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:39:09,340 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:39:09,340 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:39:09,341 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:39:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-02 10:39:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:39:09,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:09,362 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:09,362 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-02-02 10:39:09,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:09,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:09,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:39:09,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,498 INFO L182 omatonBuilderFactory]: Interpolants [122#true, 123#false, 124#(= 1 (select |#valid| |main_~#top~1.base|))] [2018-02-02 10:39:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:39:09,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:39:09,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:09,509 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-02-02 10:39:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:09,648 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-02 10:39:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:39:09,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:39:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:09,655 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:39:09,655 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:39:09,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:39:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:39:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:39:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-02 10:39:09,690 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-02-02 10:39:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:09,690 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-02 10:39:09,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:39:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-02 10:39:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:39:09,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:09,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:09,691 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-02-02 10:39:09,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:09,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:09,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:39:09,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,761 INFO L182 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(and (= |main_~#top~1.offset| 0) (= (select |#length| |main_~#top~1.base|) 8))] [2018-02-02 10:39:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:39:09,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:39:09,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:09,764 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-02-02 10:39:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:09,829 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-02 10:39:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:39:09,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:39:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:09,830 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:39:09,831 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:39:09,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:39:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:39:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:39:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:39:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-02 10:39:09,841 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-02-02 10:39:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:09,842 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-02 10:39:09,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:39:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-02 10:39:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:39:09,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:09,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:09,843 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-02-02 10:39:09,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:09,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:09,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:39:09,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,921 INFO L182 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(= 1 (select |#valid| |insert_top_#t~malloc14.base|)), 586#(= 1 (select |#valid| insert_top_~top~0.base)), 587#(= 1 (select |#valid| |create_sub_list_#in~sub.base|)), 588#(= 1 (select |#valid| create_sub_list_~sub.base))] [2018-02-02 10:39:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:09,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:39:09,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:39:09,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:39:09,922 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-02-02 10:39:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:10,096 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-02 10:39:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:39:10,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:39:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:10,099 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:39:10,099 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:39:10,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:39:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:39:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-02-02 10:39:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:39:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 10:39:10,106 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-02-02 10:39:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:10,107 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 10:39:10,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:39:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 10:39:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:39:10,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:10,107 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:10,107 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-02-02 10:39:10,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:10,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:10,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:39:10,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,199 INFO L182 omatonBuilderFactory]: Interpolants [826#true, 827#false, 828#(and (= 24 (select |#length| |insert_top_#t~malloc14.base|)) (= 0 |insert_top_#t~malloc14.offset|)), 829#(and (= 24 (select |#length| insert_top_~top~0.base)) (= insert_top_~top~0.offset 0)), 830#(and (= 24 (select |#length| |create_sub_list_#in~sub.base|)) (<= |create_sub_list_#in~sub.offset| 8) (<= 8 |create_sub_list_#in~sub.offset|)), 831#(and (<= create_sub_list_~sub.offset 8) (<= 8 create_sub_list_~sub.offset) (= (select |#length| create_sub_list_~sub.base) 24))] [2018-02-02 10:39:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:39:10,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:39:10,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:39:10,200 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-02-02 10:39:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:10,355 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-02 10:39:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:39:10,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:39:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:10,357 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:39:10,357 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:39:10,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:39:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:39:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 10:39:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:39:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-02 10:39:10,362 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-02-02 10:39:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:10,362 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-02 10:39:10,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:39:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-02 10:39:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:39:10,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:10,363 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:10,363 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-02-02 10:39:10,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:10,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:10,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:39:10,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,407 INFO L182 omatonBuilderFactory]: Interpolants [1066#true, 1067#false, 1068#(= 1 (select |#valid| |insert_sub_#t~malloc9.base|)), 1069#(= 1 (select |#valid| insert_sub_~sub~0.base))] [2018-02-02 10:39:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:39:10,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:39:10,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:39:10,408 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-02-02 10:39:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:10,472 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-02 10:39:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:39:10,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 10:39:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:10,473 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:39:10,473 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:39:10,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:39:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:39:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:39:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:39:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-02 10:39:10,478 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-02-02 10:39:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:10,478 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-02 10:39:10,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:39:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-02 10:39:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:39:10,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:10,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:10,479 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-02-02 10:39:10,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:10,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:39:10,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:39:10,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:39:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,545 INFO L182 omatonBuilderFactory]: Interpolants [1298#true, 1299#false, 1300#(and (= 12 (select |#length| |insert_sub_#t~malloc9.base|)) (= 0 |insert_sub_#t~malloc9.offset|)), 1301#(and (= insert_sub_~sub~0.offset 0) (= (select |#length| insert_sub_~sub~0.base) 12))] [2018-02-02 10:39:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:39:10,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:39:10,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:39:10,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:39:10,545 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-02 10:39:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:39:10,608 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-02 10:39:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:39:10,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 10:39:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:39:10,609 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:39:10,609 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:39:10,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:39:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:39:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:39:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:39:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-02 10:39:10,614 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-02-02 10:39:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:39:10,614 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-02 10:39:10,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:39:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-02 10:39:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:39:10,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:39:10,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:39:10,615 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-02 10:39:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-02-02 10:39:10,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:39:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:39:10,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:39:10,644 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:39:10,647 INFO L168 Benchmark]: Toolchain (without parser) took 1812.05 ms. Allocated memory was 392.2 MB in the beginning and 587.7 MB in the end (delta: 195.6 MB). Free memory was 349.1 MB in the beginning and 402.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 142.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:10,648 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 392.2 MB. Free memory is still 355.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:39:10,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.21 ms. Allocated memory is still 392.2 MB. Free memory was 349.1 MB in the beginning and 337.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:10,649 INFO L168 Benchmark]: Boogie Preprocessor took 28.61 ms. Allocated memory is still 392.2 MB. Free memory was 337.2 MB in the beginning and 335.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:10,649 INFO L168 Benchmark]: RCFGBuilder took 274.30 ms. Allocated memory is still 392.2 MB. Free memory was 335.8 MB in the beginning and 303.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:10,649 INFO L168 Benchmark]: TraceAbstraction took 1357.31 ms. Allocated memory was 392.2 MB in the beginning and 587.7 MB in the end (delta: 195.6 MB). Free memory was 303.2 MB in the beginning and 402.1 MB in the end (delta: -98.9 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:39:10,650 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 392.2 MB. Free memory is still 355.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.21 ms. Allocated memory is still 392.2 MB. Free memory was 349.1 MB in the beginning and 337.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.61 ms. Allocated memory is still 392.2 MB. Free memory was 337.2 MB in the beginning and 335.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.30 ms. Allocated memory is still 392.2 MB. Free memory was 335.8 MB in the beginning and 303.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1357.31 ms. Allocated memory was 392.2 MB in the beginning and 587.7 MB in the end (delta: 195.6 MB). Free memory was 303.2 MB in the beginning and 402.1 MB in the end (delta: -98.9 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-39-10-657.csv Received shutdown request...