/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:05:47,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:05:47,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:05:47,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:05:47,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:05:47,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:05:47,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:05:47,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:05:47,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:05:47,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:05:47,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:05:47,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:05:47,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:05:47,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:05:47,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:05:47,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:05:47,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:05:47,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:05:47,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:05:47,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:05:47,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:05:47,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:05:47,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:05:47,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:05:47,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:05:47,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:05:47,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:05:47,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:05:47,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:05:47,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:05:47,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:05:47,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:05:47,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:05:47,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:05:47,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:05:47,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:05:47,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:05:47,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:05:47,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:05:47,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:05:47,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:05:47,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:05:47,611 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:05:47,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:05:47,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:05:47,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:05:47,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:05:47,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:05:47,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:05:47,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:05:47,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:05:47,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:05:47,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:05:47,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:05:47,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:05:47,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:05:47,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:05:47,620 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:05:47,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:05:47,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:05:47,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:05:47,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:05:47,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:05:47,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:05:47,621 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:05:48,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:05:48,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:05:48,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:05:48,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:05:48,185 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:05:48,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-09-04 22:05:48,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69f5a46/e1c835384edc447997bd3d3109351281/FLAGb7786ac62 [2020-09-04 22:05:48,930 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:05:48,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-09-04 22:05:48,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69f5a46/e1c835384edc447997bd3d3109351281/FLAGb7786ac62 [2020-09-04 22:05:49,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69f5a46/e1c835384edc447997bd3d3109351281 [2020-09-04 22:05:49,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:05:49,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:05:49,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:05:49,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:05:49,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:05:49,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21715d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49, skipping insertion in model container [2020-09-04 22:05:49,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:05:49,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:05:49,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:05:49,760 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:05:49,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:05:49,919 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:05:49,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49 WrapperNode [2020-09-04 22:05:49,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:05:49,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:05:49,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:05:49,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:05:49,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:05:49,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:05:49,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:05:49,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:05:49,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 22:05:50,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:05:50,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:05:50,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-09-04 22:05:50,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-09-04 22:05:50,086 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-09-04 22:05:50,086 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-09-04 22:05:50,086 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-09-04 22:05:50,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:05:50,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:05:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-09-04 22:05:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-09-04 22:05:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-09-04 22:05:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-09-04 22:05:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-09-04 22:05:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-09-04 22:05:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-09-04 22:05:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-09-04 22:05:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-09-04 22:05:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-09-04 22:05:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-09-04 22:05:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-09-04 22:05:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-09-04 22:05:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-09-04 22:05:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-09-04 22:05:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-09-04 22:05:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-09-04 22:05:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-09-04 22:05:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-09-04 22:05:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-09-04 22:05:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-09-04 22:05:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-09-04 22:05:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-09-04 22:05:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-09-04 22:05:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-09-04 22:05:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-09-04 22:05:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-09-04 22:05:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-09-04 22:05:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-09-04 22:05:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-09-04 22:05:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-09-04 22:05:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-09-04 22:05:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-09-04 22:05:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-09-04 22:05:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-09-04 22:05:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-09-04 22:05:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-09-04 22:05:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-09-04 22:05:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-09-04 22:05:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-09-04 22:05:50,106 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-09-04 22:05:50,106 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-09-04 22:05:50,106 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-09-04 22:05:50,106 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-09-04 22:05:50,106 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-09-04 22:05:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-09-04 22:05:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-09-04 22:05:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-09-04 22:05:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-09-04 22:05:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 22:05:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-09-04 22:05:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-09-04 22:05:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-09-04 22:05:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-09-04 22:05:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-09-04 22:05:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-09-04 22:05:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-09-04 22:05:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-09-04 22:05:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:05:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-09-04 22:05:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-09-04 22:05:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-09-04 22:05:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-09-04 22:05:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:05:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:05:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 22:05:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-09-04 22:05:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:05:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 22:05:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 22:05:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 22:05:50,713 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:05:50,714 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 22:05:50,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:05:50 BoogieIcfgContainer [2020-09-04 22:05:50,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:05:50,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:05:50,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:05:50,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:05:50,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:05:49" (1/3) ... [2020-09-04 22:05:50,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25074a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:05:50, skipping insertion in model container [2020-09-04 22:05:50,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (2/3) ... [2020-09-04 22:05:50,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25074a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:05:50, skipping insertion in model container [2020-09-04 22:05:50,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:05:50" (3/3) ... [2020-09-04 22:05:50,730 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2020-09-04 22:05:50,744 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:05:50,758 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:05:50,788 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:05:50,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:05:50,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:05:50,829 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:05:50,829 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:05:50,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:05:50,843 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:05:50,843 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:05:50,843 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:05:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-09-04 22:05:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 22:05:50,902 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:50,904 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] [2020-09-04 22:05:50,904 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1653885127, now seen corresponding path program 1 times [2020-09-04 22:05:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:50,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696188247] [2020-09-04 22:05:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:05:51,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696188247] [2020-09-04 22:05:51,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:05:51,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:05:51,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68887517] [2020-09-04 22:05:51,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:05:51,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:51,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:05:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:05:51,371 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2020-09-04 22:05:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:51,996 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2020-09-04 22:05:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 22:05:51,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-09-04 22:05:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:52,044 INFO L225 Difference]: With dead ends: 126 [2020-09-04 22:05:52,045 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 22:05:52,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 22:05:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 22:05:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2020-09-04 22:05:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 22:05:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2020-09-04 22:05:52,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2020-09-04 22:05:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:52,191 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2020-09-04 22:05:52,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:05:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2020-09-04 22:05:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:52,199 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:52,200 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 22:05:52,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:05:52,201 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1154270079, now seen corresponding path program 1 times [2020-09-04 22:05:52,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:52,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105916495] [2020-09-04 22:05:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 22:05:52,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105916495] [2020-09-04 22:05:52,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:05:52,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 22:05:52,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530347959] [2020-09-04 22:05:52,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:05:52,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:05:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:05:52,573 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2020-09-04 22:05:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:52,930 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-09-04 22:05:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 22:05:52,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 22:05:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:52,934 INFO L225 Difference]: With dead ends: 97 [2020-09-04 22:05:52,935 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 22:05:52,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:05:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 22:05:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-09-04 22:05:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 22:05:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2020-09-04 22:05:52,995 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 61 [2020-09-04 22:05:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:52,996 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2020-09-04 22:05:52,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:05:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-09-04 22:05:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:53,003 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:53,003 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-09-04 22:05:53,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:05:53,004 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1617160578, now seen corresponding path program 1 times [2020-09-04 22:05:53,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:53,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375328271] [2020-09-04 22:05:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 22:05:53,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1375328271] [2020-09-04 22:05:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:53,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 22:05:53,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994172348] [2020-09-04 22:05:53,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:05:53,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:05:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:05:53,415 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2020-09-04 22:05:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:53,722 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-09-04 22:05:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 22:05:53,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 22:05:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:53,724 INFO L225 Difference]: With dead ends: 100 [2020-09-04 22:05:53,725 INFO L226 Difference]: Without dead ends: 64 [2020-09-04 22:05:53,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:05:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-04 22:05:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2020-09-04 22:05:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 22:05:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-09-04 22:05:53,740 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 61 [2020-09-04 22:05:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:53,740 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-09-04 22:05:53,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:05:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-09-04 22:05:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:53,742 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:53,742 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 22:05:53,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:05:53,743 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:53,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1531514875, now seen corresponding path program 1 times [2020-09-04 22:05:53,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:53,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915624574] [2020-09-04 22:05:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 22:05:54,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915624574] [2020-09-04 22:05:54,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:54,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:05:54,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061777150] [2020-09-04 22:05:54,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:05:54,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:05:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:05:54,175 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 17 states. [2020-09-04 22:05:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:55,511 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2020-09-04 22:05:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 22:05:55,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-09-04 22:05:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:55,514 INFO L225 Difference]: With dead ends: 106 [2020-09-04 22:05:55,515 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 22:05:55,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 22:05:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 22:05:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2020-09-04 22:05:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 22:05:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-09-04 22:05:55,536 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2020-09-04 22:05:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:55,537 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-09-04 22:05:55,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:05:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-09-04 22:05:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 22:05:55,539 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:55,539 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-04 22:05:55,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:05:55,540 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824736, now seen corresponding path program 1 times [2020-09-04 22:05:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:55,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865849724] [2020-09-04 22:05:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 22:05:55,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865849724] [2020-09-04 22:05:55,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:55,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 22:05:55,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301754189] [2020-09-04 22:05:55,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 22:05:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 22:05:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-09-04 22:05:55,941 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 18 states. [2020-09-04 22:05:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:57,123 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-09-04 22:05:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 22:05:57,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-09-04 22:05:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:57,130 INFO L225 Difference]: With dead ends: 89 [2020-09-04 22:05:57,130 INFO L226 Difference]: Without dead ends: 86 [2020-09-04 22:05:57,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 22:05:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-04 22:05:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-09-04 22:05:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 22:05:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-09-04 22:05:57,169 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 70 [2020-09-04 22:05:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:57,170 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-09-04 22:05:57,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 22:05:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-09-04 22:05:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 22:05:57,180 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:57,180 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-09-04 22:05:57,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:05:57,181 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2039706158, now seen corresponding path program 1 times [2020-09-04 22:05:57,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:57,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598344684] [2020-09-04 22:05:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 22:05:57,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598344684] [2020-09-04 22:05:57,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:57,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 22:05:57,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140742197] [2020-09-04 22:05:57,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 22:05:57,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 22:05:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:05:57,742 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2020-09-04 22:05:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:59,490 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-09-04 22:05:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:05:59,490 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-09-04 22:05:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:59,493 INFO L225 Difference]: With dead ends: 93 [2020-09-04 22:05:59,493 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 22:05:59,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 22:05:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 22:05:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2020-09-04 22:05:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 22:05:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-09-04 22:05:59,515 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 71 [2020-09-04 22:05:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:59,515 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-09-04 22:05:59,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 22:05:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-09-04 22:05:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 22:05:59,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:59,518 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:59,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:05:59,518 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2033290459, now seen corresponding path program 1 times [2020-09-04 22:05:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:59,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858822503] [2020-09-04 22:05:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:59,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 22:06:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 22:06:00,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858822503] [2020-09-04 22:06:00,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:00,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 22:06:00,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353214156] [2020-09-04 22:06:00,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 22:06:00,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 22:06:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-09-04 22:06:00,094 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2020-09-04 22:06:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:01,725 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2020-09-04 22:06:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:01,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2020-09-04 22:06:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:01,728 INFO L225 Difference]: With dead ends: 89 [2020-09-04 22:06:01,729 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 22:06:01,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 22:06:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 22:06:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-09-04 22:06:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 22:06:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-09-04 22:06:01,759 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 85 [2020-09-04 22:06:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:01,760 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-09-04 22:06:01,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 22:06:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-09-04 22:06:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 22:06:01,762 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:01,762 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:01,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:06:01,763 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash 571953633, now seen corresponding path program 2 times [2020-09-04 22:06:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:01,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333307319] [2020-09-04 22:06:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 22:06:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 22:06:02,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333307319] [2020-09-04 22:06:02,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:02,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 22:06:02,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432911525] [2020-09-04 22:06:02,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 22:06:02,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 22:06:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 22:06:02,016 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 10 states. [2020-09-04 22:06:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:02,606 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-09-04 22:06:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 22:06:02,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2020-09-04 22:06:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:02,609 INFO L225 Difference]: With dead ends: 89 [2020-09-04 22:06:02,609 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 22:06:02,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 22:06:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 22:06:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-09-04 22:06:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 22:06:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-09-04 22:06:02,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 85 [2020-09-04 22:06:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:02,637 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-09-04 22:06:02,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 22:06:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-09-04 22:06:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 22:06:02,638 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:02,638 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:02,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:06:02,639 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 578402155, now seen corresponding path program 1 times [2020-09-04 22:06:02,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:02,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995079172] [2020-09-04 22:06:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:02,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 22:06:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 22:06:03,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995079172] [2020-09-04 22:06:03,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:03,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 22:06:03,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139987049] [2020-09-04 22:06:03,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 22:06:03,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 22:06:03,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:06:03,196 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 23 states. [2020-09-04 22:06:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:04,855 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-09-04 22:06:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:04,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2020-09-04 22:06:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:04,857 INFO L225 Difference]: With dead ends: 87 [2020-09-04 22:06:04,857 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 22:06:04,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 22:06:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 22:06:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 22:06:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 22:06:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 22:06:04,871 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 86 [2020-09-04 22:06:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:04,871 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 22:06:04,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 22:06:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 22:06:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 22:06:04,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:04,873 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:04,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:06:04,873 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1773366491, now seen corresponding path program 2 times [2020-09-04 22:06:04,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:04,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203913739] [2020-09-04 22:06:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 22:06:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 22:06:05,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203913739] [2020-09-04 22:06:05,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:05,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 22:06:05,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625525990] [2020-09-04 22:06:05,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 22:06:05,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:05,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 22:06:05,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-09-04 22:06:05,349 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 19 states. [2020-09-04 22:06:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:06,649 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-09-04 22:06:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:06,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-09-04 22:06:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:06,650 INFO L225 Difference]: With dead ends: 78 [2020-09-04 22:06:06,651 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 22:06:06,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 22:06:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 22:06:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 22:06:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 22:06:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 22:06:06,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2020-09-04 22:06:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:06,654 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 22:06:06,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 22:06:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 22:06:06,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 22:06:06,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:06:06,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 22:06:09,499 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-09-04 22:06:09,697 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-09-04 22:06:09,985 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-09-04 22:06:10,456 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-09-04 22:06:10,613 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2020-09-04 22:06:10,854 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-09-04 22:06:11,216 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-09-04 22:06:11,336 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-09-04 22:06:11,704 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-09-04 22:06:11,959 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 22:06:12,282 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-09-04 22:06:12,452 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-09-04 22:06:12,648 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 22:06:12,820 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-09-04 22:06:12,999 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-09-04 22:06:13,239 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-09-04 22:06:13,445 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-09-04 22:06:13,968 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-09-04 22:06:14,142 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2020-09-04 22:06:14,498 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2020-09-04 22:06:14,503 INFO L264 CegarLoopResult]: At program point my_mallocFINAL(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (not (= ~elem~0.offset 0))))) [2020-09-04 22:06:14,504 INFO L264 CegarLoopResult]: At program point L879(line 879) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= my_malloc_~size 8)) (not (= |my_malloc_#in~size| 8))) [2020-09-04 22:06:14,504 INFO L264 CegarLoopResult]: At program point L879-1(line 879) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (and (<= 0 |my_malloc_#t~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= |my_malloc_#t~ret30.base| 0) (<= |my_malloc_#t~ret30.offset| 0)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))))) [2020-09-04 22:06:14,505 INFO L264 CegarLoopResult]: At program point L879-2(line 879) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#t~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#t~ret30.base| 0) (<= |my_malloc_#t~ret30.offset| 0) (<= |my_malloc_#res.offset| 0)) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= .cse1 |my_malloc_#t~ret30.offset|) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|))) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (not (= ~elem~0.offset 0))))) [2020-09-04 22:06:14,505 INFO L264 CegarLoopResult]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (not (= |my_malloc_#in~size| 8))) [2020-09-04 22:06:14,505 INFO L264 CegarLoopResult]: At program point my_mallocEXIT(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (= my_malloc_~size 8)) (or (and (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#res.base| 0) (<= 0 |my_malloc_#res.offset|) (<= |my_malloc_#res.offset| 0)) (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)) (and (or (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) .cse0)) (not (= ~elem~0.offset 0))))) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |old(#length)| |#length|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= |old(#valid)| |#valid|)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L887(line 887) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L900(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L867(line 867) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2020-09-04 22:06:14,506 INFO L264 CegarLoopResult]: At program point L900-1(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point L900-2(line 900) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point L897(line 897) the Hoare annotation is: (and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point L896(lines 896 897) the Hoare annotation is: (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point L896-2(lines 895 898) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) .cse0) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) .cse0))) [2020-09-04 22:06:14,507 INFO L264 CegarLoopResult]: At program point list_delEXIT(lines 895 898) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) .cse0) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) .cse0))) [2020-09-04 22:06:14,508 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) [2020-09-04 22:06:14,508 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse0) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0))) [2020-09-04 22:06:14,508 INFO L264 CegarLoopResult]: At program point L892(line 892) the Hoare annotation is: (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse2 .cse3))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse1) (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse2 .cse3))))) [2020-09-04 22:06:14,508 INFO L264 CegarLoopResult]: At program point L891(lines 891 892) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (and .cse1 .cse2) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 22:06:14,508 INFO L264 CegarLoopResult]: At program point L890(line 890) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse0 .cse1 .cse2)) (or .cse3 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse0 .cse1 .cse2)) (or .cse3 .cse4 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2020-09-04 22:06:14,509 INFO L264 CegarLoopResult]: At program point L891-1(line 891) the Hoare annotation is: (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse2 .cse3))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse1) (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse2 .cse3))))) [2020-09-04 22:06:14,509 INFO L264 CegarLoopResult]: At program point L889(lines 889 893) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse0 .cse1 .cse2)) (or .cse3 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse0 .cse1 .cse2)) (or .cse3 .cse4 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2020-09-04 22:06:14,509 INFO L264 CegarLoopResult]: At program point L890-2(line 890) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)))) [2020-09-04 22:06:14,509 INFO L264 CegarLoopResult]: At program point L891-3(line 891) the Hoare annotation is: (let ((.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (and .cse1 .cse2) .cse0 (not (<= 2 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 22:06:14,509 INFO L264 CegarLoopResult]: At program point L890-3(line 890) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse1 (= list_add_~new.base |list_add_#in~new.base|)) (.cse2 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= |old(~elem~0.offset)| ~elem~0.offset))) (and (or .cse0 (and .cse1 .cse2) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse1 .cse2 .cse3 .cse4)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse3 .cse4)))) [2020-09-04 22:06:14,510 INFO L264 CegarLoopResult]: At program point L891-4(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse1 (and .cse5 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse6)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse5 .cse6 .cse2 .cse3)) (or (and .cse5 .cse6) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-09-04 22:06:14,510 INFO L264 CegarLoopResult]: At program point list_addEXIT(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse1 (and .cse5 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse6)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse0 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse4 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse5 .cse6 .cse2 .cse3)) (or (and .cse5 .cse6) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-09-04 22:06:14,510 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2020-09-04 22:06:14,510 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2020-09-04 22:06:14,510 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2020-09-04 22:06:14,510 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 22:06:14,510 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:06:14,511 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2020-09-04 22:06:14,511 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 22:06:14,511 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:06:14,511 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,511 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 902 917) the Hoare annotation is: true [2020-09-04 22:06:14,511 INFO L264 CegarLoopResult]: At program point L909(line 909) the Hoare annotation is: (or (and (<= 2 main_~dev2~0.offset) (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,511 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 902 917) the Hoare annotation is: true [2020-09-04 22:06:14,512 INFO L264 CegarLoopResult]: At program point L908(line 908) the Hoare annotation is: (let ((.cse2 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset))) (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (let ((.cse3 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse4 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse5 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse3 .cse4 (= main_~dev2~0.base ~elem~0.base) (= main_~dev2~0.offset ~elem~0.offset) .cse5) (and .cse3 .cse2 .cse4 .cse5))))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1) (and .cse2 .cse1)))) [2020-09-04 22:06:14,512 INFO L264 CegarLoopResult]: At program point L907(line 907) the Hoare annotation is: (or (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,512 INFO L264 CegarLoopResult]: At program point L906(lines 906 915) the Hoare annotation is: (or (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev2~0.offset 0) (= main_~dev2~0.base 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,512 INFO L264 CegarLoopResult]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse1 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and (<= 1 main_~dev1~0.offset) .cse0 (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (<= 2 main_~dev2~0.offset) .cse0 (= main_~dev2~0.base ~elem~0.base) (= main_~dev2~0.offset ~elem~0.offset) .cse1 (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)))) [2020-09-04 22:06:14,513 INFO L264 CegarLoopResult]: At program point L905(line 905) the Hoare annotation is: (or (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,513 INFO L271 CegarLoopResult]: At program point L906-1(lines 906 915) the Hoare annotation is: true [2020-09-04 22:06:14,513 INFO L264 CegarLoopResult]: At program point L904(line 904) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,513 INFO L264 CegarLoopResult]: At program point L905-1(line 905) the Hoare annotation is: (or (and (<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (and (= |main_#t~ret33.base| 0) (= |main_#t~ret33.offset| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,513 INFO L264 CegarLoopResult]: At program point L903(line 903) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,526 INFO L264 CegarLoopResult]: At program point L904-1(line 904) the Hoare annotation is: (or (and (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 |main_#t~ret32.offset|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= |main_#t~ret32.offset| 0) (= |main_#t~ret32.base| 0))) [2020-09-04 22:06:14,526 INFO L264 CegarLoopResult]: At program point L905-2(line 905) the Hoare annotation is: (or (and (= main_~dev2~0.offset 0) (= |main_#t~ret33.base| 0) (= |main_#t~ret33.offset| 0) (= main_~dev2~0.base 0)) (let ((.cse0 (+ main_~dev1~0.offset 1))) (and (<= .cse0 |main_#t~ret33.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= .cse0 main_~dev2~0.offset))) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,526 INFO L264 CegarLoopResult]: At program point L904-2(line 904) the Hoare annotation is: (or (and (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 main_~dev1~0.offset) (<= 1 |main_#t~ret32.offset|) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= |main_#t~ret32.offset| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret32.base| 0)) (not (= |old(~elem~0.offset)| 0))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point __getMemoryEXIT(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 8 __getMemory_~size))) (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point __getMemoryFINAL(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 8 __getMemory_~size))) (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= |__getMemory_#res.offset| 0) (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point L875(line 875) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point L874(line 874) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (= 8 __getMemory_~size) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,527 INFO L264 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L872(line 872) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L873-1(lines 873 874) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L871(line 871) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L872-1(line 872) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L873-2(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (= 8 __getMemory_~size) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L873-3(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-09-04 22:06:14,528 INFO L264 CegarLoopResult]: At program point L871-2(line 871) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,529 INFO L264 CegarLoopResult]: At program point L871-3(line 871) the Hoare annotation is: (or (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2020-09-04 22:06:14,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:06:14 BoogieIcfgContainer [2020-09-04 22:06:14,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:06:14,561 INFO L168 Benchmark]: Toolchain (without parser) took 25327.01 ms. Allocated memory was 138.4 MB in the beginning and 439.4 MB in the end (delta: 300.9 MB). Free memory was 101.5 MB in the beginning and 402.2 MB in the end (delta: -300.6 MB). Peak memory consumption was 300.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:14,562 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 22:06:14,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.17 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 167.1 MB in the end (delta: -65.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:14,563 INFO L168 Benchmark]: Boogie Preprocessor took 66.52 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 164.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:14,564 INFO L168 Benchmark]: RCFGBuilder took 732.55 ms. Allocated memory is still 201.3 MB. Free memory was 163.4 MB in the beginning and 116.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:14,565 INFO L168 Benchmark]: TraceAbstraction took 23836.74 ms. Allocated memory was 201.3 MB in the beginning and 439.4 MB in the end (delta: 238.0 MB). Free memory was 115.8 MB in the beginning and 402.2 MB in the end (delta: -286.3 MB). Peak memory consumption was 251.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:14,571 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 685.17 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 167.1 MB in the end (delta: -65.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.52 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 164.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 732.55 ms. Allocated memory is still 201.3 MB. Free memory was 163.4 MB in the beginning and 116.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23836.74 ms. Allocated memory was 201.3 MB in the beginning and 439.4 MB in the end (delta: 238.0 MB). Free memory was 115.8 MB in the beginning and 402.2 MB in the end (delta: -286.3 MB). Peak memory consumption was 251.6 MB. Max. memory is 7.1 GB. * 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: 878]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: (!(\old(size) == 8) || size == 8) && ((((((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0) || (\result <= guard_malloc_counter && \old(guard_malloc_counter) + 1 <= \result)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) - ProcedureContractResult [Line: 895]: Procedure Contract for list_del Derived contract for procedure list_del: (\old(elem) == entry || (\old(elem) == elem && \old(elem) == elem)) && ((!(1 <= guard_malloc_counter) || elem == 0) || (\old(elem) == elem && \old(elem) == elem)) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 889]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || (((new == new && elem == new) && elem == new) && new == new)) || (\old(elem) == elem && \old(elem) == elem)) || !(\old(elem) == 0)) && (((!(1 <= guard_malloc_counter) || (((new == new && elem == new) && elem == new) && new == new)) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - ProcedureContractResult [Line: 902]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 869]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: ((((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0))) || ((((\result <= 0 && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || !(elem == 0)) || ((\old(guard_malloc_counter) + 1 <= \result && 8 == size) && \result <= guard_malloc_counter) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.8s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 545 SDtfs, 784 SDslu, 2053 SDs, 0 SdLazy, 5834 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, 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, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 357 PreInvPairs, 641 NumberOfFragments, 2152 HoareAnnotationTreeSize, 357 FomulaSimplifications, 30106 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 70 FomulaSimplificationsInter, 6529 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 185839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 140/209 InterpolantCoveringCapability, 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...