/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:50:03,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:50:03,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:50:03,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:50:03,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:50:03,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:50:03,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:50:03,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:50:03,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:50:03,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:50:03,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:50:03,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:50:03,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:50:03,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:50:03,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:50:03,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:50:03,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:50:03,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:50:03,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:50:03,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:50:03,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:50:03,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:50:03,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:50:03,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:50:03,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:50:03,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:50:03,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:50:03,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:50:03,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:50:03,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:50:03,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:50:03,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:50:03,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:50:03,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:50:03,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:50:03,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:50:03,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:50:03,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:50:03,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:50:03,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:50:03,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:50:03,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 03:50:03,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:50:03,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:50:03,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:50:03,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:50:03,613 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:50:03,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:50:03,614 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:50:03,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:50:03,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:50:03,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:50:03,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:50:03,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:50:03,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:50:03,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:50:03,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:50:03,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:50:03,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:50:03,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:50:03,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:50:03,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:50:03,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:50:03,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:50:03,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:50:03,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 03:50:03,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:50:03,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:50:03,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:50:03,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:50:03,960 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:50:03,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-11-07 03:50:04,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bf9eaa9/9d92c0e81b124015a7df13868260f5ba/FLAG83b87c92d [2019-11-07 03:50:04,547 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:50:04,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-11-07 03:50:04,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bf9eaa9/9d92c0e81b124015a7df13868260f5ba/FLAG83b87c92d [2019-11-07 03:50:04,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bf9eaa9/9d92c0e81b124015a7df13868260f5ba [2019-11-07 03:50:04,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:50:04,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:50:04,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:50:04,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:50:04,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:50:04,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:04" (1/1) ... [2019-11-07 03:50:04,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276df9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:04, skipping insertion in model container [2019-11-07 03:50:04,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:04" (1/1) ... [2019-11-07 03:50:04,966 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:50:05,039 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:50:05,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:50:05,502 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:50:05,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:50:05,633 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:50:05,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05 WrapperNode [2019-11-07 03:50:05,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:50:05,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:50:05,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:50:05,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:50:05,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... [2019-11-07 03:50:05,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:50:05,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:50:05,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:50:05,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:50:05,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2019-11-07 03:50:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-11-07 03:50:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-11-07 03:50:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:50:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:50:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-11-07 03:50:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-11-07 03:50:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-11-07 03:50:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-11-07 03:50:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-11-07 03:50:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-11-07 03:50:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-11-07 03:50:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-11-07 03:50:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-11-07 03:50:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-11-07 03:50:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-11-07 03:50:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-11-07 03:50:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-11-07 03:50:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-11-07 03:50:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-11-07 03:50:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-11-07 03:50:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-11-07 03:50:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-11-07 03:50:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-11-07 03:50:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-11-07 03:50:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-11-07 03:50:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-11-07 03:50:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 03:50:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2019-11-07 03:50:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2019-11-07 03:50:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-11-07 03:50:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 03:50:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 03:50:06,394 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:50:06,395 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 03:50:06,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:06 BoogieIcfgContainer [2019-11-07 03:50:06,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:50:06,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:50:06,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:50:06,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:50:06,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:50:04" (1/3) ... [2019-11-07 03:50:06,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db44eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:06, skipping insertion in model container [2019-11-07 03:50:06,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:05" (2/3) ... [2019-11-07 03:50:06,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db44eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:06, skipping insertion in model container [2019-11-07 03:50:06,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:06" (3/3) ... [2019-11-07 03:50:06,405 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2019-11-07 03:50:06,415 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:50:06,423 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:50:06,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:50:06,454 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:50:06,455 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:50:06,455 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:50:06,455 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:50:06,455 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:50:06,455 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:50:06,456 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:50:06,456 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:50:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-11-07 03:50:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 03:50:06,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:50:06,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:50:06,484 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:50:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:50:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1762364833, now seen corresponding path program 1 times [2019-11-07 03:50:06,499 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:50:06,499 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611685975] [2019-11-07 03:50:06,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:50:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:50:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:50:06,729 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611685975] [2019-11-07 03:50:06,730 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:50:06,730 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 03:50:06,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963089205] [2019-11-07 03:50:06,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 03:50:06,738 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:50:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 03:50:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 03:50:06,756 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2019-11-07 03:50:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:50:06,870 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-11-07 03:50:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 03:50:06,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-07 03:50:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:50:06,881 INFO L225 Difference]: With dead ends: 66 [2019-11-07 03:50:06,882 INFO L226 Difference]: Without dead ends: 31 [2019-11-07 03:50:06,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 03:50:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-07 03:50:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-07 03:50:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:50:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-07 03:50:06,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 12 [2019-11-07 03:50:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:50:06,929 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-07 03:50:06,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 03:50:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-07 03:50:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 03:50:06,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:50:06,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:50:06,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:50:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:50:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash 516237429, now seen corresponding path program 1 times [2019-11-07 03:50:06,933 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:50:06,933 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111676786] [2019-11-07 03:50:06,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:50:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:50:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 03:50:07,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111676786] [2019-11-07 03:50:07,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:50:07,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 03:50:07,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124431015] [2019-11-07 03:50:07,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 03:50:07,114 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:50:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 03:50:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 03:50:07,114 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2019-11-07 03:50:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:50:07,254 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-11-07 03:50:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 03:50:07,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-07 03:50:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:50:07,256 INFO L225 Difference]: With dead ends: 37 [2019-11-07 03:50:07,256 INFO L226 Difference]: Without dead ends: 34 [2019-11-07 03:50:07,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 03:50:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-07 03:50:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-07 03:50:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:50:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-07 03:50:07,266 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2019-11-07 03:50:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:50:07,268 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-07 03:50:07,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 03:50:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-07 03:50:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 03:50:07,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:50:07,270 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-07 03:50:07,270 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:50:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:50:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1298848610, now seen corresponding path program 1 times [2019-11-07 03:50:07,271 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:50:07,271 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939279206] [2019-11-07 03:50:07,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:50:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:50:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 03:50:07,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939279206] [2019-11-07 03:50:07,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721447417] [2019-11-07 03:50:07,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:50:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:50:08,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-07 03:50:08,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:50:08,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:08,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:50:09,259 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:50:09,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 03:50:10,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:10,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 03:50:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 03:50:11,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 03:50:11,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:50:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:50:11,480 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229898863] [2019-11-07 03:50:11,506 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-07 03:50:11,506 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:50:11,513 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:50:11,521 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:50:11,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:50:11,699 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 61 for LOIs [2019-11-07 03:50:12,278 INFO L197 IcfgInterpreter]: Interpreting procedure list_add with input of size 17 for LOIs [2019-11-07 03:50:12,289 INFO L197 IcfgInterpreter]: Interpreting procedure __blast_assert with input of size 14 for LOIs [2019-11-07 03:50:12,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 31 for LOIs [2019-11-07 03:50:12,293 INFO L197 IcfgInterpreter]: Interpreting procedure my_malloc with input of size 62 for LOIs [2019-11-07 03:50:12,442 INFO L197 IcfgInterpreter]: Interpreting procedure __getMemory with input of size 59 for LOIs [2019-11-07 03:50:12,453 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:50:13,001 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-07 03:50:13,250 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-07 03:50:13,464 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-07 03:50:13,688 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-07 03:50:13,893 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-07 03:50:14,129 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-07 03:50:14,553 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-07 03:50:15,074 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-07 03:50:15,644 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-07 03:50:16,316 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-11-07 03:50:16,842 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-11-07 03:50:17,416 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-07 03:50:17,893 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-07 03:50:18,345 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-11-07 03:50:19,084 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:50:19,085 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21, 22] total 79 [2019-11-07 03:50:19,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580731296] [2019-11-07 03:50:19,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-07 03:50:19,088 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:50:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-07 03:50:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=5804, Unknown=0, NotChecked=0, Total=6162 [2019-11-07 03:50:19,093 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 79 states. [2019-11-07 03:50:19,760 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-07 03:50:20,077 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-07 03:50:20,379 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-07 03:50:20,661 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-07 03:50:21,007 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-07 03:50:21,336 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-11-07 03:50:21,657 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-11-07 03:50:22,142 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-07 03:50:22,467 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-07 03:50:22,748 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-07 03:50:23,012 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-11-07 03:50:23,229 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-07 03:50:23,461 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-07 03:50:23,745 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-07 03:50:24,098 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-07 03:50:24,370 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-07 03:50:24,964 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-07 03:50:25,607 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-07 03:50:25,857 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-11-07 03:50:26,187 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-11-07 03:50:26,579 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-11-07 03:50:26,820 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-07 03:50:27,041 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-07 03:50:27,384 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-07 03:50:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:50:28,498 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-07 03:50:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-07 03:50:28,499 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 36 [2019-11-07 03:50:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:50:28,500 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:50:28,500 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:50:28,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3529 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1093, Invalid=11563, Unknown=0, NotChecked=0, Total=12656 [2019-11-07 03:50:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:50:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-07 03:50:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-07 03:50:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2019-11-07 03:50:28,552 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2019-11-07 03:50:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:50:28,552 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2019-11-07 03:50:28,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-07 03:50:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2019-11-07 03:50:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 03:50:28,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:50:28,558 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-07 03:50:28,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:50:28,763 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:50:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:50:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1231387513, now seen corresponding path program 1 times [2019-11-07 03:50:28,765 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:50:28,765 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554891326] [2019-11-07 03:50:28,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:50:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:50:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 03:50:28,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554891326] [2019-11-07 03:50:28,946 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:50:28,946 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 03:50:28,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484496850] [2019-11-07 03:50:28,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 03:50:28,947 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:50:28,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 03:50:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 03:50:28,948 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 7 states. [2019-11-07 03:50:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:50:29,036 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2019-11-07 03:50:29,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 03:50:29,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-11-07 03:50:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:50:29,037 INFO L225 Difference]: With dead ends: 45 [2019-11-07 03:50:29,037 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 03:50:29,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 03:50:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 03:50:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 03:50:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 03:50:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 03:50:29,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-07 03:50:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:50:29,039 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 03:50:29,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 03:50:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 03:50:29,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 03:50:29,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 03:50:29,242 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 32 [2019-11-07 03:50:29,421 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-07 03:50:29,653 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-11-07 03:50:29,878 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-11-07 03:50:30,118 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-11-07 03:50:30,265 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-11-07 03:50:30,549 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-11-07 03:50:30,696 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-11-07 03:50:30,872 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-07 03:50:31,078 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-11-07 03:50:31,208 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-11-07 03:50:31,390 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-11-07 03:50:31,394 INFO L439 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= |my_malloc_#in~size| 8)) (not (= 1 (select |#valid| |~#head~0.base|))) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= my_malloc_~size 8)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,395 INFO L443 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2019-11-07 03:50:31,395 INFO L439 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= |my_malloc_#in~size| 8)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,395 INFO L443 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2019-11-07 03:50:31,395 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#head~0.base)| |~#head~0.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |old(~elem~0.base)| ~elem~0.base) (= |~#head~0.offset| |old(~#head~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2019-11-07 03:50:31,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:50:31,395 INFO L443 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2019-11-07 03:50:31,396 INFO L439 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base))) [2019-11-07 03:50:31,396 INFO L439 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (= |old(~elem~0.offset)| |list_add_#in~new.offset|) (= |old(~elem~0.base)| |list_add_#in~new.base|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (not (<= 0 |list_add_#in~head.offset|)) (not (<= |list_add_#in~head.offset| 0))) [2019-11-07 03:50:31,396 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-07 03:50:31,396 INFO L439 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (= |old(~elem~0.offset)| |list_add_#in~new.offset|) (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (not (<= 0 |list_add_#in~head.offset|)) (not (<= |list_add_#in~head.offset| 0))) [2019-11-07 03:50:31,396 INFO L443 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2019-11-07 03:50:31,396 INFO L443 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2019-11-07 03:50:31,397 INFO L443 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2019-11-07 03:50:31,397 INFO L443 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-07 03:50:31,397 INFO L446 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2019-11-07 03:50:31,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:50:31,397 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse1 (+ |~#head~0.offset| 4))) (and (<= |#NULL.base| 0) (< |~#head~0.base| |#StackHeapBarrier|) (= 0 (select .cse0 .cse1)) (<= 0 |#NULL.base|) (= 8 (select |#length| |~#head~0.base|)) (= (select .cse0 |~#head~0.offset|) 0) (<= 0 |~#head~0.offset|) (= 0 ~guard_malloc_counter~0.offset) (= 0 (select .cse2 |~#head~0.offset|)) (= ~elem~0.base 0) (= 0 (select |#valid| 0)) (<= |~#head~0.offset| 0) (= 0 ~guard_malloc_counter~0.base) (= |#NULL.offset| 0) (= 0 (select .cse2 .cse1)) (= ~elem~0.offset 0) (= 1 (select |#valid| |~#head~0.base|)))) [2019-11-07 03:50:31,398 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 03:50:31,398 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 03:50:31,398 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |old(~elem~0.offset)| ~elem~0.offset) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.base 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,398 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2019-11-07 03:50:31,398 INFO L439 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (and (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (or (not (= main_~dev2~0.base ~elem~0.base)) (not (= main_~dev2~0.offset ~elem~0.offset))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0))) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,399 INFO L439 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (and (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,399 INFO L439 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (and (= main_~dev2~0.offset ~guard_malloc_counter~0.offset) (not (= main_~dev1~0.offset 0)) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (= 0 main_~dev1~0.base) (= main_~dev2~0.base ~guard_malloc_counter~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (not (= main_~dev2~0.offset ~elem~0.offset)) (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.base 0)) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,399 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2019-11-07 03:50:31,399 INFO L439 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (let ((.cse3 (= ~elem~0.offset 0))) (and (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (or (and (not .cse3) (= ~elem~0.base |old(~guard_malloc_counter~0.base)|)) (= 0 ~guard_malloc_counter~0.base)) (not (= main_~dev1~0.offset 0)) (let ((.cse4 (= 0 main_~dev1~0.base))) (or (and .cse4 (<= (+ main_~dev1~0.offset 1) ~elem~0.offset)) (and .cse4 .cse3))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0)) (not (= main_~dev2~0.offset main_~dev1~0.offset)))) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,400 INFO L439 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse3 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (let ((.cse1 (= 0 main_~dev1~0.base))) (or (and .cse1 (= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (and .cse1 (= main_~dev1~0.offset 0)))) (= 0 ~guard_malloc_counter~0.base) (<= 0 ~elem~0.base) (<= ~elem~0.base 0) (= ~elem~0.offset 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse2 .cse3))) (not (= 0 (select .cse2 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse3) 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,400 INFO L443 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2019-11-07 03:50:31,400 INFO L439 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.base)| 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |old(~elem~0.offset)| 0)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= (select .cse0 .cse2) 0)) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |old(~elem~0.offset)| ~elem~0.offset) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.base 0)) (not (<= 0 |~#head~0.offset|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,400 INFO L443 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2019-11-07 03:50:31,400 INFO L443 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2019-11-07 03:50:31,401 INFO L439 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |__getMemory_#in~size| 8)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,401 INFO L443 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2019-11-07 03:50:31,401 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-11-07 03:50:31,401 INFO L439 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |__getMemory_#in~size| 8)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-11-07 03:50:31,401 INFO L443 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2019-11-07 03:50:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:50:31 BoogieIcfgContainer [2019-11-07 03:50:31,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 03:50:31,408 INFO L168 Benchmark]: Toolchain (without parser) took 26499.01 ms. Allocated memory was 146.3 MB in the beginning and 446.2 MB in the end (delta: 299.9 MB). Free memory was 102.7 MB in the beginning and 90.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 316.5 MB. Max. memory is 7.1 GB. [2019-11-07 03:50:31,408 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-07 03:50:31,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.11 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 167.3 MB in the end (delta: -64.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-11-07 03:50:31,410 INFO L168 Benchmark]: Boogie Preprocessor took 52.52 ms. Allocated memory is still 202.9 MB. Free memory was 167.3 MB in the beginning and 164.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-07 03:50:31,411 INFO L168 Benchmark]: RCFGBuilder took 709.05 ms. Allocated memory is still 202.9 MB. Free memory was 164.5 MB in the beginning and 113.2 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-11-07 03:50:31,411 INFO L168 Benchmark]: TraceAbstraction took 25008.67 ms. Allocated memory was 202.9 MB in the beginning and 446.2 MB in the end (delta: 243.3 MB). Free memory was 112.3 MB in the beginning and 90.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 269.4 MB. Max. memory is 7.1 GB. [2019-11-07 03:50:31,415 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 706.11 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 167.3 MB in the end (delta: -64.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.52 ms. Allocated memory is still 202.9 MB. Free memory was 167.3 MB in the beginning and 164.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 709.05 ms. Allocated memory is still 202.9 MB. Free memory was 164.5 MB in the beginning and 113.2 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25008.67 ms. Allocated memory was 202.9 MB in the beginning and 446.2 MB in the end (delta: 243.3 MB). Free memory was 112.3 MB in the beginning and 90.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 269.4 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 37 locations, 1 error locations. Result: SAFE, OverallTime: 24.9s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, HoareTripleCheckerStatistics: 103 SDtfs, 166 SDslu, 338 SDs, 0 SdLazy, 1476 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3533 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 41 PreInvPairs, 46 NumberOfFragments, 1507 HoareAnnotationTreeSize, 41 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2284 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 56057 SizeOfPredicates, 22 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 29/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 949, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 28, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 24, TOOLS_POST_TIME[ms]: 79, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME[ms]: 47, TOOLS_POST_RETURN_APPLICATIONS: 12, TOOLS_POST_RETURN_TIME[ms]: 43, TOOLS_QUANTIFIERELIM_APPLICATIONS: 56, TOOLS_QUANTIFIERELIM_TIME[ms]: 147, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 64, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 86, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 13, DOMAIN_JOIN_TIME[ms]: 637, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 28, DOMAIN_ISBOTTOM_TIME[ms]: 63, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 12, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME[ms]: 96, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 96, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 19, DAG_COMPRESSION_PROCESSED_NODES: 193, DAG_COMPRESSION_RETAINED_NODES: 90, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...