/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:01:21,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:01:21,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:01:21,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:01:21,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:01:21,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:01:21,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:01:21,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:01:21,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:01:21,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:01:21,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:01:21,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:01:21,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:01:21,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:01:21,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:01:21,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:01:21,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:01:21,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:01:21,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:01:21,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:01:21,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:01:21,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:01:21,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:01:21,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:01:21,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:01:21,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:01:21,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:01:21,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:01:21,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:01:21,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:01:21,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:01:21,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:01:21,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:01:21,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:01:21,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:01:21,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:01:21,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:01:21,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:01:21,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:01:21,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:01:21,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:01:21,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:01:21,244 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:01:21,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:01:21,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:01:21,246 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:01:21,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:01:21,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:01:21,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:01:21,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:01:21,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:01:21,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:01:21,247 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:01:21,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:01:21,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:01:21,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:01:21,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:01:21,248 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:01:21,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:01:21,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:01:21,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:01:21,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:01:21,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:01:21,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:01:21,250 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:01:21,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:01:21,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:01:21,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:01:21,557 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:01:21,557 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:01:21,558 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-10 19:01:21,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de66830fc/97e54ffc222a4aa68868333c82741ec8/FLAGaac04be26 [2020-07-10 19:01:22,189 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:01:22,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-10 19:01:22,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de66830fc/97e54ffc222a4aa68868333c82741ec8/FLAGaac04be26 [2020-07-10 19:01:22,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de66830fc/97e54ffc222a4aa68868333c82741ec8 [2020-07-10 19:01:22,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:01:22,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:01:22,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:22,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:01:22,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:01:22,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:22" (1/1) ... [2020-07-10 19:01:22,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403f2301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:22, skipping insertion in model container [2020-07-10 19:01:22,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:22" (1/1) ... [2020-07-10 19:01:22,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:01:22,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:01:23,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:23,124 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:01:23,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:23,304 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:01:23,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23 WrapperNode [2020-07-10 19:01:23,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:23,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:01:23,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:01:23,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:01:23,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... [2020-07-10 19:01:23,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:01:23,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:01:23,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:01:23,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:01:23,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (1/1) ... No working directory specified, using /storage/repos/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 [2020-07-10 19:01:23,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:01:23,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:01:23,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-10 19:01:23,434 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-07-10 19:01:23,434 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-07-10 19:01:23,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:01:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:01:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-10 19:01:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-07-10 19:01:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-07-10 19:01:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-07-10 19:01:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-07-10 19:01:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-07-10 19:01:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-07-10 19:01:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-07-10 19:01:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-07-10 19:01:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-07-10 19:01:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-07-10 19:01:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-07-10 19:01:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-07-10 19:01:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-07-10 19:01:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-07-10 19:01:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-07-10 19:01:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-07-10 19:01:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-07-10 19:01:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-07-10 19:01:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-07-10 19:01:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-07-10 19:01:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-07-10 19:01:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-07-10 19:01:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-07-10 19:01:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-07-10 19:01:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-07-10 19:01:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-07-10 19:01:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-07-10 19:01:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-07-10 19:01:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-07-10 19:01:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-07-10 19:01:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-07-10 19:01:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-07-10 19:01:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-07-10 19:01:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-07-10 19:01:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:01:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-07-10 19:01:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-07-10 19:01:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-07-10 19:01:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 19:01:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:01:23,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:01:23,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:01:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:01:24,034 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:01:24,034 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:01:24,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:24 BoogieIcfgContainer [2020-07-10 19:01:24,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:01:24,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:01:24,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:01:24,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:01:24,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:01:22" (1/3) ... [2020-07-10 19:01:24,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1c50cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:24, skipping insertion in model container [2020-07-10 19:01:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:23" (2/3) ... [2020-07-10 19:01:24,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1c50cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:24, skipping insertion in model container [2020-07-10 19:01:24,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:24" (3/3) ... [2020-07-10 19:01:24,049 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list.i [2020-07-10 19:01:24,062 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:01:24,071 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:01:24,088 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:01:24,114 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:01:24,115 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:01:24,115 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:01:24,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:01:24,115 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:01:24,116 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:01:24,116 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:01:24,116 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:01:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-10 19:01:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 19:01:24,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:24,148 INFO L422 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] [2020-07-10 19:01:24,149 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1815251874, now seen corresponding path program 1 times [2020-07-10 19:01:24,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:24,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1386983335] [2020-07-10 19:01:24,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:24,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-10 19:01:24,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-10 19:01:24,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-10 19:01:24,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {48#true} is VALID [2020-07-10 19:01:24,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {48#true} is VALID [2020-07-10 19:01:24,809 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {48#true} is VALID [2020-07-10 19:01:24,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {48#true} is VALID [2020-07-10 19:01:24,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 19:01:24,810 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {48#true} {48#true} #65#return; {48#true} is VALID [2020-07-10 19:01:24,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 19:01:24,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-10 19:01:24,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-10 19:01:24,819 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-10 19:01:24,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {48#true} is VALID [2020-07-10 19:01:24,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {48#true} is VALID [2020-07-10 19:01:24,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {48#true} is VALID [2020-07-10 19:01:24,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {48#true} is VALID [2020-07-10 19:01:24,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 19:01:24,821 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {48#true} {48#true} #65#return; {48#true} is VALID [2020-07-10 19:01:24,822 INFO L263 TraceCheckUtils]: 10: Hoare triple {48#true} call #t~ret31 := main(); {48#true} is VALID [2020-07-10 19:01:24,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc ~dev~0.base, ~dev~0.offset; {48#true} is VALID [2020-07-10 19:01:24,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {59#(= 0 |main_#t~malloc30.offset|)} is VALID [2020-07-10 19:01:24,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#(= 0 |main_#t~malloc30.offset|)} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {60#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:24,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {60#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {60#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:24,828 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#(= 0 main_~dev~0.offset)} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {61#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 19:01:24,830 INFO L263 TraceCheckUtils]: 16: Hoare triple {61#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {62#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-10 19:01:24,832 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {63#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-10 19:01:24,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {63#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {63#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-10 19:01:24,834 INFO L280 TraceCheckUtils]: 19: Hoare triple {63#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {64#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-10 19:01:24,835 INFO L280 TraceCheckUtils]: 20: Hoare triple {64#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {49#false} is VALID [2020-07-10 19:01:24,836 INFO L263 TraceCheckUtils]: 21: Hoare triple {49#false} call __blast_assert(); {49#false} is VALID [2020-07-10 19:01:24,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-10 19:01:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:01:24,841 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:24,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1386983335] [2020-07-10 19:01:24,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:24,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 19:01:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88553533] [2020-07-10 19:01:24,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 19:01:24,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:24,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 19:01:24,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:24,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 19:01:24,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 19:01:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:01:24,922 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 9 states. [2020-07-10 19:01:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:26,064 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2020-07-10 19:01:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:01:26,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 19:01:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:01:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-10 19:01:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:01:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-10 19:01:26,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2020-07-10 19:01:26,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:26,257 INFO L225 Difference]: With dead ends: 77 [2020-07-10 19:01:26,257 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 19:01:26,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:01:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 19:01:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-10 19:01:26,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:26,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-10 19:01:26,424 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-10 19:01:26,424 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-10 19:01:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:26,430 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-10 19:01:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 19:01:26,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:26,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-10 19:01:26,432 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-10 19:01:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:26,437 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-10 19:01:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 19:01:26,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:26,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:26,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:26,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 19:01:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-07-10 19:01:26,444 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 23 [2020-07-10 19:01:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:26,445 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-07-10 19:01:26,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 19:01:26,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2020-07-10 19:01:26,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 19:01:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 19:01:26,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:26,523 INFO L422 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, 1] [2020-07-10 19:01:26,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:01:26,524 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -953108253, now seen corresponding path program 1 times [2020-07-10 19:01:26,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:26,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066337972] [2020-07-10 19:01:26,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:26,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {402#true} is VALID [2020-07-10 19:01:26,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#true} #valid := #valid[0 := 0]; {402#true} is VALID [2020-07-10 19:01:26,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#true} assume 0 < #StackHeapBarrier; {402#true} is VALID [2020-07-10 19:01:26,774 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {402#true} is VALID [2020-07-10 19:01:26,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {402#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {402#true} is VALID [2020-07-10 19:01:26,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {402#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {402#true} is VALID [2020-07-10 19:01:26,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {402#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {402#true} is VALID [2020-07-10 19:01:26,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {402#true} assume true; {402#true} is VALID [2020-07-10 19:01:26,776 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {402#true} {402#true} #65#return; {402#true} is VALID [2020-07-10 19:01:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:26,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,940 INFO L280 TraceCheckUtils]: 3: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 19:01:26,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 19:01:26,947 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {414#(= 0 main_~dev~0.offset)} #55#return; {423#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 19:01:26,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {402#true} call ULTIMATE.init(); {427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 19:01:26,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {402#true} is VALID [2020-07-10 19:01:26,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#true} #valid := #valid[0 := 0]; {402#true} is VALID [2020-07-10 19:01:26,952 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#true} assume 0 < #StackHeapBarrier; {402#true} is VALID [2020-07-10 19:01:26,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {402#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {402#true} is VALID [2020-07-10 19:01:26,953 INFO L280 TraceCheckUtils]: 5: Hoare triple {402#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {402#true} is VALID [2020-07-10 19:01:26,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {402#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {402#true} is VALID [2020-07-10 19:01:26,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {402#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {402#true} is VALID [2020-07-10 19:01:26,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {402#true} assume true; {402#true} is VALID [2020-07-10 19:01:26,957 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {402#true} {402#true} #65#return; {402#true} is VALID [2020-07-10 19:01:26,957 INFO L263 TraceCheckUtils]: 10: Hoare triple {402#true} call #t~ret31 := main(); {402#true} is VALID [2020-07-10 19:01:26,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {402#true} havoc ~dev~0.base, ~dev~0.offset; {402#true} is VALID [2020-07-10 19:01:26,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {402#true} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {413#(= 0 |main_#t~malloc30.offset|)} is VALID [2020-07-10 19:01:26,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {413#(= 0 |main_#t~malloc30.offset|)} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {414#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:26,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {414#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {414#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:26,964 INFO L280 TraceCheckUtils]: 15: Hoare triple {414#(= 0 main_~dev~0.offset)} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {414#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:26,966 INFO L263 TraceCheckUtils]: 16: Hoare triple {414#(= 0 main_~dev~0.offset)} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {428#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:01:26,967 INFO L280 TraceCheckUtils]: 17: Hoare triple {428#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,969 INFO L280 TraceCheckUtils]: 18: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,970 INFO L280 TraceCheckUtils]: 19: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,971 INFO L280 TraceCheckUtils]: 20: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,972 INFO L280 TraceCheckUtils]: 21: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28; {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 19:01:26,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {429#(and (= |list_add_#in~new.offset| list_add_~new.offset) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 19:01:26,974 INFO L280 TraceCheckUtils]: 23: Hoare triple {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 19:01:26,976 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {430#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {414#(= 0 main_~dev~0.offset)} #55#return; {423#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 19:01:26,978 INFO L263 TraceCheckUtils]: 25: Hoare triple {423#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} call list_del(~dev~0.base, ~dev~0.offset); {424#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} is VALID [2020-07-10 19:01:26,980 INFO L280 TraceCheckUtils]: 26: Hoare triple {424#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {425#(= 1 (select (select |#memory_int| list_del_~entry.base) (+ list_del_~entry.offset 8)))} is VALID [2020-07-10 19:01:26,981 INFO L280 TraceCheckUtils]: 27: Hoare triple {425#(= 1 (select (select |#memory_int| list_del_~entry.base) (+ list_del_~entry.offset 8)))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {426#(= 1 |list_del_#t~mem29|)} is VALID [2020-07-10 19:01:26,982 INFO L280 TraceCheckUtils]: 28: Hoare triple {426#(= 1 |list_del_#t~mem29|)} assume !(1 == #t~mem29); {403#false} is VALID [2020-07-10 19:01:26,982 INFO L263 TraceCheckUtils]: 29: Hoare triple {403#false} call __blast_assert(); {403#false} is VALID [2020-07-10 19:01:26,982 INFO L280 TraceCheckUtils]: 30: Hoare triple {403#false} assume !false; {403#false} is VALID [2020-07-10 19:01:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:01:26,986 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:26,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066337972] [2020-07-10 19:01:26,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:26,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:01:26,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767281188] [2020-07-10 19:01:26,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 19:01:26,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:26,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:01:27,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:27,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:01:27,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:01:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:01:27,037 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 12 states. [2020-07-10 19:01:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:28,607 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-10 19:01:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 19:01:28,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 19:01:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:01:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2020-07-10 19:01:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:01:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2020-07-10 19:01:28,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2020-07-10 19:01:28,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:28,685 INFO L225 Difference]: With dead ends: 44 [2020-07-10 19:01:28,686 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 19:01:28,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-07-10 19:01:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 19:01:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 19:01:28,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:28,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 19:01:28,846 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 19:01:28,846 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 19:01:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:28,850 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-10 19:01:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-10 19:01:28,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:28,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:28,851 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 19:01:28,852 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 19:01:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:28,855 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-10 19:01:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-10 19:01:28,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:28,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:28,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:28,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 19:01:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2020-07-10 19:01:28,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 31 [2020-07-10 19:01:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:28,860 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2020-07-10 19:01:28,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:01:28,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 40 transitions. [2020-07-10 19:01:28,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-07-10 19:01:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 19:01:28,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:28,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2020-07-10 19:01:28,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:01:28,948 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 609934341, now seen corresponding path program 1 times [2020-07-10 19:01:28,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:28,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266961504] [2020-07-10 19:01:28,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:29,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {738#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {706#true} is VALID [2020-07-10 19:01:29,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {706#true} #valid := #valid[0 := 0]; {706#true} is VALID [2020-07-10 19:01:29,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {706#true} assume 0 < #StackHeapBarrier; {706#true} is VALID [2020-07-10 19:01:29,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {706#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {706#true} is VALID [2020-07-10 19:01:29,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {706#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {706#true} is VALID [2020-07-10 19:01:29,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {706#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {706#true} is VALID [2020-07-10 19:01:29,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {706#true} is VALID [2020-07-10 19:01:29,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {706#true} assume true; {706#true} is VALID [2020-07-10 19:01:29,234 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {706#true} {706#true} #65#return; {706#true} is VALID [2020-07-10 19:01:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:29,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {706#true} is VALID [2020-07-10 19:01:29,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {706#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {706#true} is VALID [2020-07-10 19:01:29,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {706#true} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {706#true} is VALID [2020-07-10 19:01:29,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {706#true} assume 0 == #t~mem28; {706#true} is VALID [2020-07-10 19:01:29,294 INFO L280 TraceCheckUtils]: 4: Hoare triple {706#true} havoc #t~mem28; {706#true} is VALID [2020-07-10 19:01:29,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {706#true} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {706#true} is VALID [2020-07-10 19:01:29,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#true} assume true; {706#true} is VALID [2020-07-10 19:01:29,297 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {706#true} {718#(= 0 main_~dev~0.offset)} #55#return; {718#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:29,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} assume 1 == #t~mem29; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} havoc #t~mem29; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} SUMMARY for call write~int(0, ~entry.base, 8 + ~entry.offset, 4); srcloc: L873 {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 19:01:29,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 19:01:29,426 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {718#(= 0 main_~dev~0.offset)} #57#return; {734#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 19:01:29,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {738#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 19:01:29,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {738#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {706#true} is VALID [2020-07-10 19:01:29,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {706#true} #valid := #valid[0 := 0]; {706#true} is VALID [2020-07-10 19:01:29,434 INFO L280 TraceCheckUtils]: 3: Hoare triple {706#true} assume 0 < #StackHeapBarrier; {706#true} is VALID [2020-07-10 19:01:29,434 INFO L280 TraceCheckUtils]: 4: Hoare triple {706#true} SUMMARY for call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12); srcloc: L876 {706#true} is VALID [2020-07-10 19:01:29,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {706#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4); srcloc: L876-1 {706#true} is VALID [2020-07-10 19:01:29,435 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); srcloc: L876-2 {706#true} is VALID [2020-07-10 19:01:29,435 INFO L280 TraceCheckUtils]: 7: Hoare triple {706#true} SUMMARY for call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); srcloc: L876-3 {706#true} is VALID [2020-07-10 19:01:29,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {706#true} assume true; {706#true} is VALID [2020-07-10 19:01:29,436 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {706#true} {706#true} #65#return; {706#true} is VALID [2020-07-10 19:01:29,436 INFO L263 TraceCheckUtils]: 10: Hoare triple {706#true} call #t~ret31 := main(); {706#true} is VALID [2020-07-10 19:01:29,436 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#true} havoc ~dev~0.base, ~dev~0.offset; {706#true} is VALID [2020-07-10 19:01:29,438 INFO L280 TraceCheckUtils]: 12: Hoare triple {706#true} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12); srcloc: L880 {717#(= 0 |main_#t~malloc30.offset|)} is VALID [2020-07-10 19:01:29,439 INFO L280 TraceCheckUtils]: 13: Hoare triple {717#(= 0 |main_#t~malloc30.offset|)} ~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {718#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:29,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {718#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0; {718#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:29,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {718#(= 0 main_~dev~0.offset)} SUMMARY for call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); srcloc: L882 {718#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:29,442 INFO L263 TraceCheckUtils]: 16: Hoare triple {718#(= 0 main_~dev~0.offset)} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:01:29,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {706#true} is VALID [2020-07-10 19:01:29,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {706#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {706#true} is VALID [2020-07-10 19:01:29,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {706#true} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {706#true} is VALID [2020-07-10 19:01:29,444 INFO L280 TraceCheckUtils]: 20: Hoare triple {706#true} assume 0 == #t~mem28; {706#true} is VALID [2020-07-10 19:01:29,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {706#true} havoc #t~mem28; {706#true} is VALID [2020-07-10 19:01:29,444 INFO L280 TraceCheckUtils]: 22: Hoare triple {706#true} SUMMARY for call write~int(1, ~new.base, 8 + ~new.offset, 4); srcloc: L868 {706#true} is VALID [2020-07-10 19:01:29,445 INFO L280 TraceCheckUtils]: 23: Hoare triple {706#true} assume true; {706#true} is VALID [2020-07-10 19:01:29,446 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {706#true} {718#(= 0 main_~dev~0.offset)} #55#return; {718#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 19:01:29,448 INFO L263 TraceCheckUtils]: 25: Hoare triple {718#(= 0 main_~dev~0.offset)} call list_del(~dev~0.base, ~dev~0.offset); {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:01:29,460 INFO L280 TraceCheckUtils]: 26: Hoare triple {739#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,463 INFO L280 TraceCheckUtils]: 27: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} SUMMARY for call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); srcloc: L872 {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,464 INFO L280 TraceCheckUtils]: 28: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} assume 1 == #t~mem29; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} havoc #t~mem29; {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 19:01:29,466 INFO L280 TraceCheckUtils]: 30: Hoare triple {740#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} SUMMARY for call write~int(0, ~entry.base, 8 + ~entry.offset, 4); srcloc: L873 {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 19:01:29,466 INFO L280 TraceCheckUtils]: 31: Hoare triple {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 19:01:29,468 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {741#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {718#(= 0 main_~dev~0.offset)} #57#return; {734#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 19:01:29,469 INFO L263 TraceCheckUtils]: 33: Hoare triple {734#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {735#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-10 19:01:29,470 INFO L280 TraceCheckUtils]: 34: Hoare triple {735#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset; {736#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-10 19:01:29,471 INFO L280 TraceCheckUtils]: 35: Hoare triple {736#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {736#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} is VALID [2020-07-10 19:01:29,472 INFO L280 TraceCheckUtils]: 36: Hoare triple {736#(= 0 (select (select |#memory_int| list_add_~new.base) (+ list_add_~new.offset 8)))} SUMMARY for call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); srcloc: L867 {737#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-10 19:01:29,473 INFO L280 TraceCheckUtils]: 37: Hoare triple {737#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {707#false} is VALID [2020-07-10 19:01:29,473 INFO L263 TraceCheckUtils]: 38: Hoare triple {707#false} call __blast_assert(); {707#false} is VALID [2020-07-10 19:01:29,473 INFO L280 TraceCheckUtils]: 39: Hoare triple {707#false} assume !false; {707#false} is VALID [2020-07-10 19:01:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:01:29,476 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:29,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266961504] [2020-07-10 19:01:29,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:29,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:01:29,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971772885] [2020-07-10 19:01:29,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-10 19:01:29,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:29,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:01:29,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:29,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:01:29,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:01:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:01:29,531 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 12 states. [2020-07-10 19:01:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:30,800 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-07-10 19:01:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 19:01:30,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-10 19:01:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:01:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2020-07-10 19:01:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:01:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2020-07-10 19:01:30,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 37 transitions. [2020-07-10 19:01:30,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:30,881 INFO L225 Difference]: With dead ends: 41 [2020-07-10 19:01:30,881 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:01:30,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-07-10 19:01:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:01:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:01:30,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:30,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:30,884 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:30,884 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:30,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:30,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:30,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:30,885 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:30,885 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:30,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:30,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:30,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:30,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:30,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:01:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:01:30,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2020-07-10 19:01:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:30,887 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:01:30,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:01:30,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:01:30,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:30,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:30,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:01:30,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:01:32,121 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 876) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L271 CegarLoopResult]: At program point L876(line 876) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L271 CegarLoopResult]: At program point L876-1(line 876) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L271 CegarLoopResult]: At program point L876-2(line 876) the Hoare annotation is: true [2020-07-10 19:01:32,122 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#head~0.base)| |~#head~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|)) [2020-07-10 19:01:32,123 INFO L271 CegarLoopResult]: At program point L876-3(line 876) the Hoare annotation is: true [2020-07-10 19:01:32,123 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,123 INFO L264 CegarLoopResult]: At program point list_delFINAL(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,124 INFO L264 CegarLoopResult]: At program point list_delEXIT(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,124 INFO L264 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,124 INFO L264 CegarLoopResult]: At program point L872(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,124 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,125 INFO L264 CegarLoopResult]: At program point L872-1(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 1 |list_del_#t~mem29|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,125 INFO L264 CegarLoopResult]: At program point L872-3(line 872) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,125 INFO L264 CegarLoopResult]: At program point L872-4(line 872) the Hoare annotation is: (or (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= 1 |list_del_#t~mem29|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 19:01:32,125 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 866 869) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,125 INFO L264 CegarLoopResult]: At program point L867-3(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point L867-4(line 867) the Hoare annotation is: (let ((.cse0 (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8)))) (.cse1 (not (= 0 |list_add_#in~new.offset|)))) (and (or .cse0 (= 0 |list_add_#t~mem28|) .cse1) (or .cse0 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) .cse1))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point list_addFINAL(lines 866 869) the Hoare annotation is: (or (and (= list_add_~new.base |list_add_#in~new.base|) (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (= |list_add_#in~new.offset| list_add_~new.offset)) (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point L868(line 868) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point list_addEXIT(lines 866 869) the Hoare annotation is: (or (and (= list_add_~new.base |list_add_#in~new.base|) (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (= |list_add_#in~new.offset| list_add_~new.offset)) (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point L867(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,126 INFO L264 CegarLoopResult]: At program point L866(lines 866 869) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,127 INFO L264 CegarLoopResult]: At program point L867-1(line 867) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |list_add_#in~new.base|) 8))) (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) (= 0 |list_add_#t~mem28|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_add_#in~new.offset|))) [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,127 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 878 888) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 878 888) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point L884(line 884) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point L883(line 883) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point L882(line 882) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 main_~dev~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 19:01:32,128 INFO L264 CegarLoopResult]: At program point L881(lines 881 886) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 main_~dev~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 19:01:32,129 INFO L264 CegarLoopResult]: At program point L882-1(line 882) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,129 INFO L264 CegarLoopResult]: At program point L880(line 880) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 19:01:32,129 INFO L264 CegarLoopResult]: At program point L881-1(lines 881 886) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,129 INFO L264 CegarLoopResult]: At program point L880-1(line 880) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 19:01:32,129 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 878 888) the Hoare annotation is: (and (= 0 |main_#t~malloc30.offset|) (= 0 main_~dev~0.offset)) [2020-07-10 19:01:32,168 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:01:32,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:01:32 BoogieIcfgContainer [2020-07-10 19:01:32,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:01:32,189 INFO L168 Benchmark]: Toolchain (without parser) took 9676.43 ms. Allocated memory was 135.8 MB in the beginning and 351.3 MB in the end (delta: 215.5 MB). Free memory was 99.8 MB in the beginning and 266.9 MB in the end (delta: -167.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:32,190 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:01:32,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.06 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 163.3 MB in the end (delta: -63.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:32,192 INFO L168 Benchmark]: Boogie Preprocessor took 60.17 ms. Allocated memory is still 199.2 MB. Free memory was 163.3 MB in the beginning and 159.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:32,193 INFO L168 Benchmark]: RCFGBuilder took 673.45 ms. Allocated memory is still 199.2 MB. Free memory was 159.8 MB in the beginning and 108.7 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:32,194 INFO L168 Benchmark]: TraceAbstraction took 8146.12 ms. Allocated memory was 199.2 MB in the beginning and 351.3 MB in the end (delta: 152.0 MB). Free memory was 108.0 MB in the beginning and 266.9 MB in the end (delta: -158.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:01:32,197 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.06 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 163.3 MB in the end (delta: -63.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.17 ms. Allocated memory is still 199.2 MB. Free memory was 163.3 MB in the beginning and 159.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 673.45 ms. Allocated memory is still 199.2 MB. Free memory was 159.8 MB in the beginning and 108.7 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8146.12 ms. Allocated memory was 199.2 MB in the beginning and 351.3 MB in the end (delta: 152.0 MB). Free memory was 108.0 MB in the beginning and 266.9 MB in the end (delta: -158.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 871]: Procedure Contract for list_del [2020-07-10 19:01:32,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure list_del: (!(1 == \old(unknown-#memory_int-unknown)[entry][8]) || ((entry == entry && entry == entry) && 0 == unknown-#memory_int-unknown[entry][8])) || !(0 == entry) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 866]: Procedure Contract for list_add [2020-07-10 19:01:32,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:01:32,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure list_add: (((new == new && 1 == unknown-#memory_int-unknown[new][8]) && new == new) || !(0 == \old(unknown-#memory_int-unknown)[new][8])) || !(0 == new) - ProcedureContractResult [Line: 878]: Procedure Contract for main Derived contract for procedure main: 0 == malloc(sizeof(*dev)) && 0 == dev - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 79 SDtfs, 133 SDslu, 192 SDs, 0 SdLazy, 595 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 83 PreInvPairs, 102 NumberOfFragments, 642 HoareAnnotationTreeSize, 83 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 813 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...